Warning: Permanently added '54.89.115.111' (ED25519) to the list of known hosts. Running (timeout=18000): unbuffer mock --spec /var/lib/copr-rpmbuild/workspace/workdir-7st6y422/R-CRAN-starvz/R-CRAN-starvz.spec --sources /var/lib/copr-rpmbuild/workspace/workdir-7st6y422/R-CRAN-starvz --resultdir /var/lib/copr-rpmbuild/results --uniqueext 1725845899.389089 -r /var/lib/copr-rpmbuild/results/configs/child.cfg INFO: mock.py version 5.6 starting (python version = 3.12.1, NVR = mock-5.6-1.fc39), args: /usr/libexec/mock/mock --spec /var/lib/copr-rpmbuild/workspace/workdir-7st6y422/R-CRAN-starvz/R-CRAN-starvz.spec --sources /var/lib/copr-rpmbuild/workspace/workdir-7st6y422/R-CRAN-starvz --resultdir /var/lib/copr-rpmbuild/results --uniqueext 1725845899.389089 -r /var/lib/copr-rpmbuild/results/configs/child.cfg Start: init plugins INFO: tmpfs initialized INFO: selinux enabled INFO: chroot_scan: initialized INFO: compress_logs: initialized Finish: init plugins INFO: Signal handler active Start: run INFO: Start(/var/lib/copr-rpmbuild/workspace/workdir-7st6y422/R-CRAN-starvz/R-CRAN-starvz.spec) Config(fedora-41-x86_64) Start: clean chroot Finish: clean chroot Mock Version: 5.6 INFO: Mock Version: 5.6 Start: chroot init INFO: mounting tmpfs at /var/lib/mock/fedora-41-x86_64-1725845899.389089/root. INFO: calling preinit hooks INFO: enabled root cache INFO: enabled package manager cache Start: cleaning package manager metadata Finish: cleaning package manager metadata INFO: enabled HW Info plugin INFO: Package manager dnf5 detected and used (fallback) INFO: Buildroot is handled by package management from host and used with --installroot: rpm-4.19.1.1-1.fc39.x86_64 rpm-sequoia-1.6.0-1.fc39.x86_64 python3-dnf-4.21.1-1.fc39.noarch python3-dnf-plugins-core-4.9.0-1.fc39.noarch yum-4.21.1-1.fc39.noarch dnf5-5.1.17-2.fc39.x86_64 dnf5-plugins-5.1.17-2.fc39.x86_64 Start: installing minimal buildroot with dnf5 Updating and loading repositories: updates 100% | 277.5 KiB/s | 28.3 KiB | 00m00s fedora 100% | 316.9 KiB/s | 8.9 KiB | 00m00s Copr repository 100% | 53.0 KiB/s | 1.5 KiB | 00m00s Copr repository 100% | 103.4 MiB/s | 11.9 MiB | 00m00s Repositories loaded. Package Arch Version Repository Size Installing group/module packages: bash x86_64 5.2.32-1.fc41 fedora 8.2 MiB bzip2 x86_64 1.0.8-19.fc41 fedora 95.7 KiB coreutils x86_64 9.5-9.fc41 fedora 5.6 MiB cpio x86_64 2.15-2.fc41 fedora 1.1 MiB diffutils x86_64 3.10-8.fc41 fedora 1.6 MiB fedora-release-common noarch 41-0.21 fedora 19.4 KiB findutils x86_64 1:4.10.0-4.fc41 fedora 1.8 MiB gawk x86_64 5.3.0-4.fc41 fedora 1.7 MiB glibc-minimal-langpack x86_64 2.40-3.fc41 fedora 0.0 B grep x86_64 3.11-9.fc41 fedora 1.0 MiB gzip x86_64 1.13-2.fc41 fedora 389.0 KiB info x86_64 7.1-3.fc41 fedora 361.8 KiB patch x86_64 2.7.6-25.fc41 fedora 266.7 KiB redhat-rpm-config noarch 293-1.fc41 fedora 183.5 KiB rpm-build x86_64 4.19.92-6.fc41 fedora 194.1 KiB sed x86_64 4.9-3.fc41 fedora 861.5 KiB shadow-utils x86_64 2:4.15.1-9.fc41 fedora 4.1 MiB tar x86_64 2:1.35-4.fc41 fedora 2.9 MiB unzip x86_64 6.0-64.fc41 fedora 386.8 KiB util-linux x86_64 2.40.2-4.fc41 fedora 3.7 MiB which x86_64 2.21-42.fc41 fedora 80.2 KiB xz x86_64 1:5.6.2-2.fc41 fedora 1.2 MiB Installing dependencies: add-determinism x86_64 0.3.6-1.fc41 fedora 2.2 MiB alternatives x86_64 1.30-1.fc41 fedora 66.3 KiB ansible-srpm-macros noarch 1-16.fc41 fedora 35.7 KiB audit-libs x86_64 4.0.2-1.fc41 fedora 331.3 KiB authselect x86_64 1.5.0-7.fc41 fedora 153.5 KiB authselect-libs x86_64 1.5.0-7.fc41 fedora 818.3 KiB basesystem noarch 11-21.fc41 fedora 0.0 B binutils x86_64 2.43-3.fc41 fedora 27.5 MiB build-reproducibility-srpm-macros noarch 0.3.6-1.fc41 fedora 735.0 B bzip2-libs x86_64 1.0.8-19.fc41 fedora 80.7 KiB ca-certificates noarch 2024.2.68_v8.0.302-3.fc41 fedora 2.3 MiB coreutils-common x86_64 9.5-9.fc41 fedora 11.2 MiB cracklib x86_64 2.9.11-6.fc41 fedora 238.9 KiB crypto-policies noarch 20240826-1.gite824389.fc41 fedora 136.9 KiB curl x86_64 8.9.1-2.fc41 fedora 796.2 KiB cyrus-sasl-lib x86_64 2.1.28-27.fc41 fedora 2.3 MiB debugedit x86_64 5.0-17.fc41 fedora 199.3 KiB dwz x86_64 0.15-7.fc41 fedora 290.9 KiB ed x86_64 1.20.2-2.fc41 fedora 146.9 KiB efi-srpm-macros noarch 5-12.fc41 fedora 40.1 KiB elfutils x86_64 0.191-8.fc41 fedora 2.6 MiB elfutils-debuginfod-client x86_64 0.191-8.fc41 fedora 64.9 KiB elfutils-default-yama-scope noarch 0.191-8.fc41 fedora 1.8 KiB elfutils-libelf x86_64 0.191-8.fc41 fedora 1.2 MiB elfutils-libs x86_64 0.191-8.fc41 fedora 646.2 KiB fedora-gpg-keys noarch 41-0.5 fedora 126.4 KiB fedora-release noarch 41-0.21 fedora 0.0 B fedora-release-identity-basic noarch 41-0.21 fedora 684.0 B fedora-repos noarch 41-0.5 fedora 4.9 KiB file x86_64 5.45-7.fc41 fedora 103.5 KiB file-libs x86_64 5.45-7.fc41 fedora 9.9 MiB filesystem x86_64 3.18-23.fc41 fedora 106.0 B fonts-srpm-macros noarch 1:2.0.5-17.fc41 fedora 55.8 KiB forge-srpm-macros noarch 0.3.2-1.fc41 fedora 39.0 KiB fpc-srpm-macros noarch 1.3-13.fc41 fedora 144.0 B gdb-minimal x86_64 15.1-1.fc41 fedora 13.0 MiB gdbm x86_64 1:1.23-7.fc41 fedora 460.9 KiB gdbm-libs x86_64 1:1.23-7.fc41 fedora 121.9 KiB ghc-srpm-macros noarch 1.9.1-2.fc41 fedora 747.0 B glibc x86_64 2.40-3.fc41 fedora 6.7 MiB glibc-common x86_64 2.40-3.fc41 fedora 1.0 MiB glibc-gconv-extra x86_64 2.40-3.fc41 fedora 8.0 MiB gmp x86_64 1:6.3.0-2.fc41 fedora 811.4 KiB gnat-srpm-macros noarch 6-6.fc41 fedora 1.0 KiB go-srpm-macros noarch 3.6.0-3.fc41 fedora 60.8 KiB jansson x86_64 2.13.1-10.fc41 fedora 88.3 KiB kernel-srpm-macros noarch 1.0-24.fc41 fedora 1.9 KiB keyutils-libs x86_64 1.6.3-4.fc41 fedora 54.4 KiB krb5-libs x86_64 1.21.3-2.fc41 fedora 2.3 MiB libacl x86_64 2.3.2-2.fc41 fedora 40.0 KiB libarchive x86_64 3.7.4-3.fc41 fedora 922.6 KiB libattr x86_64 2.5.2-4.fc41 fedora 28.5 KiB libblkid x86_64 2.40.2-4.fc41 fedora 258.5 KiB libbrotli x86_64 1.1.0-5.fc41 fedora 837.6 KiB libcap x86_64 2.70-4.fc41 fedora 220.2 KiB libcap-ng x86_64 0.8.5-3.fc41 fedora 69.2 KiB libcom_err x86_64 1.47.1-3.fc41 fedora 67.2 KiB libcurl x86_64 8.9.1-2.fc41 fedora 818.1 KiB libeconf x86_64 0.6.2-3.fc41 fedora 58.0 KiB libevent x86_64 2.1.12-14.fc41 fedora 895.7 KiB libfdisk x86_64 2.40.2-4.fc41 fedora 362.9 KiB libffi x86_64 3.4.6-3.fc41 fedora 86.4 KiB libgcc x86_64 14.2.1-1.fc41 fedora 274.6 KiB libgomp x86_64 14.2.1-1.fc41 fedora 523.4 KiB libidn2 x86_64 2.3.7-2.fc41 fedora 329.1 KiB libmount x86_64 2.40.2-4.fc41 fedora 351.8 KiB libnghttp2 x86_64 1.62.1-2.fc41 fedora 166.1 KiB libnsl2 x86_64 2.0.1-2.fc41 fedora 57.9 KiB libpkgconf x86_64 2.3.0-1.fc41 fedora 78.2 KiB libpsl x86_64 0.21.5-4.fc41 fedora 80.5 KiB libpwquality x86_64 1.4.5-11.fc41 fedora 417.8 KiB libselinux x86_64 3.7-5.fc41 fedora 181.0 KiB libsemanage x86_64 3.7-2.fc41 fedora 293.5 KiB libsepol x86_64 3.7-2.fc41 fedora 817.8 KiB libsmartcols x86_64 2.40.2-4.fc41 fedora 180.4 KiB libssh x86_64 0.10.6-8.fc41 fedora 513.3 KiB libssh-config noarch 0.10.6-8.fc41 fedora 277.0 B libstdc++ x86_64 14.2.1-1.fc41 fedora 2.8 MiB libtasn1 x86_64 4.19.0-9.fc41 fedora 175.7 KiB libtirpc x86_64 1.3.5-0.fc41 fedora 202.7 KiB libtool-ltdl x86_64 2.4.7-12.fc41 fedora 66.2 KiB libunistring x86_64 1.1-8.fc41 fedora 1.7 MiB libutempter x86_64 1.2.1-15.fc41 fedora 57.7 KiB libuuid x86_64 2.40.2-4.fc41 fedora 37.5 KiB libverto x86_64 0.3.2-9.fc41 fedora 29.5 KiB libxcrypt x86_64 4.4.36-7.fc41 fedora 266.8 KiB libxml2 x86_64 2.12.8-2.fc41 fedora 1.7 MiB libzstd x86_64 1.5.6-2.fc41 fedora 795.9 KiB lua-libs x86_64 5.4.6-6.fc41 fedora 285.0 KiB lua-srpm-macros noarch 1-14.fc41 fedora 1.3 KiB lz4-libs x86_64 1.10.0-1.fc41 fedora 145.5 KiB mpfr x86_64 4.2.1-5.fc41 fedora 832.1 KiB ncurses-base noarch 6.5-2.20240629.fc41 fedora 326.3 KiB ncurses-libs x86_64 6.5-2.20240629.fc41 fedora 975.2 KiB ocaml-srpm-macros noarch 10-3.fc41 fedora 1.9 KiB openblas-srpm-macros noarch 2-18.fc41 fedora 112.0 B openldap x86_64 2.6.8-5.fc41 fedora 644.2 KiB openssl-libs x86_64 1:3.2.2-5.fc41 fedora 7.8 MiB p11-kit x86_64 0.25.5-3.fc41 fedora 2.2 MiB p11-kit-trust x86_64 0.25.5-3.fc41 fedora 391.4 KiB package-notes-srpm-macros noarch 0.5-12.fc41 fedora 1.6 KiB pam x86_64 1.6.1-5.fc41 fedora 1.8 MiB pam-libs x86_64 1.6.1-5.fc41 fedora 139.0 KiB pcre2 x86_64 10.44-1.fc41.1 fedora 653.5 KiB pcre2-syntax noarch 10.44-1.fc41.1 fedora 251.6 KiB perl-srpm-macros noarch 1-56.fc41 fedora 861.0 B pkgconf x86_64 2.3.0-1.fc41 fedora 88.6 KiB pkgconf-m4 noarch 2.3.0-1.fc41 fedora 14.4 KiB pkgconf-pkg-config x86_64 2.3.0-1.fc41 fedora 989.0 B popt x86_64 1.19-7.fc41 fedora 136.9 KiB publicsuffix-list-dafsa noarch 20240107-4.fc41 fedora 67.5 KiB pyproject-srpm-macros noarch 1.14.0-1.fc41 fedora 1.9 KiB python-srpm-macros noarch 3.13-3.fc41 fedora 51.0 KiB qt5-srpm-macros noarch 5.15.14-3.fc41 fedora 500.0 B qt6-srpm-macros noarch 6.7.2-3.fc41 fedora 456.0 B readline x86_64 8.2-10.fc41 fedora 493.2 KiB rpm x86_64 4.19.92-6.fc41 fedora 3.1 MiB rpm-build-libs x86_64 4.19.92-6.fc41 fedora 206.7 KiB rpm-libs x86_64 4.19.92-6.fc41 fedora 721.9 KiB rpm-sequoia x86_64 1.7.0-2.fc41 fedora 2.4 MiB rust-srpm-macros noarch 26.3-3.fc41 fedora 4.8 KiB setup noarch 2.15.0-5.fc41 fedora 720.7 KiB sqlite-libs x86_64 3.46.1-1.fc41 fedora 1.4 MiB systemd-libs x86_64 256.5-1.fc41 fedora 2.0 MiB util-linux-core x86_64 2.40.2-4.fc41 fedora 1.5 MiB xxhash-libs x86_64 0.8.2-3.fc41 fedora 88.5 KiB xz-libs x86_64 1:5.6.2-2.fc41 fedora 214.4 KiB zig-srpm-macros noarch 1-3.fc41 fedora 1.1 KiB zip x86_64 3.0-41.fc41 fedora 703.2 KiB zlib-ng-compat x86_64 2.1.7-2.fc41 fedora 134.0 KiB zstd x86_64 1.5.6-2.fc41 fedora 1.7 MiB Installing groups: Buildsystem building group Transaction Summary: Installing: 153 packages Total size of inbound packages is 53 MiB. Need to download 0 B. After this operation 180 MiB will be used (install 180 MiB, remove 0 B). [ 1/153] tar-2:1.35-4.fc41.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 2/153] bzip2-0:1.0.8-19.fc41.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 3/153] redhat-rpm-config-0:293-1.fc4 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 4/153] rpm-build-0:4.19.92-6.fc41.x8 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 5/153] unzip-0:6.0-64.fc41.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 6/153] cpio-0:2.15-2.fc41.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 7/153] which-0:2.21-42.fc41.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 8/153] bash-0:5.2.32-1.fc41.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 9/153] coreutils-0:9.5-9.fc41.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 10/153] grep-0:3.11-9.fc41.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 11/153] patch-0:2.7.6-25.fc41.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 12/153] sed-0:4.9-3.fc41.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 13/153] shadow-utils-2:4.15.1-9.fc41. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 14/153] diffutils-0:3.10-8.fc41.x86_6 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 15/153] fedora-release-common-0:41-0. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 16/153] findutils-1:4.10.0-4.fc41.x86 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 17/153] glibc-minimal-langpack-0:2.40 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 18/153] gzip-0:1.13-2.fc41.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 19/153] info-0:7.1-3.fc41.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 20/153] xz-1:5.6.2-2.fc41.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 21/153] util-linux-0:2.40.2-4.fc41.x8 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 22/153] gawk-0:5.3.0-4.fc41.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 23/153] glibc-0:2.40-3.fc41.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 24/153] libacl-0:2.3.2-2.fc41.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 25/153] libselinux-0:3.7-5.fc41.x86_6 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 26/153] bzip2-libs-0:1.0.8-19.fc41.x8 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 27/153] ansible-srpm-macros-0:1-16.fc 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 28/153] build-reproducibility-srpm-ma 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 29/153] dwz-0:0.15-7.fc41.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 30/153] efi-srpm-macros-0:5-12.fc41.n 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 31/153] file-0:5.45-7.fc41.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 32/153] fonts-srpm-macros-1:2.0.5-17. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 33/153] forge-srpm-macros-0:0.3.2-1.f 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 34/153] fpc-srpm-macros-0:1.3-13.fc41 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 35/153] ghc-srpm-macros-0:1.9.1-2.fc4 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 36/153] gnat-srpm-macros-0:6-6.fc41.n 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 37/153] go-srpm-macros-0:3.6.0-3.fc41 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 38/153] kernel-srpm-macros-0:1.0-24.f 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 39/153] lua-srpm-macros-0:1-14.fc41.n 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 40/153] ocaml-srpm-macros-0:10-3.fc41 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 41/153] openblas-srpm-macros-0:2-18.f 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 42/153] package-notes-srpm-macros-0:0 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 43/153] perl-srpm-macros-0:1-56.fc41. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 44/153] pyproject-srpm-macros-0:1.14. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 45/153] python-srpm-macros-0:3.13-3.f 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 46/153] qt5-srpm-macros-0:5.15.14-3.f 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 47/153] qt6-srpm-macros-0:6.7.2-3.fc4 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 48/153] rpm-0:4.19.92-6.fc41.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 49/153] rust-srpm-macros-0:26.3-3.fc4 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 50/153] zig-srpm-macros-0:1-3.fc41.no 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 51/153] zip-0:3.0-41.fc41.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 52/153] debugedit-0:5.0-17.fc41.x86_6 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 53/153] elfutils-0:0.191-8.fc41.x86_6 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 54/153] elfutils-libelf-0:0.191-8.fc4 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 55/153] libarchive-0:3.7.4-3.fc41.x86 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 56/153] popt-0:1.19-7.fc41.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 57/153] readline-0:8.2-10.fc41.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 58/153] rpm-build-libs-0:4.19.92-6.fc 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 59/153] rpm-libs-0:4.19.92-6.fc41.x86 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 60/153] zstd-0:1.5.6-2.fc41.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 61/153] filesystem-0:3.18-23.fc41.x86 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 62/153] ncurses-libs-0:6.5-2.20240629 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 63/153] coreutils-common-0:9.5-9.fc41 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 64/153] libattr-0:2.5.2-4.fc41.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 65/153] libcap-0:2.70-4.fc41.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 66/153] openssl-libs-1:3.2.2-5.fc41.x 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 67/153] pcre2-0:10.44-1.fc41.1.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 68/153] ed-0:1.20.2-2.fc41.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 69/153] audit-libs-0:4.0.2-1.fc41.x86 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 70/153] libeconf-0:0.6.2-3.fc41.x86_6 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 71/153] libsemanage-0:3.7-2.fc41.x86_ 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 72/153] libxcrypt-0:4.4.36-7.fc41.x86 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 73/153] pam-libs-0:1.6.1-5.fc41.x86_6 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 74/153] setup-0:2.15.0-5.fc41.noarch 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 75/153] fedora-repos-0:41-0.5.noarch 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 76/153] glibc-common-0:2.40-3.fc41.x8 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 77/153] xz-libs-1:5.6.2-2.fc41.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 78/153] libblkid-0:2.40.2-4.fc41.x86_ 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 79/153] libcap-ng-0:0.8.5-3.fc41.x86_ 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 80/153] libfdisk-0:2.40.2-4.fc41.x86_ 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 81/153] libmount-0:2.40.2-4.fc41.x86_ 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 82/153] libsmartcols-0:2.40.2-4.fc41. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 83/153] libutempter-0:1.2.1-15.fc41.x 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 84/153] libuuid-0:2.40.2-4.fc41.x86_6 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 85/153] systemd-libs-0:256.5-1.fc41.x 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 86/153] util-linux-core-0:2.40.2-4.fc 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 87/153] zlib-ng-compat-0:2.1.7-2.fc41 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 88/153] mpfr-0:4.2.1-5.fc41.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 89/153] glibc-gconv-extra-0:2.40-3.fc 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 90/153] basesystem-0:11-21.fc41.noarc 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 91/153] libgcc-0:14.2.1-1.fc41.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 92/153] libsepol-0:3.7-2.fc41.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 93/153] add-determinism-0:0.3.6-1.fc4 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 94/153] file-libs-0:5.45-7.fc41.x86_6 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 95/153] curl-0:8.9.1-2.fc41.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 96/153] elfutils-libs-0:0.191-8.fc41. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 97/153] elfutils-debuginfod-client-0: 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 98/153] libstdc++-0:14.2.1-1.fc41.x86 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 99/153] libzstd-0:1.5.6-2.fc41.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [100/153] libxml2-0:2.12.8-2.fc41.x86_6 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [101/153] lz4-libs-0:1.10.0-1.fc41.x86_ 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [102/153] libgomp-0:14.2.1-1.fc41.x86_6 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [103/153] lua-libs-0:5.4.6-6.fc41.x86_6 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [104/153] rpm-sequoia-0:1.7.0-2.fc41.x8 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [105/153] sqlite-libs-0:3.46.1-1.fc41.x 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [106/153] ncurses-base-0:6.5-2.20240629 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [107/153] ca-certificates-0:2024.2.68_v 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [108/153] crypto-policies-0:20240826-1. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [109/153] pcre2-syntax-0:10.44-1.fc41.1 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [110/153] fedora-gpg-keys-0:41-0.5.noar 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [111/153] elfutils-default-yama-scope-0 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [112/153] authselect-libs-0:1.5.0-7.fc4 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [113/153] pam-0:1.6.1-5.fc41.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [114/153] authselect-0:1.5.0-7.fc41.x86 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [115/153] gdbm-libs-1:1.23-7.fc41.x86_6 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [116/153] libnsl2-0:2.0.1-2.fc41.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [117/153] libpwquality-0:1.4.5-11.fc41. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [118/153] libtirpc-0:1.3.5-0.fc41.x86_6 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [119/153] cracklib-0:2.9.11-6.fc41.x86_ 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [120/153] krb5-libs-0:1.21.3-2.fc41.x86 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [121/153] libcom_err-0:1.47.1-3.fc41.x8 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [122/153] keyutils-libs-0:1.6.3-4.fc41. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [123/153] libverto-0:0.3.2-9.fc41.x86_6 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [124/153] binutils-0:2.43-3.fc41.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [125/153] alternatives-0:1.30-1.fc41.x8 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [126/153] jansson-0:2.13.1-10.fc41.x86_ 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [127/153] pkgconf-pkg-config-0:2.3.0-1. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [128/153] pkgconf-0:2.3.0-1.fc41.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [129/153] pkgconf-m4-0:2.3.0-1.fc41.noa 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [130/153] libpkgconf-0:2.3.0-1.fc41.x86 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [131/153] gdbm-1:1.23-7.fc41.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [132/153] p11-kit-0:0.25.5-3.fc41.x86_6 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [133/153] libffi-0:3.4.6-3.fc41.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [134/153] libtasn1-0:4.19.0-9.fc41.x86_ 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [135/153] p11-kit-trust-0:0.25.5-3.fc41 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [136/153] fedora-release-0:41-0.21.noar 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [137/153] gdb-minimal-0:15.1-1.fc41.x86 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [138/153] xxhash-libs-0:0.8.2-3.fc41.x8 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [139/153] gmp-1:6.3.0-2.fc41.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [140/153] fedora-release-identity-basic 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [141/153] libcurl-0:8.9.1-2.fc41.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [142/153] libbrotli-0:1.1.0-5.fc41.x86_ 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [143/153] libidn2-0:2.3.7-2.fc41.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [144/153] libnghttp2-0:1.62.1-2.fc41.x8 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [145/153] libpsl-0:0.21.5-4.fc41.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [146/153] libssh-0:0.10.6-8.fc41.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [147/153] openldap-0:2.6.8-5.fc41.x86_6 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [148/153] libunistring-0:1.1-8.fc41.x86 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [149/153] publicsuffix-list-dafsa-0:202 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [150/153] libssh-config-0:0.10.6-8.fc41 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [151/153] cyrus-sasl-lib-0:2.1.28-27.fc 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [152/153] libevent-0:2.1.12-14.fc41.x86 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [153/153] libtool-ltdl-0:2.4.7-12.fc41. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded -------------------------------------------------------------------------------- [153/153] Total 100% | 0.0 B/s | 0.0 B | 00m00s Running transaction Importing PGP key 0xE99D6AD1: Userid : "Fedora (41) " Fingerprint: 466CF2D8B60BC3057AA9453ED0622462E99D6AD1 From : file:///usr/share/distribution-gpg-keys/fedora/RPM-GPG-KEY-fedora-41-primary The key was successfully imported. [ 1/155] Verify package files 100% | 768.0 B/s | 153.0 B | 00m00s >>> Running pre-transaction scriptlet: filesystem-0:3.18-23.fc41.x86_64 >>> Stop pre-transaction scriptlet: filesystem-0:3.18-23.fc41.x86_64 [ 2/155] Prepare transaction 100% | 3.8 KiB/s | 153.0 B | 00m00s [ 3/155] Installing libgcc-0:14.2.1-1. 100% | 269.8 MiB/s | 276.3 KiB | 00m00s >>> Running post-install scriptlet: libgcc-0:14.2.1-1.fc41.x86_64 >>> Stop post-install scriptlet: libgcc-0:14.2.1-1.fc41.x86_64 [ 4/155] Installing fedora-release-ide 100% | 0.0 B/s | 940.0 B | 00m00s [ 5/155] Installing fedora-gpg-keys-0: 100% | 56.1 MiB/s | 172.2 KiB | 00m00s [ 6/155] Installing fedora-repos-0:41- 100% | 0.0 B/s | 5.7 KiB | 00m00s [ 7/155] Installing fedora-release-com 100% | 23.1 MiB/s | 23.7 KiB | 00m00s [ 8/155] Installing fedora-release-0:4 100% | 0.0 B/s | 124.0 B | 00m00s [ 9/155] Installing setup-0:2.15.0-5.f 100% | 59.1 MiB/s | 726.1 KiB | 00m00s >>> Running post-install scriptlet: setup-0:2.15.0-5.fc41.noarch >>> Stop post-install scriptlet: setup-0:2.15.0-5.fc41.noarch [ 10/155] Installing filesystem-0:3.18- 100% | 3.1 MiB/s | 212.5 KiB | 00m00s [ 11/155] Installing basesystem-0:11-21 100% | 0.0 B/s | 124.0 B | 00m00s [ 12/155] Installing libssh-config-0:0. 100% | 0.0 B/s | 816.0 B | 00m00s [ 13/155] Installing publicsuffix-list- 100% | 0.0 B/s | 68.3 KiB | 00m00s [ 14/155] Installing pkgconf-m4-0:2.3.0 100% | 0.0 B/s | 14.8 KiB | 00m00s [ 15/155] Installing pcre2-syntax-0:10. 100% | 248.1 MiB/s | 254.1 KiB | 00m00s [ 16/155] Installing ncurses-base-0:6.5 100% | 85.9 MiB/s | 351.7 KiB | 00m00s [ 17/155] Installing glibc-minimal-lang 100% | 0.0 B/s | 124.0 B | 00m00s [ 18/155] Installing ncurses-libs-0:6.5 100% | 239.7 MiB/s | 981.8 KiB | 00m00s >>> Running pre-install scriptlet: glibc-0:2.40-3.fc41.x86_64 >>> Stop pre-install scriptlet: glibc-0:2.40-3.fc41.x86_64 [ 19/155] Installing glibc-0:2.40-3.fc4 100% | 222.6 MiB/s | 6.7 MiB | 00m00s >>> Running post-install scriptlet: glibc-0:2.40-3.fc41.x86_64 >>> Stop post-install scriptlet: glibc-0:2.40-3.fc41.x86_64 [ 20/155] Installing bash-0:5.2.32-1.fc 100% | 389.0 MiB/s | 8.2 MiB | 00m00s >>> Running post-install scriptlet: bash-0:5.2.32-1.fc41.x86_64 >>> Stop post-install scriptlet: bash-0:5.2.32-1.fc41.x86_64 [ 21/155] Installing glibc-common-0:2.4 100% | 174.5 MiB/s | 1.0 MiB | 00m00s [ 22/155] Installing glibc-gconv-extra- 100% | 231.4 MiB/s | 8.1 MiB | 00m00s >>> Running post-install scriptlet: glibc-gconv-extra-0:2.40-3.fc41.x86_64 >>> Stop post-install scriptlet: glibc-gconv-extra-0:2.40-3.fc41.x86_64 [ 23/155] Installing zlib-ng-compat-0:2 100% | 131.7 MiB/s | 134.8 KiB | 00m00s [ 24/155] Installing bzip2-libs-0:1.0.8 100% | 79.9 MiB/s | 81.8 KiB | 00m00s [ 25/155] Installing xz-libs-1:5.6.2-2. 100% | 210.4 MiB/s | 215.5 KiB | 00m00s [ 26/155] Installing popt-0:1.19-7.fc41 100% | 70.1 MiB/s | 143.5 KiB | 00m00s [ 27/155] Installing readline-0:8.2-10. 100% | 241.8 MiB/s | 495.3 KiB | 00m00s [ 28/155] Installing libuuid-0:2.40.2-4 100% | 0.0 B/s | 38.6 KiB | 00m00s [ 29/155] Installing libblkid-0:2.40.2- 100% | 253.4 MiB/s | 259.5 KiB | 00m00s [ 30/155] Installing libattr-0:2.5.2-4. 100% | 0.0 B/s | 29.5 KiB | 00m00s [ 31/155] Installing libacl-0:2.3.2-2.f 100% | 0.0 B/s | 40.7 KiB | 00m00s [ 32/155] Installing libxcrypt-0:4.4.36 100% | 263.2 MiB/s | 269.5 KiB | 00m00s [ 33/155] Installing libstdc++-0:14.2.1 100% | 346.3 MiB/s | 2.8 MiB | 00m00s [ 34/155] Installing libzstd-0:1.5.6-2. 100% | 259.5 MiB/s | 797.2 KiB | 00m00s [ 35/155] Installing elfutils-libelf-0: 100% | 389.7 MiB/s | 1.2 MiB | 00m00s [ 36/155] Installing gmp-1:6.3.0-2.fc41 100% | 99.3 MiB/s | 813.7 KiB | 00m00s >>> Running pre-install scriptlet: crypto-policies-0:20240826-1.gite824389.fc41. >>> Stop pre-install scriptlet: crypto-policies-0:20240826-1.gite824389.fc41.noa [ 37/155] Installing crypto-policies-0: 100% | 31.9 MiB/s | 163.2 KiB | 00m00s >>> Running post-install scriptlet: crypto-policies-0:20240826-1.gite824389.fc41 >>> Stop post-install scriptlet: crypto-policies-0:20240826-1.gite824389.fc41.no [ 38/155] Installing libeconf-0:0.6.2-3 100% | 58.3 MiB/s | 59.7 KiB | 00m00s [ 39/155] Installing gdbm-libs-1:1.23-7 100% | 120.7 MiB/s | 123.6 KiB | 00m00s [ 40/155] Installing mpfr-0:4.2.1-5.fc4 100% | 271.4 MiB/s | 833.7 KiB | 00m00s [ 41/155] Installing gawk-0:5.3.0-4.fc4 100% | 288.7 MiB/s | 1.7 MiB | 00m00s [ 42/155] Installing dwz-0:0.15-7.fc41. 100% | 285.5 MiB/s | 292.3 KiB | 00m00s [ 43/155] Installing unzip-0:6.0-64.fc4 100% | 190.6 MiB/s | 390.3 KiB | 00m00s [ 44/155] Installing file-libs-0:5.45-7 100% | 620.9 MiB/s | 9.9 MiB | 00m00s [ 45/155] Installing file-0:5.45-7.fc41 100% | 102.6 MiB/s | 105.0 KiB | 00m00s [ 46/155] Installing pcre2-0:10.44-1.fc 100% | 319.8 MiB/s | 654.9 KiB | 00m00s [ 47/155] Installing grep-0:3.11-9.fc41 100% | 200.7 MiB/s | 1.0 MiB | 00m00s [ 48/155] Installing xz-1:5.6.2-2.fc41. 100% | 241.0 MiB/s | 1.2 MiB | 00m00s [ 49/155] Installing libcap-ng-0:0.8.5- 100% | 69.4 MiB/s | 71.0 KiB | 00m00s [ 50/155] Installing audit-libs-0:4.0.2 100% | 162.8 MiB/s | 333.4 KiB | 00m00s [ 51/155] Installing pam-libs-0:1.6.1-5 100% | 138.1 MiB/s | 141.4 KiB | 00m00s [ 52/155] Installing libcap-0:2.70-4.fc 100% | 110.0 MiB/s | 225.2 KiB | 00m00s [ 53/155] Installing systemd-libs-0:256 100% | 338.2 MiB/s | 2.0 MiB | 00m00s [ 54/155] Installing libsmartcols-0:2.4 100% | 177.1 MiB/s | 181.4 KiB | 00m00s [ 55/155] Installing libsepol-0:3.7-2.f 100% | 266.5 MiB/s | 818.8 KiB | 00m00s [ 56/155] Installing libselinux-0:3.7-5 100% | 178.0 MiB/s | 182.3 KiB | 00m00s [ 57/155] Installing sed-0:4.9-3.fc41.x 100% | 212.3 MiB/s | 869.7 KiB | 00m00s [ 58/155] Installing findutils-1:4.10.0 100% | 309.7 MiB/s | 1.9 MiB | 00m00s [ 59/155] Installing libmount-0:2.40.2- 100% | 344.7 MiB/s | 352.9 KiB | 00m00s [ 60/155] Installing lz4-libs-0:1.10.0- 100% | 143.1 MiB/s | 146.6 KiB | 00m00s [ 61/155] Installing lua-libs-0:5.4.6-6 100% | 279.5 MiB/s | 286.2 KiB | 00m00s [ 62/155] Installing libcom_err-0:1.47. 100% | 66.7 MiB/s | 68.3 KiB | 00m00s [ 63/155] Installing alternatives-0:1.3 100% | 66.3 MiB/s | 67.9 KiB | 00m00s [ 64/155] Installing libtasn1-0:4.19.0- 100% | 173.3 MiB/s | 177.5 KiB | 00m00s [ 65/155] Installing libunistring-0:1.1 100% | 346.1 MiB/s | 1.7 MiB | 00m00s [ 66/155] Installing libidn2-0:2.3.7-2. 100% | 109.1 MiB/s | 335.1 KiB | 00m00s [ 67/155] Installing libpsl-0:0.21.5-4. 100% | 79.7 MiB/s | 81.7 KiB | 00m00s [ 68/155] Installing zstd-0:1.5.6-2.fc4 100% | 338.3 MiB/s | 1.7 MiB | 00m00s [ 69/155] Installing util-linux-core-0: 100% | 247.6 MiB/s | 1.5 MiB | 00m00s [ 70/155] Installing tar-2:1.35-4.fc41. 100% | 328.7 MiB/s | 3.0 MiB | 00m00s [ 71/155] Installing libsemanage-0:3.7- 100% | 96.1 MiB/s | 295.2 KiB | 00m00s [ 72/155] Installing shadow-utils-2:4.1 100% | 149.8 MiB/s | 4.2 MiB | 00m00s >>> Running pre-install scriptlet: libutempter-0:1.2.1-15.fc41.x86_64 >>> Stop pre-install scriptlet: libutempter-0:1.2.1-15.fc41.x86_64 [ 73/155] Installing libutempter-0:1.2. 100% | 58.3 MiB/s | 59.7 KiB | 00m00s [ 74/155] Installing zip-0:3.0-41.fc41. 100% | 230.2 MiB/s | 707.1 KiB | 00m00s [ 75/155] Installing gdbm-1:1.23-7.fc41 100% | 151.6 MiB/s | 465.8 KiB | 00m00s [ 76/155] Installing cyrus-sasl-lib-0:2 100% | 329.4 MiB/s | 2.3 MiB | 00m00s [ 77/155] Installing libfdisk-0:2.40.2- 100% | 177.8 MiB/s | 364.1 KiB | 00m00s [ 78/155] Installing libxml2-0:2.12.8-2 100% | 342.4 MiB/s | 1.7 MiB | 00m00s [ 79/155] Installing bzip2-0:1.0.8-19.f 100% | 97.8 MiB/s | 100.2 KiB | 00m00s [ 80/155] Installing add-determinism-0: 100% | 374.3 MiB/s | 2.2 MiB | 00m00s [ 81/155] Installing build-reproducibil 100% | 0.0 B/s | 1.0 KiB | 00m00s [ 82/155] Installing sqlite-libs-0:3.46 100% | 357.3 MiB/s | 1.4 MiB | 00m00s [ 83/155] Installing ed-0:1.20.2-2.fc41 100% | 145.7 MiB/s | 149.2 KiB | 00m00s [ 84/155] Installing patch-0:2.7.6-25.f 100% | 261.9 MiB/s | 268.2 KiB | 00m00s [ 85/155] Installing elfutils-default-y 100% | 340.5 KiB/s | 2.0 KiB | 00m00s >>> Running post-install scriptlet: elfutils-default-yama-scope-0:0.191-8.fc41.n >>> Stop post-install scriptlet: elfutils-default-yama-scope-0:0.191-8.fc41.noar [ 86/155] Installing cpio-0:2.15-2.fc41 100% | 219.9 MiB/s | 1.1 MiB | 00m00s [ 87/155] Installing diffutils-0:3.10-8 100% | 265.0 MiB/s | 1.6 MiB | 00m00s [ 88/155] Installing libgomp-0:14.2.1-1 100% | 256.2 MiB/s | 524.8 KiB | 00m00s [ 89/155] Installing keyutils-libs-0:1. 100% | 54.5 MiB/s | 55.8 KiB | 00m00s [ 90/155] Installing libverto-0:0.3.2-9 100% | 30.5 MiB/s | 31.3 KiB | 00m00s [ 91/155] Installing jansson-0:2.13.1-1 100% | 87.6 MiB/s | 89.7 KiB | 00m00s [ 92/155] Installing libpkgconf-0:2.3.0 100% | 77.5 MiB/s | 79.3 KiB | 00m00s [ 93/155] Installing pkgconf-0:2.3.0-1. 100% | 89.0 MiB/s | 91.1 KiB | 00m00s [ 94/155] Installing pkgconf-pkg-config 100% | 0.0 B/s | 1.8 KiB | 00m00s [ 95/155] Installing libffi-0:3.4.6-3.f 100% | 85.7 MiB/s | 87.8 KiB | 00m00s [ 96/155] Installing p11-kit-0:0.25.5-3 100% | 245.3 MiB/s | 2.2 MiB | 00m00s [ 97/155] Installing p11-kit-trust-0:0. 100% | 48.0 MiB/s | 393.1 KiB | 00m00s >>> Running post-install scriptlet: p11-kit-trust-0:0.25.5-3.fc41.x86_64 >>> Stop post-install scriptlet: p11-kit-trust-0:0.25.5-3.fc41.x86_64 [ 98/155] Installing xxhash-libs-0:0.8. 100% | 87.8 MiB/s | 89.9 KiB | 00m00s [ 99/155] Installing libbrotli-0:1.1.0- 100% | 273.4 MiB/s | 839.9 KiB | 00m00s [100/155] Installing libnghttp2-0:1.62. 100% | 163.2 MiB/s | 167.1 KiB | 00m00s [101/155] Installing libtool-ltdl-0:2.4 100% | 65.7 MiB/s | 67.3 KiB | 00m00s [102/155] Installing coreutils-common-0 100% | 385.9 MiB/s | 11.2 MiB | 00m00s [103/155] Installing openssl-libs-1:3.2 100% | 411.9 MiB/s | 7.8 MiB | 00m00s [104/155] Installing coreutils-0:9.5-9. 100% | 269.5 MiB/s | 5.7 MiB | 00m00s >>> Running pre-install scriptlet: ca-certificates-0:2024.2.68_v8.0.302-3.fc41.n >>> Stop pre-install scriptlet: ca-certificates-0:2024.2.68_v8.0.302-3.fc41.noar [105/155] Installing ca-certificates-0: 100% | 3.8 MiB/s | 2.4 MiB | 00m01s >>> Running post-install scriptlet: ca-certificates-0:2024.2.68_v8.0.302-3.fc41. >>> Stop post-install scriptlet: ca-certificates-0:2024.2.68_v8.0.302-3.fc41.noa [106/155] Installing krb5-libs-0:1.21.3 100% | 255.5 MiB/s | 2.3 MiB | 00m00s [107/155] Installing libarchive-0:3.7.4 100% | 301.0 MiB/s | 924.6 KiB | 00m00s [108/155] Installing libtirpc-0:1.3.5-0 100% | 199.7 MiB/s | 204.5 KiB | 00m00s [109/155] Installing gzip-0:1.13-2.fc41 100% | 192.7 MiB/s | 394.6 KiB | 00m00s [110/155] Installing authselect-libs-0: 100% | 162.7 MiB/s | 833.2 KiB | 00m00s [111/155] Installing cracklib-0:2.9.11- 100% | 61.1 MiB/s | 250.3 KiB | 00m00s [112/155] Installing libpwquality-0:1.4 100% | 105.0 MiB/s | 430.1 KiB | 00m00s [113/155] Installing libnsl2-0:2.0.1-2. 100% | 57.7 MiB/s | 59.1 KiB | 00m00s [114/155] Installing pam-0:1.6.1-5.fc41 100% | 156.4 MiB/s | 1.9 MiB | 00m00s [115/155] Installing libssh-0:0.10.6-8. 100% | 251.7 MiB/s | 515.4 KiB | 00m00s [116/155] Installing rpm-sequoia-0:1.7. 100% | 338.2 MiB/s | 2.4 MiB | 00m00s [117/155] Installing rpm-libs-0:4.19.92 100% | 235.5 MiB/s | 723.4 KiB | 00m00s [118/155] Installing libevent-0:2.1.12- 100% | 292.8 MiB/s | 899.5 KiB | 00m00s [119/155] Installing openldap-0:2.6.8-5 100% | 210.9 MiB/s | 648.0 KiB | 00m00s [120/155] Installing libcurl-0:8.9.1-2. 100% | 266.7 MiB/s | 819.2 KiB | 00m00s [121/155] Installing elfutils-libs-0:0. 100% | 210.9 MiB/s | 648.0 KiB | 00m00s [122/155] Installing elfutils-debuginfo 100% | 65.3 MiB/s | 66.9 KiB | 00m00s [123/155] Installing elfutils-0:0.191-8 100% | 365.7 MiB/s | 2.6 MiB | 00m00s [124/155] Installing binutils-0:2.43-3. 100% | 377.5 MiB/s | 27.6 MiB | 00m00s >>> Running post-install scriptlet: binutils-0:2.43-3.fc41.x86_64 >>> Stop post-install scriptlet: binutils-0:2.43-3.fc41.x86_64 [125/155] Installing gdb-minimal-0:15.1 100% | 382.1 MiB/s | 13.0 MiB | 00m00s [126/155] Installing debugedit-0:5.0-17 100% | 98.6 MiB/s | 202.0 KiB | 00m00s [127/155] Installing rpm-build-libs-0:4 100% | 202.6 MiB/s | 207.5 KiB | 00m00s [128/155] Installing curl-0:8.9.1-2.fc4 100% | 70.9 MiB/s | 798.6 KiB | 00m00s >>> Running pre-install scriptlet: rpm-0:4.19.92-6.fc41.x86_64 >>> Stop pre-install scriptlet: rpm-0:4.19.92-6.fc41.x86_64 [129/155] Installing rpm-0:4.19.92-6.fc 100% | 156.2 MiB/s | 2.5 MiB | 00m00s [130/155] Installing efi-srpm-macros-0: 100% | 0.0 B/s | 41.2 KiB | 00m00s [131/155] Installing lua-srpm-macros-0: 100% | 0.0 B/s | 1.9 KiB | 00m00s [132/155] Installing zig-srpm-macros-0: 100% | 0.0 B/s | 1.7 KiB | 00m00s [133/155] Installing rust-srpm-macros-0 100% | 5.4 MiB/s | 5.6 KiB | 00m00s [134/155] Installing qt6-srpm-macros-0: 100% | 0.0 B/s | 732.0 B | 00m00s [135/155] Installing qt5-srpm-macros-0: 100% | 0.0 B/s | 776.0 B | 00m00s [136/155] Installing perl-srpm-macros-0 100% | 0.0 B/s | 1.1 KiB | 00m00s [137/155] Installing package-notes-srpm 100% | 0.0 B/s | 2.0 KiB | 00m00s [138/155] Installing openblas-srpm-macr 100% | 0.0 B/s | 392.0 B | 00m00s [139/155] Installing ocaml-srpm-macros- 100% | 0.0 B/s | 2.2 KiB | 00m00s [140/155] Installing kernel-srpm-macros 100% | 0.0 B/s | 2.3 KiB | 00m00s [141/155] Installing gnat-srpm-macros-0 100% | 0.0 B/s | 1.3 KiB | 00m00s [142/155] Installing ghc-srpm-macros-0: 100% | 0.0 B/s | 1.0 KiB | 00m00s [143/155] Installing fpc-srpm-macros-0: 100% | 0.0 B/s | 420.0 B | 00m00s [144/155] Installing ansible-srpm-macro 100% | 0.0 B/s | 36.2 KiB | 00m00s [145/155] Installing fonts-srpm-macros- 100% | 55.7 MiB/s | 57.0 KiB | 00m00s [146/155] Installing forge-srpm-macros- 100% | 0.0 B/s | 40.4 KiB | 00m00s [147/155] Installing go-srpm-macros-0:3 100% | 60.5 MiB/s | 62.0 KiB | 00m00s [148/155] Installing python-srpm-macros 100% | 50.9 MiB/s | 52.2 KiB | 00m00s [149/155] Installing redhat-rpm-config- 100% | 92.8 MiB/s | 190.1 KiB | 00m00s [150/155] Installing rpm-build-0:4.19.9 100% | 99.0 MiB/s | 202.8 KiB | 00m00s [151/155] Installing pyproject-srpm-mac 100% | 2.4 MiB/s | 2.5 KiB | 00m00s [152/155] Installing util-linux-0:2.40. 100% | 163.0 MiB/s | 3.7 MiB | 00m00s >>> Running post-install scriptlet: util-linux-0:2.40.2-4.fc41.x86_64 >>> Stop post-install scriptlet: util-linux-0:2.40.2-4.fc41.x86_64 [153/155] Installing authselect-0:1.5.0 100% | 77.1 MiB/s | 157.9 KiB | 00m00s [154/155] Installing which-0:2.21-42.fc 100% | 80.5 MiB/s | 82.4 KiB | 00m00s [155/155] Installing info-0:7.1-3.fc41. 100% | 402.0 KiB/s | 362.2 KiB | 00m01s >>> Running post-transaction scriptlet: filesystem-0:3.18-23.fc41.x86_64 >>> Stop post-transaction scriptlet: filesystem-0:3.18-23.fc41.x86_64 >>> Running post-transaction scriptlet: ca-certificates-0:2024.2.68_v8.0.302-3.f >>> Stop post-transaction scriptlet: ca-certificates-0:2024.2.68_v8.0.302-3.fc41 >>> Running post-transaction scriptlet: authselect-libs-0:1.5.0-7.fc41.x86_64 >>> Stop post-transaction scriptlet: authselect-libs-0:1.5.0-7.fc41.x86_64 >>> Running post-transaction scriptlet: rpm-0:4.19.92-6.fc41.x86_64 >>> Stop post-transaction scriptlet: rpm-0:4.19.92-6.fc41.x86_64 >>> Running trigger-install scriptlet: glibc-common-0:2.40-3.fc41.x86_64 >>> Stop trigger-install scriptlet: glibc-common-0:2.40-3.fc41.x86_64 >>> Running trigger-install scriptlet: info-0:7.1-3.fc41.x86_64 >>> Stop trigger-install scriptlet: info-0:7.1-3.fc41.x86_64 Finish: installing minimal buildroot with dnf5 Start: creating root cache Finish: creating root cache Finish: chroot init INFO: Installed packages: INFO: add-determinism-0.3.6-1.fc41.x86_64 alternatives-1.30-1.fc41.x86_64 ansible-srpm-macros-1-16.fc41.noarch audit-libs-4.0.2-1.fc41.x86_64 authselect-1.5.0-7.fc41.x86_64 authselect-libs-1.5.0-7.fc41.x86_64 basesystem-11-21.fc41.noarch bash-5.2.32-1.fc41.x86_64 binutils-2.43-3.fc41.x86_64 build-reproducibility-srpm-macros-0.3.6-1.fc41.noarch bzip2-1.0.8-19.fc41.x86_64 bzip2-libs-1.0.8-19.fc41.x86_64 ca-certificates-2024.2.68_v8.0.302-3.fc41.noarch coreutils-9.5-9.fc41.x86_64 coreutils-common-9.5-9.fc41.x86_64 cpio-2.15-2.fc41.x86_64 cracklib-2.9.11-6.fc41.x86_64 crypto-policies-20240826-1.gite824389.fc41.noarch curl-8.9.1-2.fc41.x86_64 cyrus-sasl-lib-2.1.28-27.fc41.x86_64 debugedit-5.0-17.fc41.x86_64 diffutils-3.10-8.fc41.x86_64 dwz-0.15-7.fc41.x86_64 ed-1.20.2-2.fc41.x86_64 efi-srpm-macros-5-12.fc41.noarch elfutils-0.191-8.fc41.x86_64 elfutils-debuginfod-client-0.191-8.fc41.x86_64 elfutils-default-yama-scope-0.191-8.fc41.noarch elfutils-libelf-0.191-8.fc41.x86_64 elfutils-libs-0.191-8.fc41.x86_64 fedora-gpg-keys-41-0.5.noarch fedora-release-41-0.21.noarch fedora-release-common-41-0.21.noarch fedora-release-identity-basic-41-0.21.noarch fedora-repos-41-0.5.noarch file-5.45-7.fc41.x86_64 file-libs-5.45-7.fc41.x86_64 filesystem-3.18-23.fc41.x86_64 findutils-4.10.0-4.fc41.x86_64 fonts-srpm-macros-2.0.5-17.fc41.noarch forge-srpm-macros-0.3.2-1.fc41.noarch fpc-srpm-macros-1.3-13.fc41.noarch gawk-5.3.0-4.fc41.x86_64 gdb-minimal-15.1-1.fc41.x86_64 gdbm-1.23-7.fc41.x86_64 gdbm-libs-1.23-7.fc41.x86_64 ghc-srpm-macros-1.9.1-2.fc41.noarch glibc-2.40-3.fc41.x86_64 glibc-common-2.40-3.fc41.x86_64 glibc-gconv-extra-2.40-3.fc41.x86_64 glibc-minimal-langpack-2.40-3.fc41.x86_64 gmp-6.3.0-2.fc41.x86_64 gnat-srpm-macros-6-6.fc41.noarch go-srpm-macros-3.6.0-3.fc41.noarch gpg-pubkey-e99d6ad1-64d2612c grep-3.11-9.fc41.x86_64 gzip-1.13-2.fc41.x86_64 info-7.1-3.fc41.x86_64 jansson-2.13.1-10.fc41.x86_64 kernel-srpm-macros-1.0-24.fc41.noarch keyutils-libs-1.6.3-4.fc41.x86_64 krb5-libs-1.21.3-2.fc41.x86_64 libacl-2.3.2-2.fc41.x86_64 libarchive-3.7.4-3.fc41.x86_64 libattr-2.5.2-4.fc41.x86_64 libblkid-2.40.2-4.fc41.x86_64 libbrotli-1.1.0-5.fc41.x86_64 libcap-2.70-4.fc41.x86_64 libcap-ng-0.8.5-3.fc41.x86_64 libcom_err-1.47.1-3.fc41.x86_64 libcurl-8.9.1-2.fc41.x86_64 libeconf-0.6.2-3.fc41.x86_64 libevent-2.1.12-14.fc41.x86_64 libfdisk-2.40.2-4.fc41.x86_64 libffi-3.4.6-3.fc41.x86_64 libgcc-14.2.1-1.fc41.x86_64 libgomp-14.2.1-1.fc41.x86_64 libidn2-2.3.7-2.fc41.x86_64 libmount-2.40.2-4.fc41.x86_64 libnghttp2-1.62.1-2.fc41.x86_64 libnsl2-2.0.1-2.fc41.x86_64 libpkgconf-2.3.0-1.fc41.x86_64 libpsl-0.21.5-4.fc41.x86_64 libpwquality-1.4.5-11.fc41.x86_64 libselinux-3.7-5.fc41.x86_64 libsemanage-3.7-2.fc41.x86_64 libsepol-3.7-2.fc41.x86_64 libsmartcols-2.40.2-4.fc41.x86_64 libssh-0.10.6-8.fc41.x86_64 libssh-config-0.10.6-8.fc41.noarch libstdc++-14.2.1-1.fc41.x86_64 libtasn1-4.19.0-9.fc41.x86_64 libtirpc-1.3.5-0.fc41.x86_64 libtool-ltdl-2.4.7-12.fc41.x86_64 libunistring-1.1-8.fc41.x86_64 libutempter-1.2.1-15.fc41.x86_64 libuuid-2.40.2-4.fc41.x86_64 libverto-0.3.2-9.fc41.x86_64 libxcrypt-4.4.36-7.fc41.x86_64 libxml2-2.12.8-2.fc41.x86_64 libzstd-1.5.6-2.fc41.x86_64 lua-libs-5.4.6-6.fc41.x86_64 lua-srpm-macros-1-14.fc41.noarch lz4-libs-1.10.0-1.fc41.x86_64 mpfr-4.2.1-5.fc41.x86_64 ncurses-base-6.5-2.20240629.fc41.noarch ncurses-libs-6.5-2.20240629.fc41.x86_64 ocaml-srpm-macros-10-3.fc41.noarch openblas-srpm-macros-2-18.fc41.noarch openldap-2.6.8-5.fc41.x86_64 openssl-libs-3.2.2-5.fc41.x86_64 p11-kit-0.25.5-3.fc41.x86_64 p11-kit-trust-0.25.5-3.fc41.x86_64 package-notes-srpm-macros-0.5-12.fc41.noarch pam-1.6.1-5.fc41.x86_64 pam-libs-1.6.1-5.fc41.x86_64 patch-2.7.6-25.fc41.x86_64 pcre2-10.44-1.fc41.1.x86_64 pcre2-syntax-10.44-1.fc41.1.noarch perl-srpm-macros-1-56.fc41.noarch pkgconf-2.3.0-1.fc41.x86_64 pkgconf-m4-2.3.0-1.fc41.noarch pkgconf-pkg-config-2.3.0-1.fc41.x86_64 popt-1.19-7.fc41.x86_64 publicsuffix-list-dafsa-20240107-4.fc41.noarch pyproject-srpm-macros-1.14.0-1.fc41.noarch python-srpm-macros-3.13-3.fc41.noarch qt5-srpm-macros-5.15.14-3.fc41.noarch qt6-srpm-macros-6.7.2-3.fc41.noarch readline-8.2-10.fc41.x86_64 redhat-rpm-config-293-1.fc41.noarch rpm-4.19.92-6.fc41.x86_64 rpm-build-4.19.92-6.fc41.x86_64 rpm-build-libs-4.19.92-6.fc41.x86_64 rpm-libs-4.19.92-6.fc41.x86_64 rpm-sequoia-1.7.0-2.fc41.x86_64 rust-srpm-macros-26.3-3.fc41.noarch sed-4.9-3.fc41.x86_64 setup-2.15.0-5.fc41.noarch shadow-utils-4.15.1-9.fc41.x86_64 sqlite-libs-3.46.1-1.fc41.x86_64 systemd-libs-256.5-1.fc41.x86_64 tar-1.35-4.fc41.x86_64 unzip-6.0-64.fc41.x86_64 util-linux-2.40.2-4.fc41.x86_64 util-linux-core-2.40.2-4.fc41.x86_64 which-2.21-42.fc41.x86_64 xxhash-libs-0.8.2-3.fc41.x86_64 xz-5.6.2-2.fc41.x86_64 xz-libs-5.6.2-2.fc41.x86_64 zig-srpm-macros-1-3.fc41.noarch zip-3.0-41.fc41.x86_64 zlib-ng-compat-2.1.7-2.fc41.x86_64 zstd-1.5.6-2.fc41.x86_64 Start: buildsrpm Start: rpmbuild -bs Building target platforms: x86_64 Building for target x86_64 warning: %source_date_epoch_from_changelog is set, but %changelog has no entries to take a date from Wrote: /builddir/build/SRPMS/R-CRAN-starvz-0.8.2-1.fc41.copr7998582.src.rpm RPM build warnings: %source_date_epoch_from_changelog is set, but %changelog has no entries to take a date from Finish: rpmbuild -bs cp: preserving permissions for ‘/var/lib/copr-rpmbuild/results/chroot_scan/var/lib/mock/fedora-41-x86_64-1725845899.389089/root/var/log’: No such file or directory INFO: chroot_scan: 1 files copied to /var/lib/copr-rpmbuild/results/chroot_scan INFO: /var/lib/mock/fedora-41-x86_64-1725845899.389089/root/var/log/dnf5.log Finish: buildsrpm INFO: Done(/var/lib/copr-rpmbuild/workspace/workdir-7st6y422/R-CRAN-starvz/R-CRAN-starvz.spec) Config(child) 0 minutes 9 seconds INFO: Results and/or logs in: /var/lib/copr-rpmbuild/results INFO: Cleaning up build root ('cleanup_on_success=True') Start: clean chroot INFO: unmounting tmpfs. Finish: clean chroot INFO: Start(/var/lib/copr-rpmbuild/results/R-CRAN-starvz-0.8.2-1.fc41.copr7998582.src.rpm) Config(fedora-41-x86_64) Start: chroot init INFO: mounting tmpfs at /var/lib/mock/fedora-41-x86_64-1725845899.389089/root. INFO: calling preinit hooks INFO: enabled root cache Start: unpacking root cache Finish: unpacking root cache INFO: enabled package manager cache Start: cleaning package manager metadata Finish: cleaning package manager metadata INFO: enabled HW Info plugin INFO: Buildroot is handled by package management from host and used with --installroot: rpm-4.19.1.1-1.fc39.x86_64 rpm-sequoia-1.6.0-1.fc39.x86_64 python3-dnf-4.21.1-1.fc39.noarch python3-dnf-plugins-core-4.9.0-1.fc39.noarch yum-4.21.1-1.fc39.noarch dnf5-5.1.17-2.fc39.x86_64 dnf5-plugins-5.1.17-2.fc39.x86_64 Finish: chroot init Start: build phase for R-CRAN-starvz-0.8.2-1.fc41.copr7998582.src.rpm Start: build setup for R-CRAN-starvz-0.8.2-1.fc41.copr7998582.src.rpm Building target platforms: x86_64 Building for target x86_64 warning: %source_date_epoch_from_changelog is set, but %changelog has no entries to take a date from Wrote: /builddir/build/SRPMS/R-CRAN-starvz-0.8.2-1.fc41.copr7998582.src.rpm RPM build warnings: %source_date_epoch_from_changelog is set, but %changelog has no entries to take a date from Updating and loading repositories: updates 100% | 449.3 KiB/s | 28.3 KiB | 00m00s fedora 100% | 260.9 KiB/s | 8.9 KiB | 00m00s Copr repository 100% | 73.2 KiB/s | 1.5 KiB | 00m00s Copr repository 100% | 126.5 MiB/s | 11.9 MiB | 00m00s Repositories loaded. Package Arch Version Repository Size Installing: R-CRAN-BH noarch 1.84.0.0-1.fc41.copr7349931 copr_base 121.0 MiB R-CRAN-RColorBrewer noarch 1.1.3-1.fc41.copr7349948 copr_base 63.6 KiB R-CRAN-Rcpp x86_64 1.0.13-1.fc41.copr7745410 copr_base 8.4 MiB R-CRAN-data.tree noarch 1.1.0-1.fc41.copr7353767 copr_base 3.0 MiB R-CRAN-dplyr x86_64 1.1.4-1.fc41.copr7361225 copr_base 2.6 MiB R-CRAN-ggplot2 noarch 3.5.1-1.fc41.copr7361224 copr_base 7.1 MiB R-CRAN-gtools x86_64 3.9.5-1.fc41.copr7349932 copr_base 534.9 KiB R-CRAN-lpSolve x86_64 5.6.20-1.fc41.copr7350236 copr_base 770.8 KiB R-CRAN-magrittr x86_64 2.0.3-1.fc41.copr7349936 copr_base 417.3 KiB R-CRAN-patchwork noarch 1.2.0-1.fc41.copr7363400 copr_base 4.1 MiB R-CRAN-purrr x86_64 1.0.2-1.fc41.copr7357927 copr_base 878.1 KiB R-CRAN-readr x86_64 2.1.5-1.fc41.copr7362418 copr_base 1.4 MiB R-CRAN-rlang x86_64 1.1.4-1.fc41.copr7531082 copr_base 2.6 MiB R-CRAN-stringr noarch 1.5.1-1.fc41.copr7357924 copr_base 646.8 KiB R-CRAN-tibble x86_64 3.2.1-1.fc41.copr7359525 copr_base 1.7 MiB R-CRAN-tidyr x86_64 1.3.1-1.fc41.copr7362421 copr_base 1.8 MiB R-CRAN-yaml x86_64 2.3.10-1.fc41.copr7795167 copr_base 276.1 KiB R-CRAN-zoo x86_64 1.8.12-1.fc41.copr7353591 copr_base 1.5 MiB R-core x86_64 4.4.1-5.fc41 fedora 101.5 MiB R-devel x86_64 4.4.1-5.fc41 fedora 0.0 B Installing dependencies: R-CRAN-MASS x86_64 7.3.61-1.fc41.copr7613806 copr_base 1.8 MiB R-CRAN-Matrix x86_64 1.7.0-1.fc41.copr7382390 copr_base 8.0 MiB R-CRAN-R6 noarch 2.5.1-1.fc41.copr7349938 copr_base 115.9 KiB R-CRAN-bit x86_64 4.0.5-1.fc41.copr7349969 copr_base 1.5 MiB R-CRAN-bit64 x86_64 4.0.5-1.fc41.copr7353647 copr_base 888.0 KiB R-CRAN-cli x86_64 3.6.3-1.fc41.copr7649835 copr_base 2.4 MiB R-CRAN-clipr noarch 0.8.0-1.fc41.copr7349958 copr_base 85.0 KiB R-CRAN-colorspace x86_64 2.1.1-1.fc41.copr7795131 copr_base 4.0 MiB R-CRAN-crayon noarch 1.5.3-1.fc41.copr7633037 copr_base 235.8 KiB R-CRAN-fansi x86_64 1.0.6-1.fc41.copr7349952 copr_base 625.8 KiB R-CRAN-farver x86_64 2.1.2-1.fc41.copr7442181 copr_base 2.1 MiB R-CRAN-generics noarch 0.1.3-1.fc41.copr7350006 copr_base 160.2 KiB R-CRAN-glue x86_64 1.7.0-1.fc41.copr7349919 copr_base 261.2 KiB R-CRAN-gtable noarch 0.3.5-1.fc41.copr7356060 copr_base 306.7 KiB R-CRAN-hms noarch 1.1.3-1.fc41.copr7357932 copr_base 132.4 KiB R-CRAN-isoband x86_64 0.2.7-1.fc41.copr7351195 copr_base 1.9 MiB R-CRAN-labeling noarch 0.4.3-1.fc41.copr7349947 copr_base 92.7 KiB R-CRAN-lattice x86_64 0.22.6-1.fc41.copr7352639 copr_base 2.0 MiB R-CRAN-lifecycle noarch 1.0.4-1.fc41.copr7354340 copr_base 282.7 KiB R-CRAN-mgcv x86_64 1.9.1-1.fc41.copr7357272 copr_base 4.5 MiB R-CRAN-munsell noarch 0.5.1-1.fc41.copr7353599 copr_base 379.0 KiB R-CRAN-nlme x86_64 3.1.166-1.fc41.copr7936970 copr_base 3.8 MiB R-CRAN-pillar noarch 1.9.0-1.fc41.copr7357931 copr_base 1.4 MiB R-CRAN-pkgconfig noarch 2.0.3-3.fc41.copr7349937 copr_base 34.0 KiB R-CRAN-scales noarch 1.3.0-1.fc41.copr7356067 copr_base 1.1 MiB R-CRAN-stringi x86_64 1.8.4-1.fc41.copr7422034 copr_base 2.0 MiB R-CRAN-tidyselect noarch 1.2.1-1.fc41.copr7357928 copr_base 433.3 KiB R-CRAN-tzdb x86_64 0.4.0-1.fc41.copr7355368 copr_base 2.1 MiB R-CRAN-utf8 x86_64 1.2.4-1.fc41.copr7349954 copr_base 470.9 KiB R-CRAN-vctrs x86_64 0.6.5-1.fc41.copr7356070 copr_base 2.3 MiB R-CRAN-viridisLite noarch 0.4.2-1.fc41.copr7349928 copr_base 1.3 MiB R-CRAN-vroom x86_64 1.6.5-1.fc41.copr7361506 copr_base 1.7 MiB R-CRAN-withr noarch 3.0.1-1.fc41.copr7810684 copr_base 397.2 KiB R-core-devel x86_64 4.4.1-5.fc41 fedora 394.7 KiB R-java x86_64 4.4.1-5.fc41 fedora 0.0 B R-java-devel x86_64 4.4.1-5.fc41 fedora 0.0 B R-littler x86_64 0.3.19-5.fc41 fedora 158.1 KiB R-rpm-macros noarch 1.2.1-11.fc41 fedora 5.6 KiB abattis-cantarell-vf-fonts noarch 0.301-13.fc41 fedora 192.7 KiB alsa-lib x86_64 1.2.12-2.fc41 fedora 1.4 MiB annobin-docs noarch 12.69-1.fc41 fedora 97.7 KiB annobin-plugin-gcc x86_64 12.69-1.fc41 fedora 985.0 KiB avahi-libs x86_64 0.8-29.fc41 fedora 166.3 KiB brotli x86_64 1.1.0-5.fc41 fedora 31.8 KiB brotli-devel x86_64 1.1.0-5.fc41 fedora 65.6 KiB bzip2-devel x86_64 1.0.8-19.fc41 fedora 309.8 KiB cairo x86_64 1.18.0-4.fc41 fedora 1.7 MiB cairo-devel x86_64 1.18.0-4.fc41 fedora 2.3 MiB cmake-filesystem x86_64 3.28.3-7.fc41 fedora 0.0 B copy-jdk-configs noarch 4.1-6.fc41 fedora 20.3 KiB cpp x86_64 14.2.1-1.fc41 fedora 35.0 MiB cups-libs x86_64 1:2.4.10-6.fc41 fedora 622.9 KiB dbus-libs x86_64 1:1.14.10-4.fc41 fedora 368.9 KiB default-fonts-core-sans noarch 4.1-2.fc41 fedora 11.9 KiB desktop-file-utils x86_64 0.27-2.fc41 fedora 230.4 KiB emacs-filesystem noarch 1:30.0-3.fc41 fedora 0.0 B expat x86_64 2.6.2-2.fc41 fedora 284.8 KiB flexiblas x86_64 3.4.4-3.fc41 fedora 48.5 KiB flexiblas-devel x86_64 3.4.4-3.fc41 fedora 4.8 MiB flexiblas-netlib x86_64 3.4.4-3.fc41 fedora 10.7 MiB flexiblas-netlib64 x86_64 3.4.4-3.fc41 fedora 10.8 MiB flexiblas-openblas-openmp x86_64 3.4.4-3.fc41 fedora 43.3 KiB flexiblas-openblas-openmp64 x86_64 3.4.4-3.fc41 fedora 43.3 KiB fontconfig x86_64 2.15.0-8.fc41 fedora 791.9 KiB fontconfig-devel x86_64 2.15.0-8.fc41 fedora 117.2 KiB fonts-filesystem noarch 1:2.0.5-17.fc41 fedora 0.0 B freetype x86_64 2.13.2-6.fc41 fedora 850.6 KiB freetype-devel x86_64 2.13.2-6.fc41 fedora 7.8 MiB fribidi x86_64 1.0.15-2.fc41 fedora 368.4 KiB gcc x86_64 14.2.1-1.fc41 fedora 104.1 MiB gcc-c++ x86_64 14.2.1-1.fc41 fedora 38.2 MiB gcc-gfortran x86_64 14.2.1-1.fc41 fedora 37.2 MiB gcc-plugin-annobin x86_64 14.2.1-1.fc41 fedora 61.1 KiB gettext x86_64 0.22.5-6.fc41 fedora 5.2 MiB gettext-envsubst x86_64 0.22.5-6.fc41 fedora 74.9 KiB gettext-libs x86_64 0.22.5-6.fc41 fedora 1.7 MiB gettext-runtime x86_64 0.22.5-6.fc41 fedora 481.3 KiB glib2 x86_64 2.82.0-1.fc41 fedora 14.7 MiB glib2-devel x86_64 2.82.0-1.fc41 fedora 15.7 MiB glibc-devel x86_64 2.40-3.fc41 fedora 35.0 KiB glibc-headers-x86 noarch 2.40-3.fc41 fedora 2.2 MiB gnutls x86_64 3.8.6-7.fc41 fedora 3.2 MiB google-noto-fonts-common noarch 20240701-2.fc41 fedora 17.5 KiB google-noto-sans-vf-fonts noarch 20240701-2.fc41 fedora 1.2 MiB graphite2 x86_64 1.3.14-16.fc41 fedora 192.0 KiB graphite2-devel x86_64 1.3.14-16.fc41 fedora 49.1 KiB groff-base x86_64 1.23.0-7.fc41 fedora 3.8 MiB harfbuzz x86_64 9.0.0-3.fc41 fedora 2.6 MiB harfbuzz-cairo x86_64 9.0.0-3.fc41 fedora 48.2 KiB harfbuzz-devel x86_64 9.0.0-3.fc41 fedora 5.1 MiB harfbuzz-icu x86_64 9.0.0-3.fc41 fedora 19.5 KiB java-21-openjdk x86_64 1:21.0.4.0.7-2.fc41 fedora 1.1 MiB java-21-openjdk-devel x86_64 1:21.0.4.0.7-2.fc41 fedora 11.2 MiB java-21-openjdk-headless x86_64 1:21.0.4.0.7-2.fc41 fedora 204.9 MiB javapackages-filesystem noarch 6.2.0-14.fc41 fedora 1.9 KiB jbigkit-libs x86_64 2.1-30.fc41 fedora 117.6 KiB kernel-headers x86_64 6.11.0-0.rc5.43.fc41 fedora 6.4 MiB less x86_64 661-2.fc41 fedora 405.3 KiB libICE x86_64 1.1.1-4.fc41 fedora 181.2 KiB libRmath x86_64 4.4.1-5.fc41 fedora 246.8 KiB libRmath-devel x86_64 4.4.1-5.fc41 fedora 17.4 KiB libSM x86_64 1.2.4-4.fc41 fedora 97.3 KiB libX11 x86_64 1.8.10-2.fc41 fedora 1.3 MiB libX11-common noarch 1.8.10-2.fc41 fedora 1.1 MiB libX11-devel x86_64 1.8.10-2.fc41 fedora 1.0 MiB libX11-xcb x86_64 1.8.10-2.fc41 fedora 15.0 KiB libXau x86_64 1.0.11-7.fc41 fedora 66.9 KiB libXau-devel x86_64 1.0.11-7.fc41 fedora 6.4 KiB libXcomposite x86_64 0.4.6-4.fc41 fedora 44.5 KiB libXext x86_64 1.3.6-2.fc41 fedora 90.1 KiB libXext-devel x86_64 1.3.6-2.fc41 fedora 98.9 KiB libXft x86_64 2.3.8-7.fc41 fedora 164.5 KiB libXft-devel x86_64 2.3.8-7.fc41 fedora 31.7 KiB libXi x86_64 1.8.1-6.fc41 fedora 80.7 KiB libXmu x86_64 1.2.1-2.fc41 fedora 191.5 KiB libXrender x86_64 0.9.11-7.fc41 fedora 50.1 KiB libXrender-devel x86_64 0.9.11-7.fc41 fedora 50.1 KiB libXt x86_64 1.3.0-4.fc41 fedora 429.9 KiB libXtst x86_64 1.2.5-1.fc41 fedora 33.6 KiB libb2 x86_64 0.98.1-12.fc41 fedora 42.2 KiB libblkid-devel x86_64 2.40.2-4.fc41 fedora 44.9 KiB libdatrie x86_64 0.2.13-10.fc41 fedora 57.9 KiB libdeflate x86_64 1.21-2.fc41 fedora 117.0 KiB libdeflate-devel x86_64 1.21-2.fc41 fedora 25.7 KiB libffi-devel x86_64 3.4.6-3.fc41 fedora 33.1 KiB libfontenc x86_64 1.1.8-2.fc41 fedora 67.0 KiB libgfortran x86_64 14.2.1-1.fc41 fedora 3.0 MiB libicu x86_64 74.2-2.fc41 fedora 34.9 MiB libicu-devel x86_64 74.2-2.fc41 fedora 5.6 MiB libjpeg-turbo x86_64 3.0.2-3.fc41 fedora 776.9 KiB liblerc x86_64 4.0.0-7.fc41 fedora 607.5 KiB libmount-devel x86_64 2.40.2-4.fc41 fedora 63.5 KiB libmpc x86_64 1.3.1-6.fc41 fedora 164.7 KiB libpng x86_64 2:1.6.40-4.fc41 fedora 245.8 KiB libpng-devel x86_64 2:1.6.40-4.fc41 fedora 881.5 KiB libquadmath x86_64 14.2.1-1.fc41 fedora 325.9 KiB libquadmath-devel x86_64 14.2.1-1.fc41 fedora 21.8 KiB libselinux-devel x86_64 3.7-5.fc41 fedora 126.4 KiB libsepol-devel x86_64 3.7-2.fc41 fedora 120.3 KiB libstdc++-devel x86_64 14.2.1-1.fc41 fedora 15.4 MiB libtextstyle x86_64 0.22.5-6.fc41 fedora 195.6 KiB libthai x86_64 0.1.29-9.fc41 fedora 783.5 KiB libtiff x86_64 4.6.0-6.fc41 fedora 606.0 KiB libtirpc-devel x86_64 1.3.5-0.fc41 fedora 251.6 KiB libwebp x86_64 1.4.0-4.fc41 fedora 822.6 KiB libxcb x86_64 1.17.0-2.fc41 fedora 1.1 MiB libxcb-devel x86_64 1.17.0-2.fc41 fedora 2.7 MiB libxcrypt-devel x86_64 4.4.36-7.fc41 fedora 30.3 KiB libxml2-devel x86_64 2.12.8-2.fc41 fedora 3.4 MiB lksctp-tools x86_64 1.0.19-9.fc41 fedora 275.2 KiB lua x86_64 5.4.6-6.fc41 fedora 601.7 KiB lua-posix x86_64 36.2.1-7.fc41 fedora 599.8 KiB make x86_64 1:4.4.1-8.fc41 fedora 1.8 MiB mkfontscale x86_64 1.2.3-1.fc41 fedora 49.2 KiB mpdecimal x86_64 2.5.1-16.fc41 fedora 204.9 KiB ncurses x86_64 6.5-2.20240629.fc41 fedora 627.3 KiB nettle x86_64 3.10-3.fc41 fedora 793.0 KiB nspr x86_64 4.35.0-28.fc41 fedora 320.4 KiB nss x86_64 3.103.0-1.fc41 fedora 1.9 MiB nss-softokn x86_64 3.103.0-1.fc41 fedora 1.9 MiB nss-softokn-freebl x86_64 3.103.0-1.fc41 fedora 783.6 KiB nss-sysinit x86_64 3.103.0-1.fc41 fedora 22.2 KiB nss-util x86_64 3.103.0-1.fc41 fedora 205.1 KiB openblas x86_64 0.3.26-5.fc41 fedora 96.0 KiB openblas-openmp x86_64 0.3.26-5.fc41 fedora 39.4 MiB openblas-openmp64 x86_64 0.3.26-5.fc41 fedora 39.5 MiB pango x86_64 1.54.0-2.fc41 fedora 996.2 KiB pcre2-devel x86_64 10.44-1.fc41.1 fedora 2.0 MiB pcre2-utf16 x86_64 10.44-1.fc41.1 fedora 590.1 KiB pcre2-utf32 x86_64 10.44-1.fc41.1 fedora 562.0 KiB perl-AutoLoader noarch 5.74-511.fc41 fedora 20.5 KiB perl-B x86_64 1.89-511.fc41 fedora 498.0 KiB perl-Carp noarch 1.54-511.fc41 fedora 46.6 KiB perl-Class-Struct noarch 0.68-511.fc41 fedora 25.4 KiB perl-Data-Dumper x86_64 2.189-512.fc41 fedora 111.7 KiB perl-Digest noarch 1.20-511.fc41 fedora 35.3 KiB perl-Digest-MD5 x86_64 2.59-5.fc41 fedora 59.8 KiB perl-DynaLoader x86_64 1.56-511.fc41 fedora 32.1 KiB perl-Encode x86_64 4:3.21-511.fc41 fedora 4.7 MiB perl-Errno x86_64 1.38-511.fc41 fedora 8.4 KiB perl-Exporter noarch 5.78-511.fc41 fedora 54.3 KiB perl-Fcntl x86_64 1.18-511.fc41 fedora 49.0 KiB perl-File-Basename noarch 2.86-511.fc41 fedora 14.0 KiB perl-File-Path noarch 2.18-511.fc41 fedora 63.5 KiB perl-File-Temp noarch 1:0.231.100-511.fc41 fedora 162.3 KiB perl-File-stat noarch 1.14-511.fc41 fedora 12.5 KiB perl-FileHandle noarch 2.05-511.fc41 fedora 9.3 KiB perl-Getopt-Long noarch 1:2.58-2.fc41 fedora 144.5 KiB perl-Getopt-Std noarch 1.14-511.fc41 fedora 11.2 KiB perl-HTTP-Tiny noarch 0.088-512.fc41 fedora 152.2 KiB perl-IO x86_64 1.55-511.fc41 fedora 151.1 KiB perl-IO-Socket-IP noarch 0.42-512.fc41 fedora 98.7 KiB perl-IO-Socket-SSL noarch 2.088-2.fc41 fedora 701.1 KiB perl-IPC-Open3 noarch 1.22-511.fc41 fedora 22.5 KiB perl-MIME-Base64 x86_64 3.16-511.fc41 fedora 46.1 KiB perl-Mozilla-CA noarch 20240730-1.fc41 fedora 9.8 KiB perl-Net-SSLeay x86_64 1.94-7.fc41 fedora 1.3 MiB perl-POSIX x86_64 2.20-511.fc41 fedora 235.1 KiB perl-PathTools x86_64 3.91-511.fc41 fedora 180.0 KiB perl-Pod-Escapes noarch 1:1.07-511.fc41 fedora 24.9 KiB perl-Pod-Perldoc noarch 3.28.01-512.fc41 fedora 163.7 KiB perl-Pod-Simple noarch 1:3.45-511.fc41 fedora 560.9 KiB perl-Pod-Usage noarch 4:2.03-511.fc41 fedora 84.8 KiB perl-Scalar-List-Utils x86_64 5:1.65-1.fc41 fedora 146.5 KiB perl-SelectSaver noarch 1.02-511.fc41 fedora 2.2 KiB perl-Socket x86_64 4:2.038-511.fc41 fedora 124.0 KiB perl-Storable x86_64 1:3.32-511.fc41 fedora 232.4 KiB perl-Symbol noarch 1.09-511.fc41 fedora 6.8 KiB perl-Term-ANSIColor noarch 5.01-512.fc41 fedora 97.5 KiB perl-Term-Cap noarch 1.18-511.fc41 fedora 29.3 KiB perl-Text-ParseWords noarch 3.31-511.fc41 fedora 13.6 KiB perl-Text-Tabs+Wrap noarch 2024.001-511.fc41 fedora 22.6 KiB perl-Time-Local noarch 2:1.350-511.fc41 fedora 69.0 KiB perl-URI noarch 5.28-2.fc41 fedora 240.7 KiB perl-base noarch 2.27-511.fc41 fedora 12.5 KiB perl-constant noarch 1.33-512.fc41 fedora 26.2 KiB perl-if noarch 0.61.000-511.fc41 fedora 5.8 KiB perl-interpreter x86_64 4:5.40.0-511.fc41 fedora 122.3 KiB perl-libnet noarch 3.15-512.fc41 fedora 289.4 KiB perl-libs x86_64 4:5.40.0-511.fc41 fedora 9.9 MiB perl-locale noarch 1.12-511.fc41 fedora 6.5 KiB perl-mro x86_64 1.29-511.fc41 fedora 45.6 KiB perl-overload noarch 1.37-511.fc41 fedora 71.5 KiB perl-overloading noarch 0.02-511.fc41 fedora 4.8 KiB perl-parent noarch 1:0.242-1.fc41 fedora 10.0 KiB perl-podlators noarch 1:6.0.2-2.fc41 fedora 317.5 KiB perl-vars noarch 1.05-511.fc41 fedora 3.9 KiB pixman x86_64 0.43.4-2.fc41 fedora 718.1 KiB pixman-devel x86_64 0.43.4-2.fc41 fedora 49.4 KiB python-pip-wheel noarch 24.2-1.fc41 fedora 1.2 MiB python3 x86_64 3.13.0~rc1-2.fc41 fedora 31.8 KiB python3-libs x86_64 3.13.0~rc1-2.fc41 fedora 40.3 MiB python3-packaging noarch 24.1-2.fc41 fedora 422.3 KiB sysprof-capture-devel x86_64 47~beta-1.fc41 fedora 252.6 KiB tcl x86_64 1:8.6.14-2.fc41 fedora 4.2 MiB tcl-devel x86_64 1:8.6.14-2.fc41 fedora 791.3 KiB tk x86_64 1:8.6.14-2.fc41 fedora 3.6 MiB tk-devel x86_64 1:8.6.14-2.fc41 fedora 984.9 KiB tre x86_64 0.8.0-45.20140228gitc2f5d13.fc41 fedora 75.9 KiB tre-common noarch 0.8.0-45.20140228gitc2f5d13.fc41 fedora 81.0 KiB tre-devel x86_64 0.8.0-45.20140228gitc2f5d13.fc41 fedora 10.7 KiB ttmkfdir x86_64 3.0.9-71.fc41 fedora 122.7 KiB tzdata noarch 2024a-9.fc41 fedora 1.7 MiB tzdata-java noarch 2024a-9.fc41 fedora 101.7 KiB xclip x86_64 0.13-22.git11cba61.fc41 fedora 62.4 KiB xdg-utils noarch 1.2.1-2.fc41 fedora 346.3 KiB xml-common noarch 0.6.3-65.fc41 fedora 78.4 KiB xorg-x11-fonts-Type1 noarch 7.5-39.fc41 fedora 863.3 KiB xorg-x11-proto-devel noarch 2024.1-3.fc41 fedora 1.7 MiB xz-devel x86_64 1:5.6.2-2.fc41 fedora 255.6 KiB zlib-ng-compat-devel x86_64 2.1.7-2.fc41 fedora 106.8 KiB Transaction Summary: Installing: 271 packages Total size of inbound packages is 339 MiB. Need to download 31 MiB. After this operation 1 GiB will be used (install 1 GiB, remove 0 B). [ 1/271] R-CRAN-RColorBrewer-0:1.1.3-1 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 2/271] R-CRAN-Rcpp-0:1.0.13-1.fc41.c 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 3/271] R-CRAN-dplyr-0:1.1.4-1.fc41.c 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 4/271] R-CRAN-ggplot2-0:3.5.1-1.fc41 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 5/271] R-CRAN-magrittr-0:2.0.3-1.fc4 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 6/271] R-CRAN-purrr-0:1.0.2-1.fc41.c 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 7/271] R-CRAN-rlang-0:1.1.4-1.fc41.c 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 8/271] R-CRAN-tibble-0:3.2.1-1.fc41. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 9/271] R-devel-0:4.4.1-5.fc41.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 10/271] R-core-0:4.4.1-5.fc41.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 11/271] R-littler-0:0.3.19-5.fc41.x86 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 12/271] R-CRAN-R6-0:2.5.1-1.fc41.copr 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 13/271] R-CRAN-cli-0:3.6.3-1.fc41.cop 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 14/271] R-CRAN-generics-0:0.1.3-1.fc4 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 15/271] R-CRAN-glue-0:1.7.0-1.fc41.co 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 16/271] R-CRAN-lifecycle-0:1.0.4-1.fc 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 17/271] R-CRAN-pillar-0:1.9.0-1.fc41. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 18/271] R-CRAN-tidyselect-0:1.2.1-1.f 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 19/271] R-CRAN-vctrs-0:0.6.5-1.fc41.c 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 20/271] R-CRAN-MASS-0:7.3.61-1.fc41.c 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 21/271] R-CRAN-gtable-0:0.3.5-1.fc41. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 22/271] R-CRAN-isoband-0:0.2.7-1.fc41 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 23/271] R-CRAN-mgcv-0:1.9.1-1.fc41.co 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 24/271] R-CRAN-scales-0:1.3.0-1.fc41. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 25/271] R-CRAN-withr-0:3.0.1-1.fc41.c 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 26/271] R-CRAN-fansi-0:1.0.6-1.fc41.c 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 27/271] R-CRAN-pkgconfig-0:2.0.3-3.fc 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 28/271] R-CRAN-lattice-0:0.22.6-1.fc4 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 29/271] R-core-devel-0:4.4.1-5.fc41.x 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 30/271] R-java-devel-0:4.4.1-5.fc41.x 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 31/271] R-rpm-macros-0:1.2.1-11.fc41. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 32/271] cairo-0:1.18.0-4.fc41.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 33/271] flexiblas-netlib-0:3.4.4-3.fc 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 34/271] glib2-0:2.82.0-1.fc41.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 35/271] less-0:661-2.fc41.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 36/271] libRmath-0:4.4.1-5.fc41.x86_6 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 37/271] libX11-0:1.8.10-2.fc41.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 38/271] libXmu-0:1.2.1-2.fc41.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 39/271] libXt-0:1.3.0-4.fc41.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 40/271] libdeflate-0:1.21-2.fc41.x86_ 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 41/271] libicu-0:74.2-2.fc41.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 42/271] libjpeg-turbo-0:3.0.2-3.fc41. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 43/271] libpng-2:1.6.40-4.fc41.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 44/271] libtiff-0:4.6.0-6.fc41.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 45/271] pango-0:1.54.0-2.fc41.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 46/271] tcl-1:8.6.14-2.fc41.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 47/271] tk-1:8.6.14-2.fc41.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 48/271] tre-0:0.8.0-45.20140228gitc2f 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 49/271] xdg-utils-0:1.2.1-2.fc41.noar 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 50/271] R-CRAN-utf8-0:1.2.4-1.fc41.co 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 51/271] R-CRAN-Matrix-0:1.7.0-1.fc41. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 52/271] R-CRAN-nlme-0:3.1.166-1.fc41. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 53/271] R-CRAN-farver-0:2.1.2-1.fc41. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 54/271] R-CRAN-labeling-0:0.4.3-1.fc4 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 55/271] R-CRAN-munsell-0:0.5.1-1.fc41 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 56/271] R-CRAN-viridisLite-0:0.4.2-1. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 57/271] libRmath-devel-0:4.4.1-5.fc41 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 58/271] make-1:4.4.1-8.fc41.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 59/271] R-java-0:4.4.1-5.fc41.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 60/271] java-21-openjdk-devel-1:21.0. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 61/271] fontconfig-0:2.15.0-8.fc41.x8 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 62/271] freetype-0:2.13.2-6.fc41.x86_ 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 63/271] libXext-0:1.3.6-2.fc41.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 64/271] libXrender-0:0.9.11-7.fc41.x8 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 65/271] libxcb-0:1.17.0-2.fc41.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 66/271] pixman-0:0.43.4-2.fc41.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 67/271] flexiblas-0:3.4.4-3.fc41.x86_ 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 68/271] flexiblas-openblas-openmp-0:3 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 69/271] libgfortran-0:14.2.1-1.fc41.x 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 70/271] libquadmath-0:14.2.1-1.fc41.x 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 71/271] gnutls-0:3.8.6-7.fc41.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 72/271] libX11-common-0:1.8.10-2.fc41 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 73/271] libICE-0:1.1.1-4.fc41.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 74/271] libSM-0:1.2.4-4.fc41.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 75/271] jbigkit-libs-0:2.1-30.fc41.x8 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 76/271] liblerc-0:4.0.0-7.fc41.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 77/271] libwebp-0:1.4.0-4.fc41.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 78/271] fribidi-0:1.0.15-2.fc41.x86_6 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 79/271] harfbuzz-0:9.0.0-3.fc41.x86_6 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 80/271] libXft-0:2.3.8-7.fc41.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 81/271] libthai-0:0.1.29-9.fc41.x86_6 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 82/271] tre-common-0:0.8.0-45.2014022 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 83/271] desktop-file-utils-0:0.27-2.f 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 84/271] R-CRAN-colorspace-0:2.1.1-1.f 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 85/271] java-21-openjdk-headless-1:21 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 86/271] java-21-openjdk-1:21.0.4.0.7- 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 87/271] default-fonts-core-sans-0:4.1 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 88/271] fonts-filesystem-1:2.0.5-17.f 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 89/271] xml-common-0:0.6.3-65.fc41.no 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 90/271] libXau-0:1.0.11-7.fc41.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 91/271] openblas-openmp-0:0.3.26-5.fc 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 92/271] nettle-0:3.10-3.fc41.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 93/271] graphite2-0:1.3.14-16.fc41.x8 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 94/271] libdatrie-0:0.2.13-10.fc41.x8 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 95/271] emacs-filesystem-1:30.0-3.fc4 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 96/271] alsa-lib-0:1.2.12-2.fc41.x86_ 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 97/271] copy-jdk-configs-0:4.1-6.fc41 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 98/271] javapackages-filesystem-0:6.2 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 99/271] lksctp-tools-0:1.0.19-9.fc41. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [100/271] tzdata-java-0:2024a-9.fc41.no 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [101/271] libXcomposite-0:0.4.6-4.fc41. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [102/271] libXi-0:1.8.1-6.fc41.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [103/271] libXtst-0:1.2.5-1.fc41.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [104/271] xorg-x11-fonts-Type1-0:7.5-39 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [105/271] abattis-cantarell-vf-fonts-0: 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [106/271] google-noto-sans-vf-fonts-0:2 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [107/271] lua-posix-0:36.2.1-7.fc41.x86 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [108/271] mkfontscale-0:1.2.3-1.fc41.x8 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [109/271] ttmkfdir-0:3.0.9-71.fc41.x86_ 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [110/271] google-noto-fonts-common-0:20 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [111/271] libfontenc-0:1.1.8-2.fc41.x86 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [112/271] openblas-0:0.3.26-5.fc41.x86_ 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [113/271] cups-libs-1:2.4.10-6.fc41.x86 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [114/271] avahi-libs-0:0.8-29.fc41.x86_ 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [115/271] dbus-libs-1:1.14.10-4.fc41.x8 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [116/271] nss-0:3.103.0-1.fc41.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [117/271] nspr-0:4.35.0-28.fc41.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [118/271] nss-softokn-0:3.103.0-1.fc41. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [119/271] nss-sysinit-0:3.103.0-1.fc41. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [120/271] nss-util-0:3.103.0-1.fc41.x86 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [121/271] nss-softokn-freebl-0:3.103.0- 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [122/271] lua-0:5.4.6-6.fc41.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [123/271] bzip2-devel-0:1.0.8-19.fc41.x 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [124/271] flexiblas-devel-0:3.4.4-3.fc4 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [125/271] flexiblas-netlib64-0:3.4.4-3. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [126/271] flexiblas-openblas-openmp64-0 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [127/271] openblas-openmp64-0:0.3.26-5. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [128/271] gcc-c++-0:14.2.1-1.fc41.x86_6 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [129/271] gcc-0:14.2.1-1.fc41.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [130/271] libmpc-0:1.3.1-6.fc41.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [131/271] annobin-plugin-gcc-0:12.69-1. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [132/271] gcc-plugin-annobin-0:14.2.1-1 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [133/271] cpp-0:14.2.1-1.fc41.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [134/271] annobin-docs-0:12.69-1.fc41.n 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [135/271] gcc-gfortran-0:14.2.1-1.fc41. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [136/271] libX11-devel-0:1.8.10-2.fc41. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [137/271] libX11-xcb-0:1.8.10-2.fc41.x8 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [138/271] xorg-x11-proto-devel-0:2024.1 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [139/271] libdeflate-devel-0:1.21-2.fc4 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [140/271] cmake-filesystem-0:3.28.3-7.f 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [141/271] libicu-devel-0:74.2-2.fc41.x8 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [142/271] libtirpc-devel-0:1.3.5-0.fc41 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [143/271] pcre2-devel-0:10.44-1.fc41.1. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [144/271] pcre2-utf16-0:10.44-1.fc41.1. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [145/271] pcre2-utf32-0:10.44-1.fc41.1. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [146/271] tcl-devel-1:8.6.14-2.fc41.x86 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [147/271] tk-devel-1:8.6.14-2.fc41.x86_ 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [148/271] tre-devel-0:0.8.0-45.20140228 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [149/271] xz-devel-1:5.6.2-2.fc41.x86_6 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [150/271] zlib-ng-compat-devel-0:2.1.7- 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [151/271] libXft-devel-0:2.3.8-7.fc41.x 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [152/271] fontconfig-devel-0:2.15.0-8.f 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [153/271] gettext-0:0.22.5-6.fc41.x86_6 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [154/271] gettext-libs-0:0.22.5-6.fc41. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [155/271] gettext-runtime-0:0.22.5-6.fc 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [156/271] libtextstyle-0:0.22.5-6.fc41. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [157/271] gettext-envsubst-0:0.22.5-6.f 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [158/271] freetype-devel-0:2.13.2-6.fc4 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [159/271] libXrender-devel-0:0.9.11-7.f 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [160/271] libxcb-devel-0:1.17.0-2.fc41. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [161/271] libquadmath-devel-0:14.2.1-1. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [162/271] libstdc++-devel-0:14.2.1-1.fc 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [163/271] glibc-devel-0:2.40-3.fc41.x86 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [164/271] glibc-headers-x86-0:2.40-3.fc 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [165/271] libxcrypt-devel-0:4.4.36-7.fc 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [166/271] brotli-devel-0:1.1.0-5.fc41.x 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [167/271] brotli-0:1.1.0-5.fc41.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [168/271] harfbuzz-devel-0:9.0.0-3.fc41 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [169/271] harfbuzz-cairo-0:9.0.0-3.fc41 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [170/271] harfbuzz-icu-0:9.0.0-3.fc41.x 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [171/271] libpng-devel-2:1.6.40-4.fc41. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [172/271] libxml2-devel-0:2.12.8-2.fc41 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [173/271] libXau-devel-0:1.0.11-7.fc41. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [174/271] cairo-devel-0:1.18.0-4.fc41.x 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [175/271] glib2-devel-0:2.82.0-1.fc41.x 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [176/271] python3-packaging-0:24.1-2.fc 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [177/271] graphite2-devel-0:1.3.14-16.f 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [178/271] kernel-headers-0:6.11.0-0.rc5 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [179/271] libffi-devel-0:3.4.6-3.fc41.x 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [180/271] libmount-devel-0:2.40.2-4.fc4 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [181/271] libselinux-devel-0:3.7-5.fc41 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [182/271] libsepol-devel-0:3.7-2.fc41.x 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [183/271] python3-0:3.13.0~rc1-2.fc41.x 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [184/271] python3-libs-0:3.13.0~rc1-2.f 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [185/271] expat-0:2.6.2-2.fc41.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [186/271] libb2-0:0.98.1-12.fc41.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [187/271] mpdecimal-0:2.5.1-16.fc41.x86 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [188/271] python-pip-wheel-0:24.2-1.fc4 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [189/271] tzdata-0:2024a-9.fc41.noarch 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [190/271] sysprof-capture-devel-0:47~be 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [191/271] libXext-devel-0:1.3.6-2.fc41. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [192/271] pixman-devel-0:0.43.4-2.fc41. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [193/271] libblkid-devel-0:2.40.2-4.fc4 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [194/271] R-CRAN-data.tree-0:1.1.0-1.fc 100% | 26.9 MiB/s | 1.2 MiB | 00m00s [195/271] R-CRAN-gtools-0:3.9.5-1.fc41. 100% | 7.6 MiB/s | 388.4 KiB | 00m00s [196/271] R-CRAN-lpSolve-0:5.6.20-1.fc4 100% | 59.0 MiB/s | 362.6 KiB | 00m00s [197/271] R-CRAN-readr-0:2.1.5-1.fc41.c 100% | 96.3 MiB/s | 788.5 KiB | 00m00s [198/271] R-CRAN-stringr-0:1.5.1-1.fc41 100% | 155.3 MiB/s | 318.0 KiB | 00m00s [199/271] R-CRAN-tidyr-0:1.3.1-1.fc41.c 100% | 223.9 MiB/s | 1.1 MiB | 00m00s [200/271] R-CRAN-yaml-0:2.3.10-1.fc41.c 100% | 61.1 MiB/s | 125.1 KiB | 00m00s [201/271] R-CRAN-zoo-0:1.8.12-1.fc41.co 100% | 260.9 MiB/s | 1.0 MiB | 00m00s [202/271] R-CRAN-stringi-0:1.8.4-1.fc41 100% | 163.9 MiB/s | 1.0 MiB | 00m00s [203/271] R-CRAN-clipr-0:0.8.0-1.fc41.c 100% | 10.3 MiB/s | 63.4 KiB | 00m00s [204/271] R-CRAN-patchwork-0:1.2.0-1.fc 100% | 74.1 MiB/s | 3.1 MiB | 00m00s [205/271] R-CRAN-crayon-0:1.5.3-1.fc41. 100% | 44.4 MiB/s | 181.7 KiB | 00m00s [206/271] R-CRAN-hms-0:1.1.3-1.fc41.cop 100% | 27.8 MiB/s | 113.8 KiB | 00m00s [207/271] R-CRAN-vroom-0:1.6.5-1.fc41.c 100% | 75.4 MiB/s | 849.8 KiB | 00m00s [208/271] xclip-0:0.13-22.git11cba61.fc 100% | 4.0 MiB/s | 36.5 KiB | 00m00s [209/271] R-CRAN-bit64-0:4.0.5-1.fc41.c 100% | 105.4 MiB/s | 539.5 KiB | 00m00s [210/271] R-CRAN-bit-0:4.0.5-1.fc41.cop 100% | 185.0 MiB/s | 1.1 MiB | 00m00s [211/271] R-CRAN-tzdb-0:0.4.0-1.fc41.co 100% | 57.7 MiB/s | 531.6 KiB | 00m00s [212/271] perl-interpreter-4:5.40.0-511 100% | 35.3 MiB/s | 72.3 KiB | 00m00s [213/271] perl-Carp-0:1.54-511.fc41.noa 100% | 14.1 MiB/s | 28.9 KiB | 00m00s [214/271] perl-DynaLoader-0:1.56-511.fc 100% | 5.1 MiB/s | 26.0 KiB | 00m00s [215/271] perl-Exporter-0:5.78-511.fc41 100% | 6.0 MiB/s | 30.9 KiB | 00m00s [216/271] perl-libs-4:5.40.0-511.fc41.x 100% | 129.5 MiB/s | 2.3 MiB | 00m00s [217/271] perl-PathTools-0:3.91-511.fc4 100% | 21.3 MiB/s | 87.4 KiB | 00m00s [218/271] perl-vars-0:1.05-511.fc41.noa 100% | 4.2 MiB/s | 13.0 KiB | 00m00s [219/271] perl-Errno-0:1.38-511.fc41.x8 100% | 3.6 MiB/s | 14.9 KiB | 00m00s [220/271] perl-Scalar-List-Utils-5:1.65 100% | 23.5 MiB/s | 72.1 KiB | 00m00s [221/271] perl-constant-0:1.33-512.fc41 100% | 5.6 MiB/s | 23.0 KiB | 00m00s [222/271] perl-File-Basename-0:2.86-511 100% | 5.6 MiB/s | 17.1 KiB | 00m00s [223/271] perl-Encode-4:3.21-511.fc41.x 100% | 131.8 MiB/s | 1.1 MiB | 00m00s [224/271] perl-Getopt-Long-1:2.58-2.fc4 100% | 20.8 MiB/s | 63.9 KiB | 00m00s [225/271] perl-MIME-Base64-0:3.16-511.f 100% | 14.6 MiB/s | 29.9 KiB | 00m00s [226/271] R-CRAN-BH-0:1.84.0.0-1.fc41.c 100% | 58.5 MiB/s | 9.8 MiB | 00m00s [227/271] perl-Getopt-Std-0:1.14-511.fc 100% | 1.3 MiB/s | 15.6 KiB | 00m00s [228/271] perl-Storable-1:3.32-511.fc41 100% | 10.7 MiB/s | 98.4 KiB | 00m00s [229/271] perl-parent-1:0.242-1.fc41.no 100% | 7.3 MiB/s | 15.0 KiB | 00m00s [230/271] perl-overload-0:1.37-511.fc41 100% | 11.1 MiB/s | 45.5 KiB | 00m00s [231/271] perl-Pod-Usage-4:2.03-511.fc4 100% | 9.8 MiB/s | 40.0 KiB | 00m00s [232/271] perl-Fcntl-0:1.18-511.fc41.x8 100% | 14.5 MiB/s | 29.8 KiB | 00m00s [233/271] perl-Text-ParseWords-0:3.31-5 100% | 3.2 MiB/s | 16.6 KiB | 00m00s [234/271] perl-base-0:2.27-511.fc41.noa 100% | 3.9 MiB/s | 16.2 KiB | 00m00s [235/271] perl-overloading-0:0.02-511.f 100% | 4.2 MiB/s | 12.9 KiB | 00m00s [236/271] perl-IO-0:1.55-511.fc41.x86_6 100% | 20.0 MiB/s | 81.8 KiB | 00m00s [237/271] perl-mro-0:1.29-511.fc41.x86_ 100% | 7.3 MiB/s | 29.9 KiB | 00m00s [238/271] perl-File-stat-0:1.14-511.fc4 100% | 16.6 MiB/s | 17.0 KiB | 00m00s [239/271] perl-Pod-Perldoc-0:3.28.01-51 100% | 28.0 MiB/s | 86.1 KiB | 00m00s [240/271] perl-podlators-1:6.0.2-2.fc41 100% | 31.5 MiB/s | 128.9 KiB | 00m00s [241/271] perl-SelectSaver-0:1.02-511.f 100% | 5.7 MiB/s | 11.7 KiB | 00m00s [242/271] perl-Symbol-0:1.09-511.fc41.n 100% | 13.8 MiB/s | 14.2 KiB | 00m00s [243/271] perl-Socket-4:2.038-511.fc41. 100% | 17.8 MiB/s | 54.8 KiB | 00m00s [244/271] perl-HTTP-Tiny-0:0.088-512.fc 100% | 27.3 MiB/s | 55.8 KiB | 00m00s [245/271] perl-File-Temp-1:0.231.100-51 100% | 14.4 MiB/s | 59.1 KiB | 00m00s [246/271] perl-Pod-Simple-1:3.45-511.fc 100% | 53.5 MiB/s | 219.0 KiB | 00m00s [247/271] groff-base-0:1.23.0-7.fc41.x8 100% | 100.0 MiB/s | 1.1 MiB | 00m00s [248/271] perl-IPC-Open3-0:1.22-511.fc4 100% | 3.0 MiB/s | 21.8 KiB | 00m00s [249/271] perl-Term-Cap-0:1.18-511.fc41 100% | 10.8 MiB/s | 22.1 KiB | 00m00s [250/271] perl-Term-ANSIColor-0:5.01-51 100% | 11.6 MiB/s | 47.7 KiB | 00m00s [251/271] perl-POSIX-0:2.20-511.fc41.x8 100% | 15.8 MiB/s | 97.0 KiB | 00m00s [252/271] perl-Class-Struct-0:0.68-511. 100% | 7.2 MiB/s | 22.0 KiB | 00m00s [253/271] perl-File-Path-0:2.18-511.fc4 100% | 17.2 MiB/s | 35.3 KiB | 00m00s [254/271] perl-IO-Socket-SSL-0:2.088-2. 100% | 112.5 MiB/s | 230.4 KiB | 00m00s [255/271] perl-Mozilla-CA-0:20240730-1. 100% | 7.0 MiB/s | 14.3 KiB | 00m00s [256/271] perl-Time-Local-2:1.350-511.f 100% | 33.7 MiB/s | 34.5 KiB | 00m00s [257/271] perl-Pod-Escapes-1:1.07-511.f 100% | 9.7 MiB/s | 19.8 KiB | 00m00s [258/271] perl-Text-Tabs+Wrap-0:2024.00 100% | 7.1 MiB/s | 21.9 KiB | 00m00s [259/271] perl-if-0:0.61.000-511.fc41.n 100% | 4.5 MiB/s | 14.0 KiB | 00m00s [260/271] perl-Net-SSLeay-0:1.94-7.fc41 100% | 45.9 MiB/s | 375.7 KiB | 00m00s [261/271] perl-locale-0:1.12-511.fc41.n 100% | 6.6 MiB/s | 13.6 KiB | 00m00s [262/271] ncurses-0:6.5-2.20240629.fc41 100% | 137.9 MiB/s | 423.8 KiB | 00m00s [263/271] perl-IO-Socket-IP-0:0.42-512. 100% | 20.4 MiB/s | 41.8 KiB | 00m00s [264/271] perl-Data-Dumper-0:2.189-512. 100% | 18.3 MiB/s | 56.3 KiB | 00m00s [265/271] perl-AutoLoader-0:5.74-511.fc 100% | 5.2 MiB/s | 21.2 KiB | 00m00s [266/271] perl-URI-0:5.28-2.fc41.noarch 100% | 21.6 MiB/s | 132.6 KiB | 00m00s [267/271] perl-Digest-MD5-0:2.59-5.fc41 100% | 11.7 MiB/s | 36.0 KiB | 00m00s [268/271] perl-libnet-0:3.15-512.fc41.n 100% | 31.4 MiB/s | 128.5 KiB | 00m00s [269/271] perl-B-0:1.89-511.fc41.x86_64 100% | 28.7 MiB/s | 176.3 KiB | 00m00s [270/271] perl-FileHandle-0:2.05-511.fc 100% | 5.0 MiB/s | 15.5 KiB | 00m00s [271/271] perl-Digest-0:1.20-511.fc41.n 100% | 8.1 MiB/s | 24.9 KiB | 00m00s -------------------------------------------------------------------------------- [271/271] Total 100% | 52.9 MiB/s | 30.5 MiB | 00m01s Running transaction [ 1/273] Verify package files 100% | 241.0 B/s | 271.0 B | 00m01s >>> Running pre-transaction scriptlet: copy-jdk-configs-0:4.1-6.fc41.noarch >>> Stop pre-transaction scriptlet: copy-jdk-configs-0:4.1-6.fc41.noarch >>> Running pre-transaction scriptlet: java-21-openjdk-headless-1:21.0.4.0.7-2.f >>> Stop pre-transaction scriptlet: java-21-openjdk-headless-1:21.0.4.0.7-2.fc41 [ 2/273] Prepare transaction 100% | 1.1 KiB/s | 271.0 B | 00m00s [ 3/273] Installing xorg-x11-proto-dev 100% | 254.7 MiB/s | 1.8 MiB | 00m00s [ 4/273] Installing nspr-0:4.35.0-28.f 100% | 157.3 MiB/s | 322.1 KiB | 00m00s [ 5/273] Installing libgfortran-0:14.2 100% | 380.5 MiB/s | 3.0 MiB | 00m00s [ 6/273] Installing nss-util-0:3.103.0 100% | 201.3 MiB/s | 206.1 KiB | 00m00s [ 7/273] Installing libmpc-0:1.3.1-6.f 100% | 162.3 MiB/s | 166.2 KiB | 00m00s [ 8/273] Installing libquadmath-0:14.2 100% | 319.5 MiB/s | 327.2 KiB | 00m00s [ 9/273] Installing libpng-2:1.6.40-4. 100% | 241.3 MiB/s | 247.1 KiB | 00m00s [ 10/273] Installing libicu-0:74.2-2.fc 100% | 388.4 MiB/s | 35.0 MiB | 00m00s [ 11/273] Installing cmake-filesystem-0 100% | 7.0 MiB/s | 7.1 KiB | 00m00s [ 12/273] Installing zlib-ng-compat-dev 100% | 105.8 MiB/s | 108.3 KiB | 00m00s [ 13/273] Installing fonts-filesystem-1 100% | 769.5 KiB/s | 788.0 B | 00m00s [ 14/273] Installing tcl-1:8.6.14-2.fc4 100% | 301.9 MiB/s | 4.2 MiB | 00m00s [ 15/273] Installing tcl-devel-1:8.6.14 100% | 259.9 MiB/s | 798.4 KiB | 00m00s [ 16/273] Installing libpng-devel-2:1.6 100% | 216.2 MiB/s | 885.4 KiB | 00m00s [ 17/273] Installing libicu-devel-0:74. 100% | 296.9 MiB/s | 5.6 MiB | 00m00s [ 18/273] Installing libtextstyle-0:0.2 100% | 191.9 MiB/s | 196.5 KiB | 00m00s [ 19/273] Installing gettext-libs-0:0.2 100% | 279.4 MiB/s | 1.7 MiB | 00m00s [ 20/273] Installing xz-devel-1:5.6.2-2 100% | 253.3 MiB/s | 259.4 KiB | 00m00s [ 21/273] Installing bzip2-devel-0:1.0. 100% | 303.5 MiB/s | 310.7 KiB | 00m00s [ 22/273] Installing openblas-0:0.3.26- 100% | 95.5 MiB/s | 97.8 KiB | 00m00s [ 23/273] Installing graphite2-0:1.3.14 100% | 189.6 MiB/s | 194.1 KiB | 00m00s [ 24/273] Installing libXau-0:1.0.11-7. 100% | 66.8 MiB/s | 68.4 KiB | 00m00s [ 25/273] Installing libxcb-0:1.17.0-2. 100% | 223.3 MiB/s | 1.1 MiB | 00m00s [ 26/273] Installing libICE-0:1.1.1-4.f 100% | 178.3 MiB/s | 182.6 KiB | 00m00s [ 27/273] Installing pixman-0:0.43.4-2. 100% | 234.1 MiB/s | 719.2 KiB | 00m00s [ 28/273] Installing make-1:4.4.1-8.fc4 100% | 300.0 MiB/s | 1.8 MiB | 00m00s [ 29/273] Installing libjpeg-turbo-0:3. 100% | 380.2 MiB/s | 778.7 KiB | 00m00s [ 30/273] Installing libdeflate-0:1.21- 100% | 115.7 MiB/s | 118.4 KiB | 00m00s [ 31/273] Installing libRmath-0:4.4.1-5 100% | 242.0 MiB/s | 247.8 KiB | 00m00s [ 32/273] Installing libRmath-devel-0:4 100% | 0.0 B/s | 17.7 KiB | 00m00s [ 33/273] Installing libdeflate-devel-0 100% | 0.0 B/s | 27.1 KiB | 00m00s [ 34/273] Installing pixman-devel-0:0.4 100% | 0.0 B/s | 50.2 KiB | 00m00s [ 35/273] Installing libSM-0:1.2.4-4.fc 100% | 96.3 MiB/s | 98.7 KiB | 00m00s [ 36/273] Installing libXau-devel-0:1.0 100% | 1.6 MiB/s | 8.2 KiB | 00m00s [ 37/273] Installing libxcb-devel-0:1.1 100% | 80.7 MiB/s | 3.1 MiB | 00m00s [ 38/273] Installing graphite2-devel-0: 100% | 49.4 MiB/s | 50.6 KiB | 00m00s [ 39/273] Installing openblas-openmp-0: 100% | 596.5 MiB/s | 39.4 MiB | 00m00s [ 40/273] Installing openblas-openmp64- 100% | 608.2 MiB/s | 39.5 MiB | 00m00s [ 41/273] Installing flexiblas-netlib64 100% | 414.4 MiB/s | 10.8 MiB | 00m00s [ 42/273] Installing flexiblas-openblas 100% | 43.1 MiB/s | 44.2 KiB | 00m00s [ 43/273] Installing flexiblas-0:3.4.4- 100% | 0.0 B/s | 49.7 KiB | 00m00s [ 44/273] Installing flexiblas-openblas 100% | 43.1 MiB/s | 44.1 KiB | 00m00s [ 45/273] Installing flexiblas-netlib-0 100% | 410.2 MiB/s | 10.7 MiB | 00m00s [ 46/273] Installing flexiblas-devel-0: 100% | 595.4 MiB/s | 4.8 MiB | 00m00s [ 47/273] Installing libxml2-devel-0:2. 100% | 379.6 MiB/s | 3.4 MiB | 00m00s [ 48/273] Installing abattis-cantarell- 100% | 189.9 MiB/s | 194.4 KiB | 00m00s [ 49/273] Installing cpp-0:14.2.1-1.fc4 100% | 388.9 MiB/s | 35.0 MiB | 00m00s [ 50/273] Installing nss-softokn-freebl 100% | 255.8 MiB/s | 785.8 KiB | 00m00s [ 51/273] Installing nss-softokn-0:3.10 100% | 375.8 MiB/s | 1.9 MiB | 00m00s [ 52/273] Installing nss-sysinit-0:3.10 100% | 22.7 MiB/s | 23.3 KiB | 00m00s [ 53/273] Installing nss-0:3.103.0-1.fc 100% | 156.8 MiB/s | 1.9 MiB | 00m00s >>> Running post-install scriptlet: nss-0:3.103.0-1.fc41.x86_64 >>> Stop post-install scriptlet: nss-0:3.103.0-1.fc41.x86_64 [ 54/273] Installing libblkid-devel-0:2 100% | 44.9 MiB/s | 46.0 KiB | 00m00s [ 55/273] Installing sysprof-capture-de 100% | 49.9 MiB/s | 255.4 KiB | 00m00s [ 56/273] Installing tzdata-0:2024a-9.f 100% | 62.6 MiB/s | 1.9 MiB | 00m00s [ 57/273] Installing python-pip-wheel-0 100% | 620.8 MiB/s | 1.2 MiB | 00m00s [ 58/273] Installing mpdecimal-0:2.5.1- 100% | 201.2 MiB/s | 206.0 KiB | 00m00s [ 59/273] Installing libb2-0:0.98.1-12. 100% | 42.3 MiB/s | 43.3 KiB | 00m00s [ 60/273] Installing expat-0:2.6.2-2.fc 100% | 46.7 MiB/s | 286.8 KiB | 00m00s [ 61/273] Installing python3-libs-0:3.1 100% | 333.5 MiB/s | 40.7 MiB | 00m00s [ 62/273] Installing python3-0:3.13.0~r 100% | 32.8 MiB/s | 33.6 KiB | 00m00s [ 63/273] Installing python3-packaging- 100% | 141.0 MiB/s | 433.2 KiB | 00m00s [ 64/273] Installing libsepol-devel-0:3 100% | 62.4 MiB/s | 127.8 KiB | 00m00s [ 65/273] Installing libffi-devel-0:3.4 100% | 11.3 MiB/s | 34.8 KiB | 00m00s [ 66/273] Installing kernel-headers-0:6 100% | 218.1 MiB/s | 6.5 MiB | 00m00s [ 67/273] Installing brotli-0:1.1.0-5.f 100% | 0.0 B/s | 32.5 KiB | 00m00s [ 68/273] Installing brotli-devel-0:1.1 100% | 33.2 MiB/s | 68.0 KiB | 00m00s [ 69/273] Installing glibc-headers-x86- 100% | 190.5 MiB/s | 2.3 MiB | 00m00s [ 70/273] Installing libxcrypt-devel-0: 100% | 31.8 MiB/s | 32.6 KiB | 00m00s [ 71/273] Installing glibc-devel-0:2.40 100% | 18.7 MiB/s | 38.4 KiB | 00m00s [ 72/273] Installing gcc-0:14.2.1-1.fc4 100% | 418.4 MiB/s | 104.2 MiB | 00m00s >>> Running trigger-install scriptlet: redhat-rpm-config-0:293-1.fc41.noarch >>> Stop trigger-install scriptlet: redhat-rpm-config-0:293-1.fc41.noarch [ 73/273] Installing libquadmath-devel- 100% | 22.7 MiB/s | 23.3 KiB | 00m00s [ 74/273] Installing gcc-gfortran-0:14. 100% | 368.9 MiB/s | 37.3 MiB | 00m00s [ 75/273] Installing libstdc++-devel-0: 100% | 379.3 MiB/s | 15.6 MiB | 00m00s [ 76/273] Installing gcc-c++-0:14.2.1-1 100% | 389.5 MiB/s | 38.2 MiB | 00m00s [ 77/273] Installing gettext-envsubst-0 100% | 74.6 MiB/s | 76.3 KiB | 00m00s [ 78/273] Installing gettext-runtime-0: 100% | 119.8 MiB/s | 490.7 KiB | 00m00s [ 79/273] Installing gettext-0:0.22.5-6 100% | 349.3 MiB/s | 5.2 MiB | 00m00s [ 80/273] Installing pcre2-utf32-0:10.4 100% | 274.8 MiB/s | 562.8 KiB | 00m00s [ 81/273] Installing pcre2-utf16-0:10.4 100% | 288.5 MiB/s | 590.9 KiB | 00m00s [ 82/273] Installing pcre2-devel-0:10.4 100% | 285.0 MiB/s | 2.0 MiB | 00m00s [ 83/273] Installing libselinux-devel-0 100% | 39.4 MiB/s | 161.2 KiB | 00m00s [ 84/273] Installing libmount-devel-0:2 100% | 63.0 MiB/s | 64.5 KiB | 00m00s [ 85/273] Installing libtirpc-devel-0:1 100% | 128.4 MiB/s | 263.0 KiB | 00m00s [ 86/273] Installing libX11-xcb-0:1.8.1 100% | 15.5 MiB/s | 15.9 KiB | 00m00s [ 87/273] Installing annobin-docs-0:12. 100% | 96.5 MiB/s | 98.8 KiB | 00m00s [ 88/273] Installing lua-0:5.4.6-6.fc41 100% | 295.3 MiB/s | 604.8 KiB | 00m00s [ 89/273] Installing dbus-libs-1:1.14.1 100% | 180.7 MiB/s | 370.0 KiB | 00m00s [ 90/273] Installing avahi-libs-0:0.8-2 100% | 82.5 MiB/s | 168.9 KiB | 00m00s [ 91/273] Installing ncurses-0:6.5-2.20 100% | 61.9 MiB/s | 633.9 KiB | 00m00s >>> Running pre-install scriptlet: groff-base-0:1.23.0-7.fc41.x86_64 >>> Stop pre-install scriptlet: groff-base-0:1.23.0-7.fc41.x86_64 [ 92/273] Installing groff-base-0:1.23. 100% | 184.4 MiB/s | 3.9 MiB | 00m00s >>> Running post-install scriptlet: groff-base-0:1.23.0-7.fc41.x86_64 >>> Stop post-install scriptlet: groff-base-0:1.23.0-7.fc41.x86_64 [ 93/273] Installing perl-Digest-0:1.20 100% | 36.2 MiB/s | 37.1 KiB | 00m00s [ 94/273] Installing perl-B-0:1.89-511. 100% | 244.8 MiB/s | 501.3 KiB | 00m00s [ 95/273] Installing perl-FileHandle-0: 100% | 0.0 B/s | 9.8 KiB | 00m00s [ 96/273] Installing perl-Digest-MD5-0: 100% | 60.2 MiB/s | 61.7 KiB | 00m00s [ 97/273] Installing perl-Data-Dumper-0 100% | 110.9 MiB/s | 113.6 KiB | 00m00s [ 98/273] Installing perl-libnet-0:3.15 100% | 143.9 MiB/s | 294.7 KiB | 00m00s [ 99/273] Installing perl-AutoLoader-0: 100% | 0.0 B/s | 20.9 KiB | 00m00s [100/273] Installing perl-URI-0:5.28-2. 100% | 82.1 MiB/s | 252.3 KiB | 00m00s [101/273] Installing perl-File-Path-0:2 100% | 63.0 MiB/s | 64.5 KiB | 00m00s [102/273] Installing perl-Mozilla-CA-0: 100% | 0.0 B/s | 10.8 KiB | 00m00s [103/273] Installing perl-Time-Local-2: 100% | 68.9 MiB/s | 70.6 KiB | 00m00s [104/273] Installing perl-Pod-Escapes-1 100% | 0.0 B/s | 25.9 KiB | 00m00s [105/273] Installing perl-Text-Tabs+Wra 100% | 0.0 B/s | 23.9 KiB | 00m00s [106/273] Installing perl-if-0:0.61.000 100% | 0.0 B/s | 6.2 KiB | 00m00s [107/273] Installing perl-locale-0:1.12 100% | 0.0 B/s | 6.9 KiB | 00m00s [108/273] Installing perl-IO-Socket-IP- 100% | 98.1 MiB/s | 100.5 KiB | 00m00s [109/273] Installing perl-Net-SSLeay-0: 100% | 227.1 MiB/s | 1.4 MiB | 00m00s [110/273] Installing perl-IO-Socket-SSL 100% | 229.6 MiB/s | 705.2 KiB | 00m00s [111/273] Installing perl-Term-ANSIColo 100% | 96.9 MiB/s | 99.2 KiB | 00m00s [112/273] Installing perl-Term-Cap-0:1. 100% | 0.0 B/s | 30.6 KiB | 00m00s [113/273] Installing perl-Class-Struct- 100% | 0.0 B/s | 25.9 KiB | 00m00s [114/273] Installing perl-File-Temp-1:0 100% | 160.2 MiB/s | 164.1 KiB | 00m00s [115/273] Installing perl-IPC-Open3-0:1 100% | 0.0 B/s | 23.3 KiB | 00m00s [116/273] Installing perl-POSIX-0:2.20- 100% | 230.8 MiB/s | 236.4 KiB | 00m00s [117/273] Installing perl-HTTP-Tiny-0:0 100% | 150.6 MiB/s | 154.2 KiB | 00m00s [118/273] Installing perl-Pod-Simple-1: 100% | 185.7 MiB/s | 570.5 KiB | 00m00s [119/273] Installing perl-Socket-4:2.03 100% | 123.1 MiB/s | 126.1 KiB | 00m00s [120/273] Installing perl-SelectSaver-0 100% | 0.0 B/s | 2.6 KiB | 00m00s [121/273] Installing perl-Symbol-0:1.09 100% | 0.0 B/s | 7.2 KiB | 00m00s [122/273] Installing perl-File-stat-0:1 100% | 0.0 B/s | 13.1 KiB | 00m00s [123/273] Installing perl-Pod-Perldoc-0 100% | 165.3 MiB/s | 169.3 KiB | 00m00s [124/273] Installing perl-podlators-1:6 100% | 157.0 MiB/s | 321.4 KiB | 00m00s [125/273] Installing perl-Text-ParseWor 100% | 0.0 B/s | 14.6 KiB | 00m00s [126/273] Installing perl-base-0:2.27-5 100% | 0.0 B/s | 12.9 KiB | 00m00s [127/273] Installing perl-Fcntl-0:1.18- 100% | 48.9 MiB/s | 50.1 KiB | 00m00s [128/273] Installing perl-mro-0:1.29-51 100% | 45.6 MiB/s | 46.7 KiB | 00m00s [129/273] Installing perl-overloading-0 100% | 0.0 B/s | 5.5 KiB | 00m00s [130/273] Installing perl-IO-0:1.55-511 100% | 151.7 MiB/s | 155.3 KiB | 00m00s [131/273] Installing perl-Pod-Usage-4:2 100% | 84.3 MiB/s | 86.3 KiB | 00m00s [132/273] Installing perl-vars-0:1.05-5 100% | 0.0 B/s | 4.3 KiB | 00m00s [133/273] Installing perl-Errno-0:1.38- 100% | 0.0 B/s | 8.8 KiB | 00m00s [134/273] Installing perl-Scalar-List-U 100% | 146.2 MiB/s | 149.7 KiB | 00m00s [135/273] Installing perl-constant-0:1. 100% | 0.0 B/s | 27.4 KiB | 00m00s [136/273] Installing perl-File-Basename 100% | 0.0 B/s | 14.6 KiB | 00m00s [137/273] Installing perl-Getopt-Std-0: 100% | 0.0 B/s | 11.7 KiB | 00m00s [138/273] Installing perl-MIME-Base64-0 100% | 47.2 MiB/s | 48.4 KiB | 00m00s [139/273] Installing perl-parent-1:0.24 100% | 0.0 B/s | 10.7 KiB | 00m00s [140/273] Installing perl-overload-0:1. 100% | 0.0 B/s | 71.9 KiB | 00m00s [141/273] Installing perl-Storable-1:3. 100% | 228.5 MiB/s | 234.0 KiB | 00m00s [142/273] Installing perl-Getopt-Long-1 100% | 143.8 MiB/s | 147.2 KiB | 00m00s [143/273] Installing perl-Carp-0:1.54-5 100% | 46.6 MiB/s | 47.7 KiB | 00m00s [144/273] Installing perl-Exporter-0:5. 100% | 54.3 MiB/s | 55.6 KiB | 00m00s [145/273] Installing perl-DynaLoader-0: 100% | 0.0 B/s | 32.5 KiB | 00m00s [146/273] Installing perl-PathTools-0:3 100% | 90.1 MiB/s | 184.6 KiB | 00m00s [147/273] Installing perl-Encode-4:3.21 100% | 314.6 MiB/s | 4.7 MiB | 00m00s [148/273] Installing perl-libs-4:5.40.0 100% | 262.1 MiB/s | 10.0 MiB | 00m00s [149/273] Installing perl-interpreter-4 100% | 60.5 MiB/s | 124.0 KiB | 00m00s [150/273] Installing libfontenc-0:1.1.8 100% | 66.8 MiB/s | 68.4 KiB | 00m00s [151/273] Installing google-noto-fonts- 100% | 0.0 B/s | 18.3 KiB | 00m00s [152/273] Installing google-noto-sans-v 100% | 312.2 MiB/s | 1.2 MiB | 00m00s [153/273] Installing default-fonts-core 100% | 17.8 MiB/s | 18.2 KiB | 00m00s [154/273] Installing lua-posix-0:36.2.1 100% | 150.1 MiB/s | 614.8 KiB | 00m00s [155/273] Installing copy-jdk-configs-0 100% | 0.0 B/s | 21.0 KiB | 00m00s [156/273] Installing tzdata-java-0:2024 100% | 99.7 MiB/s | 102.1 KiB | 00m00s [157/273] Installing lksctp-tools-0:1.0 100% | 39.0 MiB/s | 279.7 KiB | 00m00s [158/273] Installing javapackages-files 100% | 5.2 MiB/s | 5.3 KiB | 00m00s [159/273] Installing alsa-lib-0:1.2.12- 100% | 232.5 MiB/s | 1.4 MiB | 00m00s [160/273] Installing emacs-filesystem-1 100% | 0.0 B/s | 544.0 B | 00m00s [161/273] Installing libdatrie-0:0.2.13 100% | 57.7 MiB/s | 59.0 KiB | 00m00s [162/273] Installing libthai-0:0.1.29-9 100% | 255.6 MiB/s | 785.3 KiB | 00m00s [163/273] Installing nettle-0:3.10-3.fc 100% | 259.2 MiB/s | 796.1 KiB | 00m00s [164/273] Installing gnutls-0:3.8.6-7.f 100% | 322.4 MiB/s | 3.2 MiB | 00m00s [165/273] Installing glib2-0:2.82.0-1.f 100% | 376.6 MiB/s | 14.7 MiB | 00m00s [166/273] Installing freetype-0:2.13.2- 100% | 277.4 MiB/s | 852.3 KiB | 00m00s [167/273] Installing harfbuzz-0:9.0.0-3 100% | 331.3 MiB/s | 2.7 MiB | 00m00s [168/273] Installing harfbuzz-icu-0:9.0 100% | 0.0 B/s | 20.3 KiB | 00m00s [169/273] Installing mkfontscale-0:1.2. 100% | 49.4 MiB/s | 50.6 KiB | 00m00s [170/273] Installing ttmkfdir-0:3.0.9-7 100% | 120.9 MiB/s | 123.8 KiB | 00m00s [171/273] Installing desktop-file-utils 100% | 114.3 MiB/s | 234.2 KiB | 00m00s [172/273] Installing xdg-utils-0:1.2.1- 100% | 170.7 MiB/s | 349.5 KiB | 00m00s [173/273] Installing glib2-devel-0:2.82 100% | 491.5 MiB/s | 15.7 MiB | 00m00s [174/273] Installing cups-libs-1:2.4.10 100% | 203.3 MiB/s | 624.4 KiB | 00m00s [175/273] Installing java-21-openjdk-he 100% | 434.4 MiB/s | 205.0 MiB | 00m00s >>> Running post-install scriptlet: java-21-openjdk-headless-1:21.0.4.0.7-2.fc41 >>> Stop post-install scriptlet: java-21-openjdk-headless-1:21.0.4.0.7-2.fc41.x8 >>> Running pre-install scriptlet: xml-common-0:0.6.3-65.fc41.noarch >>> Stop pre-install scriptlet: xml-common-0:0.6.3-65.fc41.noarch [176/273] Installing xml-common-0:0.6.3 100% | 39.6 MiB/s | 81.1 KiB | 00m00s [177/273] Installing fontconfig-0:2.15. 100% | 794.4 KiB/s | 811.1 KiB | 00m01s >>> Running post-install scriptlet: fontconfig-0:2.15.0-8.fc41.x86_64 >>> Stop post-install scriptlet: fontconfig-0:2.15.0-8.fc41.x86_64 [178/273] Installing xorg-x11-fonts-Typ 100% | 22.8 MiB/s | 865.6 KiB | 00m00s >>> Running post-install scriptlet: xorg-x11-fonts-Type1-0:7.5-39.fc41.noarch >>> Stop post-install scriptlet: xorg-x11-fonts-Type1-0:7.5-39.fc41.noarch [179/273] Installing tre-common-0:0.8.0 100% | 81.2 MiB/s | 83.1 KiB | 00m00s [180/273] Installing tre-0:0.8.0-45.201 100% | 74.9 MiB/s | 76.7 KiB | 00m00s [181/273] Installing tre-devel-0:0.8.0- 100% | 0.0 B/s | 11.6 KiB | 00m00s [182/273] Installing fribidi-0:1.0.15-2 100% | 181.1 MiB/s | 370.9 KiB | 00m00s [183/273] Installing libwebp-0:1.4.0-4. 100% | 269.1 MiB/s | 826.8 KiB | 00m00s [184/273] Installing liblerc-0:4.0.0-7. 100% | 297.4 MiB/s | 609.0 KiB | 00m00s [185/273] Installing jbigkit-libs-0:2.1 100% | 116.8 MiB/s | 119.6 KiB | 00m00s [186/273] Installing libtiff-0:4.6.0-6. 100% | 198.0 MiB/s | 608.2 KiB | 00m00s [187/273] Installing libX11-common-0:1. 100% | 148.4 MiB/s | 1.2 MiB | 00m00s [188/273] Installing libX11-0:1.8.10-2. 100% | 320.4 MiB/s | 1.3 MiB | 00m00s [189/273] Installing libXext-0:1.3.6-2. 100% | 89.2 MiB/s | 91.3 KiB | 00m00s [190/273] Installing libXrender-0:0.9.1 100% | 50.2 MiB/s | 51.4 KiB | 00m00s [191/273] Installing cairo-0:1.18.0-4.f 100% | 249.1 MiB/s | 1.7 MiB | 00m00s [192/273] Installing libX11-devel-0:1.8 100% | 80.0 MiB/s | 1.1 MiB | 00m00s [193/273] Installing libXft-0:2.3.8-7.f 100% | 23.2 MiB/s | 166.0 KiB | 00m00s >>> Running pre-install scriptlet: tk-1:8.6.14-2.fc41.x86_64 >>> Stop pre-install scriptlet: tk-1:8.6.14-2.fc41.x86_64 [194/273] Installing tk-1:8.6.14-2.fc41 100% | 244.0 MiB/s | 3.7 MiB | 00m00s [195/273] Installing libXrender-devel-0 100% | 0.0 B/s | 51.0 KiB | 00m00s [196/273] Installing libXi-0:1.8.1-6.fc 100% | 79.9 MiB/s | 81.8 KiB | 00m00s [197/273] Installing libXt-0:1.3.0-4.fc 100% | 210.5 MiB/s | 431.1 KiB | 00m00s [198/273] Installing libXmu-0:1.2.1-2.f 100% | 189.0 MiB/s | 193.5 KiB | 00m00s [199/273] Installing xclip-0:0.13-22.gi 100% | 62.8 MiB/s | 64.3 KiB | 00m00s [200/273] Installing libXtst-0:1.2.5-1. 100% | 33.8 MiB/s | 34.7 KiB | 00m00s [201/273] Installing pango-0:1.54.0-2.f 100% | 244.6 MiB/s | 1.0 MiB | 00m00s [202/273] Installing libXext-devel-0:1. 100% | 54.2 MiB/s | 110.9 KiB | 00m00s [203/273] Installing harfbuzz-cairo-0:9 100% | 47.9 MiB/s | 49.1 KiB | 00m00s [204/273] Installing fontconfig-devel-0 100% | 29.7 MiB/s | 151.9 KiB | 00m00s [205/273] Installing freetype-devel-0:2 100% | 413.5 MiB/s | 7.9 MiB | 00m00s [206/273] Installing cairo-devel-0:1.18 100% | 381.8 MiB/s | 2.3 MiB | 00m00s [207/273] Installing harfbuzz-devel-0:9 100% | 424.9 MiB/s | 5.1 MiB | 00m00s [208/273] Installing libXft-devel-0:2.3 100% | 21.6 MiB/s | 44.3 KiB | 00m00s [209/273] Installing tk-devel-1:8.6.14- 100% | 168.5 MiB/s | 1.0 MiB | 00m00s [210/273] Installing libXcomposite-0:0. 100% | 45.0 MiB/s | 46.1 KiB | 00m00s [211/273] Installing java-21-openjdk-1: 100% | 90.3 MiB/s | 1.1 MiB | 00m00s >>> Running post-install scriptlet: java-21-openjdk-1:21.0.4.0.7-2.fc41.x86_64 >>> Stop post-install scriptlet: java-21-openjdk-1:21.0.4.0.7-2.fc41.x86_64 [212/273] Installing java-21-openjdk-de 100% | 401.3 MiB/s | 11.2 MiB | 00m00s >>> Running post-install scriptlet: java-21-openjdk-devel-1:21.0.4.0.7-2.fc41.x8 >>> Stop post-install scriptlet: java-21-openjdk-devel-1:21.0.4.0.7-2.fc41.x86_6 [213/273] Installing less-0:661-2.fc41. 100% | 13.8 MiB/s | 408.6 KiB | 00m00s [214/273] Installing R-core-0:4.4.1-5.f 100% | 263.1 MiB/s | 103.7 MiB | 00m00s [215/273] Installing R-CRAN-rlang-0:1.1 100% | 169.3 MiB/s | 2.7 MiB | 00m00s [216/273] Installing R-CRAN-cli-0:3.6.3 100% | 202.8 MiB/s | 2.4 MiB | 00m00s [217/273] Installing R-CRAN-glue-0:1.7. 100% | 132.9 MiB/s | 272.2 KiB | 00m00s [218/273] Installing R-CRAN-lifecycle-0 100% | 96.3 MiB/s | 295.9 KiB | 00m00s [219/273] Installing R-CRAN-vctrs-0:0.6 100% | 218.6 MiB/s | 2.4 MiB | 00m00s [220/273] Installing R-CRAN-magrittr-0: 100% | 106.5 MiB/s | 436.3 KiB | 00m00s [221/273] Installing R-CRAN-R6-0:2.5.1- 100% | 118.7 MiB/s | 121.6 KiB | 00m00s [222/273] Installing R-CRAN-withr-0:3.0 100% | 103.3 MiB/s | 423.1 KiB | 00m00s [223/273] Installing R-CRAN-tidyselect- 100% | 145.9 MiB/s | 448.2 KiB | 00m00s [224/273] Installing R-CRAN-lattice-0:0 100% | 189.2 MiB/s | 2.1 MiB | 00m00s [225/273] Installing R-CRAN-gtable-0:0. 100% | 104.6 MiB/s | 321.3 KiB | 00m00s [226/273] Installing R-CRAN-stringi-0:1 100% | 188.4 MiB/s | 2.1 MiB | 00m00s [227/273] Installing R-CRAN-crayon-0:1. 100% | 82.0 MiB/s | 251.8 KiB | 00m00s [228/273] Installing R-CRAN-fansi-0:1.0 100% | 157.2 MiB/s | 643.9 KiB | 00m00s [229/273] Installing R-CRAN-pkgconfig-0 100% | 38.9 MiB/s | 39.9 KiB | 00m00s [230/273] Installing R-CRAN-hms-0:1.1.3 100% | 69.7 MiB/s | 142.8 KiB | 00m00s [231/273] Installing R-core-devel-0:4.4 100% | 195.9 MiB/s | 401.3 KiB | 00m00s [232/273] Installing R-CRAN-stringr-0:1 100% | 82.2 MiB/s | 673.3 KiB | 00m00s [233/273] Installing R-CRAN-Matrix-0:1. 100% | 161.7 MiB/s | 8.4 MiB | 00m00s [234/273] Installing R-CRAN-nlme-0:3.1. 100% | 187.2 MiB/s | 3.9 MiB | 00m00s [235/273] Installing R-CRAN-mgcv-0:1.9. 100% | 287.6 MiB/s | 4.6 MiB | 00m00s [236/273] Installing R-CRAN-purrr-0:1.0 100% | 129.6 MiB/s | 929.2 KiB | 00m00s [237/273] Installing R-CRAN-RColorBrewe 100% | 67.8 MiB/s | 69.5 KiB | 00m00s [238/273] Installing R-littler-0:0.3.19 100% | 80.3 MiB/s | 164.4 KiB | 00m00s [239/273] Installing R-CRAN-generics-0: 100% | 57.8 MiB/s | 177.5 KiB | 00m00s [240/273] Installing R-CRAN-MASS-0:7.3. 100% | 170.0 MiB/s | 1.9 MiB | 00m00s [241/273] Installing R-CRAN-isoband-0:0 100% | 312.0 MiB/s | 1.9 MiB | 00m00s [242/273] Installing R-CRAN-clipr-0:0.8 100% | 45.2 MiB/s | 92.7 KiB | 00m00s [243/273] Installing R-rpm-macros-0:1.2 100% | 0.0 B/s | 6.6 KiB | 00m00s [244/273] Installing R-CRAN-utf8-0:1.2. 100% | 156.1 MiB/s | 479.5 KiB | 00m00s [245/273] Installing R-CRAN-pillar-0:1. 100% | 239.4 MiB/s | 1.4 MiB | 00m00s [246/273] Installing R-CRAN-tibble-0:3. 100% | 243.3 MiB/s | 1.7 MiB | 00m00s [247/273] Installing R-CRAN-dplyr-0:1.1 100% | 141.3 MiB/s | 2.7 MiB | 00m00s [248/273] Installing R-CRAN-farver-0:2. 100% | 298.2 MiB/s | 2.1 MiB | 00m00s [249/273] Installing R-CRAN-labeling-0: 100% | 50.1 MiB/s | 102.5 KiB | 00m00s [250/273] Installing R-CRAN-viridisLite 100% | 434.7 MiB/s | 1.3 MiB | 00m00s [251/273] Installing R-CRAN-tzdb-0:0.4. 100% | 305.7 MiB/s | 2.1 MiB | 00m00s [252/273] Installing R-java-0:4.4.1-5.f 100% | 0.0 B/s | 124.0 B | 00m00s [253/273] Installing R-java-devel-0:4.4 100% | 0.0 B/s | 124.0 B | 00m00s [254/273] Installing R-CRAN-colorspace- 100% | 274.1 MiB/s | 4.1 MiB | 00m00s [255/273] Installing R-CRAN-munsell-0:0 100% | 128.2 MiB/s | 393.7 KiB | 00m00s [256/273] Installing R-CRAN-scales-0:1. 100% | 127.9 MiB/s | 1.2 MiB | 00m00s [257/273] Installing R-CRAN-ggplot2-0:3 100% | 258.4 MiB/s | 7.2 MiB | 00m00s [258/273] Installing R-CRAN-bit-0:4.0.5 100% | 177.4 MiB/s | 1.6 MiB | 00m00s [259/273] Installing R-CRAN-bit64-0:4.0 100% | 114.8 MiB/s | 940.4 KiB | 00m00s [260/273] Installing R-CRAN-vroom-0:1.6 100% | 173.4 MiB/s | 1.7 MiB | 00m00s [261/273] Installing R-CRAN-readr-0:2.1 100% | 203.1 MiB/s | 1.4 MiB | 00m00s [262/273] Installing R-CRAN-patchwork-0 100% | 370.3 MiB/s | 4.1 MiB | 00m00s [263/273] Installing R-devel-0:4.4.1-5. 100% | 0.0 B/s | 124.0 B | 00m00s [264/273] Installing R-CRAN-tidyr-0:1.3 100% | 170.4 MiB/s | 1.9 MiB | 00m00s [265/273] Installing R-CRAN-Rcpp-0:1.0. 100% | 265.9 MiB/s | 8.5 MiB | 00m00s [266/273] Installing R-CRAN-data.tree-0 100% | 307.4 MiB/s | 3.1 MiB | 00m00s [267/273] Installing R-CRAN-zoo-0:1.8.1 100% | 58.8 MiB/s | 1.5 MiB | 00m00s [268/273] Installing R-CRAN-BH-0:1.84.0 100% | 272.1 MiB/s | 123.5 MiB | 00m00s [269/273] Installing R-CRAN-gtools-0:3. 100% | 135.7 MiB/s | 555.9 KiB | 00m00s [270/273] Installing R-CRAN-lpSolve-0:5 100% | 189.8 MiB/s | 777.5 KiB | 00m00s [271/273] Installing R-CRAN-yaml-0:2.3. 100% | 92.6 MiB/s | 284.4 KiB | 00m00s [272/273] Installing annobin-plugin-gcc 100% | 64.2 MiB/s | 986.7 KiB | 00m00s >>> Running trigger-install scriptlet: redhat-rpm-config-0:293-1.fc41.noarch >>> Stop trigger-install scriptlet: redhat-rpm-config-0:293-1.fc41.noarch [273/273] Installing gcc-plugin-annobin 100% | 172.2 KiB/s | 62.7 KiB | 00m00s >>> Running trigger-install scriptlet: redhat-rpm-config-0:293-1.fc41.noarch >>> Stop trigger-install scriptlet: redhat-rpm-config-0:293-1.fc41.noarch >>> Running post-transaction scriptlet: copy-jdk-configs-0:4.1-6.fc41.noarch >>> Stop post-transaction scriptlet: copy-jdk-configs-0:4.1-6.fc41.noarch >>> Running post-transaction scriptlet: java-21-openjdk-headless-1:21.0.4.0.7-2. >>> Stop post-transaction scriptlet: java-21-openjdk-headless-1:21.0.4.0.7-2.fc4 >>> Running post-transaction scriptlet: fontconfig-0:2.15.0-8.fc41.x86_64 >>> Stop post-transaction scriptlet: fontconfig-0:2.15.0-8.fc41.x86_64 >>> Running post-transaction scriptlet: java-21-openjdk-1:21.0.4.0.7-2.fc41.x86_ >>> Stop post-transaction scriptlet: java-21-openjdk-1:21.0.4.0.7-2.fc41.x86_64 >>> Running post-transaction scriptlet: java-21-openjdk-devel-1:21.0.4.0.7-2.fc4 >>> Stop post-transaction scriptlet: java-21-openjdk-devel-1:21.0.4.0.7-2.fc41.x >>> Running trigger-install scriptlet: glibc-common-0:2.40-3.fc41.x86_64 >>> Stop trigger-install scriptlet: glibc-common-0:2.40-3.fc41.x86_64 >>> Running trigger-install scriptlet: info-0:7.1-3.fc41.x86_64 >>> Stop trigger-install scriptlet: info-0:7.1-3.fc41.x86_64 >>> Running trigger-install scriptlet: glib2-0:2.82.0-1.fc41.x86_64 >>> Stop trigger-install scriptlet: glib2-0:2.82.0-1.fc41.x86_64 >>> Running trigger-install scriptlet: glib2-0:2.82.0-1.fc41.x86_64 >>> Stop trigger-install scriptlet: glib2-0:2.82.0-1.fc41.x86_64 >>> Running trigger-install scriptlet: desktop-file-utils-0:0.27-2.fc41.x86_64 >>> Stop trigger-install scriptlet: desktop-file-utils-0:0.27-2.fc41.x86_64 >>> Running trigger-install scriptlet: fontconfig-0:2.15.0-8.fc41.x86_64 >>> Stop trigger-install scriptlet: fontconfig-0:2.15.0-8.fc41.x86_64 Warning: skipped PGP checks for 51 package(s). Finish: build setup for R-CRAN-starvz-0.8.2-1.fc41.copr7998582.src.rpm Start: rpmbuild R-CRAN-starvz-0.8.2-1.fc41.copr7998582.src.rpm Building target platforms: x86_64 Building for target x86_64 warning: %source_date_epoch_from_changelog is set, but %changelog has no entries to take a date from Executing(%mkbuilddir): /bin/sh -e /var/tmp/rpm-tmp.wofmba + umask 022 + cd /builddir/build/BUILD/R-CRAN-starvz-0.8.2-build + test -d /builddir/build/BUILD/R-CRAN-starvz-0.8.2-build + /usr/bin/chmod -Rf a+rX,u+w,g-w,o-w /builddir/build/BUILD/R-CRAN-starvz-0.8.2-build + /usr/bin/rm -rf /builddir/build/BUILD/R-CRAN-starvz-0.8.2-build + /usr/bin/mkdir -p /builddir/build/BUILD/R-CRAN-starvz-0.8.2-build + /usr/bin/mkdir -p /builddir/build/BUILD/R-CRAN-starvz-0.8.2-build/SPECPARTS + RPM_EC=0 ++ jobs -p + exit 0 Executing(%prep): /bin/sh -e /var/tmp/rpm-tmp.SxQEhl + umask 022 + cd /builddir/build/BUILD/R-CRAN-starvz-0.8.2-build + cd /builddir/build/BUILD/R-CRAN-starvz-0.8.2-build + rm -rf starvz + /usr/bin/mkdir -p starvz + cd starvz + /usr/lib/rpm/rpmuncompress -x /builddir/build/SOURCES/starvz_0.8.2.tar.gz + STATUS=0 + '[' 0 -ne 0 ']' + /usr/bin/chmod -Rf a+rX,u+w,g-w,o-w . + find -type f -executable -exec grep -Iq . '{}' ';' -exec sed -i -e '$a\' '{}' ';' + '[' -d starvz/src ']' + find starvz/src -type f -exec sed -i s@/usr/bin/strip@/usr/bin/true@g '{}' ';' + '[' -d starvz/src ']' + find 'starvz/src/Make*' -type f -exec sed -i s@-g0@@g '{}' ';' find: ‘starvz/src/Make*’: No such file or directory + true + find -type f -executable -exec sed -Ei 's@#!( )*/usr/local/bin@#!/usr/bin@g' '{}' ';' + RPM_EC=0 ++ jobs -p + exit 0 Executing(%build): /bin/sh -e /var/tmp/rpm-tmp.V5TvSS + umask 022 + cd /builddir/build/BUILD/R-CRAN-starvz-0.8.2-build + CFLAGS='-O2 -flto=auto -ffat-lto-objects -fexceptions -g -grecord-gcc-switches -pipe -Wall -Werror=format-security -Wp,-U_FORTIFY_SOURCE,-D_FORTIFY_SOURCE=3 -Wp,-D_GLIBCXX_ASSERTIONS -specs=/usr/lib/rpm/redhat/redhat-hardened-cc1 -fstack-protector-strong -specs=/usr/lib/rpm/redhat/redhat-annobin-cc1 -m64 -march=x86-64 -mtune=generic -fasynchronous-unwind-tables -fstack-clash-protection -fcf-protection -mtls-dialect=gnu2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer ' + export CFLAGS + CXXFLAGS='-O2 -flto=auto -ffat-lto-objects -fexceptions -g -grecord-gcc-switches -pipe -Wall -Werror=format-security -Wp,-U_FORTIFY_SOURCE,-D_FORTIFY_SOURCE=3 -Wp,-D_GLIBCXX_ASSERTIONS -specs=/usr/lib/rpm/redhat/redhat-hardened-cc1 -fstack-protector-strong -specs=/usr/lib/rpm/redhat/redhat-annobin-cc1 -m64 -march=x86-64 -mtune=generic -fasynchronous-unwind-tables -fstack-clash-protection -fcf-protection -mtls-dialect=gnu2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer ' + export CXXFLAGS + FFLAGS='-O2 -flto=auto -ffat-lto-objects -fexceptions -g -grecord-gcc-switches -pipe -Wall -Wp,-U_FORTIFY_SOURCE,-D_FORTIFY_SOURCE=3 -Wp,-D_GLIBCXX_ASSERTIONS -specs=/usr/lib/rpm/redhat/redhat-hardened-cc1 -fstack-protector-strong -specs=/usr/lib/rpm/redhat/redhat-annobin-cc1 -m64 -march=x86-64 -mtune=generic -fasynchronous-unwind-tables -fstack-clash-protection -fcf-protection -mtls-dialect=gnu2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -I/usr/lib64/gfortran/modules ' + export FFLAGS + FCFLAGS='-O2 -flto=auto -ffat-lto-objects -fexceptions -g -grecord-gcc-switches -pipe -Wall -Wp,-U_FORTIFY_SOURCE,-D_FORTIFY_SOURCE=3 -Wp,-D_GLIBCXX_ASSERTIONS -specs=/usr/lib/rpm/redhat/redhat-hardened-cc1 -fstack-protector-strong -specs=/usr/lib/rpm/redhat/redhat-annobin-cc1 -m64 -march=x86-64 -mtune=generic -fasynchronous-unwind-tables -fstack-clash-protection -fcf-protection -mtls-dialect=gnu2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -I/usr/lib64/gfortran/modules ' + export FCFLAGS + VALAFLAGS=-g + export VALAFLAGS + RUSTFLAGS='-Copt-level=3 -Cdebuginfo=2 -Ccodegen-units=1 -Cstrip=none -Cforce-frame-pointers=yes -Clink-arg=-specs=/usr/lib/rpm/redhat/redhat-package-notes --cap-lints=warn' + export RUSTFLAGS + LDFLAGS='-Wl,-z,relro -Wl,--as-needed -Wl,-z,pack-relative-relocs -Wl,-z,now -specs=/usr/lib/rpm/redhat/redhat-hardened-ld -specs=/usr/lib/rpm/redhat/redhat-annobin-cc1 -Wl,--build-id=sha1 -specs=/usr/lib/rpm/redhat/redhat-package-notes ' + export LDFLAGS + LT_SYS_LIBRARY_PATH=/usr/lib64: + export LT_SYS_LIBRARY_PATH + CC=gcc + export CC + CXX=g++ + export CXX + cd starvz + RPM_EC=0 ++ jobs -p + exit 0 Executing(%install): /bin/sh -e /var/tmp/rpm-tmp.2nUAD2 + umask 022 + cd /builddir/build/BUILD/R-CRAN-starvz-0.8.2-build + '[' /builddir/build/BUILD/R-CRAN-starvz-0.8.2-build/BUILDROOT '!=' / ']' + rm -rf /builddir/build/BUILD/R-CRAN-starvz-0.8.2-build/BUILDROOT ++ dirname /builddir/build/BUILD/R-CRAN-starvz-0.8.2-build/BUILDROOT + mkdir -p /builddir/build/BUILD/R-CRAN-starvz-0.8.2-build + mkdir /builddir/build/BUILD/R-CRAN-starvz-0.8.2-build/BUILDROOT + CFLAGS='-O2 -flto=auto -ffat-lto-objects -fexceptions -g -grecord-gcc-switches -pipe -Wall -Werror=format-security -Wp,-U_FORTIFY_SOURCE,-D_FORTIFY_SOURCE=3 -Wp,-D_GLIBCXX_ASSERTIONS -specs=/usr/lib/rpm/redhat/redhat-hardened-cc1 -fstack-protector-strong -specs=/usr/lib/rpm/redhat/redhat-annobin-cc1 -m64 -march=x86-64 -mtune=generic -fasynchronous-unwind-tables -fstack-clash-protection -fcf-protection -mtls-dialect=gnu2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer ' + export CFLAGS + CXXFLAGS='-O2 -flto=auto -ffat-lto-objects -fexceptions -g -grecord-gcc-switches -pipe -Wall -Werror=format-security -Wp,-U_FORTIFY_SOURCE,-D_FORTIFY_SOURCE=3 -Wp,-D_GLIBCXX_ASSERTIONS -specs=/usr/lib/rpm/redhat/redhat-hardened-cc1 -fstack-protector-strong -specs=/usr/lib/rpm/redhat/redhat-annobin-cc1 -m64 -march=x86-64 -mtune=generic -fasynchronous-unwind-tables -fstack-clash-protection -fcf-protection -mtls-dialect=gnu2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer ' + export CXXFLAGS + FFLAGS='-O2 -flto=auto -ffat-lto-objects -fexceptions -g -grecord-gcc-switches -pipe -Wall -Wp,-U_FORTIFY_SOURCE,-D_FORTIFY_SOURCE=3 -Wp,-D_GLIBCXX_ASSERTIONS -specs=/usr/lib/rpm/redhat/redhat-hardened-cc1 -fstack-protector-strong -specs=/usr/lib/rpm/redhat/redhat-annobin-cc1 -m64 -march=x86-64 -mtune=generic -fasynchronous-unwind-tables -fstack-clash-protection -fcf-protection -mtls-dialect=gnu2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -I/usr/lib64/gfortran/modules ' + export FFLAGS + FCFLAGS='-O2 -flto=auto -ffat-lto-objects -fexceptions -g -grecord-gcc-switches -pipe -Wall -Wp,-U_FORTIFY_SOURCE,-D_FORTIFY_SOURCE=3 -Wp,-D_GLIBCXX_ASSERTIONS -specs=/usr/lib/rpm/redhat/redhat-hardened-cc1 -fstack-protector-strong -specs=/usr/lib/rpm/redhat/redhat-annobin-cc1 -m64 -march=x86-64 -mtune=generic -fasynchronous-unwind-tables -fstack-clash-protection -fcf-protection -mtls-dialect=gnu2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -I/usr/lib64/gfortran/modules ' + export FCFLAGS + VALAFLAGS=-g + export VALAFLAGS + RUSTFLAGS='-Copt-level=3 -Cdebuginfo=2 -Ccodegen-units=1 -Cstrip=none -Cforce-frame-pointers=yes -Clink-arg=-specs=/usr/lib/rpm/redhat/redhat-package-notes --cap-lints=warn' + export RUSTFLAGS + LDFLAGS='-Wl,-z,relro -Wl,--as-needed -Wl,-z,pack-relative-relocs -Wl,-z,now -specs=/usr/lib/rpm/redhat/redhat-hardened-ld -specs=/usr/lib/rpm/redhat/redhat-annobin-cc1 -Wl,--build-id=sha1 -specs=/usr/lib/rpm/redhat/redhat-package-notes ' + export LDFLAGS + LT_SYS_LIBRARY_PATH=/usr/lib64: + export LT_SYS_LIBRARY_PATH + CC=gcc + export CC + CXX=g++ + export CXX + cd starvz + mkdir -p /builddir/build/BUILD/R-CRAN-starvz-0.8.2-build/BUILDROOT/usr/local/lib/R/library + /usr/bin/R CMD INSTALL -l /builddir/build/BUILD/R-CRAN-starvz-0.8.2-build/BUILDROOT/usr/local/lib/R/library starvz * installing *source* package ‘starvz’ ... ** package ‘starvz’ successfully unpacked and MD5 sums checked ** using staged installation ** libs using C++ compiler: ‘g++ (GCC) 14.2.1 20240801 (Red Hat 14.2.1-1)’ g++ -std=gnu++17 -I"/usr/include/R" -DNDEBUG -I'/usr/local/lib/R/library/Rcpp/include' -I'/usr/local/lib/R/library/BH/include' -I/usr/local/include -fpic -O2 -flto=auto -ffat-lto-objects -fexceptions -g -grecord-gcc-switches -pipe -Wall -Werror=format-security -Wp,-U_FORTIFY_SOURCE,-D_FORTIFY_SOURCE=3 -Wp,-D_GLIBCXX_ASSERTIONS -specs=/usr/lib/rpm/redhat/redhat-hardened-cc1 -fstack-protector-strong -specs=/usr/lib/rpm/redhat/redhat-annobin-cc1 -m64 -march=x86-64 -mtune=generic -fasynchronous-unwind-tables -fstack-clash-protection -fcf-protection -mtls-dialect=gnu2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -c RcppExports.cpp -o RcppExports.o g++ -std=gnu++17 -I"/usr/include/R" -DNDEBUG -I'/usr/local/lib/R/library/Rcpp/include' -I'/usr/local/lib/R/library/BH/include' -I/usr/local/include -fpic -O2 -flto=auto -ffat-lto-objects -fexceptions -g -grecord-gcc-switches -pipe -Wall -Werror=format-security -Wp,-U_FORTIFY_SOURCE,-D_FORTIFY_SOURCE=3 -Wp,-D_GLIBCXX_ASSERTIONS -specs=/usr/lib/rpm/redhat/redhat-hardened-cc1 -fstack-protector-strong -specs=/usr/lib/rpm/redhat/redhat-annobin-cc1 -m64 -march=x86-64 -mtune=generic -fasynchronous-unwind-tables -fstack-clash-protection -fcf-protection -mtls-dialect=gnu2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -c integrate_step.cpp -o integrate_step.o g++ -std=gnu++17 -I"/usr/include/R" -DNDEBUG -I'/usr/local/lib/R/library/Rcpp/include' -I'/usr/local/lib/R/library/BH/include' -I/usr/local/include -fpic -O2 -flto=auto -ffat-lto-objects -fexceptions -g -grecord-gcc-switches -pipe -Wall -Werror=format-security -Wp,-U_FORTIFY_SOURCE,-D_FORTIFY_SOURCE=3 -Wp,-D_GLIBCXX_ASSERTIONS -specs=/usr/lib/rpm/redhat/redhat-hardened-cc1 -fstack-protector-strong -specs=/usr/lib/rpm/redhat/redhat-annobin-cc1 -m64 -march=x86-64 -mtune=generic -fasynchronous-unwind-tables -fstack-clash-protection -fcf-protection -mtls-dialect=gnu2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -c last.cpp -o last.o g++ -std=gnu++17 -I"/usr/include/R" -DNDEBUG -I'/usr/local/lib/R/library/Rcpp/include' -I'/usr/local/lib/R/library/BH/include' -I/usr/local/include -fpic -O2 -flto=auto -ffat-lto-objects -fexceptions -g -grecord-gcc-switches -pipe -Wall -Werror=format-security -Wp,-U_FORTIFY_SOURCE,-D_FORTIFY_SOURCE=3 -Wp,-D_GLIBCXX_ASSERTIONS -specs=/usr/lib/rpm/redhat/redhat-hardened-cc1 -fstack-protector-strong -specs=/usr/lib/rpm/redhat/redhat-annobin-cc1 -m64 -march=x86-64 -mtune=generic -fasynchronous-unwind-tables -fstack-clash-protection -fcf-protection -mtls-dialect=gnu2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -c separate_res.cpp -o separate_res.o g++ -std=gnu++17 -I"/usr/include/R" -DNDEBUG -I'/usr/local/lib/R/library/Rcpp/include' -I'/usr/local/lib/R/library/BH/include' -I/usr/local/include -fpic -O2 -flto=auto -ffat-lto-objects -fexceptions -g -grecord-gcc-switches -pipe -Wall -Werror=format-security -Wp,-U_FORTIFY_SOURCE,-D_FORTIFY_SOURCE=3 -Wp,-D_GLIBCXX_ASSERTIONS -specs=/usr/lib/rpm/redhat/redhat-hardened-cc1 -fstack-protector-strong -specs=/usr/lib/rpm/redhat/redhat-annobin-cc1 -m64 -march=x86-64 -mtune=generic -fasynchronous-unwind-tables -fstack-clash-protection -fcf-protection -mtls-dialect=gnu2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -c shortest_path.cpp -o shortest_path.o In file included from /usr/local/lib/R/library/BH/include/boost/property_map/property_map.hpp:22, from /usr/local/lib/R/library/BH/include/boost/graph/topological_sort.hpp:15, from /usr/local/lib/R/library/BH/include/boost/graph/dag_shortest_paths.hpp:13, from shortest_path.cpp:4: /usr/local/lib/R/library/BH/include/boost/mpl/assert.hpp:194:21: warning: unnecessary parentheses in declaration of ‘assert_arg’ [-Wparentheses] 194 | failed ************ (Pred::************ | ^~~~~~~~~~~~~~~~~~~ 195 | assert_arg( void (*)(Pred), typename assert_arg_pred::type ) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 196 | ); | ~ /usr/local/lib/R/library/BH/include/boost/mpl/assert.hpp:194:21: note: remove parentheses 194 | failed ************ (Pred::************ | ^~~~~~~~~~~~~~~~~~~ | - 195 | assert_arg( void (*)(Pred), typename assert_arg_pred::type ) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 196 | ); | ~ | - /usr/local/lib/R/library/BH/include/boost/mpl/assert.hpp:199:21: warning: unnecessary parentheses in declaration of ‘assert_not_arg’ [-Wparentheses] 199 | failed ************ (boost::mpl::not_::************ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 200 | assert_not_arg( void (*)(Pred), typename assert_arg_pred_not::type ) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 201 | ); | ~ /usr/local/lib/R/library/BH/include/boost/mpl/assert.hpp:199:21: note: remove parentheses 199 | failed ************ (boost::mpl::not_::************ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ | - 200 | assert_not_arg( void (*)(Pred), typename assert_arg_pred_not::type ) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 201 | ); | ~ | - In file included from /usr/local/lib/R/library/BH/include/boost/smart_ptr/shared_ptr.hpp:18, from /usr/local/lib/R/library/BH/include/boost/property_map/vector_property_map.hpp:14, from /usr/local/lib/R/library/BH/include/boost/property_map/property_map.hpp:598: /usr/local/lib/R/library/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++/14/memory:78, from /usr/local/lib/R/library/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /usr/local/lib/R/library/BH/include/boost/smart_ptr/detail/shared_count.hpp:27: /usr/include/c++/14/bits/unique_ptr.h:59:28: note: declared here 59 | template class auto_ptr; | ^~~~~~~~ /usr/local/lib/R/library/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++/14/bits/unique_ptr.h:59:28: note: declared here 59 | template class auto_ptr; | ^~~~~~~~ /usr/local/lib/R/library/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++/14/bits/unique_ptr.h:59:28: note: declared here 59 | template class auto_ptr; | ^~~~~~~~ /usr/local/lib/R/library/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++/14/bits/unique_ptr.h:59:28: note: declared here 59 | template class auto_ptr; | ^~~~~~~~ /usr/local/lib/R/library/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++/14/bits/unique_ptr.h:59:28: note: declared here 59 | template class auto_ptr; | ^~~~~~~~ /usr/local/lib/R/library/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++/14/bits/unique_ptr.h:59:28: note: declared here 59 | template class auto_ptr; | ^~~~~~~~ /usr/local/lib/R/library/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr& boost::shared_ptr::operator=(std::auto_ptr<_Up>&&)’: /usr/local/lib/R/library/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++/14/bits/unique_ptr.h:59:28: note: declared here 59 | template class auto_ptr; | ^~~~~~~~ In file included from /usr/local/lib/R/library/BH/include/boost/scoped_ptr.hpp:13, from /usr/local/lib/R/library/BH/include/boost/smart_ptr.hpp:17, from /usr/local/lib/R/library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:26, from /usr/local/lib/R/library/BH/include/boost/graph/dag_shortest_paths.hpp:14: /usr/local/lib/R/library/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope: /usr/local/lib/R/library/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++/14/bits/unique_ptr.h:59:28: note: declared here 59 | template class auto_ptr; | ^~~~~~~~ In file included from /usr/local/lib/R/library/BH/include/boost/concept/assert.hpp:35, from /usr/local/lib/R/library/BH/include/boost/property_map/property_map.hpp:19: /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ 502 | BOOST_concept(InputIterator,(TT)) | ^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ 540 | BOOST_concept(ForwardIterator,(TT)) | ^~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ 568 | BOOST_concept(BidirectionalIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/property_map/property_map.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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/dag_shortest_paths.hpp:116: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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 116 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 117 | distance_map.begin(), id, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:31, from /usr/local/lib/R/library/BH/include/boost/property_map/property_map.hpp:20: /usr/local/lib/R/library/BH/include/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(); } | ^ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ 502 | BOOST_concept(InputIterator,(TT)) | ^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ 540 | BOOST_concept(ForwardIterator,(TT)) | ^~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ 568 | BOOST_concept(BidirectionalIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/property_map/property_map.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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/dag_shortest_paths.hpp:116: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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 116 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 117 | distance_map.begin(), id, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/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(); } | ^ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ 540 | BOOST_concept(ForwardIterator,(TT)) | ^~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ 568 | BOOST_concept(BidirectionalIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/property_map/property_map.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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/dag_shortest_paths.hpp:116: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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 116 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 117 | distance_map.begin(), id, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/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(); } | ^ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ 568 | BOOST_concept(BidirectionalIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/property_map/property_map.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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/dag_shortest_paths.hpp:116: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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 116 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 117 | distance_map.begin(), id, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/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(); } | ^ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/property_map/property_map.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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/dag_shortest_paths.hpp:116: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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 116 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 117 | distance_map.begin(), id, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/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(); } | ^ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/property_map/property_map.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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/dag_shortest_paths.hpp:116: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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 116 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 117 | distance_map.begin(), id, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/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(); } | ^ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/property_map/property_map.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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/dag_shortest_paths.hpp:116: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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 116 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 117 | distance_map.begin(), id, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/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(); } | ^ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /usr/local/lib/R/library/BH/include/boost/property_map/property_map.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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/dag_shortest_paths.hpp:116: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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 116 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 117 | distance_map.begin(), id, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:8: /usr/local/lib/R/library/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)) | ^~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /usr/local/lib/R/library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ 502 | BOOST_concept(InputIterator,(TT)) | ^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ 540 | BOOST_concept(ForwardIterator,(TT)) | ^~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ 568 | BOOST_concept(BidirectionalIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/property_map/property_map.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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 120 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 121 | color_map.begin(), id, color_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/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(); } | ^ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ 502 | BOOST_concept(InputIterator,(TT)) | ^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ 540 | BOOST_concept(ForwardIterator,(TT)) | ^~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ 568 | BOOST_concept(BidirectionalIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/property_map/property_map.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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 120 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 121 | color_map.begin(), id, color_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/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(); } | ^ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ 540 | BOOST_concept(ForwardIterator,(TT)) | ^~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ 568 | BOOST_concept(BidirectionalIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/property_map/property_map.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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 120 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 121 | color_map.begin(), id, color_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/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(); } | ^ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ 568 | BOOST_concept(BidirectionalIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/property_map/property_map.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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 120 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 121 | color_map.begin(), id, color_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/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(); } | ^ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/property_map/property_map.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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 120 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 121 | color_map.begin(), id, color_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/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(); } | ^ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/property_map/property_map.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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 120 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 121 | color_map.begin(), id, color_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/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(); } | ^ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/property_map/property_map.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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 120 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 121 | color_map.begin(), id, color_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/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(); } | ^ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /usr/local/lib/R/library/BH/include/boost/property_map/property_map.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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 120 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 121 | color_map.begin(), id, color_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/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)) | ^~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /usr/local/lib/R/library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’: /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ 502 | BOOST_concept(InputIterator,(TT)) | ^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ 540 | BOOST_concept(ForwardIterator,(TT)) | ^~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ 568 | BOOST_concept(BidirectionalIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/property_map/property_map.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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/dag_shortest_paths.hpp:116: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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 116 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 117 | distance_map.begin(), id, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/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() | ^ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’: /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ 502 | BOOST_concept(InputIterator,(TT)) | ^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ 540 | BOOST_concept(ForwardIterator,(TT)) | ^~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ 568 | BOOST_concept(BidirectionalIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/property_map/property_map.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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/dag_shortest_paths.hpp:116: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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 116 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 117 | distance_map.begin(), id, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/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() | ^ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’: /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ 540 | BOOST_concept(ForwardIterator,(TT)) | ^~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ 568 | BOOST_concept(BidirectionalIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/property_map/property_map.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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/dag_shortest_paths.hpp:116: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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 116 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 117 | distance_map.begin(), id, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/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() | ^ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’: /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ 568 | BOOST_concept(BidirectionalIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/property_map/property_map.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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/dag_shortest_paths.hpp:116: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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 116 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 117 | distance_map.begin(), id, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/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() | ^ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’: /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/property_map/property_map.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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/dag_shortest_paths.hpp:116: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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 116 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 117 | distance_map.begin(), id, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/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() | ^ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’: /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/property_map/property_map.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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/dag_shortest_paths.hpp:116: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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 116 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 117 | distance_map.begin(), id, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/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() | ^ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’: /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/property_map/property_map.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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/dag_shortest_paths.hpp:116: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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 116 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 117 | distance_map.begin(), id, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/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() | ^ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’: /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ 502 | BOOST_concept(InputIterator,(TT)) | ^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ 540 | BOOST_concept(ForwardIterator,(TT)) | ^~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ 568 | BOOST_concept(BidirectionalIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/property_map/property_map.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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 120 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 121 | color_map.begin(), id, color_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/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() | ^ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’: /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ 502 | BOOST_concept(InputIterator,(TT)) | ^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ 540 | BOOST_concept(ForwardIterator,(TT)) | ^~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ 568 | BOOST_concept(BidirectionalIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/property_map/property_map.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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 120 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 121 | color_map.begin(), id, color_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/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() | ^ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’: /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ 540 | BOOST_concept(ForwardIterator,(TT)) | ^~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ 568 | BOOST_concept(BidirectionalIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/property_map/property_map.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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 120 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 121 | color_map.begin(), id, color_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/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() | ^ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’: /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ 568 | BOOST_concept(BidirectionalIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/property_map/property_map.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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 120 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 121 | color_map.begin(), id, color_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/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() | ^ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’: /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/property_map/property_map.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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 120 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 121 | color_map.begin(), id, color_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/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() | ^ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’: /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/property_map/property_map.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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 120 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 121 | color_map.begin(), id, color_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/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() | ^ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’: /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/property_map/property_map.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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 120 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 121 | color_map.begin(), id, color_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/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() | ^ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/property_map/property_map.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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/dag_shortest_paths.hpp:116: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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 116 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 117 | distance_map.begin(), id, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/property_map/property_map.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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/dag_shortest_paths.hpp:116: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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 116 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 117 | distance_map.begin(), id, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/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() | ^ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::SignedInteger]’: /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:514:9: required from ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ 540 | BOOST_concept(ForwardIterator,(TT)) | ^~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:568:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/property_map/property_map.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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/dag_shortest_paths.hpp:116: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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 116 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 117 | distance_map.begin(), id, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:107:22: note: in a call to non-static member function ‘boost::SignedInteger::~SignedInteger()’ 107 | template <> struct SignedInteger {}; | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:515:9: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/property_map/property_map.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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/dag_shortest_paths.hpp:116: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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 116 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 117 | distance_map.begin(), id, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ 540 | BOOST_concept(ForwardIterator,(TT)) | ^~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:568:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/property_map/property_map.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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/dag_shortest_paths.hpp:116: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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 116 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 117 | distance_map.begin(), id, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/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() | ^ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:545:11: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/property_map/property_map.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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/dag_shortest_paths.hpp:116: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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 116 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 117 | distance_map.begin(), id, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:545:11: required from ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ 568 | BOOST_concept(BidirectionalIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/property_map/property_map.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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/dag_shortest_paths.hpp:116: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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 116 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 117 | distance_map.begin(), id, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/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() | ^ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:573:11: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/property_map/property_map.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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/dag_shortest_paths.hpp:116: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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 116 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 117 | distance_map.begin(), id, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:573:11: required from ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/property_map/property_map.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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/dag_shortest_paths.hpp:116: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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 116 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 117 | distance_map.begin(), id, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/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() | ^ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/property_map/property_map.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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/dag_shortest_paths.hpp:116: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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 116 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 117 | distance_map.begin(), id, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/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() | ^ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property > > >]’: /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph, boost::property > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph, boost::property > >’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept, boost::property > >’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept, boost::property > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/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, property >; 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]’ 417 | detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map, long unsigned int>, double, 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 = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ 42 | depth_first_visit(g, s, topo_visitor, color); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 90 | dag_shortest_paths(g, s, distance, weight, color, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 91 | choose_param(get_param(params, vertex_predecessor), p_map), vis, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 92 | choose_param( | ~~~~~~~~~~~~~ 93 | get_param(params, distance_compare_t()), std::less< D >()), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 94 | choose_param( | ~~~~~~~~~~~~~ 95 | get_param(params, distance_combine_t()), closed_plus< D >(inf)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 96 | inf, choose_param(get_param(params, distance_zero_t()), D())); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 114 | dag_sp_dispatch2(g, s, | ~~~~~~~~~~~~~~~~^~~~~~ 115 | choose_param(distance, | ~~~~~~~~~~~~~~~~~~~~~~ 116 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | distance_map.begin(), id, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 118 | weight, | ~~~~~~~ 119 | choose_param(color, | ~~~~~~~~~~~~~~~~~~~ 120 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 121 | color_map.begin(), id, color_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 122 | id, vis, params); | ~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/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(); } | ^ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property > > >]’: /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph, boost::property > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept, boost::property > >’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept, boost::property > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/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, property >; 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]’ 417 | detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map, long unsigned int>, double, 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 = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ 42 | depth_first_visit(g, s, topo_visitor, color); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 90 | dag_shortest_paths(g, s, distance, weight, color, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 91 | choose_param(get_param(params, vertex_predecessor), p_map), vis, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 92 | choose_param( | ~~~~~~~~~~~~~ 93 | get_param(params, distance_compare_t()), std::less< D >()), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 94 | choose_param( | ~~~~~~~~~~~~~ 95 | get_param(params, distance_combine_t()), closed_plus< D >(inf)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 96 | inf, choose_param(get_param(params, distance_zero_t()), D())); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 114 | dag_sp_dispatch2(g, s, | ~~~~~~~~~~~~~~~~^~~~~~ 115 | choose_param(distance, | ~~~~~~~~~~~~~~~~~~~~~~ 116 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | distance_map.begin(), id, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 118 | weight, | ~~~~~~~ 119 | choose_param(color, | ~~~~~~~~~~~~~~~~~~~ 120 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 121 | color_map.begin(), id, color_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 122 | id, vis, params); | ~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/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(); } | ^ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept, boost::property > >]’: /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list, boost::property >; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::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]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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, property >; 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]’ 417 | detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map, long unsigned int>, double, 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 = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ 42 | depth_first_visit(g, s, topo_visitor, color); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 90 | dag_shortest_paths(g, s, distance, weight, color, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 91 | choose_param(get_param(params, vertex_predecessor), p_map), vis, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 92 | choose_param( | ~~~~~~~~~~~~~ 93 | get_param(params, distance_compare_t()), std::less< D >()), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 94 | choose_param( | ~~~~~~~~~~~~~ 95 | get_param(params, distance_combine_t()), closed_plus< D >(inf)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 96 | inf, choose_param(get_param(params, distance_zero_t()), D())); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 114 | dag_sp_dispatch2(g, s, | ~~~~~~~~~~~~~~~~^~~~~~ 115 | choose_param(distance, | ~~~~~~~~~~~~~~~~~~~~~~ 116 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | distance_map.begin(), id, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 118 | weight, | ~~~~~~~ 119 | choose_param(color, | ~~~~~~~~~~~~~~~~~~~ 120 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 121 | color_map.begin(), id, color_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 122 | id, vis, params); | ~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/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 > | ^~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /usr/local/lib/R/library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::DFSVisitorConcept > >, boost::adjacency_list, boost::property > >]’: /usr/local/lib/R/library/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, boost::property >; 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]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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, property >; 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]’ 417 | detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map, long unsigned int>, double, 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 = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ 42 | depth_first_visit(g, s, topo_visitor, color); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 90 | dag_shortest_paths(g, s, distance, weight, color, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 91 | choose_param(get_param(params, vertex_predecessor), p_map), vis, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 92 | choose_param( | ~~~~~~~~~~~~~ 93 | get_param(params, distance_compare_t()), std::less< D >()), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 94 | choose_param( | ~~~~~~~~~~~~~ 95 | get_param(params, distance_combine_t()), closed_plus< D >(inf)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 96 | inf, choose_param(get_param(params, distance_zero_t()), D())); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 114 | dag_sp_dispatch2(g, s, | ~~~~~~~~~~~~~~~~^~~~~~ 115 | choose_param(distance, | ~~~~~~~~~~~~~~~~~~~~~~ 116 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | distance_map.begin(), id, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 118 | weight, | ~~~~~~~ 119 | choose_param(color, | ~~~~~~~~~~~~~~~~~~~ 120 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 121 | color_map.begin(), id, color_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 122 | id, vis, params); | ~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 /usr/local/lib/R/library/BH/include/boost/graph/topological_sort.hpp:16: /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::topo_sort_visitor > >; Graph = boost::adjacency_list, boost::property >]’ 39 | void constraints() | ^~~~~~~~~~~ /usr/local/lib/R/library/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>]’: /usr/local/lib/R/library/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 = 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]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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, property >; 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]’ 417 | detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map, long unsigned int>, double, 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 = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ 42 | depth_first_visit(g, s, topo_visitor, color); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 90 | dag_shortest_paths(g, s, distance, weight, color, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 91 | choose_param(get_param(params, vertex_predecessor), p_map), vis, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 92 | choose_param( | ~~~~~~~~~~~~~ 93 | get_param(params, distance_compare_t()), std::less< D >()), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 94 | choose_param( | ~~~~~~~~~~~~~ 95 | get_param(params, distance_combine_t()), closed_plus< D >(inf)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 96 | inf, choose_param(get_param(params, distance_zero_t()), D())); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 114 | dag_sp_dispatch2(g, s, | ~~~~~~~~~~~~~~~~^~~~~~ 115 | choose_param(distance, | ~~~~~~~~~~~~~~~~~~~~~~ 116 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | distance_map.begin(), id, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 118 | weight, | ~~~~~~~ 119 | choose_param(color, | ~~~~~~~~~~~~~~~~~~~ 120 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 121 | color_map.begin(), id, color_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 122 | id, vis, params); | ~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/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() { | ^~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/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, property >; 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]’ 417 | detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map, long unsigned int>, double, 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 = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ 42 | depth_first_visit(g, s, topo_visitor, color); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 90 | dag_shortest_paths(g, s, distance, weight, color, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 91 | choose_param(get_param(params, vertex_predecessor), p_map), vis, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 92 | choose_param( | ~~~~~~~~~~~~~ 93 | get_param(params, distance_compare_t()), std::less< D >()), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 94 | choose_param( | ~~~~~~~~~~~~~ 95 | get_param(params, distance_combine_t()), closed_plus< D >(inf)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 96 | inf, choose_param(get_param(params, distance_zero_t()), D())); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 114 | dag_sp_dispatch2(g, s, | ~~~~~~~~~~~~~~~~^~~~~~ 115 | choose_param(distance, | ~~~~~~~~~~~~~~~~~~~~~~ 116 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | distance_map.begin(), id, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 118 | weight, | ~~~~~~~ 119 | choose_param(color, | ~~~~~~~~~~~~~~~~~~~ 120 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 121 | color_map.begin(), id, color_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 122 | id, vis, params); | ~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/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(); } | ^ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/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, property >; 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]’ 417 | detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map, long unsigned int>, double, 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 = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ 42 | depth_first_visit(g, s, topo_visitor, color); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 90 | dag_shortest_paths(g, s, distance, weight, color, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 91 | choose_param(get_param(params, vertex_predecessor), p_map), vis, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 92 | choose_param( | ~~~~~~~~~~~~~ 93 | get_param(params, distance_compare_t()), std::less< D >()), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 94 | choose_param( | ~~~~~~~~~~~~~ 95 | get_param(params, distance_combine_t()), closed_plus< D >(inf)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 96 | inf, choose_param(get_param(params, distance_zero_t()), D())); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 114 | dag_sp_dispatch2(g, s, | ~~~~~~~~~~~~~~~~^~~~~~ 115 | choose_param(distance, | ~~~~~~~~~~~~~~~~~~~~~~ 116 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | distance_map.begin(), id, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 118 | weight, | ~~~~~~~ 119 | choose_param(color, | ~~~~~~~~~~~~~~~~~~~ 120 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 121 | color_map.begin(), id, color_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 122 | id, vis, params); | ~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/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(); } | ^ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:505:5: required from ‘struct boost::concepts::ColorValue’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/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, property >; 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]’ 417 | detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map, long unsigned int>, double, 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 = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ 42 | depth_first_visit(g, s, topo_visitor, color); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 90 | dag_shortest_paths(g, s, distance, weight, color, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 91 | choose_param(get_param(params, vertex_predecessor), p_map), vis, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 92 | choose_param( | ~~~~~~~~~~~~~ 93 | get_param(params, distance_compare_t()), std::less< D >()), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 94 | choose_param( | ~~~~~~~~~~~~~ 95 | get_param(params, distance_combine_t()), closed_plus< D >(inf)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 96 | inf, choose_param(get_param(params, distance_zero_t()), D())); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 114 | dag_sp_dispatch2(g, s, | ~~~~~~~~~~~~~~~~^~~~~~ 115 | choose_param(distance, | ~~~~~~~~~~~~~~~~~~~~~~ 116 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | distance_map.begin(), id, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 118 | weight, | ~~~~~~~ 119 | choose_param(color, | ~~~~~~~~~~~~~~~~~~~ 120 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 121 | color_map.begin(), id, color_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 122 | id, vis, params); | ~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/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(); } | ^ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::ColorValueConcept]’: /usr/local/lib/R/library/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 = 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]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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, property >; 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]’ 417 | detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map, long unsigned int>, double, 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 = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ 42 | depth_first_visit(g, s, topo_visitor, color); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 90 | dag_shortest_paths(g, s, distance, weight, color, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 91 | choose_param(get_param(params, vertex_predecessor), p_map), vis, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 92 | choose_param( | ~~~~~~~~~~~~~ 93 | get_param(params, distance_compare_t()), std::less< D >()), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 94 | choose_param( | ~~~~~~~~~~~~~ 95 | get_param(params, distance_combine_t()), closed_plus< D >(inf)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 96 | inf, choose_param(get_param(params, distance_zero_t()), D())); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 114 | dag_sp_dispatch2(g, s, | ~~~~~~~~~~~~~~~~^~~~~~ 115 | choose_param(distance, | ~~~~~~~~~~~~~~~~~~~~~~ 116 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | distance_map.begin(), id, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 118 | weight, | ~~~~~~~ 119 | choose_param(color, | ~~~~~~~~~~~~~~~~~~~ 120 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 121 | color_map.begin(), id, color_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 122 | id, vis, params); | ~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/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)) | ^~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /usr/local/lib/R/library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:502:1: note: in expansion of macro ‘BOOST_concept’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/property_map/property_map.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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/dag_shortest_paths.hpp:116: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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 116 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 117 | distance_map.begin(), id, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/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() | ^ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/property_map/property_map.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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/dag_shortest_paths.hpp:116: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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 116 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 117 | distance_map.begin(), id, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/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() | ^ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/property_map/property_map.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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/dag_shortest_paths.hpp:116: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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 116 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 117 | distance_map.begin(), id, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/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() | ^ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph, boost::property > >]’: /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property > > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph, boost::property > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph, boost::property > >’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept, boost::property > >’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept, boost::property > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/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, property >; 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]’ 417 | detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map, long unsigned int>, double, 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 = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ 42 | depth_first_visit(g, s, topo_visitor, color); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 90 | dag_shortest_paths(g, s, distance, weight, color, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 91 | choose_param(get_param(params, vertex_predecessor), p_map), vis, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 92 | choose_param( | ~~~~~~~~~~~~~ 93 | get_param(params, distance_compare_t()), std::less< D >()), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 94 | choose_param( | ~~~~~~~~~~~~~ 95 | get_param(params, distance_combine_t()), closed_plus< D >(inf)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 96 | inf, choose_param(get_param(params, distance_zero_t()), D())); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 114 | dag_sp_dispatch2(g, s, | ~~~~~~~~~~~~~~~~^~~~~~ 115 | choose_param(distance, | ~~~~~~~~~~~~~~~~~~~~~~ 116 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | distance_map.begin(), id, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 118 | weight, | ~~~~~~~ 119 | choose_param(color, | ~~~~~~~~~~~~~~~~~~~ 120 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 121 | color_map.begin(), id, color_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 122 | id, vis, params); | ~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/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() | ^ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph, boost::property > >]’: /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property > > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph, boost::property > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept, boost::property > >’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept, boost::property > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/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, property >; 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]’ 417 | detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map, long unsigned int>, double, 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 = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ 42 | depth_first_visit(g, s, topo_visitor, color); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 90 | dag_shortest_paths(g, s, distance, weight, color, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 91 | choose_param(get_param(params, vertex_predecessor), p_map), vis, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 92 | choose_param( | ~~~~~~~~~~~~~ 93 | get_param(params, distance_compare_t()), std::less< D >()), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 94 | choose_param( | ~~~~~~~~~~~~~ 95 | get_param(params, distance_combine_t()), closed_plus< D >(inf)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 96 | inf, choose_param(get_param(params, distance_zero_t()), D())); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 114 | dag_sp_dispatch2(g, s, | ~~~~~~~~~~~~~~~~^~~~~~ 115 | choose_param(distance, | ~~~~~~~~~~~~~~~~~~~~~~ 116 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | distance_map.begin(), id, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 118 | weight, | ~~~~~~~ 119 | choose_param(color, | ~~~~~~~~~~~~~~~~~~~ 120 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 121 | color_map.begin(), id, color_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 122 | id, vis, params); | ~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/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() | ^ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible > > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept > > >’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept > > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/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, property >; 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]’ 417 | detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map, long unsigned int>, double, 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 = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ 42 | depth_first_visit(g, s, topo_visitor, color); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 90 | dag_shortest_paths(g, s, distance, weight, color, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 91 | choose_param(get_param(params, vertex_predecessor), p_map), vis, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 92 | choose_param( | ~~~~~~~~~~~~~ 93 | get_param(params, distance_compare_t()), std::less< D >()), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 94 | choose_param( | ~~~~~~~~~~~~~ 95 | get_param(params, distance_combine_t()), closed_plus< D >(inf)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 96 | inf, choose_param(get_param(params, distance_zero_t()), D())); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 114 | dag_sp_dispatch2(g, s, | ~~~~~~~~~~~~~~~~^~~~~~ 115 | choose_param(distance, | ~~~~~~~~~~~~~~~~~~~~~~ 116 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | distance_map.begin(), id, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 118 | weight, | ~~~~~~~ 119 | choose_param(color, | ~~~~~~~~~~~~~~~~~~~ 120 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 121 | color_map.begin(), id, color_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 122 | id, vis, params); | ~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/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(); } | ^ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept > > >]’: /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::topo_sort_visitor > >; Graph = boost::adjacency_list, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DFSVisitorConcept > >, boost::adjacency_list, boost::property > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::adjacency_list, boost::property > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::adjacency_list, boost::property > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/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, property >; 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]’ 417 | detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map, long unsigned int>, double, 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 = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ 42 | depth_first_visit(g, s, topo_visitor, color); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 90 | dag_shortest_paths(g, s, distance, weight, color, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 91 | choose_param(get_param(params, vertex_predecessor), p_map), vis, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 92 | choose_param( | ~~~~~~~~~~~~~ 93 | get_param(params, distance_compare_t()), std::less< D >()), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 94 | choose_param( | ~~~~~~~~~~~~~ 95 | get_param(params, distance_combine_t()), closed_plus< D >(inf)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 96 | inf, choose_param(get_param(params, distance_zero_t()), D())); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 114 | dag_sp_dispatch2(g, s, | ~~~~~~~~~~~~~~~~^~~~~~ 115 | choose_param(distance, | ~~~~~~~~~~~~~~~~~~~~~~ 116 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | distance_map.begin(), id, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 118 | weight, | ~~~~~~~ 119 | choose_param(color, | ~~~~~~~~~~~~~~~~~~~ 120 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 121 | color_map.begin(), id, color_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 122 | id, vis, params); | ~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/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)) | ^~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /usr/local/lib/R/library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ /usr/local/lib/R/library/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>]’: /usr/local/lib/R/library/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]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_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>]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/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> >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/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, property >; 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]’ 417 | detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map, long unsigned int>, double, 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 = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ 42 | depth_first_visit(g, s, topo_visitor, color); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 90 | dag_shortest_paths(g, s, distance, weight, color, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 91 | choose_param(get_param(params, vertex_predecessor), p_map), vis, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 92 | choose_param( | ~~~~~~~~~~~~~ 93 | get_param(params, distance_compare_t()), std::less< D >()), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 94 | choose_param( | ~~~~~~~~~~~~~ 95 | get_param(params, distance_combine_t()), closed_plus< D >(inf)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 96 | inf, choose_param(get_param(params, distance_zero_t()), D())); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 114 | dag_sp_dispatch2(g, s, | ~~~~~~~~~~~~~~~~^~~~~~ 115 | choose_param(distance, | ~~~~~~~~~~~~~~~~~~~~~~ 116 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | distance_map.begin(), id, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 118 | weight, | ~~~~~~~ 119 | choose_param(color, | ~~~~~~~~~~~~~~~~~~~ 120 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 121 | color_map.begin(), id, color_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 122 | id, vis, params); | ~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/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() { | ^~~~~~~~~~~ /usr/local/lib/R/library/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>]’: /usr/local/lib/R/library/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]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_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>]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/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> >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/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, property >; 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]’ 417 | detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map, long unsigned int>, double, 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 = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ 42 | depth_first_visit(g, s, topo_visitor, color); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 90 | dag_shortest_paths(g, s, distance, weight, color, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 91 | choose_param(get_param(params, vertex_predecessor), p_map), vis, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 92 | choose_param( | ~~~~~~~~~~~~~ 93 | get_param(params, distance_compare_t()), std::less< D >()), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 94 | choose_param( | ~~~~~~~~~~~~~ 95 | get_param(params, distance_combine_t()), closed_plus< D >(inf)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 96 | inf, choose_param(get_param(params, distance_zero_t()), D())); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 114 | dag_sp_dispatch2(g, s, | ~~~~~~~~~~~~~~~~^~~~~~ 115 | choose_param(distance, | ~~~~~~~~~~~~~~~~~~~~~~ 116 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | distance_map.begin(), id, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 118 | weight, | ~~~~~~~ 119 | choose_param(color, | ~~~~~~~~~~~~~~~~~~~ 120 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 121 | color_map.begin(), id, color_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 122 | id, vis, params); | ~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/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() { | ^~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/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, property >; 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]’ 417 | detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map, long unsigned int>, double, 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 = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ 42 | depth_first_visit(g, s, topo_visitor, color); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 90 | dag_shortest_paths(g, s, distance, weight, color, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 91 | choose_param(get_param(params, vertex_predecessor), p_map), vis, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 92 | choose_param( | ~~~~~~~~~~~~~ 93 | get_param(params, distance_compare_t()), std::less< D >()), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 94 | choose_param( | ~~~~~~~~~~~~~ 95 | get_param(params, distance_combine_t()), closed_plus< D >(inf)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 96 | inf, choose_param(get_param(params, distance_zero_t()), D())); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 114 | dag_sp_dispatch2(g, s, | ~~~~~~~~~~~~~~~~^~~~~~ 115 | choose_param(distance, | ~~~~~~~~~~~~~~~~~~~~~~ 116 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | distance_map.begin(), id, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 118 | weight, | ~~~~~~~ 119 | choose_param(color, | ~~~~~~~~~~~~~~~~~~~ 120 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 121 | color_map.begin(), id, color_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 122 | id, vis, params); | ~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /usr/local/lib/R/library/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]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_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>]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/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> >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/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, property >; 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]’ 417 | detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map, long unsigned int>, double, 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 = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ 42 | depth_first_visit(g, s, topo_visitor, color); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 90 | dag_shortest_paths(g, s, distance, weight, color, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 91 | choose_param(get_param(params, vertex_predecessor), p_map), vis, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 92 | choose_param( | ~~~~~~~~~~~~~ 93 | get_param(params, distance_compare_t()), std::less< D >()), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 94 | choose_param( | ~~~~~~~~~~~~~ 95 | get_param(params, distance_combine_t()), closed_plus< D >(inf)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 96 | inf, choose_param(get_param(params, distance_zero_t()), D())); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 114 | dag_sp_dispatch2(g, s, | ~~~~~~~~~~~~~~~~^~~~~~ 115 | choose_param(distance, | ~~~~~~~~~~~~~~~~~~~~~~ 116 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | distance_map.begin(), id, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 118 | weight, | ~~~~~~~ 119 | choose_param(color, | ~~~~~~~~~~~~~~~~~~~ 120 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 121 | color_map.begin(), id, color_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 122 | id, vis, params); | ~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/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)) | ^~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /usr/local/lib/R/library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/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, property >; 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]’ 417 | detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map, long unsigned int>, double, 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 = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ 42 | depth_first_visit(g, s, topo_visitor, color); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 90 | dag_shortest_paths(g, s, distance, weight, color, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 91 | choose_param(get_param(params, vertex_predecessor), p_map), vis, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 92 | choose_param( | ~~~~~~~~~~~~~ 93 | get_param(params, distance_compare_t()), std::less< D >()), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 94 | choose_param( | ~~~~~~~~~~~~~ 95 | get_param(params, distance_combine_t()), closed_plus< D >(inf)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 96 | inf, choose_param(get_param(params, distance_zero_t()), D())); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 114 | dag_sp_dispatch2(g, s, | ~~~~~~~~~~~~~~~~^~~~~~ 115 | choose_param(distance, | ~~~~~~~~~~~~~~~~~~~~~~ 116 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | distance_map.begin(), id, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 118 | weight, | ~~~~~~~ 119 | choose_param(color, | ~~~~~~~~~~~~~~~~~~~ 120 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 121 | color_map.begin(), id, color_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 122 | id, vis, params); | ~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/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() | ^ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’: /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/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, property >; 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]’ 417 | detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map, long unsigned int>, double, 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 = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ 42 | depth_first_visit(g, s, topo_visitor, color); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 90 | dag_shortest_paths(g, s, distance, weight, color, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 91 | choose_param(get_param(params, vertex_predecessor), p_map), vis, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 92 | choose_param( | ~~~~~~~~~~~~~ 93 | get_param(params, distance_compare_t()), std::less< D >()), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 94 | choose_param( | ~~~~~~~~~~~~~ 95 | get_param(params, distance_combine_t()), closed_plus< D >(inf)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 96 | inf, choose_param(get_param(params, distance_zero_t()), D())); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 114 | dag_sp_dispatch2(g, s, | ~~~~~~~~~~~~~~~~^~~~~~ 115 | choose_param(distance, | ~~~~~~~~~~~~~~~~~~~~~~ 116 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | distance_map.begin(), id, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 118 | weight, | ~~~~~~~ 119 | choose_param(color, | ~~~~~~~~~~~~~~~~~~~ 120 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 121 | color_map.begin(), id, color_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 122 | id, vis, params); | ~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/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() | ^ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::ColorValue]’: /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:505:5: required from ‘struct boost::concepts::ColorValue’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/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, property >; 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]’ 417 | detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map, long unsigned int>, double, 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 = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ 42 | depth_first_visit(g, s, topo_visitor, color); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 90 | dag_shortest_paths(g, s, distance, weight, color, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 91 | choose_param(get_param(params, vertex_predecessor), p_map), vis, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 92 | choose_param( | ~~~~~~~~~~~~~ 93 | get_param(params, distance_compare_t()), std::less< D >()), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 94 | choose_param( | ~~~~~~~~~~~~~ 95 | get_param(params, distance_combine_t()), closed_plus< D >(inf)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 96 | inf, choose_param(get_param(params, distance_zero_t()), D())); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 114 | dag_sp_dispatch2(g, s, | ~~~~~~~~~~~~~~~~^~~~~~ 115 | choose_param(distance, | ~~~~~~~~~~~~~~~~~~~~~~ 116 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | distance_map.begin(), id, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 118 | weight, | ~~~~~~~ 119 | choose_param(color, | ~~~~~~~~~~~~~~~~~~~ 120 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 121 | color_map.begin(), id, color_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 122 | id, vis, params); | ~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/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() | ^ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:505:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 505 | BOOST_CONCEPT_USAGE(ColorValue) | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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> > >]’: /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/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, property >; 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]’ 417 | detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map, long unsigned int>, double, 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 = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ 42 | depth_first_visit(g, s, topo_visitor, color); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 90 | dag_shortest_paths(g, s, distance, weight, color, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 91 | choose_param(get_param(params, vertex_predecessor), p_map), vis, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 92 | choose_param( | ~~~~~~~~~~~~~ 93 | get_param(params, distance_compare_t()), std::less< D >()), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 94 | choose_param( | ~~~~~~~~~~~~~ 95 | get_param(params, distance_combine_t()), closed_plus< D >(inf)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 96 | inf, choose_param(get_param(params, distance_zero_t()), D())); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 114 | dag_sp_dispatch2(g, s, | ~~~~~~~~~~~~~~~~^~~~~~ 115 | choose_param(distance, | ~~~~~~~~~~~~~~~~~~~~~~ 116 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | distance_map.begin(), id, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 118 | weight, | ~~~~~~~ 119 | choose_param(color, | ~~~~~~~~~~~~~~~~~~~ 120 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 121 | color_map.begin(), id, color_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 122 | id, vis, params); | ~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/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(); } | ^ /usr/local/lib/R/library/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> >]’: /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept, boost::property > >]’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list, boost::property >; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::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]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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, property >; 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]’ 417 | detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map, long unsigned int>, double, 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 = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ 42 | depth_first_visit(g, s, topo_visitor, color); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 90 | dag_shortest_paths(g, s, distance, weight, color, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 91 | choose_param(get_param(params, vertex_predecessor), p_map), vis, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 92 | choose_param( | ~~~~~~~~~~~~~ 93 | get_param(params, distance_compare_t()), std::less< D >()), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 94 | choose_param( | ~~~~~~~~~~~~~ 95 | get_param(params, distance_combine_t()), closed_plus< D >(inf)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 96 | inf, choose_param(get_param(params, distance_zero_t()), D())); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 114 | dag_sp_dispatch2(g, s, | ~~~~~~~~~~~~~~~~^~~~~~ 115 | choose_param(distance, | ~~~~~~~~~~~~~~~~~~~~~~ 116 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | distance_map.begin(), id, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 118 | weight, | ~~~~~~~ 119 | choose_param(color, | ~~~~~~~~~~~~~~~~~~~ 120 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 121 | color_map.begin(), id, color_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 122 | id, vis, params); | ~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/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() | ^ /usr/local/lib/R/library/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( | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:90:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/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, property >; 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]’ 417 | detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map, long unsigned int>, double, 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 = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ 42 | depth_first_visit(g, s, topo_visitor, color); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 90 | dag_shortest_paths(g, s, distance, weight, color, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 91 | choose_param(get_param(params, vertex_predecessor), p_map), vis, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 92 | choose_param( | ~~~~~~~~~~~~~ 93 | get_param(params, distance_compare_t()), std::less< D >()), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 94 | choose_param( | ~~~~~~~~~~~~~ 95 | get_param(params, distance_combine_t()), closed_plus< D >(inf)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 96 | inf, choose_param(get_param(params, distance_zero_t()), D())); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 114 | dag_sp_dispatch2(g, s, | ~~~~~~~~~~~~~~~~^~~~~~ 115 | choose_param(distance, | ~~~~~~~~~~~~~~~~~~~~~~ 116 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | distance_map.begin(), id, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 118 | weight, | ~~~~~~~ 119 | choose_param(color, | ~~~~~~~~~~~~~~~~~~~ 120 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 121 | color_map.begin(), id, color_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 122 | id, vis, params); | ~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/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(); } | ^ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible >]’: /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept, boost::property > >]’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list, boost::property >; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::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]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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, property >; 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]’ 417 | detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map, long unsigned int>, double, 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 = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ 42 | depth_first_visit(g, s, topo_visitor, color); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 90 | dag_shortest_paths(g, s, distance, weight, color, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 91 | choose_param(get_param(params, vertex_predecessor), p_map), vis, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 92 | choose_param( | ~~~~~~~~~~~~~ 93 | get_param(params, distance_compare_t()), std::less< D >()), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 94 | choose_param( | ~~~~~~~~~~~~~ 95 | get_param(params, distance_combine_t()), closed_plus< D >(inf)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 96 | inf, choose_param(get_param(params, distance_zero_t()), D())); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 114 | dag_sp_dispatch2(g, s, | ~~~~~~~~~~~~~~~~^~~~~~ 115 | choose_param(distance, | ~~~~~~~~~~~~~~~~~~~~~~ 116 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | distance_map.begin(), id, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 118 | weight, | ~~~~~~~ 119 | choose_param(color, | ~~~~~~~~~~~~~~~~~~~ 120 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 121 | color_map.begin(), id, color_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 122 | id, vis, params); | ~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/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() | ^ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:91:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/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, property >; 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]’ 417 | detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map, long unsigned int>, double, 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 = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ 42 | depth_first_visit(g, s, topo_visitor, color); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 90 | dag_shortest_paths(g, s, distance, weight, color, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 91 | choose_param(get_param(params, vertex_predecessor), p_map), vis, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 92 | choose_param( | ~~~~~~~~~~~~~ 93 | get_param(params, distance_compare_t()), std::less< D >()), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 94 | choose_param( | ~~~~~~~~~~~~~ 95 | get_param(params, distance_combine_t()), closed_plus< D >(inf)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 96 | inf, choose_param(get_param(params, distance_zero_t()), D())); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 114 | dag_sp_dispatch2(g, s, | ~~~~~~~~~~~~~~~~^~~~~~ 115 | choose_param(distance, | ~~~~~~~~~~~~~~~~~~~~~~ 116 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | distance_map.begin(), id, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 118 | weight, | ~~~~~~~ 119 | choose_param(color, | ~~~~~~~~~~~~~~~~~~~ 120 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 121 | color_map.begin(), id, color_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 122 | id, vis, params); | ~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/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(); } | ^ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable >]’: /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept, boost::property > >]’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list, boost::property >; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::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]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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, property >; 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]’ 417 | detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map, long unsigned int>, double, 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 = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ 42 | depth_first_visit(g, s, topo_visitor, color); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 90 | dag_shortest_paths(g, s, distance, weight, color, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 91 | choose_param(get_param(params, vertex_predecessor), p_map), vis, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 92 | choose_param( | ~~~~~~~~~~~~~ 93 | get_param(params, distance_compare_t()), std::less< D >()), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 94 | choose_param( | ~~~~~~~~~~~~~ 95 | get_param(params, distance_combine_t()), closed_plus< D >(inf)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 96 | inf, choose_param(get_param(params, distance_zero_t()), D())); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 114 | dag_sp_dispatch2(g, s, | ~~~~~~~~~~~~~~~~^~~~~~ 115 | choose_param(distance, | ~~~~~~~~~~~~~~~~~~~~~~ 116 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | distance_map.begin(), id, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 118 | weight, | ~~~~~~~ 119 | choose_param(color, | ~~~~~~~~~~~~~~~~~~~ 120 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 121 | color_map.begin(), id, color_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 122 | id, vis, params); | ~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/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() | ^ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:92:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/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, property >; 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]’ 417 | detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map, long unsigned int>, double, 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 = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ 42 | depth_first_visit(g, s, topo_visitor, color); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 90 | dag_shortest_paths(g, s, distance, weight, color, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 91 | choose_param(get_param(params, vertex_predecessor), p_map), vis, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 92 | choose_param( | ~~~~~~~~~~~~~ 93 | get_param(params, distance_compare_t()), std::less< D >()), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 94 | choose_param( | ~~~~~~~~~~~~~ 95 | get_param(params, distance_combine_t()), closed_plus< D >(inf)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 96 | inf, choose_param(get_param(params, distance_zero_t()), D())); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 114 | dag_sp_dispatch2(g, s, | ~~~~~~~~~~~~~~~~^~~~~~ 115 | choose_param(distance, | ~~~~~~~~~~~~~~~~~~~~~~ 116 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | distance_map.begin(), id, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 118 | weight, | ~~~~~~~ 119 | choose_param(color, | ~~~~~~~~~~~~~~~~~~~ 120 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 121 | color_map.begin(), id, color_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 122 | id, vis, params); | ~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/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(); } | ^ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable >]’: /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept, boost::property > >]’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list, boost::property >; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::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]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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, property >; 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]’ 417 | detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map, long unsigned int>, double, 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 = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ 42 | depth_first_visit(g, s, topo_visitor, color); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 90 | dag_shortest_paths(g, s, distance, weight, color, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 91 | choose_param(get_param(params, vertex_predecessor), p_map), vis, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 92 | choose_param( | ~~~~~~~~~~~~~ 93 | get_param(params, distance_compare_t()), std::less< D >()), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 94 | choose_param( | ~~~~~~~~~~~~~ 95 | get_param(params, distance_combine_t()), closed_plus< D >(inf)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 96 | inf, choose_param(get_param(params, distance_zero_t()), D())); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 114 | dag_sp_dispatch2(g, s, | ~~~~~~~~~~~~~~~~^~~~~~ 115 | choose_param(distance, | ~~~~~~~~~~~~~~~~~~~~~~ 116 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | distance_map.begin(), id, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 118 | weight, | ~~~~~~~ 119 | choose_param(color, | ~~~~~~~~~~~~~~~~~~~ 120 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 121 | color_map.begin(), id, color_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 122 | id, vis, params); | ~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/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() | ^ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:93:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/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, property >; 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]’ 417 | detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map, long unsigned int>, double, 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 = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ 42 | depth_first_visit(g, s, topo_visitor, color); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 90 | dag_shortest_paths(g, s, distance, weight, color, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 91 | choose_param(get_param(params, vertex_predecessor), p_map), vis, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 92 | choose_param( | ~~~~~~~~~~~~~ 93 | get_param(params, distance_compare_t()), std::less< D >()), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 94 | choose_param( | ~~~~~~~~~~~~~ 95 | get_param(params, distance_combine_t()), closed_plus< D >(inf)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 96 | inf, choose_param(get_param(params, distance_zero_t()), D())); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 114 | dag_sp_dispatch2(g, s, | ~~~~~~~~~~~~~~~~^~~~~~ 115 | choose_param(distance, | ~~~~~~~~~~~~~~~~~~~~~~ 116 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | distance_map.begin(), id, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 118 | weight, | ~~~~~~~ 119 | choose_param(color, | ~~~~~~~~~~~~~~~~~~~ 120 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 121 | color_map.begin(), id, color_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 122 | id, vis, params); | ~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:93:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept, boost::property > >]’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list, boost::property >; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::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]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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, property >; 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]’ 417 | detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map, long unsigned int>, double, 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 = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ 42 | depth_first_visit(g, s, topo_visitor, color); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 90 | dag_shortest_paths(g, s, distance, weight, color, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 91 | choose_param(get_param(params, vertex_predecessor), p_map), vis, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 92 | choose_param( | ~~~~~~~~~~~~~ 93 | get_param(params, distance_compare_t()), std::less< D >()), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 94 | choose_param( | ~~~~~~~~~~~~~ 95 | get_param(params, distance_combine_t()), closed_plus< D >(inf)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 96 | inf, choose_param(get_param(params, distance_zero_t()), D())); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 114 | dag_sp_dispatch2(g, s, | ~~~~~~~~~~~~~~~~^~~~~~ 115 | choose_param(distance, | ~~~~~~~~~~~~~~~~~~~~~~ 116 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | distance_map.begin(), id, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 118 | weight, | ~~~~~~~ 119 | choose_param(color, | ~~~~~~~~~~~~~~~~~~~ 120 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 121 | color_map.begin(), id, color_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 122 | id, vis, params); | ~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/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() | ^ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible > > >]’: /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible > > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept > > >’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept > > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/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, property >; 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]’ 417 | detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map, long unsigned int>, double, 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 = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ 42 | depth_first_visit(g, s, topo_visitor, color); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 90 | dag_shortest_paths(g, s, distance, weight, color, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 91 | choose_param(get_param(params, vertex_predecessor), p_map), vis, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 92 | choose_param( | ~~~~~~~~~~~~~ 93 | get_param(params, distance_compare_t()), std::less< D >()), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 94 | choose_param( | ~~~~~~~~~~~~~ 95 | get_param(params, distance_combine_t()), closed_plus< D >(inf)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 96 | inf, choose_param(get_param(params, distance_zero_t()), D())); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 114 | dag_sp_dispatch2(g, s, | ~~~~~~~~~~~~~~~~^~~~~~ 115 | choose_param(distance, | ~~~~~~~~~~~~~~~~~~~~~~ 116 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | distance_map.begin(), id, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 118 | weight, | ~~~~~~~ 119 | choose_param(color, | ~~~~~~~~~~~~~~~~~~~ 120 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 121 | color_map.begin(), id, color_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 122 | id, vis, params); | ~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/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() | ^ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/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, property >; 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]’ 417 | detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map, long unsigned int>, double, 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 = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ 42 | depth_first_visit(g, s, topo_visitor, color); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 90 | dag_shortest_paths(g, s, distance, weight, color, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 91 | choose_param(get_param(params, vertex_predecessor), p_map), vis, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 92 | choose_param( | ~~~~~~~~~~~~~ 93 | get_param(params, distance_compare_t()), std::less< D >()), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 94 | choose_param( | ~~~~~~~~~~~~~ 95 | get_param(params, distance_combine_t()), closed_plus< D >(inf)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 96 | inf, choose_param(get_param(params, distance_zero_t()), D())); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 114 | dag_sp_dispatch2(g, s, | ~~~~~~~~~~~~~~~~^~~~~~ 115 | choose_param(distance, | ~~~~~~~~~~~~~~~~~~~~~~ 116 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | distance_map.begin(), id, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 118 | weight, | ~~~~~~~ 119 | choose_param(color, | ~~~~~~~~~~~~~~~~~~~ 120 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 121 | color_map.begin(), id, color_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 122 | id, vis, params); | ~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /usr/local/lib/R/library/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]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_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>]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/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> >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/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>)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/property_map/property_map.hpp:206:7: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/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, property >; 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]’ 417 | detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map, long unsigned int>, double, 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 = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ 42 | depth_first_visit(g, s, topo_visitor, color); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 90 | dag_shortest_paths(g, s, distance, weight, color, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 91 | choose_param(get_param(params, vertex_predecessor), p_map), vis, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 92 | choose_param( | ~~~~~~~~~~~~~ 93 | get_param(params, distance_compare_t()), std::less< D >()), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 94 | choose_param( | ~~~~~~~~~~~~~ 95 | get_param(params, distance_combine_t()), closed_plus< D >(inf)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 96 | inf, choose_param(get_param(params, distance_zero_t()), D())); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 114 | dag_sp_dispatch2(g, s, | ~~~~~~~~~~~~~~~~^~~~~~ 115 | choose_param(distance, | ~~~~~~~~~~~~~~~~~~~~~~ 116 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | distance_map.begin(), id, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 118 | weight, | ~~~~~~~ 119 | choose_param(color, | ~~~~~~~~~~~~~~~~~~~ 120 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 121 | color_map.begin(), id, color_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 122 | id, vis, params); | ~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/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)) | ^~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /usr/local/lib/R/library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/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, property >; 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]’ 417 | detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map, long unsigned int>, double, 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 = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ 42 | depth_first_visit(g, s, topo_visitor, color); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 90 | dag_shortest_paths(g, s, distance, weight, color, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 91 | choose_param(get_param(params, vertex_predecessor), p_map), vis, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 92 | choose_param( | ~~~~~~~~~~~~~ 93 | get_param(params, distance_compare_t()), std::less< D >()), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 94 | choose_param( | ~~~~~~~~~~~~~ 95 | get_param(params, distance_combine_t()), closed_plus< D >(inf)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 96 | inf, choose_param(get_param(params, distance_zero_t()), D())); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 114 | dag_sp_dispatch2(g, s, | ~~~~~~~~~~~~~~~~^~~~~~ 115 | choose_param(distance, | ~~~~~~~~~~~~~~~~~~~~~~ 116 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | distance_map.begin(), id, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 118 | weight, | ~~~~~~~ 119 | choose_param(color, | ~~~~~~~~~~~~~~~~~~~ 120 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 121 | color_map.begin(), id, color_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 122 | id, vis, params); | ~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /usr/local/lib/R/library/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]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_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>]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/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> >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/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>)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/property_map/property_map.hpp:207:7: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/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, property >; 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]’ 417 | detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map, long unsigned int>, double, 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 = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ 42 | depth_first_visit(g, s, topo_visitor, color); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 90 | dag_shortest_paths(g, s, distance, weight, color, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 91 | choose_param(get_param(params, vertex_predecessor), p_map), vis, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 92 | choose_param( | ~~~~~~~~~~~~~ 93 | get_param(params, distance_compare_t()), std::less< D >()), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 94 | choose_param( | ~~~~~~~~~~~~~ 95 | get_param(params, distance_combine_t()), closed_plus< D >(inf)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 96 | inf, choose_param(get_param(params, distance_zero_t()), D())); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 114 | dag_sp_dispatch2(g, s, | ~~~~~~~~~~~~~~~~^~~~~~ 115 | choose_param(distance, | ~~~~~~~~~~~~~~~~~~~~~~ 116 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | distance_map.begin(), id, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 118 | weight, | ~~~~~~~ 119 | choose_param(color, | ~~~~~~~~~~~~~~~~~~~ 120 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 121 | color_map.begin(), id, color_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 122 | id, vis, params); | ~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/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)) | ^~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /usr/local/lib/R/library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/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, property >; 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]’ 417 | detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map, long unsigned int>, double, 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 = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ 42 | depth_first_visit(g, s, topo_visitor, color); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 90 | dag_shortest_paths(g, s, distance, weight, color, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 91 | choose_param(get_param(params, vertex_predecessor), p_map), vis, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 92 | choose_param( | ~~~~~~~~~~~~~ 93 | get_param(params, distance_compare_t()), std::less< D >()), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 94 | choose_param( | ~~~~~~~~~~~~~ 95 | get_param(params, distance_combine_t()), closed_plus< D >(inf)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 96 | inf, choose_param(get_param(params, distance_zero_t()), D())); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 114 | dag_sp_dispatch2(g, s, | ~~~~~~~~~~~~~~~~^~~~~~ 115 | choose_param(distance, | ~~~~~~~~~~~~~~~~~~~~~~ 116 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | distance_map.begin(), id, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 118 | weight, | ~~~~~~~ 119 | choose_param(color, | ~~~~~~~~~~~~~~~~~~~ 120 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 121 | color_map.begin(), id, color_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 122 | id, vis, params); | ~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/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() | ^ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:68:9: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/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, property >; 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]’ 417 | detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map, long unsigned int>, double, 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 = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ 42 | depth_first_visit(g, s, topo_visitor, color); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 90 | dag_shortest_paths(g, s, distance, weight, color, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 91 | choose_param(get_param(params, vertex_predecessor), p_map), vis, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 92 | choose_param( | ~~~~~~~~~~~~~ 93 | get_param(params, distance_compare_t()), std::less< D >()), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 94 | choose_param( | ~~~~~~~~~~~~~ 95 | get_param(params, distance_combine_t()), closed_plus< D >(inf)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 96 | inf, choose_param(get_param(params, distance_zero_t()), D())); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 114 | dag_sp_dispatch2(g, s, | ~~~~~~~~~~~~~~~~^~~~~~ 115 | choose_param(distance, | ~~~~~~~~~~~~~~~~~~~~~~ 116 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | distance_map.begin(), id, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 118 | weight, | ~~~~~~~ 119 | choose_param(color, | ~~~~~~~~~~~~~~~~~~~ 120 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 121 | color_map.begin(), id, color_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 122 | id, vis, params); | ~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/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(); } | ^ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible]’: /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:68:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph, boost::property > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property > > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph, boost::property > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph, boost::property > >’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/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, property >; 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]’ 417 | detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map, long unsigned int>, double, 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 = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ 42 | depth_first_visit(g, s, topo_visitor, color); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 90 | dag_shortest_paths(g, s, distance, weight, color, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 91 | choose_param(get_param(params, vertex_predecessor), p_map), vis, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 92 | choose_param( | ~~~~~~~~~~~~~ 93 | get_param(params, distance_compare_t()), std::less< D >()), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 94 | choose_param( | ~~~~~~~~~~~~~ 95 | get_param(params, distance_combine_t()), closed_plus< D >(inf)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 96 | inf, choose_param(get_param(params, distance_zero_t()), D())); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 114 | dag_sp_dispatch2(g, s, | ~~~~~~~~~~~~~~~~^~~~~~ 115 | choose_param(distance, | ~~~~~~~~~~~~~~~~~~~~~~ 116 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | distance_map.begin(), id, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 118 | weight, | ~~~~~~~ 119 | choose_param(color, | ~~~~~~~~~~~~~~~~~~~ 120 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 121 | color_map.begin(), id, color_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 122 | id, vis, params); | ~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/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() | ^ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:69:9: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/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, property >; 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]’ 417 | detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map, long unsigned int>, double, 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 = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ 42 | depth_first_visit(g, s, topo_visitor, color); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 90 | dag_shortest_paths(g, s, distance, weight, color, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 91 | choose_param(get_param(params, vertex_predecessor), p_map), vis, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 92 | choose_param( | ~~~~~~~~~~~~~ 93 | get_param(params, distance_compare_t()), std::less< D >()), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 94 | choose_param( | ~~~~~~~~~~~~~ 95 | get_param(params, distance_combine_t()), closed_plus< D >(inf)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 96 | inf, choose_param(get_param(params, distance_zero_t()), D())); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 114 | dag_sp_dispatch2(g, s, | ~~~~~~~~~~~~~~~~^~~~~~ 115 | choose_param(distance, | ~~~~~~~~~~~~~~~~~~~~~~ 116 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | distance_map.begin(), id, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 118 | weight, | ~~~~~~~ 119 | choose_param(color, | ~~~~~~~~~~~~~~~~~~~ 120 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 121 | color_map.begin(), id, color_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 122 | id, vis, params); | ~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/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(); } | ^ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable]’: /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:69:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph, boost::property > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property > > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph, boost::property > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph, boost::property > >’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/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, property >; 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]’ 417 | detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map, long unsigned int>, double, 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 = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ 42 | depth_first_visit(g, s, topo_visitor, color); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 90 | dag_shortest_paths(g, s, distance, weight, color, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 91 | choose_param(get_param(params, vertex_predecessor), p_map), vis, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 92 | choose_param( | ~~~~~~~~~~~~~ 93 | get_param(params, distance_compare_t()), std::less< D >()), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 94 | choose_param( | ~~~~~~~~~~~~~ 95 | get_param(params, distance_combine_t()), closed_plus< D >(inf)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 96 | inf, choose_param(get_param(params, distance_zero_t()), D())); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 114 | dag_sp_dispatch2(g, s, | ~~~~~~~~~~~~~~~~^~~~~~ 115 | choose_param(distance, | ~~~~~~~~~~~~~~~~~~~~~~ 116 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | distance_map.begin(), id, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 118 | weight, | ~~~~~~~ 119 | choose_param(color, | ~~~~~~~~~~~~~~~~~~~ 120 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 121 | color_map.begin(), id, color_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 122 | id, vis, params); | ~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/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() | ^ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:70:9: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/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, property >; 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]’ 417 | detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map, long unsigned int>, double, 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 = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ 42 | depth_first_visit(g, s, topo_visitor, color); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 90 | dag_shortest_paths(g, s, distance, weight, color, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 91 | choose_param(get_param(params, vertex_predecessor), p_map), vis, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 92 | choose_param( | ~~~~~~~~~~~~~ 93 | get_param(params, distance_compare_t()), std::less< D >()), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 94 | choose_param( | ~~~~~~~~~~~~~ 95 | get_param(params, distance_combine_t()), closed_plus< D >(inf)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 96 | inf, choose_param(get_param(params, distance_zero_t()), D())); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 114 | dag_sp_dispatch2(g, s, | ~~~~~~~~~~~~~~~~^~~~~~ 115 | choose_param(distance, | ~~~~~~~~~~~~~~~~~~~~~~ 116 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | distance_map.begin(), id, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 118 | weight, | ~~~~~~~ 119 | choose_param(color, | ~~~~~~~~~~~~~~~~~~~ 120 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 121 | color_map.begin(), id, color_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 122 | id, vis, params); | ~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/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(); } | ^ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable]’: /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:70:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph, boost::property > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property > > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph, boost::property > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph, boost::property > >’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/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, property >; 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]’ 417 | detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map, long unsigned int>, double, 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 = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ 42 | depth_first_visit(g, s, topo_visitor, color); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 90 | dag_shortest_paths(g, s, distance, weight, color, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 91 | choose_param(get_param(params, vertex_predecessor), p_map), vis, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 92 | choose_param( | ~~~~~~~~~~~~~ 93 | get_param(params, distance_compare_t()), std::less< D >()), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 94 | choose_param( | ~~~~~~~~~~~~~ 95 | get_param(params, distance_combine_t()), closed_plus< D >(inf)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 96 | inf, choose_param(get_param(params, distance_zero_t()), D())); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 114 | dag_sp_dispatch2(g, s, | ~~~~~~~~~~~~~~~~^~~~~~ 115 | choose_param(distance, | ~~~~~~~~~~~~~~~~~~~~~~ 116 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | distance_map.begin(), id, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 118 | weight, | ~~~~~~~ 119 | choose_param(color, | ~~~~~~~~~~~~~~~~~~~ 120 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 121 | color_map.begin(), id, color_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 122 | id, vis, params); | ~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/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() | ^ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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> >]’: /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/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, property >; 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]’ 417 | detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map, long unsigned int>, double, 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 = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ 42 | depth_first_visit(g, s, topo_visitor, color); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 90 | dag_shortest_paths(g, s, distance, weight, color, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 91 | choose_param(get_param(params, vertex_predecessor), p_map), vis, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 92 | choose_param( | ~~~~~~~~~~~~~ 93 | get_param(params, distance_compare_t()), std::less< D >()), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 94 | choose_param( | ~~~~~~~~~~~~~ 95 | get_param(params, distance_combine_t()), closed_plus< D >(inf)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 96 | inf, choose_param(get_param(params, distance_zero_t()), D())); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 114 | dag_sp_dispatch2(g, s, | ~~~~~~~~~~~~~~~~^~~~~~ 115 | choose_param(distance, | ~~~~~~~~~~~~~~~~~~~~~~ 116 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | distance_map.begin(), id, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 118 | weight, | ~~~~~~~ 119 | choose_param(color, | ~~~~~~~~~~~~~~~~~~~ 120 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 121 | color_map.begin(), id, color_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 122 | id, vis, params); | ~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/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() | ^ /usr/local/lib/R/library/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( | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’: /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/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, property >; 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]’ 417 | detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map, long unsigned int>, double, 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 = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ 42 | depth_first_visit(g, s, topo_visitor, color); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 90 | dag_shortest_paths(g, s, distance, weight, color, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 91 | choose_param(get_param(params, vertex_predecessor), p_map), vis, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 92 | choose_param( | ~~~~~~~~~~~~~ 93 | get_param(params, distance_compare_t()), std::less< D >()), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 94 | choose_param( | ~~~~~~~~~~~~~ 95 | get_param(params, distance_combine_t()), closed_plus< D >(inf)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 96 | inf, choose_param(get_param(params, distance_zero_t()), D())); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 114 | dag_sp_dispatch2(g, s, | ~~~~~~~~~~~~~~~~^~~~~~ 115 | choose_param(distance, | ~~~~~~~~~~~~~~~~~~~~~~ 116 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | distance_map.begin(), id, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 118 | weight, | ~~~~~~~ 119 | choose_param(color, | ~~~~~~~~~~~~~~~~~~~ 120 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 121 | color_map.begin(), id, color_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 122 | id, vis, params); | ~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/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() | ^ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/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, property >; 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]’ 417 | detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map, long unsigned int>, double, 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 = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ 42 | depth_first_visit(g, s, topo_visitor, color); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 90 | dag_shortest_paths(g, s, distance, weight, color, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 91 | choose_param(get_param(params, vertex_predecessor), p_map), vis, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 92 | choose_param( | ~~~~~~~~~~~~~ 93 | get_param(params, distance_compare_t()), std::less< D >()), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 94 | choose_param( | ~~~~~~~~~~~~~ 95 | get_param(params, distance_combine_t()), closed_plus< D >(inf)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 96 | inf, choose_param(get_param(params, distance_zero_t()), D())); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 114 | dag_sp_dispatch2(g, s, | ~~~~~~~~~~~~~~~~^~~~~~ 115 | choose_param(distance, | ~~~~~~~~~~~~~~~~~~~~~~ 116 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | distance_map.begin(), id, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 118 | weight, | ~~~~~~~ 119 | choose_param(color, | ~~~~~~~~~~~~~~~~~~~ 120 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 121 | color_map.begin(), id, color_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 122 | id, vis, params); | ~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/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() | ^ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/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, property >; 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]’ 417 | detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map, long unsigned int>, double, 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 = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ 42 | depth_first_visit(g, s, topo_visitor, color); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 90 | dag_shortest_paths(g, s, distance, weight, color, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 91 | choose_param(get_param(params, vertex_predecessor), p_map), vis, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 92 | choose_param( | ~~~~~~~~~~~~~ 93 | get_param(params, distance_compare_t()), std::less< D >()), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 94 | choose_param( | ~~~~~~~~~~~~~ 95 | get_param(params, distance_combine_t()), closed_plus< D >(inf)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 96 | inf, choose_param(get_param(params, distance_zero_t()), D())); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 114 | dag_sp_dispatch2(g, s, | ~~~~~~~~~~~~~~~~^~~~~~ 115 | choose_param(distance, | ~~~~~~~~~~~~~~~~~~~~~~ 116 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | distance_map.begin(), id, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 118 | weight, | ~~~~~~~ 119 | choose_param(color, | ~~~~~~~~~~~~~~~~~~~ 120 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 121 | color_map.begin(), id, color_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 122 | id, vis, params); | ~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/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() | ^ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/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, property >; 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]’ 417 | detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map, long unsigned int>, double, 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 = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ 42 | depth_first_visit(g, s, topo_visitor, color); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 90 | dag_shortest_paths(g, s, distance, weight, color, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 91 | choose_param(get_param(params, vertex_predecessor), p_map), vis, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 92 | choose_param( | ~~~~~~~~~~~~~ 93 | get_param(params, distance_compare_t()), std::less< D >()), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 94 | choose_param( | ~~~~~~~~~~~~~ 95 | get_param(params, distance_combine_t()), closed_plus< D >(inf)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 96 | inf, choose_param(get_param(params, distance_zero_t()), D())); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 114 | dag_sp_dispatch2(g, s, | ~~~~~~~~~~~~~~~~^~~~~~ 115 | choose_param(distance, | ~~~~~~~~~~~~~~~~~~~~~~ 116 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | distance_map.begin(), id, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 118 | weight, | ~~~~~~~ 119 | choose_param(color, | ~~~~~~~~~~~~~~~~~~~ 120 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 121 | color_map.begin(), id, color_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 122 | id, vis, params); | ~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/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() | ^ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/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, property >; 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]’ 417 | detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map, long unsigned int>, double, 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 = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ 42 | depth_first_visit(g, s, topo_visitor, color); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 90 | dag_shortest_paths(g, s, distance, weight, color, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 91 | choose_param(get_param(params, vertex_predecessor), p_map), vis, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 92 | choose_param( | ~~~~~~~~~~~~~ 93 | get_param(params, distance_compare_t()), std::less< D >()), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 94 | choose_param( | ~~~~~~~~~~~~~ 95 | get_param(params, distance_combine_t()), closed_plus< D >(inf)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 96 | inf, choose_param(get_param(params, distance_zero_t()), D())); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 114 | dag_sp_dispatch2(g, s, | ~~~~~~~~~~~~~~~~^~~~~~ 115 | choose_param(distance, | ~~~~~~~~~~~~~~~~~~~~~~ 116 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | distance_map.begin(), id, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 118 | weight, | ~~~~~~~ 119 | choose_param(color, | ~~~~~~~~~~~~~~~~~~~ 120 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 121 | color_map.begin(), id, color_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 122 | id, vis, params); | ~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/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() | ^ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/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, property >; 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]’ 417 | detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map, long unsigned int>, double, 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 = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ 42 | depth_first_visit(g, s, topo_visitor, color); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 90 | dag_shortest_paths(g, s, distance, weight, color, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 91 | choose_param(get_param(params, vertex_predecessor), p_map), vis, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 92 | choose_param( | ~~~~~~~~~~~~~ 93 | get_param(params, distance_compare_t()), std::less< D >()), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 94 | choose_param( | ~~~~~~~~~~~~~ 95 | get_param(params, distance_combine_t()), closed_plus< D >(inf)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 96 | inf, choose_param(get_param(params, distance_zero_t()), D())); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 114 | dag_sp_dispatch2(g, s, | ~~~~~~~~~~~~~~~~^~~~~~ 115 | choose_param(distance, | ~~~~~~~~~~~~~~~~~~~~~~ 116 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | distance_map.begin(), id, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 118 | weight, | ~~~~~~~ 119 | choose_param(color, | ~~~~~~~~~~~~~~~~~~~ 120 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 121 | color_map.begin(), id, color_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 122 | id, vis, params); | ~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/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() | ^ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’: /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/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, property >; 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]’ 417 | detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map, long unsigned int>, double, 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 = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ 42 | depth_first_visit(g, s, topo_visitor, color); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 90 | dag_shortest_paths(g, s, distance, weight, color, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 91 | choose_param(get_param(params, vertex_predecessor), p_map), vis, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 92 | choose_param( | ~~~~~~~~~~~~~ 93 | get_param(params, distance_compare_t()), std::less< D >()), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 94 | choose_param( | ~~~~~~~~~~~~~ 95 | get_param(params, distance_combine_t()), closed_plus< D >(inf)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 96 | inf, choose_param(get_param(params, distance_zero_t()), D())); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 114 | dag_sp_dispatch2(g, s, | ~~~~~~~~~~~~~~~~^~~~~~ 115 | choose_param(distance, | ~~~~~~~~~~~~~~~~~~~~~~ 116 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | distance_map.begin(), id, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 118 | weight, | ~~~~~~~ 119 | choose_param(color, | ~~~~~~~~~~~~~~~~~~~ 120 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 121 | color_map.begin(), id, color_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 122 | id, vis, params); | ~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/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() | ^ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/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, property >; 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]’ 417 | detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map, long unsigned int>, double, 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 = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ 42 | depth_first_visit(g, s, topo_visitor, color); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 90 | dag_shortest_paths(g, s, distance, weight, color, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 91 | choose_param(get_param(params, vertex_predecessor), p_map), vis, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 92 | choose_param( | ~~~~~~~~~~~~~ 93 | get_param(params, distance_compare_t()), std::less< D >()), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 94 | choose_param( | ~~~~~~~~~~~~~ 95 | get_param(params, distance_combine_t()), closed_plus< D >(inf)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 96 | inf, choose_param(get_param(params, distance_zero_t()), D())); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 114 | dag_sp_dispatch2(g, s, | ~~~~~~~~~~~~~~~~^~~~~~ 115 | choose_param(distance, | ~~~~~~~~~~~~~~~~~~~~~~ 116 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | distance_map.begin(), id, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 118 | weight, | ~~~~~~~ 119 | choose_param(color, | ~~~~~~~~~~~~~~~~~~~ 120 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 121 | color_map.begin(), id, color_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 122 | id, vis, params); | ~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/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() | ^ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’: /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/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, property >; 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]’ 417 | detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map, long unsigned int>, double, 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 = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ 42 | depth_first_visit(g, s, topo_visitor, color); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 90 | dag_shortest_paths(g, s, distance, weight, color, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 91 | choose_param(get_param(params, vertex_predecessor), p_map), vis, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 92 | choose_param( | ~~~~~~~~~~~~~ 93 | get_param(params, distance_compare_t()), std::less< D >()), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 94 | choose_param( | ~~~~~~~~~~~~~ 95 | get_param(params, distance_combine_t()), closed_plus< D >(inf)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 96 | inf, choose_param(get_param(params, distance_zero_t()), D())); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 114 | dag_sp_dispatch2(g, s, | ~~~~~~~~~~~~~~~~^~~~~~ 115 | choose_param(distance, | ~~~~~~~~~~~~~~~~~~~~~~ 116 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | distance_map.begin(), id, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 118 | weight, | ~~~~~~~ 119 | choose_param(color, | ~~~~~~~~~~~~~~~~~~~ 120 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 121 | color_map.begin(), id, color_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 122 | id, vis, params); | ~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/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() | ^ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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> > >]’: /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ 502 | BOOST_concept(InputIterator,(TT)) | ^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/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, property >; 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]’ 417 | detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map, long unsigned int>, double, 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 = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ 42 | depth_first_visit(g, s, topo_visitor, color); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 90 | dag_shortest_paths(g, s, distance, weight, color, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 91 | choose_param(get_param(params, vertex_predecessor), p_map), vis, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 92 | choose_param( | ~~~~~~~~~~~~~ 93 | get_param(params, distance_compare_t()), std::less< D >()), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 94 | choose_param( | ~~~~~~~~~~~~~ 95 | get_param(params, distance_combine_t()), closed_plus< D >(inf)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 96 | inf, choose_param(get_param(params, distance_zero_t()), D())); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 114 | dag_sp_dispatch2(g, s, | ~~~~~~~~~~~~~~~~^~~~~~ 115 | choose_param(distance, | ~~~~~~~~~~~~~~~~~~~~~~ 116 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | distance_map.begin(), id, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 118 | weight, | ~~~~~~~ 119 | choose_param(color, | ~~~~~~~~~~~~~~~~~~~ 120 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 121 | color_map.begin(), id, color_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 122 | id, vis, params); | ~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/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(); } | ^ /usr/local/lib/R/library/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> > >]’: /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ 502 | BOOST_concept(InputIterator,(TT)) | ^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/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, property >; 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]’ 417 | detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map, long unsigned int>, double, 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 = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ 42 | depth_first_visit(g, s, topo_visitor, color); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 90 | dag_shortest_paths(g, s, distance, weight, color, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 91 | choose_param(get_param(params, vertex_predecessor), p_map), vis, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 92 | choose_param( | ~~~~~~~~~~~~~ 93 | get_param(params, distance_compare_t()), std::less< D >()), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 94 | choose_param( | ~~~~~~~~~~~~~ 95 | get_param(params, distance_combine_t()), closed_plus< D >(inf)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 96 | inf, choose_param(get_param(params, distance_zero_t()), D())); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 114 | dag_sp_dispatch2(g, s, | ~~~~~~~~~~~~~~~~^~~~~~ 115 | choose_param(distance, | ~~~~~~~~~~~~~~~~~~~~~~ 116 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | distance_map.begin(), id, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 118 | weight, | ~~~~~~~ 119 | choose_param(color, | ~~~~~~~~~~~~~~~~~~~ 120 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 121 | color_map.begin(), id, color_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 122 | id, vis, params); | ~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/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(); } | ^ /usr/local/lib/R/library/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> > >]’: /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/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, property >; 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]’ 417 | detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map, long unsigned int>, double, 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 = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ 42 | depth_first_visit(g, s, topo_visitor, color); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 90 | dag_shortest_paths(g, s, distance, weight, color, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 91 | choose_param(get_param(params, vertex_predecessor), p_map), vis, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 92 | choose_param( | ~~~~~~~~~~~~~ 93 | get_param(params, distance_compare_t()), std::less< D >()), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 94 | choose_param( | ~~~~~~~~~~~~~ 95 | get_param(params, distance_combine_t()), closed_plus< D >(inf)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 96 | inf, choose_param(get_param(params, distance_zero_t()), D())); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 114 | dag_sp_dispatch2(g, s, | ~~~~~~~~~~~~~~~~^~~~~~ 115 | choose_param(distance, | ~~~~~~~~~~~~~~~~~~~~~~ 116 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | distance_map.begin(), id, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 118 | weight, | ~~~~~~~ 119 | choose_param(color, | ~~~~~~~~~~~~~~~~~~~ 120 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 121 | color_map.begin(), id, color_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 122 | id, vis, params); | ~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/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(); } | ^ /usr/local/lib/R/library/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> >]’: /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept, boost::property > >]’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list, boost::property >; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::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]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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, property >; 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]’ 417 | detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map, long unsigned int>, double, 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 = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ 42 | depth_first_visit(g, s, topo_visitor, color); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 90 | dag_shortest_paths(g, s, distance, weight, color, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 91 | choose_param(get_param(params, vertex_predecessor), p_map), vis, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 92 | choose_param( | ~~~~~~~~~~~~~ 93 | get_param(params, distance_compare_t()), std::less< D >()), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 94 | choose_param( | ~~~~~~~~~~~~~ 95 | get_param(params, distance_combine_t()), closed_plus< D >(inf)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 96 | inf, choose_param(get_param(params, distance_zero_t()), D())); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 114 | dag_sp_dispatch2(g, s, | ~~~~~~~~~~~~~~~~^~~~~~ 115 | choose_param(distance, | ~~~~~~~~~~~~~~~~~~~~~~ 116 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | distance_map.begin(), id, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 118 | weight, | ~~~~~~~ 119 | choose_param(color, | ~~~~~~~~~~~~~~~~~~~ 120 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 121 | color_map.begin(), id, color_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 122 | id, vis, params); | ~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/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() | ^ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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> >]’: /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ 502 | BOOST_concept(InputIterator,(TT)) | ^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/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, property >; 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]’ 417 | detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map, long unsigned int>, double, 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 = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ 42 | depth_first_visit(g, s, topo_visitor, color); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 90 | dag_shortest_paths(g, s, distance, weight, color, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 91 | choose_param(get_param(params, vertex_predecessor), p_map), vis, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 92 | choose_param( | ~~~~~~~~~~~~~ 93 | get_param(params, distance_compare_t()), std::less< D >()), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 94 | choose_param( | ~~~~~~~~~~~~~ 95 | get_param(params, distance_combine_t()), closed_plus< D >(inf)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 96 | inf, choose_param(get_param(params, distance_zero_t()), D())); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 114 | dag_sp_dispatch2(g, s, | ~~~~~~~~~~~~~~~~^~~~~~ 115 | choose_param(distance, | ~~~~~~~~~~~~~~~~~~~~~~ 116 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | distance_map.begin(), id, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 118 | weight, | ~~~~~~~ 119 | choose_param(color, | ~~~~~~~~~~~~~~~~~~~ 120 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 121 | color_map.begin(), id, color_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 122 | id, vis, params); | ~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/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() | ^ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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> >]’: /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ 502 | BOOST_concept(InputIterator,(TT)) | ^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/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, property >; 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]’ 417 | detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map, long unsigned int>, double, 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 = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ 42 | depth_first_visit(g, s, topo_visitor, color); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 90 | dag_shortest_paths(g, s, distance, weight, color, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 91 | choose_param(get_param(params, vertex_predecessor), p_map), vis, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 92 | choose_param( | ~~~~~~~~~~~~~ 93 | get_param(params, distance_compare_t()), std::less< D >()), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 94 | choose_param( | ~~~~~~~~~~~~~ 95 | get_param(params, distance_combine_t()), closed_plus< D >(inf)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 96 | inf, choose_param(get_param(params, distance_zero_t()), D())); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 114 | dag_sp_dispatch2(g, s, | ~~~~~~~~~~~~~~~~^~~~~~ 115 | choose_param(distance, | ~~~~~~~~~~~~~~~~~~~~~~ 116 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | distance_map.begin(), id, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 118 | weight, | ~~~~~~~ 119 | choose_param(color, | ~~~~~~~~~~~~~~~~~~~ 120 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 121 | color_map.begin(), id, color_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 122 | id, vis, params); | ~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/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() | ^ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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> >]’: /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/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, property >; 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]’ 417 | detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map, long unsigned int>, double, 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 = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ 42 | depth_first_visit(g, s, topo_visitor, color); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 90 | dag_shortest_paths(g, s, distance, weight, color, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 91 | choose_param(get_param(params, vertex_predecessor), p_map), vis, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 92 | choose_param( | ~~~~~~~~~~~~~ 93 | get_param(params, distance_compare_t()), std::less< D >()), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 94 | choose_param( | ~~~~~~~~~~~~~ 95 | get_param(params, distance_combine_t()), closed_plus< D >(inf)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 96 | inf, choose_param(get_param(params, distance_zero_t()), D())); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 114 | dag_sp_dispatch2(g, s, | ~~~~~~~~~~~~~~~~^~~~~~ 115 | choose_param(distance, | ~~~~~~~~~~~~~~~~~~~~~~ 116 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | distance_map.begin(), id, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 118 | weight, | ~~~~~~~ 119 | choose_param(color, | ~~~~~~~~~~~~~~~~~~~ 120 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 121 | color_map.begin(), id, color_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 122 | id, vis, params); | ~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/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() | ^ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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> >]’: /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::input_iterator_tag>)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:515:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/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, property >; 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]’ 417 | detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map, long unsigned int>, double, 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 = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ 42 | depth_first_visit(g, s, topo_visitor, color); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 90 | dag_shortest_paths(g, s, distance, weight, color, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 91 | choose_param(get_param(params, vertex_predecessor), p_map), vis, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 92 | choose_param( | ~~~~~~~~~~~~~ 93 | get_param(params, distance_compare_t()), std::less< D >()), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 94 | choose_param( | ~~~~~~~~~~~~~ 95 | get_param(params, distance_combine_t()), closed_plus< D >(inf)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 96 | inf, choose_param(get_param(params, distance_zero_t()), D())); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 114 | dag_sp_dispatch2(g, s, | ~~~~~~~~~~~~~~~~^~~~~~ 115 | choose_param(distance, | ~~~~~~~~~~~~~~~~~~~~~~ 116 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | distance_map.begin(), id, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 118 | weight, | ~~~~~~~ 119 | choose_param(color, | ~~~~~~~~~~~~~~~~~~~ 120 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 121 | color_map.begin(), id, color_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 122 | id, vis, params); | ~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/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(); } | ^ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible, std::input_iterator_tag>]’: /usr/local/lib/R/library/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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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> >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/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, property >; 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]’ 417 | detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map, long unsigned int>, double, 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 = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ 42 | depth_first_visit(g, s, topo_visitor, color); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 90 | dag_shortest_paths(g, s, distance, weight, color, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 91 | choose_param(get_param(params, vertex_predecessor), p_map), vis, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 92 | choose_param( | ~~~~~~~~~~~~~ 93 | get_param(params, distance_compare_t()), std::less< D >()), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 94 | choose_param( | ~~~~~~~~~~~~~ 95 | get_param(params, distance_combine_t()), closed_plus< D >(inf)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 96 | inf, choose_param(get_param(params, distance_zero_t()), D())); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 114 | dag_sp_dispatch2(g, s, | ~~~~~~~~~~~~~~~~^~~~~~ 115 | choose_param(distance, | ~~~~~~~~~~~~~~~~~~~~~~ 116 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | distance_map.begin(), id, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 118 | weight, | ~~~~~~~ 119 | choose_param(color, | ~~~~~~~~~~~~~~~~~~~ 120 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 121 | color_map.begin(), id, color_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 122 | id, vis, params); | ~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/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() | ^ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’: /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/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, property >; 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]’ 417 | detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = iterator_property_map, long unsigned int>, double, 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 = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ 42 | depth_first_visit(g, s, topo_visitor, color); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 90 | dag_shortest_paths(g, s, distance, weight, color, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 91 | choose_param(get_param(params, vertex_predecessor), p_map), vis, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 92 | choose_param( | ~~~~~~~~~~~~~ 93 | get_param(params, distance_compare_t()), std::less< D >()), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 94 | choose_param( | ~~~~~~~~~~~~~ 95 | get_param(params, distance_combine_t()), closed_plus< D >(inf)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 96 | inf, choose_param(get_param(params, distance_zero_t()), D())); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = boost::adjacency_list, boost::property >; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = boost::iterator_property_map, long unsigned int>, double, 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, long unsigned int>, long unsigned int, long unsigned int&>, boost::vertex_predecessor_t, boost::bgl_named_params, long unsigned int>, double, double&>, boost::vertex_distance_t, boost::no_property> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 114 | dag_sp_dispatch2(g, s, | ~~~~~~~~~~~~~~~~^~~~~~ 115 | choose_param(distance, | ~~~~~~~~~~~~~~~~~~~~~~ 116 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | distance_map.begin(), id, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 118 | weight, | ~~~~~~~ 119 | choose_param(color, | ~~~~~~~~~~~~~~~~~~~ 120 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 121 | color_map.begin(), id, color_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 122 | id, vis, params); | ~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/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 = adjacency_list, property >; Param = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Tag = vertex_predecessor_t; Rest = bgl_named_params, long unsigned int>, double, double&>, vertex_distance_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ 134 | detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance), | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 135 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 136 | get_param(params, vertex_color), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 137 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | choose_param( | ~~~~~~~~~~~~~ 139 | get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 140 | params); | ~~~~~~~ shortest_path.cpp:70:28: required from here 70 | boost::dag_shortest_paths(g1, source, boost::distance_map(distanceMap).predecessor_map(predecessorMap)); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/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() | ^ /usr/local/lib/R/library/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 -shared -L/usr/lib64/R/lib -Wl,-z,relro -Wl,--as-needed -Wl,-z,pack-relative-relocs -Wl,-z,now -specs=/usr/lib/rpm/redhat/redhat-hardened-ld -specs=/usr/lib/rpm/redhat/redhat-annobin-cc1 -Wl,--build-id=sha1 -o starvz.so RcppExports.o integrate_step.o last.o separate_res.o shortest_path.o -L/usr/lib64/R/lib -lR last.cpp: In function ‘get_last_path’: last.cpp:192:52: warning: argument 1 value ‘18446744073709551615’ exceeds maximum object size 9223372036854775807 [-Walloc-size-larger-than=] 192 | CharacterVector* results = new CharacterVector[ns]; | ^ /usr/include/c++/14/new:133:26: note: in a call to allocation function ‘operator new []’ declared here 133 | _GLIBCXX_NODISCARD void* operator new[](std::size_t) _GLIBCXX_THROW (std::bad_alloc) | ^ installing to /builddir/build/BUILD/R-CRAN-starvz-0.8.2-build/BUILDROOT/usr/local/lib/R/library/00LOCK-starvz/00new/starvz/libs ** R ** data *** moving datasets to lazyload DB ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices converting help for package ‘starvz’ finding HTML links ... done cholesky_colors html data_name_coordinates html data_name_handle html data_name_tag html handles_presence_states html lu_colors html multiple_snaps html panel_abe_solution html panel_activenodes html panel_atree html panel_atree_structure html panel_compare_tree html panel_dist2d html panel_gflops html panel_gflops_computed_difference html panel_gpubandwidth html panel_handles html panel_hete_imbalance html panel_imbalance html panel_kiteration html panel_lackready html panel_memory_heatmap html panel_memory_snap html panel_memory_state html panel_model_gflops html panel_mpibandwidth html panel_mpiconcurrent html panel_mpiconcurrentout html panel_mpistate html panel_node_events html panel_node_summary html panel_nodememuse html panel_pmtool_kiteration html panel_pmtool_st html panel_power_imbalance html panel_progress html panel_ready html panel_resource_usage_task html panel_st html panel_st_agg_dynamic html panel_st_agg_node html panel_st_agg_static html panel_st_raw html panel_st_runtime html panel_submitted html panel_title html panel_usedmemory html panel_utilheatmap html panel_utiltreedepth html panel_utiltreenode html plot.starvz_data html pre_handle_gantt html print.starvz_data html qrmumps_colors html resource_utilization_tree_node html starvz_assemble html starvz_check_data html starvz_phase1 html starvz_plot html starvz_plot_list html starvz_read html starvz_read_config html starvz_sample_lu html starvz_set_log html starvz_transform_olddata html summary.starvz_data html ** 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 (starvz) + test -d starvz/src + cd starvz/src + rm -f RcppExports.o integrate_step.o last.o separate_res.o shortest_path.o starvz.so + rm -f /builddir/build/BUILD/R-CRAN-starvz-0.8.2-build/BUILDROOT/usr/local/lib/R/library/R.css + find /builddir/build/BUILD/R-CRAN-starvz-0.8.2-build/BUILDROOT/usr/local/lib/R/library -type f -exec sed -i s@/builddir/build/BUILD/R-CRAN-starvz-0.8.2-build/BUILDROOT@@g '{}' ';' + /usr/bin/find-debuginfo -j4 --strict-build-id -m -i --build-id-seed 0.8.2-1.fc41.copr7998582 --unique-debug-suffix -0.8.2-1.fc41.copr7998582.x86_64 --unique-debug-src-base R-CRAN-starvz-0.8.2-1.fc41.copr7998582.x86_64 --run-dwz --dwz-low-mem-die-limit 10000000 --dwz-max-die-limit 110000000 -S debugsourcefiles.list /builddir/build/BUILD/R-CRAN-starvz-0.8.2-build/starvz find-debuginfo: starting Extracting debug info from 1 files DWARF-compressing 1 files sepdebugcrcfix: Updated 1 CRC32s, 0 CRC32s did match. Creating .debug symlinks for symlinks to ELF files Copying sources found by 'debugedit -l' to /usr/src/debug/R-CRAN-starvz-0.8.2-1.fc41.copr7998582.x86_64 28 blocks find-debuginfo: done + /usr/lib/rpm/check-buildroot + /usr/lib/rpm/redhat/brp-ldconfig + /usr/lib/rpm/brp-compress + /usr/lib/rpm/redhat/brp-strip-lto /usr/bin/strip + /usr/lib/rpm/brp-strip-static-archive /usr/bin/strip + /usr/lib/rpm/redhat/brp-mangle-shebangs mangling shebang in /usr/local/lib/R/library/starvz/tools/2d_map.R from /usr/bin/env Rscript to #!/usr/bin/Rscript mangling shebang in /usr/local/lib/R/library/starvz/tools/fxt2paje.sh from /bin/bash to #!/usr/bin/bash mangling shebang in /usr/local/lib/R/library/starvz/tools/paje_sort.sh from /bin/bash to #!/usr/bin/bash mangling shebang in /usr/local/lib/R/library/starvz/tools/phase1-workflow.R from /usr/bin/env Rscript to #!/usr/bin/Rscript mangling shebang in /usr/local/lib/R/library/starvz/tools/phase1-workflow.sh from /bin/bash to #!/usr/bin/bash mangling shebang in /usr/local/lib/R/library/starvz/tools/phase2-memsnaps.R from /usr/bin/env Rscript to #!/usr/bin/Rscript mangling shebang in /usr/local/lib/R/library/starvz/tools/phase2-workflow.R from /usr/bin/env Rscript to #!/usr/bin/Rscript mangling shebang in /usr/local/lib/R/library/starvz/tools/starvz from /bin/bash to #!/usr/bin/bash *** WARNING: ./usr/local/lib/R/library/starvz/extdata/agg.yaml is executable but has no shebang, removing executable bit *** WARNING: ./usr/local/lib/R/library/starvz/extdata/agg_dynamic.yaml is executable but has no shebang, removing executable bit *** WARNING: ./usr/local/lib/R/library/starvz/extdata/agg_static.yaml is executable but has no shebang, removing executable bit *** WARNING: ./usr/local/lib/R/library/starvz/extdata/config.yaml is executable but has no shebang, removing executable bit *** WARNING: ./usr/local/lib/R/library/starvz/extdata/imb.yaml is executable but has no shebang, removing executable bit *** WARNING: ./usr/local/lib/R/library/starvz/extdata/pmtool.yaml is executable but has no shebang, removing executable bit *** WARNING: ./usr/local/lib/R/library/starvz/extdata/qr.yaml is executable but has no shebang, removing executable bit *** WARNING: ./usr/local/lib/R/library/starvz/extdata/selected.yaml is executable but has no shebang, removing executable bit *** WARNING: ./usr/local/lib/R/library/starvz/etc/default.yaml is executable but has no shebang, removing executable bit + /usr/lib/rpm/brp-remove-la-files + env /usr/lib/rpm/redhat/brp-python-bytecompile '' 1 0 -j4 + /usr/lib/rpm/redhat/brp-python-hardlink + /usr/bin/add-determinism --brp -j4 /builddir/build/BUILD/R-CRAN-starvz-0.8.2-build/BUILDROOT Scanned 31 directories and 194 files, processed 133 inodes, 0 modified (0 replaced + 0 rewritten), 0 unsupported format, 0 errors Reading /builddir/build/BUILD/R-CRAN-starvz-0.8.2-build/SPECPARTS/rpm-debuginfo.specpart Processing files: R-CRAN-starvz-0.8.2-1.fc41.copr7998582.x86_64 Provides: R-CRAN-starvz = 0.8.2-1.fc41.copr7998582 R-CRAN-starvz(x86-64) = 0.8.2-1.fc41.copr7998582 Requires(rpmlib): rpmlib(CompressedFileNames) <= 3.0.4-1 rpmlib(FileDigests) <= 4.6.0-1 rpmlib(PayloadFilesHavePrefix) <= 4.0-1 Requires: /usr/bin/Rscript /usr/bin/bash libR.so()(64bit) libc.so.6()(64bit) libc.so.6(GLIBC_2.11)(64bit) libc.so.6(GLIBC_2.14)(64bit) libc.so.6(GLIBC_2.2.5)(64bit) libc.so.6(GLIBC_2.38)(64bit) libc.so.6(GLIBC_2.4)(64bit) libc.so.6(GLIBC_ABI_DT_RELR)(64bit) libgcc_s.so.1()(64bit) libgcc_s.so.1(GCC_3.0)(64bit) libgcc_s.so.1(GCC_3.3.1)(64bit) libstdc++.so.6()(64bit) libstdc++.so.6(CXXABI_1.3)(64bit) libstdc++.so.6(CXXABI_1.3.15)(64bit) libstdc++.so.6(CXXABI_1.3.9)(64bit) libstdc++.so.6(GLIBCXX_3.4)(64bit) libstdc++.so.6(GLIBCXX_3.4.11)(64bit) libstdc++.so.6(GLIBCXX_3.4.15)(64bit) libstdc++.so.6(GLIBCXX_3.4.20)(64bit) libstdc++.so.6(GLIBCXX_3.4.21)(64bit) libstdc++.so.6(GLIBCXX_3.4.26)(64bit) libstdc++.so.6(GLIBCXX_3.4.30)(64bit) libstdc++.so.6(GLIBCXX_3.4.32)(64bit) libstdc++.so.6(GLIBCXX_3.4.9)(64bit) rtld(GNU_HASH) Processing files: R-CRAN-starvz-debugsource-0.8.2-1.fc41.copr7998582.x86_64 Provides: R-CRAN-starvz-debugsource = 0.8.2-1.fc41.copr7998582 R-CRAN-starvz-debugsource(x86-64) = 0.8.2-1.fc41.copr7998582 Requires(rpmlib): rpmlib(CompressedFileNames) <= 3.0.4-1 rpmlib(FileDigests) <= 4.6.0-1 rpmlib(PayloadFilesHavePrefix) <= 4.0-1 Processing files: R-CRAN-starvz-debuginfo-0.8.2-1.fc41.copr7998582.x86_64 Provides: R-CRAN-starvz-debuginfo = 0.8.2-1.fc41.copr7998582 R-CRAN-starvz-debuginfo(x86-64) = 0.8.2-1.fc41.copr7998582 debuginfo(build-id) = 7c0077e9710bdb577020e706f221202d15a338e1 Requires(rpmlib): rpmlib(CompressedFileNames) <= 3.0.4-1 rpmlib(FileDigests) <= 4.6.0-1 rpmlib(PayloadFilesHavePrefix) <= 4.0-1 Recommends: R-CRAN-starvz-debugsource(x86-64) = 0.8.2-1.fc41.copr7998582 Checking for unpackaged file(s): /usr/lib/rpm/check-files /builddir/build/BUILD/R-CRAN-starvz-0.8.2-build/BUILDROOT Wrote: /builddir/build/RPMS/R-CRAN-starvz-debugsource-0.8.2-1.fc41.copr7998582.x86_64.rpm Wrote: /builddir/build/RPMS/R-CRAN-starvz-0.8.2-1.fc41.copr7998582.x86_64.rpm Wrote: /builddir/build/RPMS/R-CRAN-starvz-debuginfo-0.8.2-1.fc41.copr7998582.x86_64.rpm Executing(rmbuild): /bin/sh -e /var/tmp/rpm-tmp.ks3AWL + umask 022 + cd /builddir/build/BUILD/R-CRAN-starvz-0.8.2-build + test -d /builddir/build/BUILD/R-CRAN-starvz-0.8.2-build + /usr/bin/chmod -Rf a+rX,u+w,g-w,o-w /builddir/build/BUILD/R-CRAN-starvz-0.8.2-build + rm -rf /builddir/build/BUILD/R-CRAN-starvz-0.8.2-build + RPM_EC=0 ++ jobs -p + exit 0 RPM build warnings: %source_date_epoch_from_changelog is set, but %changelog has no entries to take a date from Finish: rpmbuild R-CRAN-starvz-0.8.2-1.fc41.copr7998582.src.rpm Finish: build phase for R-CRAN-starvz-0.8.2-1.fc41.copr7998582.src.rpm INFO: chroot_scan: 1 files copied to /var/lib/copr-rpmbuild/results/chroot_scan INFO: /var/lib/mock/fedora-41-x86_64-1725845899.389089/root/var/log/dnf5.log INFO: Done(/var/lib/copr-rpmbuild/results/R-CRAN-starvz-0.8.2-1.fc41.copr7998582.src.rpm) Config(child) 0 minutes 39 seconds INFO: Results and/or logs in: /var/lib/copr-rpmbuild/results INFO: Cleaning up build root ('cleanup_on_success=True') Start: clean chroot INFO: unmounting tmpfs. Finish: clean chroot Finish: run Running RPMResults tool Package info: { "packages": [ { "name": "R-CRAN-starvz", "epoch": null, "version": "0.8.2", "release": "1.fc41.copr7998582", "arch": "src" }, { "name": "R-CRAN-starvz", "epoch": null, "version": "0.8.2", "release": "1.fc41.copr7998582", "arch": "x86_64" }, { "name": "R-CRAN-starvz-debugsource", "epoch": null, "version": "0.8.2", "release": "1.fc41.copr7998582", "arch": "x86_64" }, { "name": "R-CRAN-starvz-debuginfo", "epoch": null, "version": "0.8.2", "release": "1.fc41.copr7998582", "arch": "x86_64" } ] } RPMResults finished