Warning: Permanently added '34.229.230.126' (ED25519) to the list of known hosts. Running (timeout=18000): unbuffer mock --spec /var/lib/copr-rpmbuild/workspace/workdir-8s6jdnco/R-CRAN-starvz/R-CRAN-starvz.spec --sources /var/lib/copr-rpmbuild/workspace/workdir-8s6jdnco/R-CRAN-starvz --resultdir /var/lib/copr-rpmbuild/results --uniqueext 1750298820.676242 -r /var/lib/copr-rpmbuild/results/configs/child.cfg INFO: mock.py version 6.3 starting (python version = 3.13.3, NVR = mock-6.3-1.fc42), args: /usr/libexec/mock/mock --spec /var/lib/copr-rpmbuild/workspace/workdir-8s6jdnco/R-CRAN-starvz/R-CRAN-starvz.spec --sources /var/lib/copr-rpmbuild/workspace/workdir-8s6jdnco/R-CRAN-starvz --resultdir /var/lib/copr-rpmbuild/results --uniqueext 1750298820.676242 -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-8s6jdnco/R-CRAN-starvz/R-CRAN-starvz.spec) Config(fedora-rawhide-x86_64) Start: clean chroot Finish: clean chroot Mock Version: 6.3 INFO: Mock Version: 6.3 Start: chroot init INFO: mounting tmpfs at /var/lib/mock/fedora-rawhide-x86_64-1750298820.676242/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.20.1-1.fc42.x86_64 rpm-sequoia-1.7.0-5.fc42.x86_64 python3-dnf-4.23.0-1.fc42.noarch python3-dnf-plugins-core-4.10.1-1.fc42.noarch dnf5-5.2.13.1-1.fc42.x86_64 dnf5-plugins-5.2.13.1-1.fc42.x86_64 Start: installing minimal buildroot with dnf5 Updating and loading repositories: fedora 100% | 97.2 KiB/s | 28.9 KiB | 00m00s Copr repository 100% | 41.6 KiB/s | 1.5 KiB | 00m00s Copr repository 100% | 92.5 MiB/s | 12.7 MiB | 00m00s Repositories loaded. Package Arch Version Repository Size Installing group/module packages: bash x86_64 5.2.37-3.fc43 fedora 8.2 MiB bzip2 x86_64 1.0.8-20.fc42 fedora 99.3 KiB coreutils x86_64 9.7-3.fc43 fedora 5.4 MiB cpio x86_64 2.15-2.fc41 fedora 1.1 MiB diffutils x86_64 3.12-2.fc43 fedora 1.6 MiB fedora-release-common noarch 43-0.16 fedora 20.4 KiB findutils x86_64 1:4.10.0-5.fc42 fedora 1.9 MiB gawk x86_64 5.3.2-1.fc43 fedora 1.8 MiB glibc-minimal-langpack x86_64 2.41.9000-15.fc43 fedora 0.0 B grep x86_64 3.12-1.fc43 fedora 1.0 MiB gzip x86_64 1.13-3.fc42 fedora 392.9 KiB info x86_64 7.2-3.fc42 fedora 357.9 KiB patch x86_64 2.8-1.fc43 fedora 226.8 KiB redhat-rpm-config noarch 343-6.fc43 fedora 181.4 KiB rpm-build x86_64 5.99.90-6.fc43 fedora 281.7 KiB sed x86_64 4.9-4.fc42 fedora 857.3 KiB shadow-utils x86_64 2:4.17.4-1.fc43 fedora 4.0 MiB tar x86_64 2:1.35-5.fc42 fedora 3.0 MiB unzip x86_64 6.0-66.fc42 fedora 390.3 KiB util-linux x86_64 2.40.4-8.fc43 fedora 3.4 MiB which x86_64 2.23-1.fc42 fedora 83.4 KiB xz x86_64 1:5.8.1-1.fc43 fedora 1.3 MiB Installing dependencies: add-determinism x86_64 0.6.0-1.fc43 fedora 2.5 MiB alternatives x86_64 1.33-1.fc43 fedora 62.2 KiB ansible-srpm-macros noarch 1-17.1.fc42 fedora 35.7 KiB audit-libs x86_64 4.0.5-1.fc43 fedora 351.3 KiB binutils x86_64 2.44-3.fc43 fedora 25.9 MiB build-reproducibility-srpm-macros noarch 0.6.0-1.fc43 fedora 735.0 B bzip2-libs x86_64 1.0.8-20.fc42 fedora 84.6 KiB ca-certificates noarch 2024.2.69_v8.0.401-5.fc42 fedora 2.6 MiB coreutils-common x86_64 9.7-3.fc43 fedora 11.3 MiB crypto-policies noarch 20250603-1.git3a584b3.fc43 fedora 142.2 KiB curl x86_64 8.14.1-1.fc43 fedora 474.1 KiB cyrus-sasl-lib x86_64 2.1.28-30.fc42 fedora 2.3 MiB debugedit x86_64 5.1-6.fc43 fedora 192.7 KiB dwz x86_64 0.16-1.fc43 fedora 287.1 KiB ed x86_64 1.21-2.fc42 fedora 146.5 KiB efi-srpm-macros noarch 6-3.fc43 fedora 40.1 KiB elfutils x86_64 0.193-2.fc43 fedora 2.9 MiB elfutils-debuginfod-client x86_64 0.193-2.fc43 fedora 83.9 KiB elfutils-default-yama-scope noarch 0.193-2.fc43 fedora 1.8 KiB elfutils-libelf x86_64 0.193-2.fc43 fedora 1.2 MiB elfutils-libs x86_64 0.193-2.fc43 fedora 683.4 KiB fedora-gpg-keys noarch 43-0.2 fedora 129.0 KiB fedora-release noarch 43-0.16 fedora 0.0 B fedora-release-identity-basic noarch 43-0.16 fedora 664.0 B fedora-repos noarch 43-0.2 fedora 4.9 KiB fedora-repos-rawhide noarch 43-0.2 fedora 2.2 KiB file x86_64 5.46-5.fc43 fedora 100.2 KiB file-libs x86_64 5.46-5.fc43 fedora 11.9 MiB filesystem x86_64 3.18-44.fc43 fedora 112.0 B filesystem-srpm-macros noarch 3.18-44.fc43 fedora 38.2 KiB fonts-srpm-macros noarch 1:2.0.5-22.fc43 fedora 55.8 KiB forge-srpm-macros noarch 0.4.0-2.fc42 fedora 38.9 KiB fpc-srpm-macros noarch 1.3-14.fc42 fedora 144.0 B gdb-minimal x86_64 16.3-3.fc43 fedora 13.2 MiB gdbm-libs x86_64 1:1.23-9.fc42 fedora 129.9 KiB ghc-srpm-macros noarch 1.9.2-2.fc42 fedora 779.0 B glibc x86_64 2.41.9000-15.fc43 fedora 6.7 MiB glibc-common x86_64 2.41.9000-15.fc43 fedora 1.0 MiB glibc-gconv-extra x86_64 2.41.9000-15.fc43 fedora 7.2 MiB gmp x86_64 1:6.3.0-3.fc43 fedora 819.2 KiB gnat-srpm-macros noarch 6-7.fc42 fedora 1.0 KiB gnupg2 x86_64 2.4.8-2.fc43 fedora 6.5 MiB gnupg2-dirmngr x86_64 2.4.8-2.fc43 fedora 618.4 KiB gnupg2-gpg-agent x86_64 2.4.8-2.fc43 fedora 671.4 KiB gnupg2-gpgconf x86_64 2.4.8-2.fc43 fedora 250.0 KiB gnupg2-keyboxd x86_64 2.4.8-2.fc43 fedora 201.4 KiB gnupg2-verify x86_64 2.4.8-2.fc43 fedora 348.5 KiB gnutls x86_64 3.8.9-5.fc43 fedora 3.6 MiB go-srpm-macros noarch 3.6.0-7.fc43 fedora 60.8 KiB gpgverify noarch 2.1-3.fc43 fedora 8.7 KiB ima-evm-utils-libs x86_64 1.6.2-5.fc43 fedora 60.7 KiB jansson x86_64 2.14-2.fc42 fedora 93.1 KiB java-srpm-macros noarch 1-4.fc43 fedora 894.0 B json-c x86_64 0.18-2.fc42 fedora 86.7 KiB kernel-srpm-macros noarch 1.0-25.fc42 fedora 1.9 KiB keyutils-libs x86_64 1.6.3-5.fc42 fedora 58.3 KiB krb5-libs x86_64 1.21.3-6.fc43 fedora 2.3 MiB libacl x86_64 2.3.2-3.fc42 fedora 38.3 KiB libarchive x86_64 3.8.1-1.fc43 fedora 951.1 KiB libassuan x86_64 2.5.7-3.fc42 fedora 167.8 KiB libattr x86_64 2.5.2-5.fc42 fedora 27.1 KiB libblkid x86_64 2.40.4-8.fc43 fedora 262.4 KiB libbrotli x86_64 1.1.0-7.fc43 fedora 833.3 KiB libcap x86_64 2.76-1.fc43 fedora 209.2 KiB libcap-ng x86_64 0.8.5-5.fc43 fedora 68.9 KiB libcom_err x86_64 1.47.2-3.fc42 fedora 67.1 KiB libcurl x86_64 8.14.1-1.fc43 fedora 895.2 KiB libeconf x86_64 0.7.9-1.fc43 fedora 64.9 KiB libevent x86_64 2.1.12-15.fc42 fedora 903.1 KiB libfdisk x86_64 2.40.4-8.fc43 fedora 372.3 KiB libffi x86_64 3.5.1-1.fc43 fedora 83.6 KiB libfsverity x86_64 1.6-2.fc42 fedora 32.5 KiB libgcc x86_64 15.1.1-2.fc43 fedora 266.6 KiB libgcrypt x86_64 1.11.1-1.fc43 fedora 1.6 MiB libgomp x86_64 15.1.1-2.fc43 fedora 539.1 KiB libgpg-error x86_64 1.55-1.fc43 fedora 915.3 KiB libidn2 x86_64 2.3.8-1.fc43 fedora 552.5 KiB libksba x86_64 1.6.7-3.fc42 fedora 402.5 KiB libmount x86_64 2.40.4-8.fc43 fedora 356.3 KiB libnghttp2 x86_64 1.65.0-1.fc43 fedora 162.2 KiB libpkgconf x86_64 2.3.0-2.fc42 fedora 78.1 KiB libpsl x86_64 0.21.5-5.fc42 fedora 76.4 KiB libselinux x86_64 3.8-3.fc43 fedora 193.1 KiB libsemanage x86_64 3.8.1-3.fc43 fedora 304.4 KiB libsepol x86_64 3.8-1.fc42 fedora 826.0 KiB libsmartcols x86_64 2.40.4-8.fc43 fedora 176.4 KiB libssh x86_64 0.11.1-4.fc42 fedora 565.5 KiB libssh-config noarch 0.11.1-4.fc42 fedora 277.0 B libstdc++ x86_64 15.1.1-2.fc43 fedora 2.8 MiB libtasn1 x86_64 4.20.0-1.fc43 fedora 176.3 KiB libtool-ltdl x86_64 2.5.4-4.fc42 fedora 70.1 KiB libunistring x86_64 1.1-9.fc42 fedora 1.7 MiB libusb1 x86_64 1.0.28-2.fc43 fedora 171.0 KiB libuuid x86_64 2.40.4-8.fc43 fedora 37.3 KiB libverto x86_64 0.3.2-10.fc42 fedora 25.4 KiB libxcrypt x86_64 4.4.38-7.fc43 fedora 284.5 KiB libxml2 x86_64 2.12.10-2.fc43 fedora 1.7 MiB libzstd x86_64 1.5.7-1.fc43 fedora 807.8 KiB lua-libs x86_64 5.4.8-1.fc43 fedora 280.8 KiB lua-srpm-macros noarch 1-15.fc42 fedora 1.3 KiB lz4-libs x86_64 1.10.0-2.fc42 fedora 157.4 KiB mpfr x86_64 4.2.2-1.fc43 fedora 828.8 KiB ncurses-base noarch 6.5-5.20250125.fc42 fedora 326.8 KiB ncurses-libs x86_64 6.5-5.20250125.fc42 fedora 946.3 KiB nettle x86_64 3.10.1-1.fc43 fedora 790.5 KiB npth x86_64 1.8-2.fc42 fedora 49.6 KiB ocaml-srpm-macros noarch 10-4.fc42 fedora 1.9 KiB openblas-srpm-macros noarch 2-19.fc42 fedora 112.0 B openldap x86_64 2.6.10-1.fc43 fedora 655.8 KiB openssl-libs x86_64 1:3.5.0-5.fc43 fedora 8.9 MiB p11-kit x86_64 0.25.5-8.fc43 fedora 2.2 MiB p11-kit-trust x86_64 0.25.5-8.fc43 fedora 395.5 KiB package-notes-srpm-macros noarch 0.5-13.fc42 fedora 1.6 KiB pam-libs x86_64 1.7.0-4.fc42 fedora 126.7 KiB pcre2 x86_64 10.45-1.fc43 fedora 697.7 KiB pcre2-syntax noarch 10.45-1.fc43 fedora 273.9 KiB perl-srpm-macros noarch 1-57.fc42 fedora 861.0 B pkgconf x86_64 2.3.0-2.fc42 fedora 88.5 KiB pkgconf-m4 noarch 2.3.0-2.fc42 fedora 14.4 KiB pkgconf-pkg-config x86_64 2.3.0-2.fc42 fedora 989.0 B popt x86_64 1.19-8.fc42 fedora 132.8 KiB publicsuffix-list-dafsa noarch 20250616-1.fc43 fedora 69.1 KiB pyproject-srpm-macros noarch 1.18.1-1.fc43 fedora 1.9 KiB python-srpm-macros noarch 3.14-1.fc43 fedora 51.7 KiB qt5-srpm-macros noarch 5.15.17-1.fc43 fedora 500.0 B qt6-srpm-macros noarch 6.9.1-1.fc43 fedora 464.0 B readline x86_64 8.2-13.fc43 fedora 485.0 KiB rpm x86_64 5.99.90-6.fc43 fedora 3.1 MiB rpm-build-libs x86_64 5.99.90-6.fc43 fedora 264.4 KiB rpm-libs x86_64 5.99.90-6.fc43 fedora 929.8 KiB rpm-sequoia x86_64 1.8.0-1.fc43 fedora 2.5 MiB rpm-sign-libs x86_64 5.99.90-6.fc43 fedora 39.7 KiB rust-srpm-macros noarch 26.3-4.fc42 fedora 4.8 KiB setup noarch 2.15.0-25.fc43 fedora 725.0 KiB sqlite-libs x86_64 3.50.0-1.fc43 fedora 1.5 MiB systemd-libs x86_64 257.6-1.fc43 fedora 2.2 MiB systemd-standalone-sysusers x86_64 257.6-1.fc43 fedora 277.3 KiB tpm2-tss x86_64 4.1.3-7.fc43 fedora 1.6 MiB tree-sitter-srpm-macros noarch 0.4.1-1.fc43 fedora 8.2 KiB util-linux-core x86_64 2.40.4-8.fc43 fedora 1.4 MiB xxhash-libs x86_64 0.8.3-2.fc42 fedora 90.2 KiB xz-libs x86_64 1:5.8.1-1.fc43 fedora 217.8 KiB zig-srpm-macros noarch 1-4.fc42 fedora 1.1 KiB zip x86_64 3.0-43.fc42 fedora 698.5 KiB zlib-ng-compat x86_64 2.2.4-2.fc43 fedora 137.6 KiB zstd x86_64 1.5.7-1.fc43 fedora 1.7 MiB Installing groups: Buildsystem building group Transaction Summary: Installing: 168 packages Total size of inbound packages is 58 MiB. Need to download 0 B. After this operation, 197 MiB extra will be used (install 197 MiB, remove 0 B). [ 1/168] tar-2:1.35-5.fc42.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 2/168] bzip2-0:1.0.8-20.fc42.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 3/168] redhat-rpm-config-0:343-6.fc4 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 4/168] rpm-build-0:5.99.90-6.fc43.x8 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 5/168] unzip-0:6.0-66.fc42.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 6/168] cpio-0:2.15-2.fc41.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 7/168] which-0:2.23-1.fc42.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 8/168] bash-0:5.2.37-3.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 9/168] coreutils-0:9.7-3.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 10/168] grep-0:3.12-1.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 11/168] patch-0:2.8-1.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 12/168] sed-0:4.9-4.fc42.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 13/168] shadow-utils-2:4.17.4-1.fc43. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 14/168] diffutils-0:3.12-2.fc43.x86_6 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 15/168] fedora-release-common-0:43-0. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 16/168] findutils-1:4.10.0-5.fc42.x86 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 17/168] glibc-minimal-langpack-0:2.41 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 18/168] gzip-0:1.13-3.fc42.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 19/168] info-0:7.2-3.fc42.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 20/168] xz-1:5.8.1-1.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 21/168] util-linux-0:2.40.4-8.fc43.x8 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 22/168] gawk-0:5.3.2-1.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 23/168] glibc-0:2.41.9000-15.fc43.x86 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 24/168] libacl-0:2.3.2-3.fc42.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 25/168] libselinux-0:3.8-3.fc43.x86_6 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 26/168] bzip2-libs-0:1.0.8-20.fc42.x8 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 27/168] ansible-srpm-macros-0:1-17.1. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 28/168] build-reproducibility-srpm-ma 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 29/168] dwz-0:0.16-1.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 30/168] efi-srpm-macros-0:6-3.fc43.no 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 31/168] file-0:5.46-5.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 32/168] filesystem-srpm-macros-0:3.18 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 33/168] fonts-srpm-macros-1:2.0.5-22. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 34/168] forge-srpm-macros-0:0.4.0-2.f 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 35/168] fpc-srpm-macros-0:1.3-14.fc42 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 36/168] ghc-srpm-macros-0:1.9.2-2.fc4 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 37/168] gnat-srpm-macros-0:6-7.fc42.n 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 38/168] go-srpm-macros-0:3.6.0-7.fc43 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 39/168] java-srpm-macros-0:1-4.fc43.n 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 40/168] kernel-srpm-macros-0:1.0-25.f 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 41/168] lua-srpm-macros-0:1-15.fc42.n 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 42/168] ocaml-srpm-macros-0:10-4.fc42 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 43/168] openblas-srpm-macros-0:2-19.f 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 44/168] package-notes-srpm-macros-0:0 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 45/168] perl-srpm-macros-0:1-57.fc42. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 46/168] pyproject-srpm-macros-0:1.18. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 47/168] python-srpm-macros-0:3.14-1.f 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 48/168] qt5-srpm-macros-0:5.15.17-1.f 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 49/168] qt6-srpm-macros-0:6.9.1-1.fc4 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 50/168] rpm-0:5.99.90-6.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 51/168] rust-srpm-macros-0:26.3-4.fc4 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 52/168] tree-sitter-srpm-macros-0:0.4 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 53/168] zig-srpm-macros-0:1-4.fc42.no 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 54/168] zip-0:3.0-43.fc42.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 55/168] debugedit-0:5.1-6.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 56/168] elfutils-0:0.193-2.fc43.x86_6 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 57/168] elfutils-libelf-0:0.193-2.fc4 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 58/168] libarchive-0:3.8.1-1.fc43.x86 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 59/168] libgcc-0:15.1.1-2.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 60/168] libstdc++-0:15.1.1-2.fc43.x86 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 61/168] popt-0:1.19-8.fc42.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 62/168] readline-0:8.2-13.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 63/168] rpm-build-libs-0:5.99.90-6.fc 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 64/168] rpm-libs-0:5.99.90-6.fc43.x86 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 65/168] zstd-0:1.5.7-1.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 66/168] filesystem-0:3.18-44.fc43.x86 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 67/168] ncurses-libs-0:6.5-5.20250125 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 68/168] coreutils-common-0:9.7-3.fc43 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 69/168] gmp-1:6.3.0-3.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 70/168] libattr-0:2.5.2-5.fc42.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 71/168] libcap-0:2.76-1.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 72/168] openssl-libs-1:3.5.0-5.fc43.x 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 73/168] systemd-libs-0:257.6-1.fc43.x 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 74/168] pcre2-0:10.45-1.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 75/168] ed-0:1.21-2.fc42.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 76/168] audit-libs-0:4.0.5-1.fc43.x86 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 77/168] libeconf-0:0.7.9-1.fc43.x86_6 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 78/168] libsemanage-0:3.8.1-3.fc43.x8 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 79/168] libxcrypt-0:4.4.38-7.fc43.x86 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 80/168] pam-libs-0:1.7.0-4.fc42.x86_6 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 81/168] setup-0:2.15.0-25.fc43.noarch 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 82/168] fedora-repos-0:43-0.2.noarch 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 83/168] glibc-common-0:2.41.9000-15.f 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 84/168] xz-libs-1:5.8.1-1.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 85/168] libblkid-0:2.40.4-8.fc43.x86_ 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 86/168] libcap-ng-0:0.8.5-5.fc43.x86_ 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 87/168] libfdisk-0:2.40.4-8.fc43.x86_ 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 88/168] libmount-0:2.40.4-8.fc43.x86_ 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 89/168] libsmartcols-0:2.40.4-8.fc43. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 90/168] libuuid-0:2.40.4-8.fc43.x86_6 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 91/168] util-linux-core-0:2.40.4-8.fc 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 92/168] zlib-ng-compat-0:2.2.4-2.fc43 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 93/168] mpfr-0:4.2.2-1.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 94/168] glibc-gconv-extra-0:2.41.9000 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 95/168] libsepol-0:3.8-1.fc42.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 96/168] add-determinism-0:0.6.0-1.fc4 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 97/168] file-libs-0:5.46-5.fc43.x86_6 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 98/168] curl-0:8.14.1-1.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 99/168] elfutils-libs-0:0.193-2.fc43. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [100/168] elfutils-debuginfod-client-0: 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [101/168] libzstd-0:1.5.7-1.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [102/168] libxml2-0:2.12.10-2.fc43.x86_ 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [103/168] lz4-libs-0:1.10.0-2.fc42.x86_ 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [104/168] libgomp-0:15.1.1-2.fc43.x86_6 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [105/168] lua-libs-0:5.4.8-1.fc43.x86_6 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [106/168] rpm-sign-libs-0:5.99.90-6.fc4 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [107/168] rpm-sequoia-0:1.8.0-1.fc43.x8 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [108/168] sqlite-libs-0:3.50.0-1.fc43.x 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [109/168] ncurses-base-0:6.5-5.20250125 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [110/168] ca-certificates-0:2024.2.69_v 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [111/168] crypto-policies-0:20250603-1. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [112/168] pcre2-syntax-0:10.45-1.fc43.n 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [113/168] fedora-gpg-keys-0:43-0.2.noar 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [114/168] fedora-repos-rawhide-0:43-0.2 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [115/168] elfutils-default-yama-scope-0 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [116/168] json-c-0:0.18-2.fc42.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [117/168] gnupg2-0:2.4.8-2.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [118/168] ima-evm-utils-libs-0:1.6.2-5. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [119/168] libfsverity-0:1.6-2.fc42.x86_ 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [120/168] gpgverify-0:2.1-3.fc43.noarch 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [121/168] gnupg2-dirmngr-0:2.4.8-2.fc43 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [122/168] gnupg2-gpg-agent-0:2.4.8-2.fc 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [123/168] gnupg2-gpgconf-0:2.4.8-2.fc43 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [124/168] gnupg2-keyboxd-0:2.4.8-2.fc43 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [125/168] gnupg2-verify-0:2.4.8-2.fc43. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [126/168] libassuan-0:2.5.7-3.fc42.x86_ 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [127/168] libgcrypt-0:1.11.1-1.fc43.x86 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [128/168] libgpg-error-0:1.55-1.fc43.x8 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [129/168] npth-0:1.8-2.fc42.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [130/168] tpm2-tss-0:4.1.3-7.fc43.x86_6 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [131/168] gnutls-0:3.8.9-5.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [132/168] libksba-0:1.6.7-3.fc42.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [133/168] openldap-0:2.6.10-1.fc43.x86_ 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [134/168] libusb1-0:1.0.28-2.fc43.x86_6 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [135/168] libidn2-0:2.3.8-1.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [136/168] libtasn1-0:4.20.0-1.fc43.x86_ 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [137/168] libunistring-0:1.1-9.fc42.x86 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [138/168] nettle-0:3.10.1-1.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [139/168] p11-kit-0:0.25.5-8.fc43.x86_6 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [140/168] cyrus-sasl-lib-0:2.1.28-30.fc 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [141/168] libevent-0:2.1.12-15.fc42.x86 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [142/168] libtool-ltdl-0:2.5.4-4.fc42.x 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [143/168] libffi-0:3.5.1-1.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [144/168] gdbm-libs-1:1.23-9.fc42.x86_6 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [145/168] binutils-0:2.44-3.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [146/168] alternatives-0:1.33-1.fc43.x8 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [147/168] jansson-0:2.14-2.fc42.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [148/168] pkgconf-pkg-config-0:2.3.0-2. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [149/168] pkgconf-0:2.3.0-2.fc42.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [150/168] pkgconf-m4-0:2.3.0-2.fc42.noa 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [151/168] libpkgconf-0:2.3.0-2.fc42.x86 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [152/168] p11-kit-trust-0:0.25.5-8.fc43 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [153/168] fedora-release-0:43-0.16.noar 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [154/168] systemd-standalone-sysusers-0 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [155/168] gdb-minimal-0:16.3-3.fc43.x86 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [156/168] xxhash-libs-0:0.8.3-2.fc42.x8 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [157/168] fedora-release-identity-basic 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [158/168] libcurl-0:8.14.1-1.fc43.x86_6 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [159/168] krb5-libs-0:1.21.3-6.fc43.x86 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [160/168] libbrotli-0:1.1.0-7.fc43.x86_ 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [161/168] libnghttp2-0:1.65.0-1.fc43.x8 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [162/168] libpsl-0:0.21.5-5.fc42.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [163/168] libssh-0:0.11.1-4.fc42.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [164/168] keyutils-libs-0:1.6.3-5.fc42. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [165/168] libcom_err-0:1.47.2-3.fc42.x8 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [166/168] libverto-0:0.3.2-10.fc42.x86_ 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [167/168] publicsuffix-list-dafsa-0:202 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [168/168] libssh-config-0:0.11.1-4.fc42 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded -------------------------------------------------------------------------------- [168/168] Total 100% | 0.0 B/s | 0.0 B | 00m00s Running transaction Importing OpenPGP key 0x31645531: UserID : "Fedora (43) " Fingerprint: C6E7F081CF80E13146676E88829B606631645531 From : file:///usr/share/distribution-gpg-keys/fedora/RPM-GPG-KEY-fedora-43-primary The key was successfully imported. Importing OpenPGP key 0x105EF944: UserID : "Fedora (42) " Fingerprint: B0F4950458F69E1150C6C5EDC8AC4916105EF944 From : file:///usr/share/distribution-gpg-keys/fedora/RPM-GPG-KEY-fedora-42-primary The key was successfully imported. Importing OpenPGP key 0x6D9F90A6: UserID : "Fedora (44) " Fingerprint: 36F612DCF27F7D1A48A835E4DBFCF71C6D9F90A6 From : file:///usr/share/distribution-gpg-keys/fedora/RPM-GPG-KEY-fedora-44-primary The key was successfully imported. [ 1/170] Verify package files 100% | 879.0 B/s | 168.0 B | 00m00s [ 2/170] Prepare transaction 100% | 4.6 KiB/s | 168.0 B | 00m00s [ 3/170] Installing libgcc-0:15.1.1-2. 100% | 262.0 MiB/s | 268.3 KiB | 00m00s [ 4/170] Installing libssh-config-0:0. 100% | 0.0 B/s | 816.0 B | 00m00s [ 5/170] Installing publicsuffix-list- 100% | 0.0 B/s | 69.8 KiB | 00m00s [ 6/170] Installing fedora-release-ide 100% | 0.0 B/s | 920.0 B | 00m00s [ 7/170] Installing fedora-gpg-keys-0: 100% | 57.3 MiB/s | 175.9 KiB | 00m00s [ 8/170] Installing fedora-repos-rawhi 100% | 0.0 B/s | 2.4 KiB | 00m00s [ 9/170] Installing fedora-repos-0:43- 100% | 0.0 B/s | 5.7 KiB | 00m00s [ 10/170] Installing fedora-release-com 100% | 24.1 MiB/s | 24.7 KiB | 00m00s [ 11/170] Installing fedora-release-0:4 100% | 9.3 KiB/s | 124.0 B | 00m00s >>> Running sysusers scriptlet: setup-0:2.15.0-25.fc43.noarch >>> Finished sysusers scriptlet: setup-0:2.15.0-25.fc43.noarch >>> Scriptlet output: >>> Creating group 'adm' with GID 4. >>> Creating group 'audio' with GID 63. >>> Creating group 'cdrom' with GID 11. >>> Creating group 'clock' with GID 103. >>> Creating group 'dialout' with GID 18. >>> Creating group 'disk' with GID 6. >>> Creating group 'floppy' with GID 19. >>> Creating group 'ftp' with GID 50. >>> Creating group 'games' with GID 20. >>> Creating group 'input' with GID 104. >>> Creating group 'kmem' with GID 9. >>> Creating group 'kvm' with GID 36. >>> Creating group 'lock' with GID 54. >>> Creating group 'lp' with GID 7. >>> Creating group 'mail' with GID 12. >>> Creating group 'man' with GID 15. >>> Creating group 'mem' with GID 8. >>> Creating group 'nobody' with GID 65534. >>> Creating group 'render' with GID 105. >>> Creating group 'root' with GID 0. >>> Creating group 'sgx' with GID 106. >>> Creating group 'sys' with GID 3. >>> Creating group 'tape' with GID 33. >>> Creating group 'tty' with GID 5. >>> Creating group 'users' with GID 100. >>> Creating group 'utmp' with GID 22. >>> Creating group 'video' with GID 39. >>> Creating group 'wheel' with GID 10. >>> Creating user 'adm' (adm) with UID 3 and GID 4. >>> Creating group 'bin' with GID 1. >>> Creating user 'bin' (bin) with UID 1 and GID 1. >>> Creating group 'daemon' with GID 2. >>> Creating user 'daemon' (daemon) with UID 2 and GID 2. >>> Creating user 'ftp' (FTP User) with UID 14 and GID 50. >>> Creating user 'games' (games) with UID 12 and GID 100. >>> Creating user 'halt' (halt) with UID 7 and GID 0. >>> Creating user 'lp' (lp) with UID 4 and GID 7. >>> Creating user 'mail' (mail) with UID 8 and GID 12. >>> Creating user 'nobody' (Kernel Overflow User) with UID 65534 and GID 65534. >>> Creating user 'operator' (operator) with UID 11 and GID 0. >>> Creating user 'root' (Super User) with UID 0 and GID 0. >>> Creating user 'shutdown' (shutdown) with UID 6 and GID 0. >>> Creating user 'sync' (sync) with UID 5 and GID 0. >>> [ 12/170] Installing setup-0:2.15.0-25. 100% | 51.0 MiB/s | 730.6 KiB | 00m00s >>> [RPM] /etc/hosts created as /etc/hosts.rpmnew [ 13/170] Installing filesystem-0:3.18- 100% | 2.9 MiB/s | 212.5 KiB | 00m00s [ 14/170] Installing pkgconf-m4-0:2.3.0 100% | 0.0 B/s | 14.8 KiB | 00m00s [ 15/170] Installing pcre2-syntax-0:10. 100% | 269.9 MiB/s | 276.4 KiB | 00m00s [ 16/170] Installing ncurses-base-0:6.5 100% | 86.0 MiB/s | 352.2 KiB | 00m00s [ 17/170] Installing glibc-minimal-lang 100% | 0.0 B/s | 124.0 B | 00m00s [ 18/170] Installing ncurses-libs-0:6.5 100% | 232.6 MiB/s | 952.8 KiB | 00m00s [ 19/170] Installing glibc-0:2.41.9000- 100% | 208.7 MiB/s | 6.7 MiB | 00m00s [ 20/170] Installing bash-0:5.2.37-3.fc 100% | 282.1 MiB/s | 8.2 MiB | 00m00s [ 21/170] Installing glibc-common-0:2.4 100% | 63.8 MiB/s | 1.0 MiB | 00m00s [ 22/170] Installing glibc-gconv-extra- 100% | 270.8 MiB/s | 7.3 MiB | 00m00s [ 23/170] Installing zlib-ng-compat-0:2 100% | 135.2 MiB/s | 138.4 KiB | 00m00s [ 24/170] Installing bzip2-libs-0:1.0.8 100% | 83.7 MiB/s | 85.7 KiB | 00m00s [ 25/170] Installing libgpg-error-0:1.5 100% | 56.2 MiB/s | 921.1 KiB | 00m00s [ 26/170] Installing libstdc++-0:15.1.1 100% | 405.2 MiB/s | 2.8 MiB | 00m00s [ 27/170] Installing xz-libs-1:5.8.1-1. 100% | 213.8 MiB/s | 218.9 KiB | 00m00s [ 28/170] Installing libassuan-0:2.5.7- 100% | 165.6 MiB/s | 169.6 KiB | 00m00s [ 29/170] Installing libgcrypt-0:1.11.1 100% | 393.8 MiB/s | 1.6 MiB | 00m00s [ 30/170] Installing readline-0:8.2-13. 100% | 475.7 MiB/s | 487.1 KiB | 00m00s [ 31/170] Installing gmp-1:6.3.0-3.fc43 100% | 267.4 MiB/s | 821.5 KiB | 00m00s [ 32/170] Installing libuuid-0:2.40.4-8 100% | 37.4 MiB/s | 38.3 KiB | 00m00s [ 33/170] Installing popt-0:1.19-8.fc42 100% | 45.4 MiB/s | 139.4 KiB | 00m00s [ 34/170] Installing npth-0:1.8-2.fc42. 100% | 49.5 MiB/s | 50.7 KiB | 00m00s [ 35/170] Installing libblkid-0:2.40.4- 100% | 128.6 MiB/s | 263.4 KiB | 00m00s [ 36/170] Installing libxcrypt-0:4.4.38 100% | 140.2 MiB/s | 287.2 KiB | 00m00s [ 37/170] Installing libzstd-0:1.5.7-1. 100% | 395.1 MiB/s | 809.1 KiB | 00m00s [ 38/170] Installing elfutils-libelf-0: 100% | 388.8 MiB/s | 1.2 MiB | 00m00s [ 39/170] Installing gnupg2-gpgconf-0:2 100% | 11.2 MiB/s | 252.1 KiB | 00m00s [ 40/170] Installing crypto-policies-0: 100% | 40.8 MiB/s | 167.3 KiB | 00m00s [ 41/170] Installing libattr-0:2.5.2-5. 100% | 0.0 B/s | 28.1 KiB | 00m00s [ 42/170] Installing libacl-0:2.3.2-3.f 100% | 38.2 MiB/s | 39.2 KiB | 00m00s [ 43/170] Installing sqlite-libs-0:3.50 100% | 303.3 MiB/s | 1.5 MiB | 00m00s [ 44/170] Installing libtasn1-0:4.20.0- 100% | 173.9 MiB/s | 178.1 KiB | 00m00s [ 45/170] Installing libunistring-0:1.1 100% | 345.3 MiB/s | 1.7 MiB | 00m00s [ 46/170] Installing libidn2-0:2.3.8-1. 100% | 181.9 MiB/s | 558.7 KiB | 00m00s [ 47/170] Installing dwz-0:0.16-1.fc43. 100% | 20.1 MiB/s | 288.5 KiB | 00m00s [ 48/170] Installing mpfr-0:4.2.2-1.fc4 100% | 270.3 MiB/s | 830.4 KiB | 00m00s [ 49/170] Installing gawk-0:5.3.2-1.fc4 100% | 100.9 MiB/s | 1.8 MiB | 00m00s [ 50/170] Installing libksba-0:1.6.7-3. 100% | 197.8 MiB/s | 405.1 KiB | 00m00s [ 51/170] Installing unzip-0:6.0-66.fc4 100% | 29.6 MiB/s | 393.8 KiB | 00m00s [ 52/170] Installing file-libs-0:5.46-5 100% | 658.7 MiB/s | 11.9 MiB | 00m00s [ 53/170] Installing file-0:5.46-5.fc43 100% | 7.6 MiB/s | 101.7 KiB | 00m00s [ 54/170] Installing pcre2-0:10.45-1.fc 100% | 341.4 MiB/s | 699.1 KiB | 00m00s [ 55/170] Installing grep-0:3.12-1.fc43 100% | 59.0 MiB/s | 1.0 MiB | 00m00s [ 56/170] Installing xz-1:5.8.1-1.fc43. 100% | 74.0 MiB/s | 1.3 MiB | 00m00s [ 57/170] Installing libeconf-0:0.7.9-1 100% | 65.0 MiB/s | 66.5 KiB | 00m00s [ 58/170] Installing libcap-ng-0:0.8.5- 100% | 69.2 MiB/s | 70.8 KiB | 00m00s [ 59/170] Installing audit-libs-0:4.0.5 100% | 345.1 MiB/s | 353.4 KiB | 00m00s [ 60/170] Installing pam-libs-0:1.7.0-4 100% | 126.1 MiB/s | 129.1 KiB | 00m00s [ 61/170] Installing libcap-0:2.76-1.fc 100% | 16.1 MiB/s | 214.3 KiB | 00m00s [ 62/170] Installing systemd-libs-0:257 100% | 372.0 MiB/s | 2.2 MiB | 00m00s [ 63/170] Installing libsmartcols-0:2.4 100% | 173.4 MiB/s | 177.5 KiB | 00m00s [ 64/170] Installing libsepol-0:3.8-1.f 100% | 403.8 MiB/s | 827.0 KiB | 00m00s [ 65/170] Installing libselinux-0:3.8-3 100% | 189.7 MiB/s | 194.3 KiB | 00m00s [ 66/170] Installing sed-0:4.9-4.fc42.x 100% | 52.8 MiB/s | 865.5 KiB | 00m00s [ 67/170] Installing findutils-1:4.10.0 100% | 110.2 MiB/s | 1.9 MiB | 00m00s [ 68/170] Installing libmount-0:2.40.4- 100% | 349.0 MiB/s | 357.4 KiB | 00m00s [ 69/170] Installing lz4-libs-0:1.10.0- 100% | 154.7 MiB/s | 158.5 KiB | 00m00s [ 70/170] Installing lua-libs-0:5.4.8-1 100% | 275.4 MiB/s | 282.0 KiB | 00m00s [ 71/170] Installing json-c-0:0.18-2.fc 100% | 85.9 MiB/s | 88.0 KiB | 00m00s [ 72/170] Installing libffi-0:3.5.1-1.f 100% | 83.0 MiB/s | 85.0 KiB | 00m00s [ 73/170] Installing p11-kit-0:0.25.5-8 100% | 115.0 MiB/s | 2.2 MiB | 00m00s [ 74/170] Installing alternatives-0:1.3 100% | 5.2 MiB/s | 63.8 KiB | 00m00s [ 75/170] Installing p11-kit-trust-0:0. 100% | 17.6 MiB/s | 397.1 KiB | 00m00s [ 76/170] Installing zstd-0:1.5.7-1.fc4 100% | 106.9 MiB/s | 1.7 MiB | 00m00s [ 77/170] Installing util-linux-core-0: 100% | 79.2 MiB/s | 1.4 MiB | 00m00s [ 78/170] Installing tar-2:1.35-5.fc42. 100% | 148.1 MiB/s | 3.0 MiB | 00m00s [ 79/170] Installing libsemanage-0:3.8. 100% | 299.0 MiB/s | 306.2 KiB | 00m00s [ 80/170] Installing systemd-standalone 100% | 22.6 MiB/s | 278.0 KiB | 00m00s [ 81/170] Installing libusb1-0:1.0.28-2 100% | 168.7 MiB/s | 172.7 KiB | 00m00s [ 82/170] Installing zip-0:3.0-43.fc42. 100% | 49.0 MiB/s | 702.4 KiB | 00m00s [ 83/170] Installing gnupg2-keyboxd-0:2 100% | 28.3 MiB/s | 202.7 KiB | 00m00s [ 84/170] Installing libpsl-0:0.21.5-5. 100% | 75.7 MiB/s | 77.5 KiB | 00m00s [ 85/170] Installing libfdisk-0:2.40.4- 100% | 364.7 MiB/s | 373.4 KiB | 00m00s [ 86/170] Installing gnupg2-verify-0:2. 100% | 24.4 MiB/s | 349.9 KiB | 00m00s [ 87/170] Installing nettle-0:3.10.1-1. 100% | 258.3 MiB/s | 793.6 KiB | 00m00s [ 88/170] Installing gnutls-0:3.8.9-5.f 100% | 357.4 MiB/s | 3.6 MiB | 00m00s [ 89/170] Installing libxml2-0:2.12.10- 100% | 106.5 MiB/s | 1.7 MiB | 00m00s [ 90/170] Installing bzip2-0:1.0.8-20.f 100% | 8.5 MiB/s | 103.8 KiB | 00m00s [ 91/170] Installing add-determinism-0: 100% | 137.0 MiB/s | 2.5 MiB | 00m00s [ 92/170] Installing build-reproducibil 100% | 0.0 B/s | 1.0 KiB | 00m00s [ 93/170] Installing filesystem-srpm-ma 100% | 0.0 B/s | 38.9 KiB | 00m00s [ 94/170] Installing ed-0:1.21-2.fc42.x 100% | 12.1 MiB/s | 148.8 KiB | 00m00s [ 95/170] Installing patch-0:2.8-1.fc43 100% | 17.2 MiB/s | 228.3 KiB | 00m00s [ 96/170] Installing elfutils-default-y 100% | 340.5 KiB/s | 2.0 KiB | 00m00s [ 97/170] Installing elfutils-libs-0:0. 100% | 223.1 MiB/s | 685.2 KiB | 00m00s [ 98/170] Installing cpio-0:2.15-2.fc41 100% | 68.7 MiB/s | 1.1 MiB | 00m00s [ 99/170] Installing diffutils-0:3.12-2 100% | 97.6 MiB/s | 1.6 MiB | 00m00s [100/170] Installing libgomp-0:15.1.1-2 100% | 263.9 MiB/s | 540.5 KiB | 00m00s [101/170] Installing libtool-ltdl-0:2.5 100% | 0.0 B/s | 71.2 KiB | 00m00s [102/170] Installing gdbm-libs-1:1.23-9 100% | 128.5 MiB/s | 131.6 KiB | 00m00s [103/170] Installing cyrus-sasl-lib-0:2 100% | 128.0 MiB/s | 2.3 MiB | 00m00s [104/170] Installing jansson-0:2.14-2.f 100% | 92.2 MiB/s | 94.4 KiB | 00m00s [105/170] Installing libpkgconf-0:2.3.0 100% | 0.0 B/s | 79.2 KiB | 00m00s [106/170] Installing pkgconf-0:2.3.0-2. 100% | 6.8 MiB/s | 91.0 KiB | 00m00s [107/170] Installing pkgconf-pkg-config 100% | 161.2 KiB/s | 1.8 KiB | 00m00s [108/170] Installing xxhash-libs-0:0.8. 100% | 89.4 MiB/s | 91.6 KiB | 00m00s [109/170] Installing libbrotli-0:1.1.0- 100% | 272.0 MiB/s | 835.6 KiB | 00m00s [110/170] Installing libnghttp2-0:1.65. 100% | 159.5 MiB/s | 163.3 KiB | 00m00s [111/170] Installing keyutils-libs-0:1. 100% | 58.3 MiB/s | 59.7 KiB | 00m00s [112/170] Installing libcom_err-0:1.47. 100% | 0.0 B/s | 68.2 KiB | 00m00s [113/170] Installing libverto-0:0.3.2-1 100% | 26.6 MiB/s | 27.2 KiB | 00m00s [114/170] Installing coreutils-common-0 100% | 418.2 MiB/s | 11.3 MiB | 00m00s [115/170] Installing openssl-libs-1:3.5 100% | 444.2 MiB/s | 8.9 MiB | 00m00s [116/170] Installing coreutils-0:9.7-3. 100% | 160.2 MiB/s | 5.4 MiB | 00m00s [117/170] Installing ca-certificates-0: 100% | 2.0 MiB/s | 2.4 MiB | 00m01s [118/170] Installing libarchive-0:3.8.1 100% | 232.7 MiB/s | 953.1 KiB | 00m00s [119/170] Installing krb5-libs-0:1.21.3 100% | 114.6 MiB/s | 2.3 MiB | 00m00s >>> Running sysusers scriptlet: tpm2-tss-0:4.1.3-7.fc43.x86_64 >>> Finished sysusers scriptlet: tpm2-tss-0:4.1.3-7.fc43.x86_64 >>> Scriptlet output: >>> Creating group 'tss' with GID 59. >>> Creating user 'tss' (Account used for TPM access) with UID 59 and GID 59. >>> [120/170] Installing tpm2-tss-0:4.1.3-7 100% | 261.3 MiB/s | 1.6 MiB | 00m00s [121/170] Installing ima-evm-utils-libs 100% | 60.5 MiB/s | 62.0 KiB | 00m00s [122/170] Installing gnupg2-gpg-agent-0 100% | 28.7 MiB/s | 675.4 KiB | 00m00s [123/170] Installing libssh-0:0.11.1-4. 100% | 184.7 MiB/s | 567.5 KiB | 00m00s [124/170] Installing gzip-0:1.13-3.fc42 100% | 27.8 MiB/s | 398.4 KiB | 00m00s [125/170] Installing rpm-sequoia-0:1.8. 100% | 357.7 MiB/s | 2.5 MiB | 00m00s [126/170] Installing rpm-libs-0:5.99.90 100% | 303.2 MiB/s | 931.4 KiB | 00m00s [127/170] Installing libfsverity-0:1.6- 100% | 0.0 B/s | 33.5 KiB | 00m00s [128/170] Installing libevent-0:2.1.12- 100% | 295.2 MiB/s | 906.9 KiB | 00m00s [129/170] Installing openldap-0:2.6.10- 100% | 214.7 MiB/s | 659.6 KiB | 00m00s [130/170] Installing libcurl-0:8.14.1-1 100% | 291.8 MiB/s | 896.3 KiB | 00m00s [131/170] Installing elfutils-debuginfo 100% | 6.5 MiB/s | 86.2 KiB | 00m00s [132/170] Installing elfutils-0:0.193-2 100% | 146.1 MiB/s | 2.9 MiB | 00m00s [133/170] Installing binutils-0:2.44-3. 100% | 312.1 MiB/s | 25.9 MiB | 00m00s [134/170] Installing gdb-minimal-0:16.3 100% | 276.0 MiB/s | 13.2 MiB | 00m00s [135/170] Installing debugedit-0:5.1-6. 100% | 14.7 MiB/s | 195.4 KiB | 00m00s [136/170] Installing curl-0:8.14.1-1.fc 100% | 19.4 MiB/s | 476.8 KiB | 00m00s [137/170] Installing rpm-0:5.99.90-6.fc 100% | 76.0 MiB/s | 2.5 MiB | 00m00s [138/170] Installing efi-srpm-macros-0: 100% | 40.2 MiB/s | 41.1 KiB | 00m00s [139/170] Installing java-srpm-macros-0 100% | 0.0 B/s | 1.1 KiB | 00m00s [140/170] Installing lua-srpm-macros-0: 100% | 0.0 B/s | 1.9 KiB | 00m00s [141/170] Installing tree-sitter-srpm-m 100% | 0.0 B/s | 9.3 KiB | 00m00s [142/170] Installing zig-srpm-macros-0: 100% | 0.0 B/s | 1.7 KiB | 00m00s [143/170] Installing gnupg2-dirmngr-0:2 100% | 30.3 MiB/s | 621.1 KiB | 00m00s [144/170] Installing gnupg2-0:2.4.8-2.f 100% | 225.9 MiB/s | 6.6 MiB | 00m00s [145/170] Installing rpm-sign-libs-0:5. 100% | 39.6 MiB/s | 40.5 KiB | 00m00s [146/170] Installing rpm-build-libs-0:5 100% | 259.0 MiB/s | 265.2 KiB | 00m00s [147/170] Installing gpgverify-0:2.1-3. 100% | 0.0 B/s | 9.4 KiB | 00m00s [148/170] Installing rust-srpm-macros-0 100% | 0.0 B/s | 5.6 KiB | 00m00s [149/170] Installing qt6-srpm-macros-0: 100% | 0.0 B/s | 740.0 B | 00m00s [150/170] Installing qt5-srpm-macros-0: 100% | 0.0 B/s | 776.0 B | 00m00s [151/170] Installing perl-srpm-macros-0 100% | 0.0 B/s | 1.1 KiB | 00m00s [152/170] Installing package-notes-srpm 100% | 0.0 B/s | 2.0 KiB | 00m00s [153/170] Installing openblas-srpm-macr 100% | 0.0 B/s | 392.0 B | 00m00s [154/170] Installing ocaml-srpm-macros- 100% | 0.0 B/s | 2.2 KiB | 00m00s [155/170] Installing kernel-srpm-macros 100% | 0.0 B/s | 2.3 KiB | 00m00s [156/170] Installing gnat-srpm-macros-0 100% | 0.0 B/s | 1.3 KiB | 00m00s [157/170] Installing ghc-srpm-macros-0: 100% | 0.0 B/s | 1.0 KiB | 00m00s [158/170] Installing fpc-srpm-macros-0: 100% | 0.0 B/s | 420.0 B | 00m00s [159/170] Installing ansible-srpm-macro 100% | 0.0 B/s | 36.2 KiB | 00m00s [160/170] Installing fonts-srpm-macros- 100% | 0.0 B/s | 57.0 KiB | 00m00s [161/170] Installing forge-srpm-macros- 100% | 0.0 B/s | 40.3 KiB | 00m00s [162/170] Installing go-srpm-macros-0:3 100% | 0.0 B/s | 62.0 KiB | 00m00s [163/170] Installing python-srpm-macros 100% | 51.8 MiB/s | 53.1 KiB | 00m00s [164/170] Installing redhat-rpm-config- 100% | 91.7 MiB/s | 187.8 KiB | 00m00s [165/170] Installing rpm-build-0:5.99.9 100% | 20.3 MiB/s | 290.5 KiB | 00m00s [166/170] Installing pyproject-srpm-mac 100% | 0.0 B/s | 2.5 KiB | 00m00s [167/170] Installing which-0:2.23-1.fc4 100% | 6.4 MiB/s | 85.6 KiB | 00m00s [168/170] Installing util-linux-0:2.40. 100% | 99.0 MiB/s | 3.5 MiB | 00m00s [169/170] Installing shadow-utils-2:4.1 100% | 144.8 MiB/s | 4.1 MiB | 00m00s [170/170] Installing info-0:7.2-3.fc42. 100% | 208.8 KiB/s | 358.3 KiB | 00m02s Public key "file:///usr/share/distribution-gpg-keys/fedora/RPM-GPG-KEY-fedora-43-primary" is already present, not importing. Complete! Finish: installing minimal buildroot with dnf5 Start: creating root cache Finish: creating root cache Finish: chroot init INFO: Installed packages: INFO: add-determinism-0.6.0-1.fc43.x86_64 alternatives-1.33-1.fc43.x86_64 ansible-srpm-macros-1-17.1.fc42.noarch audit-libs-4.0.5-1.fc43.x86_64 bash-5.2.37-3.fc43.x86_64 binutils-2.44-3.fc43.x86_64 build-reproducibility-srpm-macros-0.6.0-1.fc43.noarch bzip2-1.0.8-20.fc42.x86_64 bzip2-libs-1.0.8-20.fc42.x86_64 ca-certificates-2024.2.69_v8.0.401-5.fc42.noarch coreutils-9.7-3.fc43.x86_64 coreutils-common-9.7-3.fc43.x86_64 cpio-2.15-2.fc41.x86_64 crypto-policies-20250603-1.git3a584b3.fc43.noarch curl-8.14.1-1.fc43.x86_64 cyrus-sasl-lib-2.1.28-30.fc42.x86_64 debugedit-5.1-6.fc43.x86_64 diffutils-3.12-2.fc43.x86_64 dwz-0.16-1.fc43.x86_64 ed-1.21-2.fc42.x86_64 efi-srpm-macros-6-3.fc43.noarch elfutils-0.193-2.fc43.x86_64 elfutils-debuginfod-client-0.193-2.fc43.x86_64 elfutils-default-yama-scope-0.193-2.fc43.noarch elfutils-libelf-0.193-2.fc43.x86_64 elfutils-libs-0.193-2.fc43.x86_64 fedora-gpg-keys-43-0.2.noarch fedora-release-43-0.16.noarch fedora-release-common-43-0.16.noarch fedora-release-identity-basic-43-0.16.noarch fedora-repos-43-0.2.noarch fedora-repos-rawhide-43-0.2.noarch file-5.46-5.fc43.x86_64 file-libs-5.46-5.fc43.x86_64 filesystem-3.18-44.fc43.x86_64 filesystem-srpm-macros-3.18-44.fc43.noarch findutils-4.10.0-5.fc42.x86_64 fonts-srpm-macros-2.0.5-22.fc43.noarch forge-srpm-macros-0.4.0-2.fc42.noarch fpc-srpm-macros-1.3-14.fc42.noarch gawk-5.3.2-1.fc43.x86_64 gdb-minimal-16.3-3.fc43.x86_64 gdbm-libs-1.23-9.fc42.x86_64 ghc-srpm-macros-1.9.2-2.fc42.noarch glibc-2.41.9000-15.fc43.x86_64 glibc-common-2.41.9000-15.fc43.x86_64 glibc-gconv-extra-2.41.9000-15.fc43.x86_64 glibc-minimal-langpack-2.41.9000-15.fc43.x86_64 gmp-6.3.0-3.fc43.x86_64 gnat-srpm-macros-6-7.fc42.noarch gnupg2-2.4.8-2.fc43.x86_64 gnupg2-dirmngr-2.4.8-2.fc43.x86_64 gnupg2-gpg-agent-2.4.8-2.fc43.x86_64 gnupg2-gpgconf-2.4.8-2.fc43.x86_64 gnupg2-keyboxd-2.4.8-2.fc43.x86_64 gnupg2-verify-2.4.8-2.fc43.x86_64 gnutls-3.8.9-5.fc43.x86_64 go-srpm-macros-3.6.0-7.fc43.noarch gpg-pubkey-105ef944-65ca83d1 gpg-pubkey-31645531-66b6dccf gpg-pubkey-6d9f90a6-6786af3b gpgverify-2.1-3.fc43.noarch grep-3.12-1.fc43.x86_64 gzip-1.13-3.fc42.x86_64 ima-evm-utils-libs-1.6.2-5.fc43.x86_64 info-7.2-3.fc42.x86_64 jansson-2.14-2.fc42.x86_64 java-srpm-macros-1-4.fc43.noarch json-c-0.18-2.fc42.x86_64 kernel-srpm-macros-1.0-25.fc42.noarch keyutils-libs-1.6.3-5.fc42.x86_64 krb5-libs-1.21.3-6.fc43.x86_64 libacl-2.3.2-3.fc42.x86_64 libarchive-3.8.1-1.fc43.x86_64 libassuan-2.5.7-3.fc42.x86_64 libattr-2.5.2-5.fc42.x86_64 libblkid-2.40.4-8.fc43.x86_64 libbrotli-1.1.0-7.fc43.x86_64 libcap-2.76-1.fc43.x86_64 libcap-ng-0.8.5-5.fc43.x86_64 libcom_err-1.47.2-3.fc42.x86_64 libcurl-8.14.1-1.fc43.x86_64 libeconf-0.7.9-1.fc43.x86_64 libevent-2.1.12-15.fc42.x86_64 libfdisk-2.40.4-8.fc43.x86_64 libffi-3.5.1-1.fc43.x86_64 libfsverity-1.6-2.fc42.x86_64 libgcc-15.1.1-2.fc43.x86_64 libgcrypt-1.11.1-1.fc43.x86_64 libgomp-15.1.1-2.fc43.x86_64 libgpg-error-1.55-1.fc43.x86_64 libidn2-2.3.8-1.fc43.x86_64 libksba-1.6.7-3.fc42.x86_64 libmount-2.40.4-8.fc43.x86_64 libnghttp2-1.65.0-1.fc43.x86_64 libpkgconf-2.3.0-2.fc42.x86_64 libpsl-0.21.5-5.fc42.x86_64 libselinux-3.8-3.fc43.x86_64 libsemanage-3.8.1-3.fc43.x86_64 libsepol-3.8-1.fc42.x86_64 libsmartcols-2.40.4-8.fc43.x86_64 libssh-0.11.1-4.fc42.x86_64 libssh-config-0.11.1-4.fc42.noarch libstdc++-15.1.1-2.fc43.x86_64 libtasn1-4.20.0-1.fc43.x86_64 libtool-ltdl-2.5.4-4.fc42.x86_64 libunistring-1.1-9.fc42.x86_64 libusb1-1.0.28-2.fc43.x86_64 libuuid-2.40.4-8.fc43.x86_64 libverto-0.3.2-10.fc42.x86_64 libxcrypt-4.4.38-7.fc43.x86_64 libxml2-2.12.10-2.fc43.x86_64 libzstd-1.5.7-1.fc43.x86_64 lua-libs-5.4.8-1.fc43.x86_64 lua-srpm-macros-1-15.fc42.noarch lz4-libs-1.10.0-2.fc42.x86_64 mpfr-4.2.2-1.fc43.x86_64 ncurses-base-6.5-5.20250125.fc42.noarch ncurses-libs-6.5-5.20250125.fc42.x86_64 nettle-3.10.1-1.fc43.x86_64 npth-1.8-2.fc42.x86_64 ocaml-srpm-macros-10-4.fc42.noarch openblas-srpm-macros-2-19.fc42.noarch openldap-2.6.10-1.fc43.x86_64 openssl-libs-3.5.0-5.fc43.x86_64 p11-kit-0.25.5-8.fc43.x86_64 p11-kit-trust-0.25.5-8.fc43.x86_64 package-notes-srpm-macros-0.5-13.fc42.noarch pam-libs-1.7.0-4.fc42.x86_64 patch-2.8-1.fc43.x86_64 pcre2-10.45-1.fc43.x86_64 pcre2-syntax-10.45-1.fc43.noarch perl-srpm-macros-1-57.fc42.noarch pkgconf-2.3.0-2.fc42.x86_64 pkgconf-m4-2.3.0-2.fc42.noarch pkgconf-pkg-config-2.3.0-2.fc42.x86_64 popt-1.19-8.fc42.x86_64 publicsuffix-list-dafsa-20250616-1.fc43.noarch pyproject-srpm-macros-1.18.1-1.fc43.noarch python-srpm-macros-3.14-1.fc43.noarch qt5-srpm-macros-5.15.17-1.fc43.noarch qt6-srpm-macros-6.9.1-1.fc43.noarch readline-8.2-13.fc43.x86_64 redhat-rpm-config-343-6.fc43.noarch rpm-5.99.90-6.fc43.x86_64 rpm-build-5.99.90-6.fc43.x86_64 rpm-build-libs-5.99.90-6.fc43.x86_64 rpm-libs-5.99.90-6.fc43.x86_64 rpm-sequoia-1.8.0-1.fc43.x86_64 rpm-sign-libs-5.99.90-6.fc43.x86_64 rust-srpm-macros-26.3-4.fc42.noarch sed-4.9-4.fc42.x86_64 setup-2.15.0-25.fc43.noarch shadow-utils-4.17.4-1.fc43.x86_64 sqlite-libs-3.50.0-1.fc43.x86_64 systemd-libs-257.6-1.fc43.x86_64 systemd-standalone-sysusers-257.6-1.fc43.x86_64 tar-1.35-5.fc42.x86_64 tpm2-tss-4.1.3-7.fc43.x86_64 tree-sitter-srpm-macros-0.4.1-1.fc43.noarch unzip-6.0-66.fc42.x86_64 util-linux-2.40.4-8.fc43.x86_64 util-linux-core-2.40.4-8.fc43.x86_64 which-2.23-1.fc42.x86_64 xxhash-libs-0.8.3-2.fc42.x86_64 xz-5.8.1-1.fc43.x86_64 xz-libs-5.8.1-1.fc43.x86_64 zig-srpm-macros-1-4.fc42.noarch zip-3.0-43.fc42.x86_64 zlib-ng-compat-2.2.4-2.fc43.x86_64 zstd-1.5.7-1.fc43.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.3-1.fc43.copr9182845.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 INFO: chroot_scan: 1 files copied to /var/lib/copr-rpmbuild/results/chroot_scan INFO: /var/lib/mock/fedora-rawhide-x86_64-1750298820.676242/root/var/log/dnf5.log INFO: chroot_scan: creating tarball /var/lib/copr-rpmbuild/results/chroot_scan.tar.gz /bin/tar: Removing leading `/' from member names Finish: buildsrpm INFO: Done(/var/lib/copr-rpmbuild/workspace/workdir-8s6jdnco/R-CRAN-starvz/R-CRAN-starvz.spec) Config(child) 0 minutes 10 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.3-1.fc43.copr9182845.src.rpm) Config(fedora-rawhide-x86_64) Start: chroot init INFO: mounting tmpfs at /var/lib/mock/fedora-rawhide-x86_64-1750298820.676242/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.20.1-1.fc42.x86_64 rpm-sequoia-1.7.0-5.fc42.x86_64 python3-dnf-4.23.0-1.fc42.noarch python3-dnf-plugins-core-4.10.1-1.fc42.noarch dnf5-5.2.13.1-1.fc42.x86_64 dnf5-plugins-5.2.13.1-1.fc42.x86_64 Finish: chroot init Start: build phase for R-CRAN-starvz-0.8.3-1.fc43.copr9182845.src.rpm Start: build setup for R-CRAN-starvz-0.8.3-1.fc43.copr9182845.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.3-1.fc43.copr9182845.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: fedora 100% | 1.9 KiB/s | 28.9 KiB | 00m15s Copr repository 100% | 73.3 KiB/s | 1.5 KiB | 00m00s Copr repository 100% | 125.5 MiB/s | 12.7 MiB | 00m00s Repositories loaded. Package Arch Version Repository Size Installing: R-CRAN-BH noarch 1.87.0.1-1.fc43.copr8922436 copr_base 122.2 MiB R-CRAN-RColorBrewer noarch 1.1.3-1.fc43.copr8922454 copr_base 63.7 KiB R-CRAN-Rcpp x86_64 1.0.14-1.fc43.copr8922423 copr_base 8.4 MiB R-CRAN-data.tree noarch 1.1.0-1.fc43.copr8926254 copr_base 3.1 MiB R-CRAN-dplyr x86_64 1.1.4-1.fc43.copr8933752 copr_base 2.6 MiB R-CRAN-ggplot2 noarch 3.5.2-1.fc43.copr8933751 copr_base 7.2 MiB R-CRAN-gtools x86_64 3.9.5-1.fc43.copr8922437 copr_base 537.0 KiB R-CRAN-lpSolve x86_64 5.6.23-1.fc43.copr8922729 copr_base 780.2 KiB R-CRAN-magrittr x86_64 2.0.3-1.fc43.copr8922441 copr_base 414.8 KiB R-CRAN-patchwork noarch 1.3.0-1.fc43.copr8936160 copr_base 4.1 MiB R-CRAN-purrr x86_64 1.0.4-1.fc43.copr8930310 copr_base 927.0 KiB R-CRAN-readr x86_64 2.1.5-1.fc43.copr8935145 copr_base 1.4 MiB R-CRAN-rlang x86_64 1.1.6-1.fc43.copr8922429 copr_base 2.6 MiB R-CRAN-stringr noarch 1.5.1-1.fc43.copr8930307 copr_base 651.8 KiB R-CRAN-tibble x86_64 3.3.0-1.fc43.copr9145570 copr_base 1.7 MiB R-CRAN-tidyr x86_64 1.3.1-1.fc43.copr8935148 copr_base 1.9 MiB R-CRAN-yaml x86_64 2.3.10-1.fc43.copr8922452 copr_base 272.1 KiB R-CRAN-zoo x86_64 1.8.14-1.fc43.copr8926102 copr_base 1.5 MiB R-core x86_64 4.5.1-1.fc43 fedora 104.0 MiB R-devel x86_64 4.5.1-1.fc43 fedora 0.0 B Installing dependencies: R-CRAN-MASS x86_64 7.3.65-1.fc43.copr8924872 copr_base 1.8 MiB R-CRAN-Matrix x86_64 1.7.3-1.fc43.copr8927562 copr_base 8.2 MiB R-CRAN-R6 noarch 2.6.1-1.fc43.copr8922444 copr_base 123.4 KiB R-CRAN-bit x86_64 4.6.0-1.fc43.copr8922476 copr_base 1.2 MiB R-CRAN-bit64 x86_64 4.6.0.1-1.fc43.copr8926155 copr_base 907.0 KiB R-CRAN-cli x86_64 3.6.5-1.fc43.copr8957462 copr_base 2.4 MiB R-CRAN-clipr noarch 0.8.0-1.fc43.copr8922465 copr_base 85.9 KiB R-CRAN-crayon noarch 1.5.3-1.fc43.copr8922448 copr_base 237.7 KiB R-CRAN-farver x86_64 2.1.2-1.fc43.copr8922502 copr_base 2.1 MiB R-CRAN-generics noarch 0.1.4-1.fc43.copr9016314 copr_base 164.1 KiB R-CRAN-glue x86_64 1.8.0-1.fc43.copr8922424 copr_base 345.2 KiB R-CRAN-gtable noarch 0.3.6-1.fc43.copr8928408 copr_base 338.3 KiB R-CRAN-hms noarch 1.1.3-1.fc43.copr8930316 copr_base 133.3 KiB R-CRAN-isoband x86_64 0.2.7-1.fc43.copr8923504 copr_base 1.9 MiB R-CRAN-labeling noarch 0.4.3-1.fc43.copr8922453 copr_base 94.1 KiB R-CRAN-lattice x86_64 0.22.7-1.fc43.copr8924871 copr_base 2.0 MiB R-CRAN-lifecycle noarch 1.0.4-1.fc43.copr8926745 copr_base 284.1 KiB R-CRAN-mgcv x86_64 1.9.3-1.fc43.copr8929575 copr_base 4.8 MiB R-CRAN-nlme x86_64 3.1.168-1.fc43.copr8927563 copr_base 3.8 MiB R-CRAN-pillar noarch 1.10.2-1.fc43.copr8930315 copr_base 1.4 MiB R-CRAN-pkgconfig noarch 2.0.3-3.fc43.copr8922443 copr_base 34.3 KiB R-CRAN-scales noarch 1.4.0-1.fc43.copr8965525 copr_base 1.3 MiB R-CRAN-stringi x86_64 1.8.7-1.fc43.copr8922456 copr_base 2.0 MiB R-CRAN-tidyselect noarch 1.2.1-1.fc43.copr8930311 copr_base 436.7 KiB R-CRAN-tzdb x86_64 0.5.0-1.fc43.copr8927643 copr_base 2.2 MiB R-CRAN-utf8 x86_64 1.2.6-1.fc43.copr9145571 copr_base 478.6 KiB R-CRAN-vctrs x86_64 0.6.5-1.fc43.copr8928418 copr_base 2.4 MiB R-CRAN-viridisLite noarch 0.4.2-1.fc43.copr8922433 copr_base 1.3 MiB R-CRAN-vroom x86_64 1.6.5-1.fc43.copr8934037 copr_base 1.7 MiB R-CRAN-withr noarch 3.0.2-1.fc43.copr8922434 copr_base 396.5 KiB R-core-devel x86_64 4.5.1-1.fc43 fedora 410.9 KiB R-java x86_64 4.5.1-1.fc43 fedora 0.0 B R-java-devel x86_64 4.5.1-1.fc43 fedora 0.0 B R-littler x86_64 0.3.19-8.fc43 fedora 161.9 KiB R-rpm-macros noarch 1.2.1-12.fc42 fedora 5.6 KiB abattis-cantarell-vf-fonts noarch 0.301-14.fc42 fedora 192.7 KiB alsa-lib x86_64 1.2.14-2.fc43 fedora 1.4 MiB annobin-docs noarch 12.96-1.fc43 fedora 98.9 KiB annobin-plugin-gcc x86_64 12.96-1.fc43 fedora 993.6 KiB avahi-libs x86_64 0.9~rc2-3.fc43 fedora 171.6 KiB bzip2-devel x86_64 1.0.8-20.fc42 fedora 309.8 KiB cairo x86_64 1.18.4-1.fc43 fedora 1.8 MiB cmake-filesystem x86_64 3.31.6-3.fc43 fedora 0.0 B cpp x86_64 15.1.1-2.fc43 fedora 37.9 MiB cups-filesystem noarch 1:2.4.12-3.fc43 fedora 0.0 B cups-libs x86_64 1:2.4.12-3.fc43 fedora 618.7 KiB dbus-libs x86_64 1:1.16.0-3.fc42 fedora 349.5 KiB default-fonts-core-sans noarch 4.2-4.fc42 fedora 11.9 KiB desktop-file-utils x86_64 0.28-1.fc43 fedora 218.4 KiB emacs-filesystem noarch 1:30.0-4.fc42 fedora 0.0 B flexiblas x86_64 3.4.5-1.fc43 fedora 50.4 KiB flexiblas-devel x86_64 3.4.5-1.fc43 fedora 4.9 MiB flexiblas-netlib x86_64 3.4.5-1.fc43 fedora 10.9 MiB flexiblas-netlib64 x86_64 3.4.5-1.fc43 fedora 11.0 MiB flexiblas-openblas-openmp x86_64 3.4.5-1.fc43 fedora 39.2 KiB flexiblas-openblas-openmp64 x86_64 3.4.5-1.fc43 fedora 39.2 KiB fontconfig x86_64 2.16.2-1.fc43 fedora 760.8 KiB fonts-filesystem noarch 1:2.0.5-22.fc43 fedora 0.0 B freetype x86_64 2.13.3-2.fc42 fedora 858.2 KiB fribidi x86_64 1.0.16-2.fc42 fedora 194.3 KiB gcc x86_64 15.1.1-2.fc43 fedora 111.1 MiB gcc-c++ x86_64 15.1.1-2.fc43 fedora 41.3 MiB gcc-gfortran x86_64 15.1.1-2.fc43 fedora 40.3 MiB gcc-plugin-annobin x86_64 15.1.1-2.fc43 fedora 57.2 KiB glib2 x86_64 2.85.1-1.fc43 fedora 14.7 MiB glibc-devel x86_64 2.41.9000-15.fc43 fedora 2.3 MiB google-noto-fonts-common noarch 20250501-1.fc43 fedora 17.7 KiB google-noto-sans-vf-fonts noarch 20250501-1.fc43 fedora 1.4 MiB graphite2 x86_64 1.3.14-18.fc42 fedora 195.8 KiB groff-base x86_64 1.23.0-8.fc42 fedora 3.9 MiB harfbuzz x86_64 11.2.1-1.fc43 fedora 2.8 MiB java-21-openjdk x86_64 1:21.0.7.0.6-2.fc43 fedora 1.1 MiB java-21-openjdk-devel x86_64 1:21.0.7.0.6-2.fc43 fedora 11.5 MiB java-21-openjdk-headless x86_64 1:21.0.7.0.6-2.fc43 fedora 197.4 MiB javapackages-filesystem noarch 6.4.0-8.fc43 fedora 2.0 KiB jbigkit-libs x86_64 2.1-31.fc42 fedora 121.4 KiB kernel-headers x86_64 6.16.0-0.rc2.24.fc43 fedora 6.7 MiB less x86_64 678-1.fc43 fedora 405.8 KiB libICE x86_64 1.1.2-2.fc42 fedora 198.4 KiB libRmath x86_64 4.5.1-1.fc43 fedora 242.7 KiB libRmath-devel x86_64 4.5.1-1.fc43 fedora 19.9 KiB libSM x86_64 1.2.5-2.fc42 fedora 105.0 KiB libX11 x86_64 1.8.11-1.fc42 fedora 1.3 MiB libX11-common noarch 1.8.11-1.fc42 fedora 1.2 MiB libX11-devel x86_64 1.8.11-1.fc42 fedora 1.0 MiB libX11-xcb x86_64 1.8.11-1.fc42 fedora 10.9 KiB libXau x86_64 1.0.12-2.fc42 fedora 76.9 KiB libXau-devel x86_64 1.0.12-2.fc42 fedora 7.5 KiB libXcomposite x86_64 0.4.6-5.fc42 fedora 44.4 KiB libXext x86_64 1.3.6-3.fc42 fedora 90.0 KiB libXft x86_64 2.3.8-8.fc42 fedora 168.4 KiB libXi x86_64 1.8.2-2.fc42 fedora 84.6 KiB libXmu x86_64 1.2.1-3.fc42 fedora 199.3 KiB libXrender x86_64 0.9.12-2.fc42 fedora 50.0 KiB libXt x86_64 1.3.1-2.fc42 fedora 429.7 KiB libXtst x86_64 1.2.5-2.fc42 fedora 33.5 KiB libdatrie x86_64 0.2.13-11.fc42 fedora 57.8 KiB libdeflate x86_64 1.24-1.fc43 fedora 123.0 KiB libdeflate-devel x86_64 1.24-1.fc43 fedora 26.0 KiB libfontenc x86_64 1.1.8-3.fc42 fedora 70.9 KiB libgfortran x86_64 15.1.1-2.fc43 fedora 3.3 MiB libicu x86_64 76.1-4.fc42 fedora 36.3 MiB libicu-devel x86_64 76.1-4.fc42 fedora 5.0 MiB libjpeg-turbo x86_64 3.1.1-1.fc43 fedora 799.5 KiB liblerc x86_64 4.0.0-8.fc42 fedora 636.1 KiB libmpc x86_64 1.3.1-7.fc42 fedora 164.5 KiB libpng x86_64 2:1.6.49-1.fc43 fedora 237.7 KiB libquadmath x86_64 15.1.1-2.fc43 fedora 317.9 KiB libquadmath-devel x86_64 15.1.1-2.fc43 fedora 22.1 KiB libstdc++-devel x86_64 15.1.1-2.fc43 fedora 16.1 MiB libthai x86_64 0.1.29-10.fc42 fedora 783.4 KiB libtiff x86_64 4.7.0-3.fc42 fedora 619.1 KiB libtirpc x86_64 1.3.6-1.rc3.fc42.2 fedora 199.0 KiB libtirpc-devel x86_64 1.3.6-1.rc3.fc42.2 fedora 251.6 KiB libtommath x86_64 1.3.1~rc1-5.fc42 fedora 130.4 KiB libwebp x86_64 1.5.0-2.fc42 fedora 947.6 KiB libxcb x86_64 1.17.0-5.fc42 fedora 1.1 MiB libxcb-devel x86_64 1.17.0-5.fc42 fedora 2.7 MiB libxcrypt-devel x86_64 4.4.38-7.fc43 fedora 30.8 KiB libzstd-devel x86_64 1.5.7-1.fc43 fedora 208.0 KiB lksctp-tools x86_64 1.0.20-2.fc42 fedora 250.3 KiB lzo x86_64 2.10-14.fc42 fedora 170.9 KiB make x86_64 1:4.4.1-10.fc42 fedora 1.8 MiB mkfontscale x86_64 1.2.3-2.fc42 fedora 45.0 KiB ncurses x86_64 6.5-5.20250125.fc42 fedora 608.1 KiB nspr x86_64 4.36.0-9.fc43 fedora 315.5 KiB nss x86_64 3.112.0-1.fc43 fedora 1.9 MiB nss-softokn x86_64 3.112.0-1.fc43 fedora 1.9 MiB nss-softokn-freebl x86_64 3.112.0-1.fc43 fedora 848.3 KiB nss-sysinit x86_64 3.112.0-1.fc43 fedora 18.1 KiB nss-util x86_64 3.112.0-1.fc43 fedora 200.8 KiB openblas x86_64 0.3.29-1.fc42 fedora 111.7 KiB openblas-openmp x86_64 0.3.29-1.fc42 fedora 43.7 MiB openblas-openmp64 x86_64 0.3.29-1.fc42 fedora 43.9 MiB pango x86_64 1.56.3-1.fc43 fedora 1.0 MiB pcre2-devel x86_64 10.45-1.fc43 fedora 2.1 MiB pcre2-utf16 x86_64 10.45-1.fc43 fedora 626.3 KiB pcre2-utf32 x86_64 10.45-1.fc43 fedora 598.2 KiB perl-AutoLoader noarch 5.74-517.fc43 fedora 20.5 KiB perl-B x86_64 1.89-517.fc43 fedora 498.0 KiB perl-Carp noarch 1.54-512.fc42 fedora 46.6 KiB perl-Class-Struct noarch 0.68-517.fc43 fedora 25.4 KiB perl-Data-Dumper x86_64 2.189-513.fc42 fedora 115.6 KiB perl-Digest noarch 1.20-512.fc42 fedora 35.3 KiB perl-Digest-MD5 x86_64 2.59-6.fc42 fedora 59.7 KiB perl-DynaLoader x86_64 1.56-517.fc43 fedora 32.1 KiB perl-Encode x86_64 4:3.21-512.fc42 fedora 4.7 MiB perl-Errno x86_64 1.38-517.fc43 fedora 8.3 KiB perl-Exporter noarch 5.78-512.fc42 fedora 54.3 KiB perl-Fcntl x86_64 1.18-517.fc43 fedora 48.9 KiB perl-File-Basename noarch 2.86-517.fc43 fedora 14.0 KiB perl-File-Path noarch 2.18-512.fc42 fedora 63.5 KiB perl-File-Temp noarch 1:0.231.100-512.fc42 fedora 162.3 KiB perl-File-stat noarch 1.14-517.fc43 fedora 12.5 KiB perl-FileHandle noarch 2.05-517.fc43 fedora 9.3 KiB perl-Getopt-Long noarch 1:2.58-3.fc42 fedora 144.5 KiB perl-Getopt-Std noarch 1.14-517.fc43 fedora 11.2 KiB perl-HTTP-Tiny noarch 0.090-2.fc42 fedora 154.4 KiB perl-IO x86_64 1.55-517.fc43 fedora 147.0 KiB perl-IO-Socket-IP noarch 0.43-2.fc42 fedora 100.3 KiB perl-IO-Socket-SSL noarch 2.091-1.fc43 fedora 711.4 KiB perl-IPC-Open3 noarch 1.22-517.fc43 fedora 22.5 KiB perl-MIME-Base32 noarch 1.303-23.fc42 fedora 30.7 KiB perl-MIME-Base64 x86_64 3.16-512.fc42 fedora 42.0 KiB perl-Net-SSLeay x86_64 1.94-9.fc43 fedora 1.3 MiB perl-POSIX x86_64 2.20-517.fc43 fedora 231.0 KiB perl-PathTools x86_64 3.91-513.fc42 fedora 180.0 KiB perl-Pod-Escapes noarch 1:1.07-512.fc42 fedora 24.9 KiB perl-Pod-Perldoc noarch 3.28.01-513.fc42 fedora 163.7 KiB perl-Pod-Simple noarch 1:3.47-1.fc43 fedora 565.2 KiB perl-Pod-Usage noarch 4:2.05-1.fc43 fedora 86.3 KiB perl-Scalar-List-Utils x86_64 5:1.69-1.fc43 fedora 144.8 KiB perl-SelectSaver noarch 1.02-517.fc43 fedora 2.2 KiB perl-Socket x86_64 4:2.038-512.fc42 fedora 119.9 KiB perl-Storable x86_64 1:3.32-512.fc42 fedora 232.3 KiB perl-Symbol noarch 1.09-517.fc43 fedora 6.8 KiB perl-Term-ANSIColor noarch 5.01-513.fc42 fedora 97.5 KiB perl-Term-Cap noarch 1.18-512.fc42 fedora 29.3 KiB perl-Text-ParseWords noarch 3.31-512.fc42 fedora 13.6 KiB perl-Text-Tabs+Wrap noarch 2024.001-512.fc42 fedora 22.6 KiB perl-Time-Local noarch 2:1.350-512.fc42 fedora 68.9 KiB perl-URI noarch 5.32-1.fc43 fedora 261.2 KiB perl-base noarch 2.27-517.fc43 fedora 12.5 KiB perl-constant noarch 1.33-513.fc42 fedora 26.2 KiB perl-if noarch 0.61.000-517.fc43 fedora 5.8 KiB perl-interpreter x86_64 4:5.40.2-517.fc43 fedora 118.3 KiB perl-libnet noarch 3.15-513.fc42 fedora 289.4 KiB perl-libs x86_64 4:5.40.2-517.fc43 fedora 9.8 MiB perl-locale noarch 1.12-517.fc43 fedora 6.5 KiB perl-mro x86_64 1.29-517.fc43 fedora 41.5 KiB perl-overload noarch 1.37-517.fc43 fedora 71.5 KiB perl-overloading noarch 0.02-517.fc43 fedora 4.8 KiB perl-parent noarch 1:0.244-2.fc42 fedora 10.3 KiB perl-podlators noarch 1:6.0.2-3.fc42 fedora 317.5 KiB perl-vars noarch 1.05-517.fc43 fedora 3.9 KiB pixman x86_64 0.46.2-1.fc43 fedora 710.3 KiB tcl x86_64 1:9.0.0-8.fc43 fedora 4.3 MiB tk x86_64 1:9.0.0-4.fc43 fedora 3.8 MiB tre x86_64 0.8.0-48.20140228gitc2f5d13.fc43 fedora 75.8 KiB tre-common noarch 0.8.0-48.20140228gitc2f5d13.fc43 fedora 81.0 KiB tre-devel x86_64 0.8.0-48.20140228gitc2f5d13.fc43 fedora 10.7 KiB ttmkfdir x86_64 3.0.9-72.fc42 fedora 118.5 KiB tzdata noarch 2025b-1.fc43 fedora 1.6 MiB tzdata-java noarch 2025b-1.fc43 fedora 100.1 KiB xclip x86_64 0.13-24.git11cba61.fc42 fedora 58.2 KiB xdg-utils noarch 1.2.1-3.fc42 fedora 346.3 KiB xml-common noarch 0.6.3-66.fc42 fedora 78.4 KiB xorg-x11-fonts-Type1 noarch 7.5-40.fc42 fedora 863.3 KiB xorg-x11-proto-devel noarch 2024.1-4.fc42 fedora 1.7 MiB xz-devel x86_64 1:5.8.1-1.fc43 fedora 258.8 KiB zlib-ng-compat-devel x86_64 2.2.4-2.fc43 fedora 107.0 KiB Transaction Summary: Installing: 231 packages Total size of inbound packages is 325 MiB. Need to download 19 MiB. After this operation, 1 GiB extra will be used (install 1 GiB, remove 0 B). [ 1/231] R-CRAN-RColorBrewer-0:1.1.3-1 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 2/231] R-CRAN-Rcpp-0:1.0.14-1.fc43.c 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 3/231] R-CRAN-dplyr-0:1.1.4-1.fc43.c 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 4/231] R-CRAN-ggplot2-0:3.5.2-1.fc43 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 5/231] R-CRAN-purrr-0:1.0.4-1.fc43.c 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 6/231] R-CRAN-rlang-0:1.1.6-1.fc43.c 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 7/231] R-CRAN-stringr-0:1.5.1-1.fc43 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 8/231] R-CRAN-tibble-0:3.3.0-1.fc43. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 9/231] R-CRAN-tidyr-0:1.3.1-1.fc43.c 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 10/231] R-CRAN-yaml-0:2.3.10-1.fc43.c 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 11/231] R-CRAN-magrittr-0:2.0.3-1.fc4 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 12/231] R-devel-0:4.5.1-1.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 13/231] R-core-0:4.5.1-1.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 14/231] R-littler-0:0.3.19-8.fc43.x86 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 15/231] R-CRAN-R6-0:2.6.1-1.fc43.copr 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 16/231] R-CRAN-stringi-0:1.8.7-1.fc43 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 17/231] R-CRAN-cli-0:3.6.5-1.fc43.cop 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 18/231] R-CRAN-generics-0:0.1.4-1.fc4 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 19/231] R-CRAN-glue-0:1.8.0-1.fc43.co 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 20/231] R-CRAN-lifecycle-0:1.0.4-1.fc 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 21/231] R-CRAN-pillar-0:1.10.2-1.fc43 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 22/231] R-CRAN-tidyselect-0:1.2.1-1.f 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 23/231] R-CRAN-vctrs-0:0.6.5-1.fc43.c 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 24/231] R-CRAN-MASS-0:7.3.65-1.fc43.c 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 25/231] R-CRAN-gtable-0:0.3.6-1.fc43. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 26/231] R-CRAN-isoband-0:0.2.7-1.fc43 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 27/231] R-CRAN-mgcv-0:1.9.3-1.fc43.co 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 28/231] R-CRAN-scales-0:1.4.0-1.fc43. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 29/231] R-CRAN-withr-0:3.0.2-1.fc43.c 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 30/231] R-CRAN-farver-0:2.1.2-1.fc43. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 31/231] R-CRAN-pkgconfig-0:2.0.3-3.fc 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 32/231] R-CRAN-lattice-0:0.22.7-1.fc4 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 33/231] R-core-devel-0:4.5.1-1.fc43.x 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 34/231] R-java-devel-0:4.5.1-1.fc43.x 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 35/231] R-rpm-macros-0:1.2.1-12.fc42. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 36/231] cairo-0:1.18.4-1.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 37/231] flexiblas-netlib-0:3.4.5-1.fc 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 38/231] glib2-0:2.85.1-1.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 39/231] less-0:678-1.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 40/231] libRmath-0:4.5.1-1.fc43.x86_6 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 41/231] libX11-0:1.8.11-1.fc42.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 42/231] libXmu-0:1.2.1-3.fc42.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 43/231] libXt-0:1.3.1-2.fc42.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 44/231] libdeflate-0:1.24-1.fc43.x86_ 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 45/231] libicu-0:76.1-4.fc42.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 46/231] libjpeg-turbo-0:3.1.1-1.fc43. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 47/231] libpng-2:1.6.49-1.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 48/231] libtiff-0:4.7.0-3.fc42.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 49/231] libtirpc-0:1.3.6-1.rc3.fc42.2 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 50/231] pango-0:1.56.3-1.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 51/231] tcl-1:9.0.0-8.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 52/231] tk-1:9.0.0-4.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 53/231] tre-0:0.8.0-48.20140228gitc2f 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 54/231] tzdata-0:2025b-1.fc43.noarch 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 55/231] xdg-utils-0:1.2.1-3.fc42.noar 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 56/231] R-CRAN-utf8-0:1.2.6-1.fc43.co 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 57/231] R-CRAN-Matrix-0:1.7.3-1.fc43. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 58/231] R-CRAN-nlme-0:3.1.168-1.fc43. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 59/231] R-CRAN-labeling-0:0.4.3-1.fc4 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 60/231] R-CRAN-viridisLite-0:0.4.2-1. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 61/231] R-CRAN-tzdb-0:0.5.0-1.fc43.co 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 62/231] libRmath-devel-0:4.5.1-1.fc43 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 63/231] make-1:4.4.1-10.fc42.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 64/231] R-java-0:4.5.1-1.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 65/231] java-21-openjdk-devel-1:21.0. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 66/231] fontconfig-0:2.16.2-1.fc43.x8 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 67/231] freetype-0:2.13.3-2.fc42.x86_ 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 68/231] libXext-0:1.3.6-3.fc42.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 69/231] libXrender-0:0.9.12-2.fc42.x8 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 70/231] libxcb-0:1.17.0-5.fc42.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 71/231] lzo-0:2.10-14.fc42.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 72/231] pixman-0:0.46.2-1.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 73/231] flexiblas-0:3.4.5-1.fc43.x86_ 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 74/231] flexiblas-openblas-openmp-0:3 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 75/231] libgfortran-0:15.1.1-2.fc43.x 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 76/231] libquadmath-0:15.1.1-2.fc43.x 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 77/231] libX11-common-0:1.8.11-1.fc42 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 78/231] libICE-0:1.1.2-2.fc42.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 79/231] libSM-0:1.2.5-2.fc42.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 80/231] jbigkit-libs-0:2.1-31.fc42.x8 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 81/231] liblerc-0:4.0.0-8.fc42.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 82/231] libwebp-0:1.5.0-2.fc42.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 83/231] fribidi-0:1.0.16-2.fc42.x86_6 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 84/231] harfbuzz-0:11.2.1-1.fc43.x86_ 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 85/231] libXft-0:2.3.8-8.fc42.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 86/231] libthai-0:0.1.29-10.fc42.x86_ 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 87/231] libtommath-0:1.3.1~rc1-5.fc42 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 88/231] tre-common-0:0.8.0-48.2014022 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 89/231] desktop-file-utils-0:0.28-1.f 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 90/231] perl-interpreter-4:5.40.2-517 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 91/231] java-21-openjdk-headless-1:21 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 92/231] java-21-openjdk-1:21.0.7.0.6- 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 93/231] default-fonts-core-sans-0:4.2 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 94/231] fonts-filesystem-1:2.0.5-22.f 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 95/231] xml-common-0:0.6.3-66.fc42.no 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 96/231] libXau-0:1.0.12-2.fc42.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 97/231] openblas-openmp-0:0.3.29-1.fc 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 98/231] graphite2-0:1.3.14-18.fc42.x8 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 99/231] libdatrie-0:0.2.13-11.fc42.x8 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [100/231] emacs-filesystem-1:30.0-4.fc4 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [101/231] perl-libs-4:5.40.2-517.fc43.x 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [102/231] alsa-lib-0:1.2.14-2.fc43.x86_ 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [103/231] javapackages-filesystem-0:6.4 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [104/231] lksctp-tools-0:1.0.20-2.fc42. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [105/231] tzdata-java-0:2025b-1.fc43.no 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [106/231] libXcomposite-0:0.4.6-5.fc42. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [107/231] libXi-0:1.8.2-2.fc42.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [108/231] libXtst-0:1.2.5-2.fc42.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [109/231] xorg-x11-fonts-Type1-0:7.5-40 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [110/231] abattis-cantarell-vf-fonts-0: 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [111/231] google-noto-sans-vf-fonts-0:2 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [112/231] perl-Carp-0:1.54-512.fc42.noa 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [113/231] perl-DynaLoader-0:1.56-517.fc 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [114/231] perl-Exporter-0:5.78-512.fc42 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [115/231] perl-PathTools-0:3.91-513.fc4 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [116/231] mkfontscale-0:1.2.3-2.fc42.x8 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [117/231] ttmkfdir-0:3.0.9-72.fc42.x86_ 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [118/231] google-noto-fonts-common-0:20 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [119/231] perl-vars-0:1.05-517.fc43.noa 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [120/231] perl-Errno-0:1.38-517.fc43.x8 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [121/231] perl-Scalar-List-Utils-5:1.69 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [122/231] perl-constant-0:1.33-513.fc42 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [123/231] libfontenc-0:1.1.8-3.fc42.x86 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [124/231] perl-Encode-4:3.21-512.fc42.x 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [125/231] perl-File-Basename-0:2.86-517 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [126/231] perl-Getopt-Long-1:2.58-3.fc4 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [127/231] perl-Getopt-Std-0:1.14-517.fc 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [128/231] perl-MIME-Base64-0:3.16-512.f 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [129/231] perl-Storable-1:3.32-512.fc42 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [130/231] perl-overload-0:1.37-517.fc43 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [131/231] perl-parent-1:0.244-2.fc42.no 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [132/231] perl-Pod-Usage-4:2.05-1.fc43. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [133/231] perl-Text-ParseWords-0:3.31-5 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [134/231] perl-base-0:2.27-517.fc43.noa 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [135/231] perl-Fcntl-0:1.18-517.fc43.x8 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [136/231] perl-IO-0:1.55-517.fc43.x86_6 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [137/231] perl-mro-0:1.29-517.fc43.x86_ 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [138/231] perl-overloading-0:0.02-517.f 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [139/231] perl-Pod-Perldoc-0:3.28.01-51 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [140/231] perl-podlators-1:6.0.2-3.fc42 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [141/231] perl-File-stat-0:1.14-517.fc4 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [142/231] perl-SelectSaver-0:1.02-517.f 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [143/231] perl-Socket-4:2.038-512.fc42. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [144/231] perl-Symbol-0:1.09-517.fc43.n 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [145/231] groff-base-0:1.23.0-8.fc42.x8 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [146/231] perl-File-Temp-1:0.231.100-51 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [147/231] perl-HTTP-Tiny-0:0.090-2.fc42 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [148/231] perl-IPC-Open3-0:1.22-517.fc4 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [149/231] perl-Pod-Simple-1:3.47-1.fc43 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [150/231] perl-POSIX-0:2.20-517.fc43.x8 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [151/231] perl-Term-ANSIColor-0:5.01-51 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [152/231] perl-Term-Cap-0:1.18-512.fc42 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [153/231] perl-Class-Struct-0:0.68-517. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [154/231] perl-File-Path-0:2.18-512.fc4 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [155/231] perl-IO-Socket-SSL-0:2.091-1. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [156/231] perl-Net-SSLeay-0:1.94-9.fc43 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [157/231] perl-Time-Local-2:1.350-512.f 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [158/231] perl-Pod-Escapes-1:1.07-512.f 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [159/231] perl-Text-Tabs+Wrap-0:2024.00 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [160/231] perl-if-0:0.61.000-517.fc43.n 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [161/231] perl-locale-0:1.12-517.fc43.n 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [162/231] ncurses-0:6.5-5.20250125.fc42 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [163/231] perl-IO-Socket-IP-0:0.43-2.fc 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [164/231] perl-URI-0:5.32-1.fc43.noarch 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [165/231] perl-AutoLoader-0:5.74-517.fc 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [166/231] perl-Data-Dumper-0:2.189-513. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [167/231] perl-MIME-Base32-0:1.303-23.f 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [168/231] perl-libnet-0:3.15-513.fc42.n 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [169/231] perl-B-0:1.89-517.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [170/231] perl-Digest-MD5-0:2.59-6.fc42 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [171/231] perl-FileHandle-0:2.05-517.fc 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [172/231] perl-Digest-0:1.20-512.fc42.n 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [173/231] openblas-0:0.3.29-1.fc42.x86_ 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [174/231] cups-libs-1:2.4.12-3.fc43.x86 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [175/231] avahi-libs-0:0.9~rc2-3.fc43.x 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [176/231] cups-filesystem-1:2.4.12-3.fc 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [177/231] dbus-libs-1:1.16.0-3.fc42.x86 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [178/231] nss-0:3.112.0-1.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [179/231] nspr-0:4.36.0-9.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [180/231] nss-softokn-0:3.112.0-1.fc43. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [181/231] nss-sysinit-0:3.112.0-1.fc43. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [182/231] nss-util-0:3.112.0-1.fc43.x86 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [183/231] nss-softokn-freebl-0:3.112.0- 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [184/231] bzip2-devel-0:1.0.8-20.fc42.x 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [185/231] flexiblas-devel-0:3.4.5-1.fc4 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [186/231] flexiblas-netlib64-0:3.4.5-1. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [187/231] flexiblas-openblas-openmp64-0 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [188/231] openblas-openmp64-0:0.3.29-1. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [189/231] gcc-c++-0:15.1.1-2.fc43.x86_6 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [190/231] gcc-0:15.1.1-2.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [191/231] libmpc-0:1.3.1-7.fc42.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [192/231] cpp-0:15.1.1-2.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [193/231] gcc-gfortran-0:15.1.1-2.fc43. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [194/231] libX11-devel-0:1.8.11-1.fc42. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [195/231] libX11-xcb-0:1.8.11-1.fc42.x8 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [196/231] xorg-x11-proto-devel-0:2024.1 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [197/231] libdeflate-devel-0:1.24-1.fc4 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [198/231] cmake-filesystem-0:3.31.6-3.f 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [199/231] libicu-devel-0:76.1-4.fc42.x8 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [200/231] libtirpc-devel-0:1.3.6-1.rc3. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [201/231] libzstd-devel-0:1.5.7-1.fc43. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [202/231] pcre2-devel-0:10.45-1.fc43.x8 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [203/231] pcre2-utf16-0:10.45-1.fc43.x8 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [204/231] pcre2-utf32-0:10.45-1.fc43.x8 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [205/231] tre-devel-0:0.8.0-48.20140228 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [206/231] xz-devel-1:5.8.1-1.fc43.x86_6 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [207/231] zlib-ng-compat-devel-0:2.2.4- 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [208/231] libxcb-devel-0:1.17.0-5.fc42. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [209/231] libquadmath-devel-0:15.1.1-2. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [210/231] libstdc++-devel-0:15.1.1-2.fc 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [211/231] glibc-devel-0:2.41.9000-15.fc 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [212/231] libxcrypt-devel-0:4.4.38-7.fc 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [213/231] libXau-devel-0:1.0.12-2.fc42. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [214/231] kernel-headers-0:6.16.0-0.rc2 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [215/231] annobin-plugin-gcc-0:12.96-1. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [216/231] gcc-plugin-annobin-0:15.1.1-2 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [217/231] annobin-docs-0:12.96-1.fc43.n 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [218/231] R-CRAN-gtools-0:3.9.5-1.fc43. 100% | 22.6 MiB/s | 393.0 KiB | 00m00s [219/231] R-CRAN-lpSolve-0:5.6.23-1.fc4 100% | 2.0 MiB/s | 367.5 KiB | 00m00s [220/231] R-CRAN-patchwork-0:1.3.0-1.fc 100% | 60.9 MiB/s | 3.2 MiB | 00m00s [221/231] R-CRAN-readr-0:2.1.5-1.fc43.c 100% | 131.8 MiB/s | 810.0 KiB | 00m00s [222/231] R-CRAN-zoo-0:1.8.14-1.fc43.co 100% | 150.6 MiB/s | 1.1 MiB | 00m00s [223/231] R-CRAN-clipr-0:0.8.0-1.fc43.c 100% | 20.8 MiB/s | 63.9 KiB | 00m00s [224/231] R-CRAN-crayon-0:1.5.3-1.fc43. 100% | 59.3 MiB/s | 182.3 KiB | 00m00s [225/231] R-CRAN-hms-0:1.1.3-1.fc43.cop 100% | 37.1 MiB/s | 114.0 KiB | 00m00s [226/231] R-CRAN-vroom-0:1.6.5-1.fc43.c 100% | 43.5 MiB/s | 846.7 KiB | 00m00s [227/231] xclip-0:0.13-24.git11cba61.fc 100% | 3.2 MiB/s | 36.4 KiB | 00m00s [228/231] R-CRAN-bit64-0:4.6.0.1-1.fc43 100% | 90.2 MiB/s | 554.4 KiB | 00m00s [229/231] R-CRAN-bit-0:4.6.0-1.fc43.cop 100% | 108.1 MiB/s | 663.9 KiB | 00m00s [230/231] R-CRAN-data.tree-0:1.1.0-1.fc 100% | 3.5 MiB/s | 1.2 MiB | 00m00s [231/231] R-CRAN-BH-0:1.87.0.1-1.fc43.c 100% | 11.0 MiB/s | 10.0 MiB | 00m01s -------------------------------------------------------------------------------- [231/231] Total 100% | 15.2 MiB/s | 19.3 MiB | 00m01s Running transaction [ 1/233] Verify package files 100% | 240.0 B/s | 231.0 B | 00m01s >>> Running pre-transaction scriptlet: java-21-openjdk-headless-1:21.0.7.0.6-2.f >>> Finished pre-transaction scriptlet: java-21-openjdk-headless-1:21.0.7.0.6-2. >>> [RPM] /var/lib/mock/fedora-rawhide-x86_64-1750298820.676242/root/var/cache/d [ 2/233] Prepare transaction 100% | 1.2 KiB/s | 231.0 B | 00m00s [ 3/233] Installing nspr-0:4.36.0-9.fc 100% | 154.9 MiB/s | 317.2 KiB | 00m00s [ 4/233] Installing libgfortran-0:15.1 100% | 417.9 MiB/s | 3.3 MiB | 00m00s [ 5/233] Installing nss-util-0:3.112.0 100% | 197.0 MiB/s | 201.8 KiB | 00m00s [ 6/233] Installing libmpc-0:1.3.1-7.f 100% | 162.2 MiB/s | 166.1 KiB | 00m00s [ 7/233] Installing libquadmath-0:15.1 100% | 311.7 MiB/s | 319.2 KiB | 00m00s [ 8/233] Installing glib2-0:2.85.1-1.f 100% | 306.8 MiB/s | 14.7 MiB | 00m00s [ 9/233] Installing fonts-filesystem-1 100% | 0.0 B/s | 788.0 B | 00m00s [ 10/233] Installing libpng-2:1.6.49-1. 100% | 233.4 MiB/s | 239.0 KiB | 00m00s [ 11/233] Installing libicu-0:76.1-4.fc 100% | 432.5 MiB/s | 36.3 MiB | 00m00s [ 12/233] Installing cmake-filesystem-0 100% | 3.7 MiB/s | 7.6 KiB | 00m00s [ 13/233] Installing xorg-x11-proto-dev 100% | 297.1 MiB/s | 1.8 MiB | 00m00s [ 14/233] Installing openblas-0:0.3.29- 100% | 110.8 MiB/s | 113.5 KiB | 00m00s [ 15/233] Installing libXau-0:1.0.12-2. 100% | 76.6 MiB/s | 78.5 KiB | 00m00s [ 16/233] Installing libxcb-0:1.17.0-5. 100% | 270.1 MiB/s | 1.1 MiB | 00m00s [ 17/233] Installing libICE-0:1.1.2-2.f 100% | 195.1 MiB/s | 199.8 KiB | 00m00s [ 18/233] Installing make-1:4.4.1-10.fc 100% | 105.9 MiB/s | 1.8 MiB | 00m00s [ 19/233] Installing libtirpc-0:1.3.6-1 100% | 196.0 MiB/s | 200.7 KiB | 00m00s [ 20/233] Installing libjpeg-turbo-0:3. 100% | 391.2 MiB/s | 801.2 KiB | 00m00s [ 21/233] Installing libdeflate-0:1.24- 100% | 121.5 MiB/s | 124.4 KiB | 00m00s [ 22/233] Installing libRmath-0:4.5.1-1 100% | 237.9 MiB/s | 243.6 KiB | 00m00s [ 23/233] Installing libRmath-devel-0:4 100% | 0.0 B/s | 20.3 KiB | 00m00s [ 24/233] Installing libdeflate-devel-0 100% | 0.0 B/s | 27.3 KiB | 00m00s [ 25/233] Installing libtirpc-devel-0:1 100% | 128.5 MiB/s | 263.1 KiB | 00m00s [ 26/233] Installing libSM-0:1.2.5-2.fc 100% | 103.9 MiB/s | 106.4 KiB | 00m00s [ 27/233] Installing libXau-devel-0:1.0 100% | 1.8 MiB/s | 9.4 KiB | 00m00s [ 28/233] Installing libxcb-devel-0:1.1 100% | 78.7 MiB/s | 3.1 MiB | 00m00s [ 29/233] Installing openblas-openmp-0: 100% | 652.5 MiB/s | 43.7 MiB | 00m00s [ 30/233] Installing flexiblas-0:3.4.5- 100% | 0.0 B/s | 51.6 KiB | 00m00s [ 31/233] Installing flexiblas-openblas 100% | 0.0 B/s | 40.1 KiB | 00m00s [ 32/233] Installing flexiblas-netlib-0 100% | 295.5 MiB/s | 10.9 MiB | 00m00s [ 33/233] Installing openblas-openmp64- 100% | 674.7 MiB/s | 43.9 MiB | 00m00s [ 34/233] Installing flexiblas-netlib64 100% | 306.0 MiB/s | 11.0 MiB | 00m00s [ 35/233] Installing flexiblas-openblas 100% | 39.1 MiB/s | 40.1 KiB | 00m00s [ 36/233] Installing flexiblas-devel-0: 100% | 272.5 MiB/s | 4.9 MiB | 00m00s [ 37/233] Installing zlib-ng-compat-dev 100% | 106.0 MiB/s | 108.5 KiB | 00m00s [ 38/233] Installing libicu-devel-0:76. 100% | 211.4 MiB/s | 5.1 MiB | 00m00s [ 39/233] Installing abattis-cantarell- 100% | 189.9 MiB/s | 194.4 KiB | 00m00s [ 40/233] Installing cpp-0:15.1.1-2.fc4 100% | 371.1 MiB/s | 37.9 MiB | 00m00s [ 41/233] Installing nss-softokn-freebl 100% | 276.9 MiB/s | 850.5 KiB | 00m00s [ 42/233] Installing nss-softokn-0:3.11 100% | 377.9 MiB/s | 1.9 MiB | 00m00s [ 43/233] Installing nss-sysinit-0:3.11 100% | 1.6 MiB/s | 19.2 KiB | 00m00s [ 44/233] Installing nss-0:3.112.0-1.fc 100% | 170.9 MiB/s | 1.9 MiB | 00m00s [ 45/233] Installing annobin-docs-0:12. 100% | 32.6 MiB/s | 100.0 KiB | 00m00s [ 46/233] Installing kernel-headers-0:6 100% | 213.3 MiB/s | 6.8 MiB | 00m00s [ 47/233] Installing libxcrypt-devel-0: 100% | 16.2 MiB/s | 33.1 KiB | 00m00s [ 48/233] Installing glibc-devel-0:2.41 100% | 180.0 MiB/s | 2.3 MiB | 00m00s [ 49/233] Installing gcc-0:15.1.1-2.fc4 100% | 429.2 MiB/s | 111.2 MiB | 00m00s [ 50/233] Installing libquadmath-devel- 100% | 23.1 MiB/s | 23.6 KiB | 00m00s [ 51/233] Installing gcc-gfortran-0:15. 100% | 363.1 MiB/s | 40.3 MiB | 00m00s [ 52/233] Installing libstdc++-devel-0: 100% | 415.9 MiB/s | 16.2 MiB | 00m00s [ 53/233] Installing gcc-c++-0:15.1.1-2 100% | 382.4 MiB/s | 41.3 MiB | 00m00s [ 54/233] Installing xz-devel-1:5.8.1-1 100% | 256.4 MiB/s | 262.6 KiB | 00m00s [ 55/233] Installing pcre2-utf32-0:10.4 100% | 292.5 MiB/s | 599.1 KiB | 00m00s [ 56/233] Installing pcre2-utf16-0:10.4 100% | 306.2 MiB/s | 627.2 KiB | 00m00s [ 57/233] Installing pcre2-devel-0:10.4 100% | 116.3 MiB/s | 2.1 MiB | 00m00s [ 58/233] Installing libzstd-devel-0:1. 100% | 203.9 MiB/s | 208.8 KiB | 00m00s [ 59/233] Installing libX11-xcb-0:1.8.1 100% | 0.0 B/s | 11.8 KiB | 00m00s [ 60/233] Installing bzip2-devel-0:1.0. 100% | 303.5 MiB/s | 310.7 KiB | 00m00s [ 61/233] Installing dbus-libs-1:1.16.0 100% | 342.4 MiB/s | 350.6 KiB | 00m00s [ 62/233] Installing avahi-libs-0:0.9~r 100% | 170.1 MiB/s | 174.2 KiB | 00m00s [ 63/233] Installing cups-filesystem-1: 100% | 0.0 B/s | 1.8 KiB | 00m00s [ 64/233] Installing cups-libs-1:2.4.12 100% | 302.9 MiB/s | 620.3 KiB | 00m00s [ 65/233] Installing ncurses-0:6.5-5.20 100% | 28.6 MiB/s | 614.7 KiB | 00m00s [ 66/233] Installing groff-base-0:1.23. 100% | 118.0 MiB/s | 3.9 MiB | 00m00s [ 67/233] Installing perl-Digest-0:1.20 100% | 36.2 MiB/s | 37.1 KiB | 00m00s [ 68/233] Installing perl-B-0:1.89-517. 100% | 244.8 MiB/s | 501.3 KiB | 00m00s [ 69/233] Installing perl-FileHandle-0: 100% | 0.0 B/s | 9.8 KiB | 00m00s [ 70/233] Installing perl-Digest-MD5-0: 100% | 60.1 MiB/s | 61.6 KiB | 00m00s [ 71/233] Installing perl-MIME-Base32-0 100% | 0.0 B/s | 32.2 KiB | 00m00s [ 72/233] Installing perl-Data-Dumper-0 100% | 114.7 MiB/s | 117.5 KiB | 00m00s [ 73/233] Installing perl-libnet-0:3.15 100% | 143.9 MiB/s | 294.7 KiB | 00m00s [ 74/233] Installing perl-IO-Socket-IP- 100% | 99.8 MiB/s | 102.2 KiB | 00m00s [ 75/233] Installing perl-AutoLoader-0: 100% | 0.0 B/s | 20.9 KiB | 00m00s [ 76/233] Installing perl-URI-0:5.32-1. 100% | 133.8 MiB/s | 274.1 KiB | 00m00s [ 77/233] Installing perl-File-Path-0:2 100% | 0.0 B/s | 64.5 KiB | 00m00s [ 78/233] Installing perl-Time-Local-2: 100% | 0.0 B/s | 70.6 KiB | 00m00s [ 79/233] Installing perl-Pod-Escapes-1 100% | 0.0 B/s | 25.9 KiB | 00m00s [ 80/233] Installing perl-Text-Tabs+Wra 100% | 0.0 B/s | 23.9 KiB | 00m00s [ 81/233] Installing perl-if-0:0.61.000 100% | 0.0 B/s | 6.2 KiB | 00m00s [ 82/233] Installing perl-locale-0:1.12 100% | 0.0 B/s | 6.9 KiB | 00m00s [ 83/233] Installing perl-Net-SSLeay-0: 100% | 271.7 MiB/s | 1.4 MiB | 00m00s [ 84/233] Installing perl-IO-Socket-SSL 100% | 349.4 MiB/s | 715.5 KiB | 00m00s [ 85/233] Installing perl-Term-ANSIColo 100% | 96.9 MiB/s | 99.2 KiB | 00m00s [ 86/233] Installing perl-Term-Cap-0:1. 100% | 0.0 B/s | 30.6 KiB | 00m00s [ 87/233] Installing perl-Class-Struct- 100% | 0.0 B/s | 25.9 KiB | 00m00s [ 88/233] Installing perl-File-Temp-1:0 100% | 160.2 MiB/s | 164.1 KiB | 00m00s [ 89/233] Installing perl-IPC-Open3-0:1 100% | 0.0 B/s | 23.3 KiB | 00m00s [ 90/233] Installing perl-POSIX-0:2.20- 100% | 226.9 MiB/s | 232.3 KiB | 00m00s [ 91/233] Installing perl-HTTP-Tiny-0:0 100% | 152.8 MiB/s | 156.4 KiB | 00m00s [ 92/233] Installing perl-Pod-Simple-1: 100% | 280.7 MiB/s | 574.8 KiB | 00m00s [ 93/233] Installing perl-Socket-4:2.03 100% | 119.1 MiB/s | 122.0 KiB | 00m00s [ 94/233] Installing perl-SelectSaver-0 100% | 0.0 B/s | 2.6 KiB | 00m00s [ 95/233] Installing perl-Symbol-0:1.09 100% | 0.0 B/s | 7.2 KiB | 00m00s [ 96/233] Installing perl-File-stat-0:1 100% | 0.0 B/s | 13.1 KiB | 00m00s [ 97/233] Installing perl-Pod-Perldoc-0 100% | 12.7 MiB/s | 169.2 KiB | 00m00s [ 98/233] Installing perl-podlators-1:6 100% | 24.1 MiB/s | 321.4 KiB | 00m00s [ 99/233] Installing perl-Text-ParseWor 100% | 0.0 B/s | 14.6 KiB | 00m00s [100/233] Installing perl-base-0:2.27-5 100% | 0.0 B/s | 12.9 KiB | 00m00s [101/233] Installing perl-Fcntl-0:1.18- 100% | 0.0 B/s | 50.0 KiB | 00m00s [102/233] Installing perl-mro-0:1.29-51 100% | 0.0 B/s | 42.6 KiB | 00m00s [103/233] Installing perl-overloading-0 100% | 0.0 B/s | 5.5 KiB | 00m00s [104/233] Installing perl-IO-0:1.55-517 100% | 147.7 MiB/s | 151.3 KiB | 00m00s [105/233] Installing perl-Pod-Usage-4:2 100% | 7.2 MiB/s | 87.9 KiB | 00m00s [106/233] Installing perl-vars-0:1.05-5 100% | 0.0 B/s | 4.3 KiB | 00m00s [107/233] Installing perl-Errno-0:1.38- 100% | 0.0 B/s | 8.7 KiB | 00m00s [108/233] Installing perl-Scalar-List-U 100% | 145.0 MiB/s | 148.5 KiB | 00m00s [109/233] Installing perl-constant-0:1. 100% | 0.0 B/s | 27.4 KiB | 00m00s [110/233] Installing perl-File-Basename 100% | 0.0 B/s | 14.6 KiB | 00m00s [111/233] Installing perl-Getopt-Std-0: 100% | 0.0 B/s | 11.7 KiB | 00m00s [112/233] Installing perl-MIME-Base64-0 100% | 43.2 MiB/s | 44.3 KiB | 00m00s [113/233] Installing perl-parent-1:0.24 100% | 0.0 B/s | 11.0 KiB | 00m00s [114/233] Installing perl-overload-0:1. 100% | 0.0 B/s | 71.9 KiB | 00m00s [115/233] Installing perl-Storable-1:3. 100% | 228.4 MiB/s | 233.9 KiB | 00m00s [116/233] Installing perl-Getopt-Long-1 100% | 143.8 MiB/s | 147.2 KiB | 00m00s [117/233] Installing perl-Carp-0:1.54-5 100% | 0.0 B/s | 47.7 KiB | 00m00s [118/233] Installing perl-Exporter-0:5. 100% | 0.0 B/s | 55.6 KiB | 00m00s [119/233] Installing perl-DynaLoader-0: 100% | 0.0 B/s | 32.5 KiB | 00m00s [120/233] Installing perl-PathTools-0:3 100% | 180.2 MiB/s | 184.5 KiB | 00m00s [121/233] Installing perl-Encode-4:3.21 100% | 187.8 MiB/s | 4.7 MiB | 00m00s [122/233] Installing perl-libs-4:5.40.2 100% | 290.9 MiB/s | 9.9 MiB | 00m00s [123/233] Installing perl-interpreter-4 100% | 9.0 MiB/s | 119.9 KiB | 00m00s [124/233] Installing libfontenc-0:1.1.8 100% | 70.6 MiB/s | 72.3 KiB | 00m00s [125/233] Installing google-noto-fonts- 100% | 0.0 B/s | 18.5 KiB | 00m00s [126/233] Installing google-noto-sans-v 100% | 347.8 MiB/s | 1.4 MiB | 00m00s [127/233] Installing default-fonts-core 100% | 17.8 MiB/s | 18.2 KiB | 00m00s [128/233] Installing tzdata-java-0:2025 100% | 0.0 B/s | 100.5 KiB | 00m00s [129/233] Installing lksctp-tools-0:1.0 100% | 17.8 MiB/s | 254.7 KiB | 00m00s [130/233] Installing javapackages-files 100% | 5.4 MiB/s | 5.5 KiB | 00m00s [131/233] Installing alsa-lib-0:1.2.14- 100% | 80.2 MiB/s | 1.4 MiB | 00m00s [132/233] Installing java-21-openjdk-he 100% | 461.5 MiB/s | 197.5 MiB | 00m00s [133/233] Installing emacs-filesystem-1 100% | 0.0 B/s | 544.0 B | 00m00s [134/233] Installing desktop-file-utils 100% | 15.5 MiB/s | 222.2 KiB | 00m00s [135/233] Installing xdg-utils-0:1.2.1- 100% | 26.3 MiB/s | 349.5 KiB | 00m00s [136/233] Installing libdatrie-0:0.2.13 100% | 0.0 B/s | 58.9 KiB | 00m00s [137/233] Installing libthai-0:0.1.29-1 100% | 255.6 MiB/s | 785.2 KiB | 00m00s [138/233] Installing graphite2-0:1.3.14 100% | 14.9 MiB/s | 197.9 KiB | 00m00s [139/233] Installing freetype-0:2.13.3- 100% | 279.9 MiB/s | 859.9 KiB | 00m00s [140/233] Installing harfbuzz-0:11.2.1- 100% | 399.2 MiB/s | 2.8 MiB | 00m00s [141/233] Installing mkfontscale-0:1.2. 100% | 3.8 MiB/s | 46.4 KiB | 00m00s [142/233] Installing ttmkfdir-0:3.0.9-7 100% | 6.5 MiB/s | 119.6 KiB | 00m00s [143/233] Installing xml-common-0:0.6.3 100% | 79.2 MiB/s | 81.1 KiB | 00m00s [144/233] Installing fontconfig-0:2.16. 100% | 754.4 KiB/s | 780.1 KiB | 00m01s [145/233] Installing xorg-x11-fonts-Typ 100% | 835.5 KiB/s | 865.6 KiB | 00m01s [146/233] Installing tre-common-0:0.8.0 100% | 81.2 MiB/s | 83.1 KiB | 00m00s [147/233] Installing tre-0:0.8.0-48.201 100% | 74.8 MiB/s | 76.6 KiB | 00m00s [148/233] Installing tre-devel-0:0.8.0- 100% | 0.0 B/s | 11.6 KiB | 00m00s [149/233] Installing libtommath-0:1.3.1 100% | 128.4 MiB/s | 131.5 KiB | 00m00s [150/233] Installing tcl-1:9.0.0-8.fc43 100% | 149.5 MiB/s | 4.3 MiB | 00m00s [151/233] Installing fribidi-0:1.0.16-2 100% | 13.7 MiB/s | 196.8 KiB | 00m00s [152/233] Installing libwebp-0:1.5.0-2. 100% | 309.8 MiB/s | 951.8 KiB | 00m00s [153/233] Installing liblerc-0:4.0.0-8. 100% | 311.3 MiB/s | 637.6 KiB | 00m00s [154/233] Installing jbigkit-libs-0:2.1 100% | 120.5 MiB/s | 123.4 KiB | 00m00s [155/233] Installing libtiff-0:4.7.0-3. 100% | 202.3 MiB/s | 621.3 KiB | 00m00s [156/233] Installing libX11-common-0:1. 100% | 169.7 MiB/s | 1.2 MiB | 00m00s [157/233] Installing libX11-0:1.8.11-1. 100% | 321.4 MiB/s | 1.3 MiB | 00m00s [158/233] Installing libXext-0:1.3.6-3. 100% | 89.1 MiB/s | 91.2 KiB | 00m00s [159/233] Installing libXrender-0:0.9.1 100% | 0.0 B/s | 51.3 KiB | 00m00s [160/233] Installing libXft-0:2.3.8-8.f 100% | 165.9 MiB/s | 169.9 KiB | 00m00s [161/233] Installing libXi-0:1.8.2-2.fc 100% | 83.7 MiB/s | 85.7 KiB | 00m00s [162/233] Installing libXt-0:1.3.1-2.fc 100% | 210.4 MiB/s | 430.9 KiB | 00m00s [163/233] Installing libXmu-0:1.2.1-3.f 100% | 39.3 MiB/s | 201.3 KiB | 00m00s [164/233] Installing xclip-0:0.13-24.gi 100% | 4.5 MiB/s | 60.1 KiB | 00m00s [165/233] Installing libXtst-0:1.2.5-2. 100% | 4.8 MiB/s | 34.6 KiB | 00m00s [166/233] Installing tk-1:9.0.0-4.fc43. 100% | 141.8 MiB/s | 3.8 MiB | 00m00s [167/233] Installing libXcomposite-0:0. 100% | 44.9 MiB/s | 46.0 KiB | 00m00s [168/233] Installing java-21-openjdk-1: 100% | 96.4 MiB/s | 1.1 MiB | 00m00s [169/233] Installing java-21-openjdk-de 100% | 250.7 MiB/s | 11.5 MiB | 00m00s [170/233] Installing libX11-devel-0:1.8 100% | 74.6 MiB/s | 1.1 MiB | 00m00s [171/233] Installing pixman-0:0.46.2-1. 100% | 347.4 MiB/s | 711.4 KiB | 00m00s [172/233] Installing lzo-0:2.10-14.fc42 100% | 168.5 MiB/s | 172.5 KiB | 00m00s [173/233] Installing cairo-0:1.18.4-1.f 100% | 354.4 MiB/s | 1.8 MiB | 00m00s [174/233] Installing pango-0:1.56.3-1.f 100% | 51.7 MiB/s | 1.0 MiB | 00m00s [175/233] Installing tzdata-0:2025b-1.f 100% | 65.2 MiB/s | 1.9 MiB | 00m00s [176/233] Installing less-0:678-1.fc43. 100% | 10.2 MiB/s | 409.1 KiB | 00m00s [177/233] Installing R-core-0:4.5.1-1.f 100% | 266.7 MiB/s | 106.1 MiB | 00m00s [178/233] Installing R-CRAN-rlang-0:1.1 100% | 170.1 MiB/s | 2.7 MiB | 00m00s [179/233] Installing R-CRAN-cli-0:3.6.5 100% | 208.9 MiB/s | 2.5 MiB | 00m00s [180/233] Installing R-CRAN-glue-0:1.8. 100% | 174.4 MiB/s | 357.1 KiB | 00m00s [181/233] Installing R-CRAN-lifecycle-0 100% | 96.8 MiB/s | 297.3 KiB | 00m00s [182/233] Installing R-CRAN-vctrs-0:0.6 100% | 220.1 MiB/s | 2.4 MiB | 00m00s [183/233] Installing R-CRAN-magrittr-0: 100% | 141.2 MiB/s | 433.8 KiB | 00m00s [184/233] Installing R-CRAN-R6-0:2.6.1- 100% | 126.4 MiB/s | 129.4 KiB | 00m00s [185/233] Installing R-CRAN-withr-0:3.0 100% | 103.1 MiB/s | 422.4 KiB | 00m00s [186/233] Installing R-CRAN-tidyselect- 100% | 147.0 MiB/s | 451.6 KiB | 00m00s [187/233] Installing R-CRAN-lattice-0:0 100% | 210.2 MiB/s | 2.1 MiB | 00m00s [188/233] Installing R-CRAN-gtable-0:0. 100% | 115.1 MiB/s | 353.6 KiB | 00m00s [189/233] Installing R-CRAN-stringi-0:1 100% | 210.5 MiB/s | 2.1 MiB | 00m00s [190/233] Installing R-CRAN-farver-0:2. 100% | 344.2 MiB/s | 2.1 MiB | 00m00s [191/233] Installing R-CRAN-crayon-0:1. 100% | 123.9 MiB/s | 253.7 KiB | 00m00s [192/233] Installing R-CRAN-pkgconfig-0 100% | 39.3 MiB/s | 40.2 KiB | 00m00s [193/233] Installing R-CRAN-hms-0:1.1.3 100% | 70.1 MiB/s | 143.7 KiB | 00m00s [194/233] Installing R-core-devel-0:4.5 100% | 203.8 MiB/s | 417.5 KiB | 00m00s [195/233] Installing R-CRAN-stringr-0:1 100% | 94.6 MiB/s | 678.4 KiB | 00m00s [196/233] Installing R-CRAN-Matrix-0:1. 100% | 169.0 MiB/s | 8.6 MiB | 00m00s [197/233] Installing R-CRAN-nlme-0:3.1. 100% | 196.6 MiB/s | 3.9 MiB | 00m00s [198/233] Installing R-CRAN-mgcv-0:1.9. 100% | 303.7 MiB/s | 4.9 MiB | 00m00s [199/233] Installing R-CRAN-purrr-0:1.0 100% | 136.5 MiB/s | 978.3 KiB | 00m00s [200/233] Installing R-CRAN-RColorBrewe 100% | 67.9 MiB/s | 69.6 KiB | 00m00s [201/233] Installing R-littler-0:0.3.19 100% | 11.7 MiB/s | 168.2 KiB | 00m00s [202/233] Installing R-CRAN-generics-0: 100% | 59.1 MiB/s | 181.4 KiB | 00m00s [203/233] Installing R-CRAN-MASS-0:7.3. 100% | 171.9 MiB/s | 1.9 MiB | 00m00s [204/233] Installing R-CRAN-isoband-0:0 100% | 374.8 MiB/s | 1.9 MiB | 00m00s [205/233] Installing R-CRAN-clipr-0:0.8 100% | 91.3 MiB/s | 93.5 KiB | 00m00s [206/233] Installing R-rpm-macros-0:1.2 100% | 0.0 B/s | 6.6 KiB | 00m00s [207/233] Installing R-CRAN-utf8-0:1.2. 100% | 237.9 MiB/s | 487.2 KiB | 00m00s [208/233] Installing R-CRAN-pillar-0:1. 100% | 241.2 MiB/s | 1.4 MiB | 00m00s [209/233] Installing R-CRAN-tibble-0:3. 100% | 239.9 MiB/s | 1.7 MiB | 00m00s [210/233] Installing R-CRAN-dplyr-0:1.1 100% | 208.4 MiB/s | 2.7 MiB | 00m00s [211/233] Installing R-CRAN-labeling-0: 100% | 101.5 MiB/s | 103.9 KiB | 00m00s [212/233] Installing R-CRAN-viridisLite 100% | 434.9 MiB/s | 1.3 MiB | 00m00s [213/233] Installing R-CRAN-scales-0:1. 100% | 153.6 MiB/s | 1.4 MiB | 00m00s [214/233] Installing R-CRAN-ggplot2-0:3 100% | 261.4 MiB/s | 7.3 MiB | 00m00s [215/233] Installing R-CRAN-tzdb-0:0.5. 100% | 315.1 MiB/s | 2.2 MiB | 00m00s [216/233] Installing R-java-0:4.5.1-1.f 100% | 0.0 B/s | 124.0 B | 00m00s [217/233] Installing R-java-devel-0:4.5 100% | 121.1 KiB/s | 124.0 B | 00m00s [218/233] Installing R-CRAN-bit-0:4.6.0 100% | 143.2 MiB/s | 1.3 MiB | 00m00s [219/233] Installing R-CRAN-bit64-0:4.6 100% | 117.2 MiB/s | 960.3 KiB | 00m00s [220/233] Installing R-CRAN-vroom-0:1.6 100% | 192.2 MiB/s | 1.7 MiB | 00m00s [221/233] Installing R-CRAN-readr-0:2.1 100% | 179.8 MiB/s | 1.4 MiB | 00m00s [222/233] Installing R-devel-0:4.5.1-1. 100% | 0.0 B/s | 124.0 B | 00m00s [223/233] Installing R-CRAN-patchwork-0 100% | 375.7 MiB/s | 4.1 MiB | 00m00s [224/233] Installing R-CRAN-tidyr-0:1.3 100% | 210.0 MiB/s | 1.9 MiB | 00m00s [225/233] Installing R-CRAN-Rcpp-0:1.0. 100% | 284.3 MiB/s | 8.5 MiB | 00m00s [226/233] Installing R-CRAN-data.tree-0 100% | 308.6 MiB/s | 3.1 MiB | 00m00s [227/233] Installing R-CRAN-zoo-0:1.8.1 100% | 57.3 MiB/s | 1.5 MiB | 00m00s [228/233] Installing R-CRAN-BH-0:1.87.0 100% | 294.9 MiB/s | 124.7 MiB | 00m00s [229/233] Installing R-CRAN-gtools-0:3. 100% | 49.5 MiB/s | 558.0 KiB | 00m00s [230/233] Installing R-CRAN-lpSolve-0:5 100% | 256.2 MiB/s | 787.0 KiB | 00m00s [231/233] Installing R-CRAN-yaml-0:2.3. 100% | 136.9 MiB/s | 280.4 KiB | 00m00s [232/233] Installing annobin-plugin-gcc 100% | 64.8 MiB/s | 995.3 KiB | 00m00s [233/233] Installing gcc-plugin-annobin 100% | 129.2 KiB/s | 58.8 KiB | 00m00s Warning: skipped OpenPGP checks for 48 packages from repository: copr_base Complete! Finish: build setup for R-CRAN-starvz-0.8.3-1.fc43.copr9182845.src.rpm Start: rpmbuild R-CRAN-starvz-0.8.3-1.fc43.copr9182845.src.rpm Building target platforms: x86_64 Building for target x86_64 Executing(%mkbuilddir): /bin/sh -e /var/tmp/rpm-tmp.Qpqx8K warning: %source_date_epoch_from_changelog is set, but %changelog has no entries to take a date from Executing(%prep): /bin/sh -e /var/tmp/rpm-tmp.0LDXEQ + umask 022 + cd /builddir/build/BUILD/R-CRAN-starvz-0.8.3-build + cd /builddir/build/BUILD/R-CRAN-starvz-0.8.3-build + rm -rf starvz + /usr/bin/mkdir -p starvz + cd starvz + /usr/lib/rpm/rpmuncompress -x /builddir/build/SOURCES/starvz_0.8.3.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.chaaHR + umask 022 + cd /builddir/build/BUILD/R-CRAN-starvz-0.8.3-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-hardened-ld-errors -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.A7GNOp + umask 022 + cd /builddir/build/BUILD/R-CRAN-starvz-0.8.3-build + '[' /builddir/build/BUILD/R-CRAN-starvz-0.8.3-build/BUILDROOT '!=' / ']' + rm -rf /builddir/build/BUILD/R-CRAN-starvz-0.8.3-build/BUILDROOT ++ dirname /builddir/build/BUILD/R-CRAN-starvz-0.8.3-build/BUILDROOT + mkdir -p /builddir/build/BUILD/R-CRAN-starvz-0.8.3-build + mkdir /builddir/build/BUILD/R-CRAN-starvz-0.8.3-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-hardened-ld-errors -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.3-build/BUILDROOT/usr/local/lib/R/library + /usr/bin/R CMD INSTALL -l /builddir/build/BUILD/R-CRAN-starvz-0.8.3-build/BUILDROOT/usr/local/lib/R/library starvz * installing *source* package ‘starvz’ ... ** this is package ‘starvz’ version ‘0.8.3’ ** package ‘starvz’ successfully unpacked and MD5 sums checked ** using staged installation ** libs using C++ compiler: ‘g++ (GCC) 15.1.1 20250521 (Red Hat 15.1.1-2)’ 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:17, 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:326:33: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 326 | explicit shared_count( std::auto_ptr & r ): pi_( new sp_counted_impl_p( r.get() ) ) | ^~~~~~~~ In file included from /usr/include/c++/15/memory:80, 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:23: /usr/include/c++/15/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:354:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 354 | explicit shared_ptr( std::auto_ptr & r ): px(r.get()), pn() | ^~~~~~~~ /usr/include/c++/15/bits/unique_ptr.h:59:28: note: declared here 59 | template class auto_ptr; | ^~~~~~~~ /usr/local/lib/R/library/BH/include/boost/smart_ptr/shared_ptr.hpp:365:22: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 365 | shared_ptr( std::auto_ptr && r ): px(r.get()), pn() | ^~~~~~~~ /usr/include/c++/15/bits/unique_ptr.h:59:28: note: declared here 59 | template class auto_ptr; | ^~~~~~~~ /usr/local/lib/R/library/BH/include/boost/smart_ptr/shared_ptr.hpp:423:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 423 | shared_ptr & operator=( std::auto_ptr & r ) | ^~~~~~~~ /usr/include/c++/15/bits/unique_ptr.h:59:28: note: declared here 59 | template class auto_ptr; | ^~~~~~~~ /usr/local/lib/R/library/BH/include/boost/smart_ptr/shared_ptr.hpp:430:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 430 | shared_ptr & operator=( std::auto_ptr && r ) | ^~~~~~~~ /usr/include/c++/15/bits/unique_ptr.h: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:432:38: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 432 | this_type( static_cast< std::auto_ptr && >( r ) ).swap( *this ); | ^~~~~~~~ /usr/include/c++/15/bits/unique_ptr.h: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 ) noexcept : px( p.release() ) | ^~~~~~~~ /usr/include/c++/15/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-hardened-ld-errors -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++/15/new:140:26: note: in a call to allocation function ‘operator new []’ declared here 140 | _GLIBCXX_NODISCARD void* operator new[](std::size_t) | ^ installing to /builddir/build/BUILD/R-CRAN-starvz-0.8.3-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.3-build/BUILDROOT/usr/local/lib/R/library/R.css + find /builddir/build/BUILD/R-CRAN-starvz-0.8.3-build/BUILDROOT/usr/local/lib/R/library -type f -exec sed -i s@/builddir/build/BUILD/R-CRAN-starvz-0.8.3-build/BUILDROOT@@g '{}' ';' + /usr/bin/find-debuginfo -j4 --strict-build-id -m -i --build-id-seed 0.8.3-1.fc43.copr9182845 --unique-debug-suffix -0.8.3-1.fc43.copr9182845.x86_64 --unique-debug-src-base R-CRAN-starvz-0.8.3-1.fc43.copr9182845.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.3-build/starvz find-debuginfo: starting Extracting debug info from 1 files warning: Unsupported auto-load script at offset 0 in section .debug_gdb_scripts of file /builddir/build/BUILD/R-CRAN-starvz-0.8.3-build/BUILDROOT/usr/local/lib/R/library/starvz/libs/starvz.so. Use `info auto-load python-scripts [REGEXP]' to list them. 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.3-1.fc43.copr9182845.x86_64 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 + /usr/lib/rpm/redhat/brp-python-rpm-in-distinfo + 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.3-build/BUILDROOT Handler jar skipped: jar handler requires $SOURCE_DATE_EPOCH to be set Handler gzip skipped: gzip handler requires $SOURCE_DATE_EPOCH to be set Handler zip skipped: zip handler requires $SOURCE_DATE_EPOCH to be set 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.3-build/SPECPARTS/rpm-debuginfo.specpart Processing files: R-CRAN-starvz-0.8.3-1.fc43.copr9182845.x86_64 Provides: R-CRAN-starvz = 0.8.3-1.fc43.copr9182845 R-CRAN-starvz(x86-64) = 0.8.3-1.fc43.copr9182845 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.3-1.fc43.copr9182845.x86_64 Provides: R-CRAN-starvz-debugsource = 0.8.3-1.fc43.copr9182845 R-CRAN-starvz-debugsource(x86-64) = 0.8.3-1.fc43.copr9182845 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.3-1.fc43.copr9182845.x86_64 Provides: R-CRAN-starvz-debuginfo = 0.8.3-1.fc43.copr9182845 R-CRAN-starvz-debuginfo(x86-64) = 0.8.3-1.fc43.copr9182845 debuginfo(build-id) = fb943fdab02edb25ea6da01886cdb0ee79709515 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.3-1.fc43.copr9182845 Checking for unpackaged file(s): /usr/lib/rpm/check-files /builddir/build/BUILD/R-CRAN-starvz-0.8.3-build/BUILDROOT Wrote: /builddir/build/RPMS/R-CRAN-starvz-debugsource-0.8.3-1.fc43.copr9182845.x86_64.rpm Wrote: /builddir/build/RPMS/R-CRAN-starvz-0.8.3-1.fc43.copr9182845.x86_64.rpm Wrote: /builddir/build/RPMS/R-CRAN-starvz-debuginfo-0.8.3-1.fc43.copr9182845.x86_64.rpm Executing(rmbuild): /bin/sh -e /var/tmp/rpm-tmp.15M3Hl + umask 022 + cd /builddir/build/BUILD/R-CRAN-starvz-0.8.3-build + test -d /builddir/build/BUILD/R-CRAN-starvz-0.8.3-build + /usr/bin/chmod -Rf a+rX,u+w,g-w,o-w /builddir/build/BUILD/R-CRAN-starvz-0.8.3-build + rm -rf /builddir/build/BUILD/R-CRAN-starvz-0.8.3-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.3-1.fc43.copr9182845.src.rpm Finish: build phase for R-CRAN-starvz-0.8.3-1.fc43.copr9182845.src.rpm INFO: chroot_scan: 1 files copied to /var/lib/copr-rpmbuild/results/chroot_scan INFO: /var/lib/mock/fedora-rawhide-x86_64-1750298820.676242/root/var/log/dnf5.log INFO: chroot_scan: creating tarball /var/lib/copr-rpmbuild/results/chroot_scan.tar.gz /bin/tar: Removing leading `/' from member names INFO: Done(/var/lib/copr-rpmbuild/results/R-CRAN-starvz-0.8.3-1.fc43.copr9182845.src.rpm) Config(child) 0 minutes 53 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-debugsource", "epoch": null, "version": "0.8.3", "release": "1.fc43.copr9182845", "arch": "x86_64" }, { "name": "R-CRAN-starvz", "epoch": null, "version": "0.8.3", "release": "1.fc43.copr9182845", "arch": "src" }, { "name": "R-CRAN-starvz-debuginfo", "epoch": null, "version": "0.8.3", "release": "1.fc43.copr9182845", "arch": "x86_64" }, { "name": "R-CRAN-starvz", "epoch": null, "version": "0.8.3", "release": "1.fc43.copr9182845", "arch": "x86_64" } ] } RPMResults finished