Warning: Permanently added '2620:52:3:1:dead:beef:cafe:c14f' (ED25519) to the list of known hosts. You can reproduce this build on your computer by running: sudo dnf install copr-rpmbuild /usr/bin/copr-rpmbuild --verbose --drop-resultdir --task-url https://copr.fedorainfracloud.org/backend/get-build-task/7307546-fedora-38-x86_64 --chroot fedora-38-x86_64 Version: 0.72 PID: 6293 Logging PID: 6294 Task: {'allow_user_ssh': False, 'appstream': False, 'background': False, 'bootstrap': 'off', 'build_id': 7307546, 'buildroot_pkgs': [], 'chroot': 'fedora-38-x86_64', 'enable_net': False, 'fedora_review': False, 'git_hash': 'f12a065c783b04a26b823182d061fe8ca214ebcc', 'git_repo': 'https://copr-dist-git.fedorainfracloud.org/git/iucar/cran/R-CRAN-starvz', 'isolation': 'default', 'memory_reqs': 2048, 'package_name': 'R-CRAN-starvz', 'package_version': '0.8.0-1.copr7307546', 'project_dirname': 'cran', 'project_name': 'cran', 'project_owner': 'iucar', 'repo_priority': None, 'repos': [{'baseurl': 'https://download.copr.fedorainfracloud.org/results/iucar/cran/fedora-38-x86_64/', 'id': 'copr_base', 'name': 'Copr repository', 'priority': None}], 'sandbox': 'iucar/cran--iucar', 'source_json': {}, 'source_type': None, 'ssh_public_keys': None, 'submitter': 'iucar', 'tags': [], 'task_id': '7307546-fedora-38-x86_64', 'timeout': 18000, 'uses_devel_repo': False, 'with_opts': [], 'without_opts': []} Running: git clone https://copr-dist-git.fedorainfracloud.org/git/iucar/cran/R-CRAN-starvz /var/lib/copr-rpmbuild/workspace/workdir-q_dvq8e_/R-CRAN-starvz --depth 500 --no-single-branch --recursive cmd: ['git', 'clone', 'https://copr-dist-git.fedorainfracloud.org/git/iucar/cran/R-CRAN-starvz', '/var/lib/copr-rpmbuild/workspace/workdir-q_dvq8e_/R-CRAN-starvz', '--depth', '500', '--no-single-branch', '--recursive'] cwd: . rc: 0 stdout: stderr: Cloning into '/var/lib/copr-rpmbuild/workspace/workdir-q_dvq8e_/R-CRAN-starvz'... Running: git checkout f12a065c783b04a26b823182d061fe8ca214ebcc -- cmd: ['git', 'checkout', 'f12a065c783b04a26b823182d061fe8ca214ebcc', '--'] cwd: /var/lib/copr-rpmbuild/workspace/workdir-q_dvq8e_/R-CRAN-starvz rc: 0 stdout: stderr: Note: switching to 'f12a065c783b04a26b823182d061fe8ca214ebcc'. You are in 'detached HEAD' state. You can look around, make experimental changes and commit them, and you can discard any commits you make in this state without impacting any branches by switching back to a branch. If you want to create a new branch to retain commits you create, you may do so (now or later) by using -c with the switch command. Example: git switch -c Or undo this operation with: git switch - Turn off this advice by setting config variable advice.detachedHead to false HEAD is now at f12a065 automatic import of R-CRAN-starvz Running: copr-distgit-client sources cmd: ['copr-distgit-client', 'sources'] cwd: /var/lib/copr-rpmbuild/workspace/workdir-q_dvq8e_/R-CRAN-starvz rc: 0 stdout: stderr: INFO: Reading stdout from command: git rev-parse --abbrev-ref HEAD INFO: Reading stdout from command: git rev-parse HEAD INFO: Reading sources specification file: sources INFO: Downloading starvz_0.8.0.tar.gz /usr/bin/tail: /var/lib/copr-rpmbuild/main.log: file truncated INFO: Reading stdout from command: curl --help all INFO: Calling: curl -H Pragma: -o starvz_0.8.0.tar.gz --location --connect-timeout 60 --retry 3 --retry-delay 10 --remote-time --show-error --fail --retry-all-errors https://copr-dist-git.fedorainfracloud.org/repo/pkgs/iucar/cran/R-CRAN-starvz/starvz_0.8.0.tar.gz/md5/268ec913c42ff48ea3d7f3df11825830/starvz_0.8.0.tar.gz % Total % Received % Xferd Average Speed Time Time Time Current Dload Upload Total Spent Left Speed 100 294k 100 294k 0 0 2460k 0 --:--:-- --:--:-- --:--:-- 2454k INFO: Reading stdout from command: md5sum starvz_0.8.0.tar.gz Running (timeout=18000): unbuffer mock --spec /var/lib/copr-rpmbuild/workspace/workdir-q_dvq8e_/R-CRAN-starvz/R-CRAN-starvz.spec --sources /var/lib/copr-rpmbuild/workspace/workdir-q_dvq8e_/R-CRAN-starvz --resultdir /var/lib/copr-rpmbuild/results --uniqueext 1713076614.308351 -r /var/lib/copr-rpmbuild/results/configs/child.cfg INFO: mock.py version 5.5 starting (python version = 3.12.1, NVR = mock-5.5-1.fc39), args: /usr/libexec/mock/mock --spec /var/lib/copr-rpmbuild/workspace/workdir-q_dvq8e_/R-CRAN-starvz/R-CRAN-starvz.spec --sources /var/lib/copr-rpmbuild/workspace/workdir-q_dvq8e_/R-CRAN-starvz --resultdir /var/lib/copr-rpmbuild/results --uniqueext 1713076614.308351 -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-q_dvq8e_/R-CRAN-starvz/R-CRAN-starvz.spec) Config(fedora-38-x86_64) Start: clean chroot Finish: clean chroot Mock Version: 5.5 INFO: Mock Version: 5.5 Start: chroot init INFO: mounting tmpfs at /var/lib/mock/fedora-38-x86_64-1713076614.308351/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 dnf detected and used (fallback) INFO: Buildroot is handled by package management from host and used with --installroot: rpm-4.19.1.1-1.fc39.x86_64 rpm-sequoia-1.6.0-1.fc39.x86_64 python3-dnf-4.19.2-1.fc39.noarch python3-dnf-plugins-core-4.6.0-1.fc39.noarch yum-4.19.2-1.fc39.noarch dnf5-5.1.17-1.fc39.x86_64 dnf5-plugins-5.1.17-1.fc39.x86_64 Start: installing minimal buildroot with dnf No matches found for the following disable plugin patterns: local, spacewalk, versionlock Updating Subscription Management repositories. Unable to read consumer identity This system is not registered with an entitlement server. You can use subscription-manager to register. Copr repository 24 MB/s | 41 MB 00:01 fedora 4.8 MB/s | 83 MB 00:17 updates 21 MB/s | 41 MB 00:01 Last metadata expiration check: 0:00:10 ago on Sun Apr 14 06:37:46 2024. Dependencies resolved. ================================================================================ Package Arch Version Repo Size ================================================================================ Installing group/module packages: bash x86_64 5.2.26-1.fc38 updates 1.8 M bzip2 x86_64 1.0.8-13.fc38 fedora 52 k coreutils x86_64 9.1-12.fc38 updates 1.1 M cpio x86_64 2.13-14.fc38 fedora 276 k diffutils x86_64 3.10-1.fc38 updates 398 k fedora-release-common noarch 38-36 updates 22 k findutils x86_64 1:4.9.0-3.fc38 fedora 492 k gawk x86_64 5.1.1-5.fc38 fedora 1.0 M glibc-minimal-langpack x86_64 2.37-18.fc38 updates 41 k grep x86_64 3.8-3.fc38 fedora 293 k gzip x86_64 1.12-3.fc38 fedora 166 k info x86_64 7.0.2-2.fc38 fedora 181 k patch x86_64 2.7.6-19.fc38 fedora 126 k redhat-rpm-config noarch 257-1.fc38 updates 76 k rpm-build x86_64 4.18.2-1.fc38 updates 76 k sed x86_64 4.8-12.fc38 fedora 306 k shadow-utils x86_64 2:4.13-6.fc38 fedora 1.3 M tar x86_64 2:1.34-8.fc38 fedora 889 k unzip x86_64 6.0-60.fc38 fedora 184 k util-linux x86_64 2.38.1-4.fc38 fedora 2.3 M which x86_64 2.21-39.fc38 fedora 42 k xz x86_64 5.4.1-1.fc38 fedora 419 k Installing dependencies: alternatives x86_64 1.26-1.fc38 updates 39 k ansible-srpm-macros noarch 1-12.fc38 updates 21 k audit-libs x86_64 3.1.2-8.fc38 updates 117 k authselect x86_64 1.4.3-1.fc38 updates 149 k authselect-libs x86_64 1.4.3-1.fc38 updates 249 k basesystem noarch 11-15.fc38 fedora 7.0 k binutils x86_64 2.39-16.fc38 updates 5.4 M binutils-gold x86_64 2.39-16.fc38 updates 795 k bzip2-libs x86_64 1.0.8-13.fc38 fedora 41 k ca-certificates noarch 2023.2.60_v7.0.306-1.0.fc38 updates 837 k coreutils-common x86_64 9.1-12.fc38 updates 2.0 M cracklib x86_64 2.9.11-1.fc38 updates 93 k crypto-policies noarch 20230301-1.gita12f7b2.fc38 fedora 93 k curl x86_64 8.0.1-7.fc38 updates 348 k cyrus-sasl-lib x86_64 2.1.28-9.fc38 fedora 794 k debugedit x86_64 5.0-9.fc38 updates 78 k dwz x86_64 0.15-2.fc38 fedora 135 k ed x86_64 1.19-2.fc38 fedora 78 k efi-srpm-macros noarch 5-7.fc38 fedora 22 k elfutils x86_64 0.191-1.fc38 updates 557 k elfutils-debuginfod-client x86_64 0.191-1.fc38 updates 37 k elfutils-default-yama-scope noarch 0.191-1.fc38 updates 12 k elfutils-libelf x86_64 0.191-1.fc38 updates 208 k elfutils-libs x86_64 0.191-1.fc38 updates 263 k fedora-gpg-keys noarch 38-1 fedora 126 k fedora-release noarch 38-36 updates 12 k fedora-release-identity-basic noarch 38-36 updates 13 k fedora-repos noarch 38-1 fedora 9.1 k file x86_64 5.44-3.fc38 fedora 49 k file-libs x86_64 5.44-3.fc38 fedora 730 k filesystem x86_64 3.18-3.fc38 fedora 1.1 M fonts-srpm-macros noarch 1:2.0.5-11.fc38 fedora 26 k forge-srpm-macros noarch 0.2.0-3.fc38 updates 19 k fpc-srpm-macros noarch 1.3-7.fc38 fedora 7.8 k gdb-minimal x86_64 14.1-3.fc38 updates 4.3 M gdbm-libs x86_64 1:1.23-3.fc38 fedora 56 k ghc-srpm-macros noarch 1.6.1-1.fc38 fedora 8.0 k glibc x86_64 2.37-18.fc38 updates 2.1 M glibc-common x86_64 2.37-18.fc38 updates 320 k glibc-gconv-extra x86_64 2.37-18.fc38 updates 1.6 M gmp x86_64 1:6.2.1-4.fc38 fedora 313 k gnat-srpm-macros noarch 6-2.fc38 fedora 8.8 k go-srpm-macros noarch 3.5.0-1.fc38 updates 27 k jansson x86_64 2.13.1-6.fc38 fedora 44 k kernel-srpm-macros noarch 1.0-19.fc38 updates 10 k keyutils-libs x86_64 1.6.3-1.fc38 updates 31 k krb5-libs x86_64 1.21-3.fc38 updates 764 k libacl x86_64 2.3.1-7.fc38 updates 23 k libarchive x86_64 3.6.1-4.fc38 fedora 400 k libattr x86_64 2.5.1-6.fc38 fedora 18 k libblkid x86_64 2.38.1-4.fc38 fedora 106 k libbrotli x86_64 1.0.9-11.fc38 fedora 317 k libcap x86_64 2.48-8.fc38 updates 68 k libcap-ng x86_64 0.8.3-8.fc38 updates 32 k libcom_err x86_64 1.46.5-4.fc38 fedora 26 k libcurl x86_64 8.0.1-7.fc38 updates 315 k libdb x86_64 5.3.28-55.fc38 fedora 758 k libeconf x86_64 0.5.2-1.fc38 updates 30 k libevent x86_64 2.1.12-8.fc38 fedora 257 k libfdisk x86_64 2.38.1-4.fc38 fedora 161 k libffi x86_64 3.4.4-2.fc38 fedora 38 k libgcc x86_64 13.2.1-7.fc38 updates 115 k libgomp x86_64 13.2.1-7.fc38 updates 324 k libidn2 x86_64 2.3.7-1.fc38 updates 119 k libmount x86_64 2.38.1-4.fc38 fedora 135 k libnghttp2 x86_64 1.52.0-2.fc38 updates 75 k libnsl2 x86_64 2.0.0-5.fc38 fedora 30 k libpkgconf x86_64 1.8.0-6.fc38 fedora 35 k libpsl x86_64 0.21.2-2.fc38 fedora 65 k libpwquality x86_64 1.4.5-3.fc38 fedora 119 k libselinux x86_64 3.5-1.fc38 fedora 87 k libsemanage x86_64 3.5-2.fc38 fedora 120 k libsepol x86_64 3.5-1.fc38 fedora 324 k libsigsegv x86_64 2.14-4.fc38 fedora 27 k libsmartcols x86_64 2.38.1-4.fc38 fedora 64 k libssh x86_64 0.10.6-2.fc38 updates 212 k libssh-config noarch 0.10.6-2.fc38 updates 9.0 k libstdc++ x86_64 13.2.1-7.fc38 updates 870 k libtasn1 x86_64 4.19.0-2.fc38 fedora 74 k libtirpc x86_64 1.3.4-1.rc3.fc38 updates 93 k libunistring x86_64 1.1-3.fc38 fedora 545 k libunistring1.0 x86_64 1.0-1.fc38 fedora 539 k libutempter x86_64 1.2.1-8.fc38 fedora 26 k libuuid x86_64 2.38.1-4.fc38 fedora 28 k libverto x86_64 0.3.2-5.fc38 fedora 21 k libxcrypt x86_64 4.4.36-1.fc38 updates 119 k libxml2 x86_64 2.10.4-1.fc38 updates 701 k libzstd x86_64 1.5.5-1.fc38 updates 308 k lua-libs x86_64 5.4.4-9.fc38 fedora 133 k lua-srpm-macros noarch 1-13.fc38 updates 8.7 k lz4-libs x86_64 1.9.4-2.fc38 fedora 67 k mpfr x86_64 4.1.1-3.fc38 fedora 600 k ncurses-base noarch 6.4-7.20230520.fc38.1 updates 88 k ncurses-libs x86_64 6.4-7.20230520.fc38.1 updates 336 k ocaml-srpm-macros noarch 7-3.fc38 fedora 13 k openblas-srpm-macros noarch 2-13.fc38 fedora 7.5 k openldap x86_64 2.6.6-1.fc38 updates 254 k openssl-libs x86_64 1:3.0.9-2.fc38 updates 2.1 M p11-kit x86_64 0.25.3-1.fc38 updates 521 k p11-kit-trust x86_64 0.25.3-1.fc38 updates 142 k package-notes-srpm-macros noarch 0.5-8.fc38 updates 11 k pam x86_64 1.5.2-16.fc38 fedora 560 k pam-libs x86_64 1.5.2-16.fc38 fedora 58 k pcre2 x86_64 10.42-1.fc38.1 fedora 234 k pcre2-syntax noarch 10.42-1.fc38.1 fedora 144 k perl-srpm-macros noarch 1-48.fc38 fedora 8.4 k pkgconf x86_64 1.8.0-6.fc38 fedora 41 k pkgconf-m4 noarch 1.8.0-6.fc38 fedora 14 k pkgconf-pkg-config x86_64 1.8.0-6.fc38 fedora 9.6 k popt x86_64 1.19-2.fc38 fedora 67 k publicsuffix-list-dafsa noarch 20240107-1.fc38 updates 58 k pyproject-srpm-macros noarch 1.12.0-1.fc38 updates 14 k python-srpm-macros noarch 3.11-10.fc38 fedora 26 k qt5-srpm-macros noarch 5.15.12-1.fc38 updates 8.3 k qt6-srpm-macros noarch 6.6.0-1.fc38 updates 8.6 k readline x86_64 8.2-4.fc38 updates 212 k rpm x86_64 4.18.2-1.fc38 updates 567 k rpm-build-libs x86_64 4.18.2-1.fc38 updates 93 k rpm-libs x86_64 4.18.2-1.fc38 updates 310 k rpm-sequoia x86_64 1.6.0-1.fc38 updates 872 k rpmautospec-rpm-macros noarch 0.6.3-1.fc38 updates 10 k rust-srpm-macros noarch 26.2-1.fc38 updates 13 k setup noarch 2.14.3-2.fc38 fedora 152 k sqlite-libs x86_64 3.40.1-2.fc38 fedora 666 k systemd-libs x86_64 253.17-1.fc38 updates 649 k tzdata noarch 2024a-1.fc38 updates 715 k util-linux-core x86_64 2.38.1-4.fc38 fedora 473 k xxhash-libs x86_64 0.8.2-1.fc38 updates 37 k xz-libs x86_64 5.4.1-1.fc38 fedora 108 k zip x86_64 3.0-37.fc38 updates 265 k zlib x86_64 1.2.13-3.fc38 fedora 95 k zstd x86_64 1.5.5-1.fc38 updates 482 k Installing Groups: Buildsystem building group Transaction Summary ================================================================================ Install 154 Packages Total download size: 54 M Installed size: 187 M Downloading Packages: (1/154): basesystem-11-15.fc38.noarch.rpm 61 kB/s | 7.0 kB 00:00 (2/154): bzip2-libs-1.0.8-13.fc38.x86_64.rpm 224 kB/s | 41 kB 00:00 (3/154): bzip2-1.0.8-13.fc38.x86_64.rpm 249 kB/s | 52 kB 00:00 (4/154): crypto-policies-20230301-1.gita12f7b2. 761 kB/s | 93 kB 00:00 (5/154): cpio-2.13-14.fc38.x86_64.rpm 1.1 MB/s | 276 kB 00:00 (6/154): dwz-0.15-2.fc38.x86_64.rpm 1.5 MB/s | 135 kB 00:00 (7/154): ed-1.19-2.fc38.x86_64.rpm 1.5 MB/s | 78 kB 00:00 (8/154): efi-srpm-macros-5-7.fc38.noarch.rpm 488 kB/s | 22 kB 00:00 (9/154): fedora-gpg-keys-38-1.noarch.rpm 2.1 MB/s | 126 kB 00:00 (10/154): cyrus-sasl-lib-2.1.28-9.fc38.x86_64.r 3.0 MB/s | 794 kB 00:00 (11/154): fedora-repos-38-1.noarch.rpm 207 kB/s | 9.1 kB 00:00 (12/154): file-5.44-3.fc38.x86_64.rpm 1.0 MB/s | 49 kB 00:00 (13/154): file-libs-5.44-3.fc38.x86_64.rpm 9.7 MB/s | 730 kB 00:00 (14/154): fonts-srpm-macros-2.0.5-11.fc38.noarc 600 kB/s | 26 kB 00:00 (15/154): findutils-4.9.0-3.fc38.x86_64.rpm 4.8 MB/s | 492 kB 00:00 (16/154): fpc-srpm-macros-1.3-7.fc38.noarch.rpm 179 kB/s | 7.8 kB 00:00 (17/154): filesystem-3.18-3.fc38.x86_64.rpm 6.7 MB/s | 1.1 MB 00:00 (18/154): ghc-srpm-macros-1.6.1-1.fc38.noarch.r 180 kB/s | 8.0 kB 00:00 (19/154): gawk-5.1.1-5.fc38.x86_64.rpm 8.3 MB/s | 1.0 MB 00:00 (20/154): gmp-6.2.1-4.fc38.x86_64.rpm 6.0 MB/s | 313 kB 00:00 (21/154): gdbm-libs-1.23-3.fc38.x86_64.rpm 407 kB/s | 56 kB 00:00 (22/154): gnat-srpm-macros-6-2.fc38.noarch.rpm 201 kB/s | 8.8 kB 00:00 (23/154): grep-3.8-3.fc38.x86_64.rpm 5.7 MB/s | 293 kB 00:00 (24/154): gzip-1.12-3.fc38.x86_64.rpm 3.2 MB/s | 166 kB 00:00 (25/154): info-7.0.2-2.fc38.x86_64.rpm 3.7 MB/s | 181 kB 00:00 (26/154): jansson-2.13.1-6.fc38.x86_64.rpm 978 kB/s | 44 kB 00:00 (27/154): libattr-2.5.1-6.fc38.x86_64.rpm 399 kB/s | 18 kB 00:00 (28/154): libarchive-3.6.1-4.fc38.x86_64.rpm 6.8 MB/s | 400 kB 00:00 (29/154): libblkid-2.38.1-4.fc38.x86_64.rpm 2.3 MB/s | 106 kB 00:00 (30/154): libcom_err-1.46.5-4.fc38.x86_64.rpm 529 kB/s | 26 kB 00:00 (31/154): libbrotli-1.0.9-11.fc38.x86_64.rpm 5.5 MB/s | 317 kB 00:00 (32/154): libdb-5.3.28-55.fc38.x86_64.rpm 12 MB/s | 758 kB 00:00 (33/154): libfdisk-2.38.1-4.fc38.x86_64.rpm 3.2 MB/s | 161 kB 00:00 (34/154): libevent-2.1.12-8.fc38.x86_64.rpm 4.7 MB/s | 257 kB 00:00 (35/154): libffi-3.4.4-2.fc38.x86_64.rpm 817 kB/s | 38 kB 00:00 (36/154): libmount-2.38.1-4.fc38.x86_64.rpm 2.8 MB/s | 135 kB 00:00 (37/154): libnsl2-2.0.0-5.fc38.x86_64.rpm 669 kB/s | 30 kB 00:00 (38/154): libpkgconf-1.8.0-6.fc38.x86_64.rpm 777 kB/s | 35 kB 00:00 (39/154): libpsl-0.21.2-2.fc38.x86_64.rpm 1.4 MB/s | 65 kB 00:00 (40/154): libpwquality-1.4.5-3.fc38.x86_64.rpm 2.5 MB/s | 119 kB 00:00 (41/154): libselinux-3.5-1.fc38.x86_64.rpm 1.7 MB/s | 87 kB 00:00 (42/154): libsemanage-3.5-2.fc38.x86_64.rpm 2.5 MB/s | 120 kB 00:00 (43/154): libsepol-3.5-1.fc38.x86_64.rpm 5.9 MB/s | 324 kB 00:00 (44/154): libsigsegv-2.14-4.fc38.x86_64.rpm 606 kB/s | 27 kB 00:00 (45/154): libsmartcols-2.38.1-4.fc38.x86_64.rpm 1.4 MB/s | 64 kB 00:00 (46/154): libtasn1-4.19.0-2.fc38.x86_64.rpm 1.5 MB/s | 74 kB 00:00 (47/154): libunistring-1.1-3.fc38.x86_64.rpm 9.3 MB/s | 545 kB 00:00 (48/154): libutempter-1.2.1-8.fc38.x86_64.rpm 586 kB/s | 26 kB 00:00 (49/154): libunistring1.0-1.0-1.fc38.x86_64.rpm 9.4 MB/s | 539 kB 00:00 (50/154): libuuid-2.38.1-4.fc38.x86_64.rpm 622 kB/s | 28 kB 00:00 (51/154): libverto-0.3.2-5.fc38.x86_64.rpm 472 kB/s | 21 kB 00:00 (52/154): lua-libs-5.4.4-9.fc38.x86_64.rpm 2.8 MB/s | 133 kB 00:00 (53/154): lz4-libs-1.9.4-2.fc38.x86_64.rpm 1.5 MB/s | 67 kB 00:00 (54/154): ocaml-srpm-macros-7-3.fc38.noarch.rpm 296 kB/s | 13 kB 00:00 (55/154): mpfr-4.1.1-3.fc38.x86_64.rpm 8.8 MB/s | 600 kB 00:00 (56/154): openblas-srpm-macros-2-13.fc38.noarch 173 kB/s | 7.5 kB 00:00 (57/154): pam-1.5.2-16.fc38.x86_64.rpm 9.6 MB/s | 560 kB 00:00 (58/154): pam-libs-1.5.2-16.fc38.x86_64.rpm 1.2 MB/s | 58 kB 00:00 (59/154): patch-2.7.6-19.fc38.x86_64.rpm 2.7 MB/s | 126 kB 00:00 (60/154): pcre2-10.42-1.fc38.1.x86_64.rpm 4.6 MB/s | 234 kB 00:00 (61/154): perl-srpm-macros-1-48.fc38.noarch.rpm 186 kB/s | 8.4 kB 00:00 (62/154): pcre2-syntax-10.42-1.fc38.1.noarch.rp 2.9 MB/s | 144 kB 00:00 (63/154): pkgconf-m4-1.8.0-6.fc38.noarch.rpm 317 kB/s | 14 kB 00:00 (64/154): pkgconf-1.8.0-6.fc38.x86_64.rpm 909 kB/s | 41 kB 00:00 (65/154): pkgconf-pkg-config-1.8.0-6.fc38.x86_6 219 kB/s | 9.6 kB 00:00 (66/154): python-srpm-macros-3.11-10.fc38.noarc 585 kB/s | 26 kB 00:00 (67/154): popt-1.19-2.fc38.x86_64.rpm 1.4 MB/s | 67 kB 00:00 (68/154): sed-4.8-12.fc38.x86_64.rpm 5.6 MB/s | 306 kB 00:00 (69/154): setup-2.14.3-2.fc38.noarch.rpm 3.1 MB/s | 152 kB 00:00 (70/154): shadow-utils-4.13-6.fc38.x86_64.rpm 17 MB/s | 1.3 MB 00:00 (71/154): sqlite-libs-3.40.1-2.fc38.x86_64.rpm 9.5 MB/s | 666 kB 00:00 (72/154): tar-1.34-8.fc38.x86_64.rpm 13 MB/s | 889 kB 00:00 (73/154): unzip-6.0-60.fc38.x86_64.rpm 3.6 MB/s | 184 kB 00:00 (74/154): util-linux-core-2.38.1-4.fc38.x86_64. 8.4 MB/s | 473 kB 00:00 (75/154): util-linux-2.38.1-4.fc38.x86_64.rpm 25 MB/s | 2.3 MB 00:00 (76/154): which-2.21-39.fc38.x86_64.rpm 928 kB/s | 42 kB 00:00 (77/154): zlib-1.2.13-3.fc38.x86_64.rpm 2.1 MB/s | 95 kB 00:00 (78/154): xz-libs-5.4.1-1.fc38.x86_64.rpm 2.3 MB/s | 108 kB 00:00 (79/154): xz-5.4.1-1.fc38.x86_64.rpm 7.7 MB/s | 419 kB 00:00 (80/154): ansible-srpm-macros-1-12.fc38.noarch. 83 kB/s | 21 kB 00:00 (81/154): alternatives-1.26-1.fc38.x86_64.rpm 155 kB/s | 39 kB 00:00 (82/154): audit-libs-3.1.2-8.fc38.x86_64.rpm 283 kB/s | 117 kB 00:00 (83/154): authselect-1.4.3-1.fc38.x86_64.rpm 449 kB/s | 149 kB 00:00 (84/154): authselect-libs-1.4.3-1.fc38.x86_64.r 500 kB/s | 249 kB 00:00 (85/154): binutils-gold-2.39-16.fc38.x86_64.rpm 873 kB/s | 795 kB 00:00 (86/154): bash-5.2.26-1.fc38.x86_64.rpm 964 kB/s | 1.8 MB 00:01 (87/154): ca-certificates-2023.2.60_v7.0.306-1. 1.1 MB/s | 837 kB 00:00 (88/154): coreutils-9.1-12.fc38.x86_64.rpm 546 kB/s | 1.1 MB 00:02 (89/154): cracklib-2.9.11-1.fc38.x86_64.rpm 374 kB/s | 93 kB 00:00 (90/154): curl-8.0.1-7.fc38.x86_64.rpm 526 kB/s | 348 kB 00:00 (91/154): debugedit-5.0-9.fc38.x86_64.rpm 468 kB/s | 78 kB 00:00 (92/154): coreutils-common-9.1-12.fc38.x86_64.r 583 kB/s | 2.0 MB 00:03 (93/154): diffutils-3.10-1.fc38.x86_64.rpm 600 kB/s | 398 kB 00:00 (94/154): elfutils-debuginfod-client-0.191-1.fc 444 kB/s | 37 kB 00:00 (95/154): elfutils-default-yama-scope-0.191-1.f 149 kB/s | 12 kB 00:00 (96/154): elfutils-libelf-0.191-1.fc38.x86_64.r 628 kB/s | 208 kB 00:00 (97/154): elfutils-0.191-1.fc38.x86_64.rpm 792 kB/s | 557 kB 00:00 (98/154): fedora-release-38-36.noarch.rpm 146 kB/s | 12 kB 00:00 (99/154): fedora-release-common-38-36.noarch.rp 266 kB/s | 22 kB 00:00 (100/154): fedora-release-identity-basic-38-36. 151 kB/s | 13 kB 00:00 (101/154): elfutils-libs-0.191-1.fc38.x86_64.rp 621 kB/s | 263 kB 00:00 (102/154): forge-srpm-macros-0.2.0-3.fc38.noarc 222 kB/s | 19 kB 00:00 (103/154): binutils-2.39-16.fc38.x86_64.rpm 636 kB/s | 5.4 MB 00:08 (104/154): glibc-common-2.37-18.fc38.x86_64.rpm 644 kB/s | 320 kB 00:00 (105/154): glibc-2.37-18.fc38.x86_64.rpm 716 kB/s | 2.1 MB 00:03 (106/154): glibc-minimal-langpack-2.37-18.fc38. 486 kB/s | 41 kB 00:00 (107/154): go-srpm-macros-3.5.0-1.fc38.noarch.r 330 kB/s | 27 kB 00:00 (108/154): kernel-srpm-macros-1.0-19.fc38.noarc 125 kB/s | 10 kB 00:00 (109/154): keyutils-libs-1.6.3-1.fc38.x86_64.rp 376 kB/s | 31 kB 00:00 (110/154): krb5-libs-1.21-3.fc38.x86_64.rpm 841 kB/s | 764 kB 00:00 (111/154): libacl-2.3.1-7.fc38.x86_64.rpm 278 kB/s | 23 kB 00:00 (112/154): libcap-2.48-8.fc38.x86_64.rpm 809 kB/s | 68 kB 00:00 (113/154): libcap-ng-0.8.3-8.fc38.x86_64.rpm 385 kB/s | 32 kB 00:00 (114/154): gdb-minimal-14.1-3.fc38.x86_64.rpm 907 kB/s | 4.3 MB 00:04 (115/154): libeconf-0.5.2-1.fc38.x86_64.rpm 358 kB/s | 30 kB 00:00 (116/154): libcurl-8.0.1-7.fc38.x86_64.rpm 762 kB/s | 315 kB 00:00 (117/154): glibc-gconv-extra-2.37-18.fc38.x86_6 773 kB/s | 1.6 MB 00:02 (118/154): libgcc-13.2.1-7.fc38.x86_64.rpm 688 kB/s | 115 kB 00:00 (119/154): libidn2-2.3.7-1.fc38.x86_64.rpm 714 kB/s | 119 kB 00:00 (120/154): libnghttp2-1.52.0-2.fc38.x86_64.rpm 893 kB/s | 75 kB 00:00 (121/154): libssh-config-0.10.6-2.fc38.noarch.r 107 kB/s | 9.0 kB 00:00 (122/154): libgomp-13.2.1-7.fc38.x86_64.rpm 781 kB/s | 324 kB 00:00 (123/154): libssh-0.10.6-2.fc38.x86_64.rpm 855 kB/s | 212 kB 00:00 (124/154): libtirpc-1.3.4-1.rc3.fc38.x86_64.rpm 535 kB/s | 93 kB 00:00 (125/154): libxcrypt-4.4.36-1.fc38.x86_64.rpm 696 kB/s | 119 kB 00:00 (126/154): libzstd-1.5.5-1.fc38.x86_64.rpm 929 kB/s | 308 kB 00:00 (127/154): lua-srpm-macros-1-13.fc38.noarch.rpm 104 kB/s | 8.7 kB 00:00 (128/154): libstdc++-13.2.1-7.fc38.x86_64.rpm 1.0 MB/s | 870 kB 00:00 (129/154): ncurses-base-6.4-7.20230520.fc38.1.n 533 kB/s | 88 kB 00:00 (130/154): libxml2-2.10.4-1.fc38.x86_64.rpm 935 kB/s | 701 kB 00:00 (131/154): ncurses-libs-6.4-7.20230520.fc38.1.x 1.0 MB/s | 336 kB 00:00 (132/154): openldap-2.6.6-1.fc38.x86_64.rpm 769 kB/s | 254 kB 00:00 (133/154): p11-kit-trust-0.25.3-1.fc38.x86_64.r 853 kB/s | 142 kB 00:00 (134/154): package-notes-srpm-macros-0.5-8.fc38 132 kB/s | 11 kB 00:00 (135/154): publicsuffix-list-dafsa-20240107-1.f 690 kB/s | 58 kB 00:00 (136/154): pyproject-srpm-macros-1.12.0-1.fc38. 164 kB/s | 14 kB 00:00 (137/154): p11-kit-0.25.3-1.fc38.x86_64.rpm 1.0 MB/s | 521 kB 00:00 (138/154): qt5-srpm-macros-5.15.12-1.fc38.noarc 100 kB/s | 8.3 kB 00:00 (139/154): qt6-srpm-macros-6.6.0-1.fc38.noarch. 103 kB/s | 8.6 kB 00:00 (140/154): redhat-rpm-config-257-1.fc38.noarch. 904 kB/s | 76 kB 00:00 (141/154): readline-8.2-4.fc38.x86_64.rpm 854 kB/s | 212 kB 00:00 (142/154): rpm-build-4.18.2-1.fc38.x86_64.rpm 913 kB/s | 76 kB 00:00 (143/154): rpm-build-libs-4.18.2-1.fc38.x86_64. 560 kB/s | 93 kB 00:00 (144/154): rpm-4.18.2-1.fc38.x86_64.rpm 1.1 MB/s | 567 kB 00:00 (145/154): rpm-libs-4.18.2-1.fc38.x86_64.rpm 938 kB/s | 310 kB 00:00 (146/154): rpmautospec-rpm-macros-0.6.3-1.fc38. 120 kB/s | 10 kB 00:00 (147/154): rust-srpm-macros-26.2-1.fc38.noarch. 151 kB/s | 13 kB 00:00 (148/154): openssl-libs-3.0.9-2.fc38.x86_64.rpm 1.1 MB/s | 2.1 MB 00:01 (149/154): rpm-sequoia-1.6.0-1.fc38.x86_64.rpm 1.1 MB/s | 872 kB 00:00 (150/154): xxhash-libs-0.8.2-1.fc38.x86_64.rpm 446 kB/s | 37 kB 00:00 (151/154): systemd-libs-253.17-1.fc38.x86_64.rp 984 kB/s | 649 kB 00:00 (152/154): zip-3.0-37.fc38.x86_64.rpm 1.0 MB/s | 265 kB 00:00 (153/154): tzdata-2024a-1.fc38.noarch.rpm 1.2 MB/s | 715 kB 00:00 (154/154): zstd-1.5.5-1.fc38.x86_64.rpm 955 kB/s | 482 kB 00:00 -------------------------------------------------------------------------------- Total 2.9 MB/s | 54 MB 00:18 fedora 1.6 MB/s | 1.6 kB 00:00 Importing GPG key 0xEB10B464: Userid : "Fedora (38) " Fingerprint: 6A51 BBAB BA3D 5467 B617 1221 809A 8D7C EB10 B464 From : /usr/share/distribution-gpg-keys/fedora/RPM-GPG-KEY-fedora-38-primary Key imported successfully Running transaction check Transaction check succeeded. Running transaction test Transaction test succeeded. Running transaction Running scriptlet: filesystem-3.18-3.fc38.x86_64 1/1 Preparing : 1/1 Installing : libgcc-13.2.1-7.fc38.x86_64 1/154 Running scriptlet: libgcc-13.2.1-7.fc38.x86_64 1/154 Installing : crypto-policies-20230301-1.gita12f7b2.fc38.noarc 2/154 Running scriptlet: crypto-policies-20230301-1.gita12f7b2.fc38.noarc 2/154 Installing : tzdata-2024a-1.fc38.noarch 3/154 Installing : fedora-release-identity-basic-38-36.noarch 4/154 Installing : rust-srpm-macros-26.2-1.fc38.noarch 5/154 Installing : qt6-srpm-macros-6.6.0-1.fc38.noarch 6/154 Installing : qt5-srpm-macros-5.15.12-1.fc38.noarch 7/154 Installing : publicsuffix-list-dafsa-20240107-1.fc38.noarch 8/154 Installing : package-notes-srpm-macros-0.5-8.fc38.noarch 9/154 Installing : ncurses-base-6.4-7.20230520.fc38.1.noarch 10/154 Installing : libssh-config-0.10.6-2.fc38.noarch 11/154 Installing : kernel-srpm-macros-1.0-19.fc38.noarch 12/154 Installing : coreutils-common-9.1-12.fc38.x86_64 13/154 Installing : ansible-srpm-macros-1-12.fc38.noarch 14/154 Installing : pkgconf-m4-1.8.0-6.fc38.noarch 15/154 Installing : perl-srpm-macros-1-48.fc38.noarch 16/154 Installing : pcre2-syntax-10.42-1.fc38.1.noarch 17/154 Installing : openblas-srpm-macros-2-13.fc38.noarch 18/154 Installing : ocaml-srpm-macros-7-3.fc38.noarch 19/154 Installing : gnat-srpm-macros-6-2.fc38.noarch 20/154 Installing : ghc-srpm-macros-1.6.1-1.fc38.noarch 21/154 Installing : fpc-srpm-macros-1.3-7.fc38.noarch 22/154 Installing : fedora-gpg-keys-38-1.noarch 23/154 Installing : fedora-release-38-36.noarch 24/154 Installing : fedora-repos-38-1.noarch 25/154 Installing : fedora-release-common-38-36.noarch 26/154 Installing : setup-2.14.3-2.fc38.noarch 27/154 warning: /etc/hosts created as /etc/hosts.rpmnew Running scriptlet: setup-2.14.3-2.fc38.noarch 27/154 Installing : filesystem-3.18-3.fc38.x86_64 28/154 Installing : basesystem-11-15.fc38.noarch 29/154 Installing : glibc-gconv-extra-2.37-18.fc38.x86_64 30/154 Running scriptlet: glibc-gconv-extra-2.37-18.fc38.x86_64 30/154 Installing : glibc-minimal-langpack-2.37-18.fc38.x86_64 31/154 Installing : glibc-common-2.37-18.fc38.x86_64 32/154 Running scriptlet: glibc-2.37-18.fc38.x86_64 33/154 Installing : glibc-2.37-18.fc38.x86_64 33/154 Running scriptlet: glibc-2.37-18.fc38.x86_64 33/154 Installing : ncurses-libs-6.4-7.20230520.fc38.1.x86_64 34/154 Installing : bash-5.2.26-1.fc38.x86_64 35/154 Running scriptlet: bash-5.2.26-1.fc38.x86_64 35/154 Installing : zlib-1.2.13-3.fc38.x86_64 36/154 Installing : xz-libs-5.4.1-1.fc38.x86_64 37/154 Installing : bzip2-libs-1.0.8-13.fc38.x86_64 38/154 Installing : libzstd-1.5.5-1.fc38.x86_64 39/154 Installing : elfutils-libelf-0.191-1.fc38.x86_64 40/154 Installing : libuuid-2.38.1-4.fc38.x86_64 41/154 Installing : popt-1.19-2.fc38.x86_64 42/154 Installing : libstdc++-13.2.1-7.fc38.x86_64 43/154 Installing : libblkid-2.38.1-4.fc38.x86_64 44/154 Installing : readline-8.2-4.fc38.x86_64 45/154 Installing : gmp-1:6.2.1-4.fc38.x86_64 46/154 Installing : libattr-2.5.1-6.fc38.x86_64 47/154 Installing : libacl-2.3.1-7.fc38.x86_64 48/154 Installing : libcap-2.48-8.fc38.x86_64 49/154 Installing : libxcrypt-4.4.36-1.fc38.x86_64 50/154 Installing : lz4-libs-1.9.4-2.fc38.x86_64 51/154 Installing : libeconf-0.5.2-1.fc38.x86_64 52/154 Installing : systemd-libs-253.17-1.fc38.x86_64 53/154 Installing : mpfr-4.1.1-3.fc38.x86_64 54/154 Installing : dwz-0.15-2.fc38.x86_64 55/154 Installing : unzip-6.0-60.fc38.x86_64 56/154 Installing : file-libs-5.44-3.fc38.x86_64 57/154 Installing : file-5.44-3.fc38.x86_64 58/154 Installing : sqlite-libs-3.40.1-2.fc38.x86_64 59/154 Installing : libcom_err-1.46.5-4.fc38.x86_64 60/154 Installing : libsepol-3.5-1.fc38.x86_64 61/154 Installing : libsmartcols-2.38.1-4.fc38.x86_64 62/154 Installing : libtasn1-4.19.0-2.fc38.x86_64 63/154 Installing : lua-libs-5.4.4-9.fc38.x86_64 64/154 Installing : pcre2-10.42-1.fc38.1.x86_64 65/154 Installing : libselinux-3.5-1.fc38.x86_64 66/154 Installing : sed-4.8-12.fc38.x86_64 67/154 Installing : grep-3.8-3.fc38.x86_64 68/154 Installing : findutils-1:4.9.0-3.fc38.x86_64 69/154 Installing : xz-5.4.1-1.fc38.x86_64 70/154 Installing : libmount-2.38.1-4.fc38.x86_64 71/154 Installing : alternatives-1.26-1.fc38.x86_64 72/154 Installing : libcap-ng-0.8.3-8.fc38.x86_64 73/154 Installing : audit-libs-3.1.2-8.fc38.x86_64 74/154 Installing : pam-libs-1.5.2-16.fc38.x86_64 75/154 Installing : libsemanage-3.5-2.fc38.x86_64 76/154 Installing : shadow-utils-2:4.13-6.fc38.x86_64 77/154 Running scriptlet: libutempter-1.2.1-8.fc38.x86_64 78/154 Installing : libutempter-1.2.1-8.fc38.x86_64 78/154 Installing : util-linux-core-2.38.1-4.fc38.x86_64 79/154 Installing : tar-2:1.34-8.fc38.x86_64 80/154 Installing : zip-3.0-37.fc38.x86_64 81/154 Installing : zstd-1.5.5-1.fc38.x86_64 82/154 Installing : libfdisk-2.38.1-4.fc38.x86_64 83/154 Installing : bzip2-1.0.8-13.fc38.x86_64 84/154 Installing : libxml2-2.10.4-1.fc38.x86_64 85/154 Installing : ed-1.19-2.fc38.x86_64 86/154 Installing : patch-2.7.6-19.fc38.x86_64 87/154 Installing : elfutils-default-yama-scope-0.191-1.fc38.noarch 88/154 Running scriptlet: elfutils-default-yama-scope-0.191-1.fc38.noarch 88/154 Installing : cpio-2.13-14.fc38.x86_64 89/154 Installing : gdbm-libs-1:1.23-3.fc38.x86_64 90/154 Installing : cyrus-sasl-lib-2.1.28-9.fc38.x86_64 91/154 Installing : jansson-2.13.1-6.fc38.x86_64 92/154 Installing : libbrotli-1.0.9-11.fc38.x86_64 93/154 Installing : libdb-5.3.28-55.fc38.x86_64 94/154 Installing : libffi-3.4.4-2.fc38.x86_64 95/154 Installing : p11-kit-0.25.3-1.fc38.x86_64 96/154 Installing : p11-kit-trust-0.25.3-1.fc38.x86_64 97/154 Running scriptlet: p11-kit-trust-0.25.3-1.fc38.x86_64 97/154 Installing : openssl-libs-1:3.0.9-2.fc38.x86_64 98/154 Installing : coreutils-9.1-12.fc38.x86_64 99/154 Running scriptlet: ca-certificates-2023.2.60_v7.0.306-1.0.fc38.noar 100/154 Installing : ca-certificates-2023.2.60_v7.0.306-1.0.fc38.noar 100/154 Running scriptlet: ca-certificates-2023.2.60_v7.0.306-1.0.fc38.noar 100/154 Installing : gzip-1.12-3.fc38.x86_64 101/154 Running scriptlet: authselect-libs-1.4.3-1.fc38.x86_64 102/154 Installing : authselect-libs-1.4.3-1.fc38.x86_64 102/154 Installing : libarchive-3.6.1-4.fc38.x86_64 103/154 Installing : rpm-sequoia-1.6.0-1.fc38.x86_64 104/154 Installing : rpm-libs-4.18.2-1.fc38.x86_64 105/154 Installing : authselect-1.4.3-1.fc38.x86_64 106/154 Installing : cracklib-2.9.11-1.fc38.x86_64 107/154 Installing : libpwquality-1.4.5-3.fc38.x86_64 108/154 Installing : libevent-2.1.12-8.fc38.x86_64 109/154 Installing : openldap-2.6.6-1.fc38.x86_64 110/154 Installing : libpkgconf-1.8.0-6.fc38.x86_64 111/154 Installing : pkgconf-1.8.0-6.fc38.x86_64 112/154 Installing : pkgconf-pkg-config-1.8.0-6.fc38.x86_64 113/154 Installing : libsigsegv-2.14-4.fc38.x86_64 114/154 Installing : gawk-5.1.1-5.fc38.x86_64 115/154 Installing : libunistring-1.1-3.fc38.x86_64 116/154 Installing : libidn2-2.3.7-1.fc38.x86_64 117/154 Installing : libunistring1.0-1.0-1.fc38.x86_64 118/154 Installing : libpsl-0.21.2-2.fc38.x86_64 119/154 Installing : libverto-0.3.2-5.fc38.x86_64 120/154 Installing : diffutils-3.10-1.fc38.x86_64 121/154 Installing : keyutils-libs-1.6.3-1.fc38.x86_64 122/154 Installing : krb5-libs-1.21-3.fc38.x86_64 123/154 Installing : libtirpc-1.3.4-1.rc3.fc38.x86_64 124/154 Installing : libnsl2-2.0.0-5.fc38.x86_64 125/154 Installing : pam-1.5.2-16.fc38.x86_64 126/154 Installing : libssh-0.10.6-2.fc38.x86_64 127/154 Installing : libgomp-13.2.1-7.fc38.x86_64 128/154 Installing : libnghttp2-1.52.0-2.fc38.x86_64 129/154 Installing : libcurl-8.0.1-7.fc38.x86_64 130/154 Installing : elfutils-libs-0.191-1.fc38.x86_64 131/154 Installing : elfutils-debuginfod-client-0.191-1.fc38.x86_64 132/154 Installing : binutils-gold-2.39-16.fc38.x86_64 133/154 Installing : binutils-2.39-16.fc38.x86_64 134/154 Running scriptlet: binutils-2.39-16.fc38.x86_64 134/154 Installing : elfutils-0.191-1.fc38.x86_64 135/154 Installing : rpm-build-libs-4.18.2-1.fc38.x86_64 136/154 Installing : curl-8.0.1-7.fc38.x86_64 137/154 Running scriptlet: rpm-4.18.2-1.fc38.x86_64 138/154 Installing : rpm-4.18.2-1.fc38.x86_64 138/154 Installing : efi-srpm-macros-5-7.fc38.noarch 139/154 Installing : lua-srpm-macros-1-13.fc38.noarch 140/154 Installing : rpmautospec-rpm-macros-0.6.3-1.fc38.noarch 141/154 Installing : xxhash-libs-0.8.2-1.fc38.x86_64 142/154 Installing : gdb-minimal-14.1-3.fc38.x86_64 143/154 Installing : debugedit-5.0-9.fc38.x86_64 144/154 Installing : fonts-srpm-macros-1:2.0.5-11.fc38.noarch 145/154 Installing : python-srpm-macros-3.11-10.fc38.noarch 146/154 Installing : forge-srpm-macros-0.2.0-3.fc38.noarch 147/154 Installing : go-srpm-macros-3.5.0-1.fc38.noarch 148/154 Installing : redhat-rpm-config-257-1.fc38.noarch 149/154 Installing : rpm-build-4.18.2-1.fc38.x86_64 150/154 Installing : pyproject-srpm-macros-1.12.0-1.fc38.noarch 151/154 Installing : util-linux-2.38.1-4.fc38.x86_64 152/154 Installing : which-2.21-39.fc38.x86_64 153/154 Installing : info-7.0.2-2.fc38.x86_64 154/154 Running scriptlet: filesystem-3.18-3.fc38.x86_64 154/154 Running scriptlet: ca-certificates-2023.2.60_v7.0.306-1.0.fc38.noar 154/154 Running scriptlet: authselect-libs-1.4.3-1.fc38.x86_64 154/154 Running scriptlet: rpm-4.18.2-1.fc38.x86_64 154/154 Running scriptlet: info-7.0.2-2.fc38.x86_64 154/154 Verifying : basesystem-11-15.fc38.noarch 1/154 Verifying : bzip2-1.0.8-13.fc38.x86_64 2/154 Verifying : bzip2-libs-1.0.8-13.fc38.x86_64 3/154 Verifying : cpio-2.13-14.fc38.x86_64 4/154 Verifying : crypto-policies-20230301-1.gita12f7b2.fc38.noarc 5/154 Verifying : cyrus-sasl-lib-2.1.28-9.fc38.x86_64 6/154 Verifying : dwz-0.15-2.fc38.x86_64 7/154 Verifying : ed-1.19-2.fc38.x86_64 8/154 Verifying : efi-srpm-macros-5-7.fc38.noarch 9/154 Verifying : fedora-gpg-keys-38-1.noarch 10/154 Verifying : fedora-repos-38-1.noarch 11/154 Verifying : file-5.44-3.fc38.x86_64 12/154 Verifying : file-libs-5.44-3.fc38.x86_64 13/154 Verifying : filesystem-3.18-3.fc38.x86_64 14/154 Verifying : findutils-1:4.9.0-3.fc38.x86_64 15/154 Verifying : fonts-srpm-macros-1:2.0.5-11.fc38.noarch 16/154 Verifying : fpc-srpm-macros-1.3-7.fc38.noarch 17/154 Verifying : gawk-5.1.1-5.fc38.x86_64 18/154 Verifying : gdbm-libs-1:1.23-3.fc38.x86_64 19/154 Verifying : ghc-srpm-macros-1.6.1-1.fc38.noarch 20/154 Verifying : gmp-1:6.2.1-4.fc38.x86_64 21/154 Verifying : gnat-srpm-macros-6-2.fc38.noarch 22/154 Verifying : grep-3.8-3.fc38.x86_64 23/154 Verifying : gzip-1.12-3.fc38.x86_64 24/154 Verifying : info-7.0.2-2.fc38.x86_64 25/154 Verifying : jansson-2.13.1-6.fc38.x86_64 26/154 Verifying : libarchive-3.6.1-4.fc38.x86_64 27/154 Verifying : libattr-2.5.1-6.fc38.x86_64 28/154 Verifying : libblkid-2.38.1-4.fc38.x86_64 29/154 Verifying : libbrotli-1.0.9-11.fc38.x86_64 30/154 Verifying : libcom_err-1.46.5-4.fc38.x86_64 31/154 Verifying : libdb-5.3.28-55.fc38.x86_64 32/154 Verifying : libevent-2.1.12-8.fc38.x86_64 33/154 Verifying : libfdisk-2.38.1-4.fc38.x86_64 34/154 Verifying : libffi-3.4.4-2.fc38.x86_64 35/154 Verifying : libmount-2.38.1-4.fc38.x86_64 36/154 Verifying : libnsl2-2.0.0-5.fc38.x86_64 37/154 Verifying : libpkgconf-1.8.0-6.fc38.x86_64 38/154 Verifying : libpsl-0.21.2-2.fc38.x86_64 39/154 Verifying : libpwquality-1.4.5-3.fc38.x86_64 40/154 Verifying : libselinux-3.5-1.fc38.x86_64 41/154 Verifying : libsemanage-3.5-2.fc38.x86_64 42/154 Verifying : libsepol-3.5-1.fc38.x86_64 43/154 Verifying : libsigsegv-2.14-4.fc38.x86_64 44/154 Verifying : libsmartcols-2.38.1-4.fc38.x86_64 45/154 Verifying : libtasn1-4.19.0-2.fc38.x86_64 46/154 Verifying : libunistring-1.1-3.fc38.x86_64 47/154 Verifying : libunistring1.0-1.0-1.fc38.x86_64 48/154 Verifying : libutempter-1.2.1-8.fc38.x86_64 49/154 Verifying : libuuid-2.38.1-4.fc38.x86_64 50/154 Verifying : libverto-0.3.2-5.fc38.x86_64 51/154 Verifying : lua-libs-5.4.4-9.fc38.x86_64 52/154 Verifying : lz4-libs-1.9.4-2.fc38.x86_64 53/154 Verifying : mpfr-4.1.1-3.fc38.x86_64 54/154 Verifying : ocaml-srpm-macros-7-3.fc38.noarch 55/154 Verifying : openblas-srpm-macros-2-13.fc38.noarch 56/154 Verifying : pam-1.5.2-16.fc38.x86_64 57/154 Verifying : pam-libs-1.5.2-16.fc38.x86_64 58/154 Verifying : patch-2.7.6-19.fc38.x86_64 59/154 Verifying : pcre2-10.42-1.fc38.1.x86_64 60/154 Verifying : pcre2-syntax-10.42-1.fc38.1.noarch 61/154 Verifying : perl-srpm-macros-1-48.fc38.noarch 62/154 Verifying : pkgconf-1.8.0-6.fc38.x86_64 63/154 Verifying : pkgconf-m4-1.8.0-6.fc38.noarch 64/154 Verifying : pkgconf-pkg-config-1.8.0-6.fc38.x86_64 65/154 Verifying : popt-1.19-2.fc38.x86_64 66/154 Verifying : python-srpm-macros-3.11-10.fc38.noarch 67/154 Verifying : sed-4.8-12.fc38.x86_64 68/154 Verifying : setup-2.14.3-2.fc38.noarch 69/154 Verifying : shadow-utils-2:4.13-6.fc38.x86_64 70/154 Verifying : sqlite-libs-3.40.1-2.fc38.x86_64 71/154 Verifying : tar-2:1.34-8.fc38.x86_64 72/154 Verifying : unzip-6.0-60.fc38.x86_64 73/154 Verifying : util-linux-2.38.1-4.fc38.x86_64 74/154 Verifying : util-linux-core-2.38.1-4.fc38.x86_64 75/154 Verifying : which-2.21-39.fc38.x86_64 76/154 Verifying : xz-5.4.1-1.fc38.x86_64 77/154 Verifying : xz-libs-5.4.1-1.fc38.x86_64 78/154 Verifying : zlib-1.2.13-3.fc38.x86_64 79/154 Verifying : alternatives-1.26-1.fc38.x86_64 80/154 Verifying : ansible-srpm-macros-1-12.fc38.noarch 81/154 Verifying : audit-libs-3.1.2-8.fc38.x86_64 82/154 Verifying : authselect-1.4.3-1.fc38.x86_64 83/154 Verifying : authselect-libs-1.4.3-1.fc38.x86_64 84/154 Verifying : bash-5.2.26-1.fc38.x86_64 85/154 Verifying : binutils-2.39-16.fc38.x86_64 86/154 Verifying : binutils-gold-2.39-16.fc38.x86_64 87/154 Verifying : ca-certificates-2023.2.60_v7.0.306-1.0.fc38.noar 88/154 Verifying : coreutils-9.1-12.fc38.x86_64 89/154 Verifying : coreutils-common-9.1-12.fc38.x86_64 90/154 Verifying : cracklib-2.9.11-1.fc38.x86_64 91/154 Verifying : curl-8.0.1-7.fc38.x86_64 92/154 Verifying : debugedit-5.0-9.fc38.x86_64 93/154 Verifying : diffutils-3.10-1.fc38.x86_64 94/154 Verifying : elfutils-0.191-1.fc38.x86_64 95/154 Verifying : elfutils-debuginfod-client-0.191-1.fc38.x86_64 96/154 Verifying : elfutils-default-yama-scope-0.191-1.fc38.noarch 97/154 Verifying : elfutils-libelf-0.191-1.fc38.x86_64 98/154 Verifying : elfutils-libs-0.191-1.fc38.x86_64 99/154 Verifying : fedora-release-38-36.noarch 100/154 Verifying : fedora-release-common-38-36.noarch 101/154 Verifying : fedora-release-identity-basic-38-36.noarch 102/154 Verifying : forge-srpm-macros-0.2.0-3.fc38.noarch 103/154 Verifying : gdb-minimal-14.1-3.fc38.x86_64 104/154 Verifying : glibc-2.37-18.fc38.x86_64 105/154 Verifying : glibc-common-2.37-18.fc38.x86_64 106/154 Verifying : glibc-gconv-extra-2.37-18.fc38.x86_64 107/154 Verifying : glibc-minimal-langpack-2.37-18.fc38.x86_64 108/154 Verifying : go-srpm-macros-3.5.0-1.fc38.noarch 109/154 Verifying : kernel-srpm-macros-1.0-19.fc38.noarch 110/154 Verifying : keyutils-libs-1.6.3-1.fc38.x86_64 111/154 Verifying : krb5-libs-1.21-3.fc38.x86_64 112/154 Verifying : libacl-2.3.1-7.fc38.x86_64 113/154 Verifying : libcap-2.48-8.fc38.x86_64 114/154 Verifying : libcap-ng-0.8.3-8.fc38.x86_64 115/154 Verifying : libcurl-8.0.1-7.fc38.x86_64 116/154 Verifying : libeconf-0.5.2-1.fc38.x86_64 117/154 Verifying : libgcc-13.2.1-7.fc38.x86_64 118/154 Verifying : libgomp-13.2.1-7.fc38.x86_64 119/154 Verifying : libidn2-2.3.7-1.fc38.x86_64 120/154 Verifying : libnghttp2-1.52.0-2.fc38.x86_64 121/154 Verifying : libssh-0.10.6-2.fc38.x86_64 122/154 Verifying : libssh-config-0.10.6-2.fc38.noarch 123/154 Verifying : libstdc++-13.2.1-7.fc38.x86_64 124/154 Verifying : libtirpc-1.3.4-1.rc3.fc38.x86_64 125/154 Verifying : libxcrypt-4.4.36-1.fc38.x86_64 126/154 Verifying : libxml2-2.10.4-1.fc38.x86_64 127/154 Verifying : libzstd-1.5.5-1.fc38.x86_64 128/154 Verifying : lua-srpm-macros-1-13.fc38.noarch 129/154 Verifying : ncurses-base-6.4-7.20230520.fc38.1.noarch 130/154 Verifying : ncurses-libs-6.4-7.20230520.fc38.1.x86_64 131/154 Verifying : openldap-2.6.6-1.fc38.x86_64 132/154 Verifying : openssl-libs-1:3.0.9-2.fc38.x86_64 133/154 Verifying : p11-kit-0.25.3-1.fc38.x86_64 134/154 Verifying : p11-kit-trust-0.25.3-1.fc38.x86_64 135/154 Verifying : package-notes-srpm-macros-0.5-8.fc38.noarch 136/154 Verifying : publicsuffix-list-dafsa-20240107-1.fc38.noarch 137/154 Verifying : pyproject-srpm-macros-1.12.0-1.fc38.noarch 138/154 Verifying : qt5-srpm-macros-5.15.12-1.fc38.noarch 139/154 Verifying : qt6-srpm-macros-6.6.0-1.fc38.noarch 140/154 Verifying : readline-8.2-4.fc38.x86_64 141/154 Verifying : redhat-rpm-config-257-1.fc38.noarch 142/154 Verifying : rpm-4.18.2-1.fc38.x86_64 143/154 Verifying : rpm-build-4.18.2-1.fc38.x86_64 144/154 Verifying : rpm-build-libs-4.18.2-1.fc38.x86_64 145/154 Verifying : rpm-libs-4.18.2-1.fc38.x86_64 146/154 Verifying : rpm-sequoia-1.6.0-1.fc38.x86_64 147/154 Verifying : rpmautospec-rpm-macros-0.6.3-1.fc38.noarch 148/154 Verifying : rust-srpm-macros-26.2-1.fc38.noarch 149/154 Verifying : systemd-libs-253.17-1.fc38.x86_64 150/154 Verifying : tzdata-2024a-1.fc38.noarch 151/154 Verifying : xxhash-libs-0.8.2-1.fc38.x86_64 152/154 Verifying : zip-3.0-37.fc38.x86_64 153/154 Verifying : zstd-1.5.5-1.fc38.x86_64 154/154 Installed products updated. Installed: alternatives-1.26-1.fc38.x86_64 ansible-srpm-macros-1-12.fc38.noarch audit-libs-3.1.2-8.fc38.x86_64 authselect-1.4.3-1.fc38.x86_64 authselect-libs-1.4.3-1.fc38.x86_64 basesystem-11-15.fc38.noarch bash-5.2.26-1.fc38.x86_64 binutils-2.39-16.fc38.x86_64 binutils-gold-2.39-16.fc38.x86_64 bzip2-1.0.8-13.fc38.x86_64 bzip2-libs-1.0.8-13.fc38.x86_64 ca-certificates-2023.2.60_v7.0.306-1.0.fc38.noarch coreutils-9.1-12.fc38.x86_64 coreutils-common-9.1-12.fc38.x86_64 cpio-2.13-14.fc38.x86_64 cracklib-2.9.11-1.fc38.x86_64 crypto-policies-20230301-1.gita12f7b2.fc38.noarch curl-8.0.1-7.fc38.x86_64 cyrus-sasl-lib-2.1.28-9.fc38.x86_64 debugedit-5.0-9.fc38.x86_64 diffutils-3.10-1.fc38.x86_64 dwz-0.15-2.fc38.x86_64 ed-1.19-2.fc38.x86_64 efi-srpm-macros-5-7.fc38.noarch elfutils-0.191-1.fc38.x86_64 elfutils-debuginfod-client-0.191-1.fc38.x86_64 elfutils-default-yama-scope-0.191-1.fc38.noarch elfutils-libelf-0.191-1.fc38.x86_64 elfutils-libs-0.191-1.fc38.x86_64 fedora-gpg-keys-38-1.noarch fedora-release-38-36.noarch fedora-release-common-38-36.noarch fedora-release-identity-basic-38-36.noarch fedora-repos-38-1.noarch file-5.44-3.fc38.x86_64 file-libs-5.44-3.fc38.x86_64 filesystem-3.18-3.fc38.x86_64 findutils-1:4.9.0-3.fc38.x86_64 fonts-srpm-macros-1:2.0.5-11.fc38.noarch forge-srpm-macros-0.2.0-3.fc38.noarch fpc-srpm-macros-1.3-7.fc38.noarch gawk-5.1.1-5.fc38.x86_64 gdb-minimal-14.1-3.fc38.x86_64 gdbm-libs-1:1.23-3.fc38.x86_64 ghc-srpm-macros-1.6.1-1.fc38.noarch glibc-2.37-18.fc38.x86_64 glibc-common-2.37-18.fc38.x86_64 glibc-gconv-extra-2.37-18.fc38.x86_64 glibc-minimal-langpack-2.37-18.fc38.x86_64 gmp-1:6.2.1-4.fc38.x86_64 gnat-srpm-macros-6-2.fc38.noarch go-srpm-macros-3.5.0-1.fc38.noarch grep-3.8-3.fc38.x86_64 gzip-1.12-3.fc38.x86_64 info-7.0.2-2.fc38.x86_64 jansson-2.13.1-6.fc38.x86_64 kernel-srpm-macros-1.0-19.fc38.noarch keyutils-libs-1.6.3-1.fc38.x86_64 krb5-libs-1.21-3.fc38.x86_64 libacl-2.3.1-7.fc38.x86_64 libarchive-3.6.1-4.fc38.x86_64 libattr-2.5.1-6.fc38.x86_64 libblkid-2.38.1-4.fc38.x86_64 libbrotli-1.0.9-11.fc38.x86_64 libcap-2.48-8.fc38.x86_64 libcap-ng-0.8.3-8.fc38.x86_64 libcom_err-1.46.5-4.fc38.x86_64 libcurl-8.0.1-7.fc38.x86_64 libdb-5.3.28-55.fc38.x86_64 libeconf-0.5.2-1.fc38.x86_64 libevent-2.1.12-8.fc38.x86_64 libfdisk-2.38.1-4.fc38.x86_64 libffi-3.4.4-2.fc38.x86_64 libgcc-13.2.1-7.fc38.x86_64 libgomp-13.2.1-7.fc38.x86_64 libidn2-2.3.7-1.fc38.x86_64 libmount-2.38.1-4.fc38.x86_64 libnghttp2-1.52.0-2.fc38.x86_64 libnsl2-2.0.0-5.fc38.x86_64 libpkgconf-1.8.0-6.fc38.x86_64 libpsl-0.21.2-2.fc38.x86_64 libpwquality-1.4.5-3.fc38.x86_64 libselinux-3.5-1.fc38.x86_64 libsemanage-3.5-2.fc38.x86_64 libsepol-3.5-1.fc38.x86_64 libsigsegv-2.14-4.fc38.x86_64 libsmartcols-2.38.1-4.fc38.x86_64 libssh-0.10.6-2.fc38.x86_64 libssh-config-0.10.6-2.fc38.noarch libstdc++-13.2.1-7.fc38.x86_64 libtasn1-4.19.0-2.fc38.x86_64 libtirpc-1.3.4-1.rc3.fc38.x86_64 libunistring-1.1-3.fc38.x86_64 libunistring1.0-1.0-1.fc38.x86_64 libutempter-1.2.1-8.fc38.x86_64 libuuid-2.38.1-4.fc38.x86_64 libverto-0.3.2-5.fc38.x86_64 libxcrypt-4.4.36-1.fc38.x86_64 libxml2-2.10.4-1.fc38.x86_64 libzstd-1.5.5-1.fc38.x86_64 lua-libs-5.4.4-9.fc38.x86_64 lua-srpm-macros-1-13.fc38.noarch lz4-libs-1.9.4-2.fc38.x86_64 mpfr-4.1.1-3.fc38.x86_64 ncurses-base-6.4-7.20230520.fc38.1.noarch ncurses-libs-6.4-7.20230520.fc38.1.x86_64 ocaml-srpm-macros-7-3.fc38.noarch openblas-srpm-macros-2-13.fc38.noarch openldap-2.6.6-1.fc38.x86_64 openssl-libs-1:3.0.9-2.fc38.x86_64 p11-kit-0.25.3-1.fc38.x86_64 p11-kit-trust-0.25.3-1.fc38.x86_64 package-notes-srpm-macros-0.5-8.fc38.noarch pam-1.5.2-16.fc38.x86_64 pam-libs-1.5.2-16.fc38.x86_64 patch-2.7.6-19.fc38.x86_64 pcre2-10.42-1.fc38.1.x86_64 pcre2-syntax-10.42-1.fc38.1.noarch perl-srpm-macros-1-48.fc38.noarch pkgconf-1.8.0-6.fc38.x86_64 pkgconf-m4-1.8.0-6.fc38.noarch pkgconf-pkg-config-1.8.0-6.fc38.x86_64 popt-1.19-2.fc38.x86_64 publicsuffix-list-dafsa-20240107-1.fc38.noarch pyproject-srpm-macros-1.12.0-1.fc38.noarch python-srpm-macros-3.11-10.fc38.noarch qt5-srpm-macros-5.15.12-1.fc38.noarch qt6-srpm-macros-6.6.0-1.fc38.noarch readline-8.2-4.fc38.x86_64 redhat-rpm-config-257-1.fc38.noarch rpm-4.18.2-1.fc38.x86_64 rpm-build-4.18.2-1.fc38.x86_64 rpm-build-libs-4.18.2-1.fc38.x86_64 rpm-libs-4.18.2-1.fc38.x86_64 rpm-sequoia-1.6.0-1.fc38.x86_64 rpmautospec-rpm-macros-0.6.3-1.fc38.noarch rust-srpm-macros-26.2-1.fc38.noarch sed-4.8-12.fc38.x86_64 setup-2.14.3-2.fc38.noarch shadow-utils-2:4.13-6.fc38.x86_64 sqlite-libs-3.40.1-2.fc38.x86_64 systemd-libs-253.17-1.fc38.x86_64 tar-2:1.34-8.fc38.x86_64 tzdata-2024a-1.fc38.noarch unzip-6.0-60.fc38.x86_64 util-linux-2.38.1-4.fc38.x86_64 util-linux-core-2.38.1-4.fc38.x86_64 which-2.21-39.fc38.x86_64 xxhash-libs-0.8.2-1.fc38.x86_64 xz-5.4.1-1.fc38.x86_64 xz-libs-5.4.1-1.fc38.x86_64 zip-3.0-37.fc38.x86_64 zlib-1.2.13-3.fc38.x86_64 zstd-1.5.5-1.fc38.x86_64 Complete! Finish: installing minimal buildroot with dnf Start: creating root cache Finish: creating root cache Finish: chroot init INFO: Installed packages: INFO: alternatives-1.26-1.fc38.x86_64 ansible-srpm-macros-1-12.fc38.noarch audit-libs-3.1.2-8.fc38.x86_64 authselect-1.4.3-1.fc38.x86_64 authselect-libs-1.4.3-1.fc38.x86_64 basesystem-11-15.fc38.noarch bash-5.2.26-1.fc38.x86_64 binutils-2.39-16.fc38.x86_64 binutils-gold-2.39-16.fc38.x86_64 bzip2-1.0.8-13.fc38.x86_64 bzip2-libs-1.0.8-13.fc38.x86_64 ca-certificates-2023.2.60_v7.0.306-1.0.fc38.noarch coreutils-9.1-12.fc38.x86_64 coreutils-common-9.1-12.fc38.x86_64 cpio-2.13-14.fc38.x86_64 cracklib-2.9.11-1.fc38.x86_64 crypto-policies-20230301-1.gita12f7b2.fc38.noarch curl-8.0.1-7.fc38.x86_64 cyrus-sasl-lib-2.1.28-9.fc38.x86_64 debugedit-5.0-9.fc38.x86_64 diffutils-3.10-1.fc38.x86_64 dwz-0.15-2.fc38.x86_64 ed-1.19-2.fc38.x86_64 efi-srpm-macros-5-7.fc38.noarch elfutils-0.191-1.fc38.x86_64 elfutils-debuginfod-client-0.191-1.fc38.x86_64 elfutils-default-yama-scope-0.191-1.fc38.noarch elfutils-libelf-0.191-1.fc38.x86_64 elfutils-libs-0.191-1.fc38.x86_64 fedora-gpg-keys-38-1.noarch fedora-release-38-36.noarch fedora-release-common-38-36.noarch fedora-release-identity-basic-38-36.noarch fedora-repos-38-1.noarch file-5.44-3.fc38.x86_64 file-libs-5.44-3.fc38.x86_64 filesystem-3.18-3.fc38.x86_64 findutils-4.9.0-3.fc38.x86_64 fonts-srpm-macros-2.0.5-11.fc38.noarch forge-srpm-macros-0.2.0-3.fc38.noarch fpc-srpm-macros-1.3-7.fc38.noarch gawk-5.1.1-5.fc38.x86_64 gdb-minimal-14.1-3.fc38.x86_64 gdbm-libs-1.23-3.fc38.x86_64 ghc-srpm-macros-1.6.1-1.fc38.noarch glibc-2.37-18.fc38.x86_64 glibc-common-2.37-18.fc38.x86_64 glibc-gconv-extra-2.37-18.fc38.x86_64 glibc-minimal-langpack-2.37-18.fc38.x86_64 gmp-6.2.1-4.fc38.x86_64 gnat-srpm-macros-6-2.fc38.noarch go-srpm-macros-3.5.0-1.fc38.noarch gpg-pubkey-eb10b464-6202d9c6 grep-3.8-3.fc38.x86_64 gzip-1.12-3.fc38.x86_64 info-7.0.2-2.fc38.x86_64 jansson-2.13.1-6.fc38.x86_64 kernel-srpm-macros-1.0-19.fc38.noarch keyutils-libs-1.6.3-1.fc38.x86_64 krb5-libs-1.21-3.fc38.x86_64 libacl-2.3.1-7.fc38.x86_64 libarchive-3.6.1-4.fc38.x86_64 libattr-2.5.1-6.fc38.x86_64 libblkid-2.38.1-4.fc38.x86_64 libbrotli-1.0.9-11.fc38.x86_64 libcap-2.48-8.fc38.x86_64 libcap-ng-0.8.3-8.fc38.x86_64 libcom_err-1.46.5-4.fc38.x86_64 libcurl-8.0.1-7.fc38.x86_64 libdb-5.3.28-55.fc38.x86_64 libeconf-0.5.2-1.fc38.x86_64 libevent-2.1.12-8.fc38.x86_64 libfdisk-2.38.1-4.fc38.x86_64 libffi-3.4.4-2.fc38.x86_64 libgcc-13.2.1-7.fc38.x86_64 libgomp-13.2.1-7.fc38.x86_64 libidn2-2.3.7-1.fc38.x86_64 libmount-2.38.1-4.fc38.x86_64 libnghttp2-1.52.0-2.fc38.x86_64 libnsl2-2.0.0-5.fc38.x86_64 libpkgconf-1.8.0-6.fc38.x86_64 libpsl-0.21.2-2.fc38.x86_64 libpwquality-1.4.5-3.fc38.x86_64 libselinux-3.5-1.fc38.x86_64 libsemanage-3.5-2.fc38.x86_64 libsepol-3.5-1.fc38.x86_64 libsigsegv-2.14-4.fc38.x86_64 libsmartcols-2.38.1-4.fc38.x86_64 libssh-0.10.6-2.fc38.x86_64 libssh-config-0.10.6-2.fc38.noarch libstdc++-13.2.1-7.fc38.x86_64 libtasn1-4.19.0-2.fc38.x86_64 libtirpc-1.3.4-1.rc3.fc38.x86_64 libunistring-1.1-3.fc38.x86_64 libunistring1.0-1.0-1.fc38.x86_64 libutempter-1.2.1-8.fc38.x86_64 libuuid-2.38.1-4.fc38.x86_64 libverto-0.3.2-5.fc38.x86_64 libxcrypt-4.4.36-1.fc38.x86_64 libxml2-2.10.4-1.fc38.x86_64 libzstd-1.5.5-1.fc38.x86_64 lua-libs-5.4.4-9.fc38.x86_64 lua-srpm-macros-1-13.fc38.noarch lz4-libs-1.9.4-2.fc38.x86_64 mpfr-4.1.1-3.fc38.x86_64 ncurses-base-6.4-7.20230520.fc38.1.noarch ncurses-libs-6.4-7.20230520.fc38.1.x86_64 ocaml-srpm-macros-7-3.fc38.noarch openblas-srpm-macros-2-13.fc38.noarch openldap-2.6.6-1.fc38.x86_64 openssl-libs-3.0.9-2.fc38.x86_64 p11-kit-0.25.3-1.fc38.x86_64 p11-kit-trust-0.25.3-1.fc38.x86_64 package-notes-srpm-macros-0.5-8.fc38.noarch pam-1.5.2-16.fc38.x86_64 pam-libs-1.5.2-16.fc38.x86_64 patch-2.7.6-19.fc38.x86_64 pcre2-10.42-1.fc38.1.x86_64 pcre2-syntax-10.42-1.fc38.1.noarch perl-srpm-macros-1-48.fc38.noarch pkgconf-1.8.0-6.fc38.x86_64 pkgconf-m4-1.8.0-6.fc38.noarch pkgconf-pkg-config-1.8.0-6.fc38.x86_64 popt-1.19-2.fc38.x86_64 publicsuffix-list-dafsa-20240107-1.fc38.noarch pyproject-srpm-macros-1.12.0-1.fc38.noarch python-srpm-macros-3.11-10.fc38.noarch qt5-srpm-macros-5.15.12-1.fc38.noarch qt6-srpm-macros-6.6.0-1.fc38.noarch readline-8.2-4.fc38.x86_64 redhat-rpm-config-257-1.fc38.noarch rpm-4.18.2-1.fc38.x86_64 rpm-build-4.18.2-1.fc38.x86_64 rpm-build-libs-4.18.2-1.fc38.x86_64 rpm-libs-4.18.2-1.fc38.x86_64 rpm-sequoia-1.6.0-1.fc38.x86_64 rpmautospec-rpm-macros-0.6.3-1.fc38.noarch rust-srpm-macros-26.2-1.fc38.noarch sed-4.8-12.fc38.x86_64 setup-2.14.3-2.fc38.noarch shadow-utils-4.13-6.fc38.x86_64 sqlite-libs-3.40.1-2.fc38.x86_64 systemd-libs-253.17-1.fc38.x86_64 tar-1.34-8.fc38.x86_64 tzdata-2024a-1.fc38.noarch unzip-6.0-60.fc38.x86_64 util-linux-2.38.1-4.fc38.x86_64 util-linux-core-2.38.1-4.fc38.x86_64 which-2.21-39.fc38.x86_64 xxhash-libs-0.8.2-1.fc38.x86_64 xz-5.4.1-1.fc38.x86_64 xz-libs-5.4.1-1.fc38.x86_64 zip-3.0-37.fc38.x86_64 zlib-1.2.13-3.fc38.x86_64 zstd-1.5.5-1.fc38.x86_64 Start: buildsrpm Start: rpmbuild -bs warning: source_date_epoch_from_changelog set but %changelog is missing Building target platforms: x86_64 Building for target x86_64 Wrote: /builddir/build/SRPMS/R-CRAN-starvz-0.8.0-1.fc38.copr7307546.src.rpm RPM build warnings: source_date_epoch_from_changelog set but %changelog is missing Finish: rpmbuild -bs cp: preserving permissions for ‘/var/lib/copr-rpmbuild/results/chroot_scan/var/lib/mock/fedora-38-x86_64-1713076614.308351/root/var/log’: No such file or directory INFO: chroot_scan: 3 files copied to /var/lib/copr-rpmbuild/results/chroot_scan INFO: /var/lib/mock/fedora-38-x86_64-1713076614.308351/root/var/log/dnf.log /var/lib/mock/fedora-38-x86_64-1713076614.308351/root/var/log/dnf.librepo.log /var/lib/mock/fedora-38-x86_64-1713076614.308351/root/var/log/dnf.rpm.log Finish: buildsrpm INFO: Done(/var/lib/copr-rpmbuild/workspace/workdir-q_dvq8e_/R-CRAN-starvz/R-CRAN-starvz.spec) Config(child) 1 minutes 43 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.0-1.fc38.copr7307546.src.rpm) Config(fedora-38-x86_64) Start: chroot init INFO: mounting tmpfs at /var/lib/mock/fedora-38-x86_64-1713076614.308351/root. INFO: calling preinit hooks INFO: enabled root cache Start: unpacking root cache Finish: unpacking root cache INFO: enabled package manager cache Start: cleaning package manager metadata Finish: cleaning package manager metadata INFO: enabled HW Info plugin INFO: Buildroot is handled by package management from host and used with --installroot: rpm-4.19.1.1-1.fc39.x86_64 rpm-sequoia-1.6.0-1.fc39.x86_64 python3-dnf-4.19.2-1.fc39.noarch python3-dnf-plugins-core-4.6.0-1.fc39.noarch yum-4.19.2-1.fc39.noarch dnf5-5.1.17-1.fc39.x86_64 dnf5-plugins-5.1.17-1.fc39.x86_64 Finish: chroot init Start: build phase for R-CRAN-starvz-0.8.0-1.fc38.copr7307546.src.rpm Start: build setup for R-CRAN-starvz-0.8.0-1.fc38.copr7307546.src.rpm warning: source_date_epoch_from_changelog set but %changelog is missing Building target platforms: x86_64 Building for target x86_64 Wrote: /builddir/build/SRPMS/R-CRAN-starvz-0.8.0-1.fc38.copr7307546.src.rpm RPM build warnings: source_date_epoch_from_changelog set but %changelog is missing No matches found for the following disable plugin patterns: local, spacewalk, versionlock Updating Subscription Management repositories. Unable to read consumer identity This system is not registered with an entitlement server. You can use subscription-manager to register. Copr repository 25 kB/s | 1.5 kB 00:00 Copr repository 29 MB/s | 41 MB 00:01 fedora 182 kB/s | 24 kB 00:00 updates 55 kB/s | 22 kB 00:00 Dependencies resolved. ======================================================================================== Package Arch Version Repo Size ======================================================================================== Installing: R-CRAN-BH noarch 1.84.0.0-1.fc38.copr6880886 copr_base 9.8 M R-CRAN-RColorBrewer noarch 1.1.3-1.fc38.copr5812145 copr_base 65 k R-CRAN-Rcpp x86_64 1.0.12-1.fc38.copr6877523 copr_base 2.0 M R-CRAN-data.tree noarch 1.1.0-1.fc38.copr6627583 copr_base 1.2 M R-CRAN-dplyr x86_64 1.1.4-1.fc38.copr6663981 copr_base 1.5 M R-CRAN-ggplot2 noarch 3.5.0-1.fc38.copr7306791 copr_base 4.6 M R-CRAN-gtools x86_64 3.9.5-1.fc38.copr6672122 copr_base 389 k R-CRAN-lpSolve x86_64 5.6.20-1.fc38.copr6739857 copr_base 363 k R-CRAN-magrittr x86_64 2.0.3-1.fc38.copr5812133 copr_base 222 k R-CRAN-patchwork noarch 1.2.0-1.fc38.copr6873795 copr_base 3.1 M R-CRAN-purrr x86_64 1.0.2-1.fc38.copr6264939 copr_base 546 k R-CRAN-readr x86_64 2.1.5-1.fc38.copr6880950 copr_base 785 k R-CRAN-rlang x86_64 1.1.3-1.fc38.copr6880930 copr_base 1.7 M R-CRAN-stringr noarch 1.5.1-1.fc38.copr6636964 copr_base 320 k R-CRAN-tibble x86_64 3.2.1-1.fc38.copr5821162 copr_base 632 k R-CRAN-tidyr x86_64 1.3.1-1.fc38.copr6948918 copr_base 1.1 M R-CRAN-yaml x86_64 2.3.8-1.fc38.copr6742560 copr_base 124 k R-CRAN-zoo x86_64 1.8.12-1.fc38.copr5815602 copr_base 1.0 M R-core x86_64 4.3.3-1.fc38 updates 64 M R-devel x86_64 4.3.3-1.fc38 updates 10 k Installing dependencies: R-CRAN-MASS x86_64 7.3.60.0.1-1.fc38.copr6895092 copr_base 1.2 M R-CRAN-Matrix x86_64 1.6.5-1.fc38.copr6886765 copr_base 4.1 M R-CRAN-R6 noarch 2.5.1-1.fc38.copr5812135 copr_base 96 k R-CRAN-bit x86_64 4.0.5-1.fc38.copr5812166 copr_base 1.1 M R-CRAN-bit64 x86_64 4.0.5-1.fc38.copr5815652 copr_base 540 k R-CRAN-cli x86_64 3.6.2-1.fc38.copr6742501 copr_base 1.3 M R-CRAN-clipr noarch 0.8.0-1.fc38.copr5812155 copr_base 63 k R-CRAN-colorspace x86_64 2.1.0-1.fc38.copr5812150 copr_base 2.4 M R-CRAN-crayon noarch 1.5.2-1.fc38.copr5812139 copr_base 182 k R-CRAN-fansi x86_64 1.0.6-1.fc38.copr6735917 copr_base 341 k R-CRAN-farver x86_64 2.1.1-1.fc38.copr5812193 copr_base 1.3 M R-CRAN-generics noarch 0.1.3-1.fc38.copr5812201 copr_base 99 k R-CRAN-glue x86_64 1.7.0-1.fc38.copr6877494 copr_base 166 k R-CRAN-gtable noarch 0.3.4-1.fc38.copr6523581 copr_base 232 k R-CRAN-hms noarch 1.1.3-1.fc38.copr5819459 copr_base 112 k R-CRAN-isoband x86_64 0.2.7-1.fc38.copr5813294 copr_base 1.6 M R-CRAN-labeling noarch 0.4.3-1.fc38.copr6354313 copr_base 77 k R-CRAN-lattice x86_64 0.22.6-1.fc38.copr7307082 copr_base 1.4 M R-CRAN-lifecycle noarch 1.0.4-1.fc38.copr6614518 copr_base 131 k R-CRAN-mgcv x86_64 1.9.1-1.fc38.copr6775870 copr_base 3.3 M R-CRAN-munsell noarch 0.5.1-1.fc38.copr7306785 copr_base 251 k R-CRAN-nlme x86_64 3.1.164-1.fc38.copr6700968 copr_base 2.4 M R-CRAN-pillar noarch 1.9.0-1.fc38.copr5819458 copr_base 624 k R-CRAN-pkgconfig noarch 2.0.3-3.fc38.copr5812134 copr_base 30 k R-CRAN-scales noarch 1.3.0-1.fc38.copr6704012 copr_base 705 k R-CRAN-stringi x86_64 1.8.3-1.fc38.copr6742554 copr_base 997 k R-CRAN-tidyselect noarch 1.2.1-1.fc38.copr7306789 copr_base 232 k R-CRAN-tzdb x86_64 0.4.0-1.fc38.copr5915135 copr_base 530 k R-CRAN-utf8 x86_64 1.2.4-1.fc38.copr6555966 copr_base 151 k R-CRAN-vctrs x86_64 0.6.5-1.fc38.copr6715464 copr_base 1.3 M R-CRAN-viridisLite noarch 0.4.2-1.fc38.copr5868842 copr_base 1.2 M R-CRAN-vroom x86_64 1.6.5-1.fc38.copr6727750 copr_base 844 k R-CRAN-withr noarch 3.0.0-1.fc38.copr6911503 copr_base 268 k R-core-devel x86_64 4.3.3-1.fc38 updates 94 k R-java x86_64 4.3.3-1.fc38 updates 11 k R-java-devel x86_64 4.3.3-1.fc38 updates 10 k R-littler x86_64 0.3.19-1.fc38 updates 76 k R-rpm-macros noarch 1.2.1-6.fc38 fedora 11 k alsa-lib x86_64 1.2.11-2.fc38 updates 520 k annobin-docs noarch 12.40-1.fc38 updates 87 k annobin-plugin-gcc x86_64 12.40-1.fc38 updates 955 k avahi-libs x86_64 0.8-22.fc38 updates 66 k brotli x86_64 1.0.9-11.fc38 fedora 316 k brotli-devel x86_64 1.0.9-11.fc38 fedora 31 k bzip2-devel x86_64 1.0.8-13.fc38 fedora 214 k cairo x86_64 1.17.8-4.fc38 updates 704 k cmake-filesystem x86_64 3.27.7-1.fc38 updates 19 k copy-jdk-configs noarch 4.1-2.fc38 fedora 28 k cpp x86_64 13.2.1-7.fc38 updates 11 M crypto-policies-scripts noarch 20230301-1.gita12f7b2.fc38 fedora 116 k cups-libs x86_64 1:2.4.7-11.fc38 updates 268 k dbus-libs x86_64 1:1.14.10-1.fc38 updates 156 k desktop-file-utils x86_64 0.26-8.fc38 fedora 71 k emacs-filesystem noarch 1:29.3-1.fc38 updates 7.2 k expat x86_64 2.6.0-1.fc38 updates 112 k flexiblas x86_64 3.4.2-1.fc38 updates 25 k flexiblas-devel x86_64 3.4.2-1.fc38 updates 121 k flexiblas-netlib x86_64 3.4.2-1.fc38 updates 3.1 M flexiblas-netlib64 x86_64 3.4.2-1.fc38 updates 3.0 M flexiblas-openblas-openmp x86_64 3.4.2-1.fc38 updates 17 k flexiblas-openblas-openmp64 x86_64 3.4.2-1.fc38 updates 17 k fontconfig x86_64 2.14.2-2.fc38 updates 295 k fontconfig-devel x86_64 2.14.2-2.fc38 updates 163 k fonts-filesystem noarch 1:2.0.5-11.fc38 fedora 8.1 k freetype x86_64 2.13.0-2.fc38 fedora 414 k freetype-devel x86_64 2.13.0-2.fc38 fedora 945 k fribidi x86_64 1.0.12-3.fc38 fedora 89 k gc x86_64 8.2.2-3.fc38 fedora 110 k gcc x86_64 13.2.1-7.fc38 updates 34 M gcc-c++ x86_64 13.2.1-7.fc38 updates 13 M gcc-gfortran x86_64 13.2.1-7.fc38 updates 12 M gcc-plugin-annobin x86_64 13.2.1-7.fc38 updates 52 k gettext x86_64 0.21.1-2.fc38 fedora 1.0 M gettext-envsubst x86_64 0.21.1-2.fc38 fedora 36 k gettext-libs x86_64 0.21.1-2.fc38 fedora 320 k gettext-runtime x86_64 0.21.1-2.fc38 fedora 117 k glib2 x86_64 2.76.6-1.fc38 updates 2.8 M glib2-devel x86_64 2.76.6-1.fc38 updates 586 k glibc-devel x86_64 2.37-18.fc38 updates 54 k glibc-headers-x86 noarch 2.37-18.fc38 updates 536 k gnutls x86_64 3.8.4-1.fc38 updates 1.1 M google-noto-fonts-common noarch 20230201-2.fc38 updates 16 k google-noto-sans-vf-fonts noarch 20230201-2.fc38 updates 579 k graphite2 x86_64 1.3.14-11.fc38 fedora 95 k graphite2-devel x86_64 1.3.14-11.fc38 fedora 20 k groff-base x86_64 1.22.4-11.fc38 fedora 1.1 M guile22 x86_64 2.2.7-7.fc38 fedora 6.5 M harfbuzz x86_64 7.1.0-1.fc38 fedora 889 k harfbuzz-devel x86_64 7.1.0-1.fc38 fedora 445 k harfbuzz-icu x86_64 7.1.0-1.fc38 fedora 16 k java-17-openjdk x86_64 1:17.0.9.0.9-3.fc38 updates 407 k java-17-openjdk-devel x86_64 1:17.0.9.0.9-3.fc38 updates 4.7 M java-17-openjdk-headless x86_64 1:17.0.9.0.9-3.fc38 updates 44 M javapackages-filesystem noarch 6.1.0-7.fc38 fedora 13 k jbigkit-libs x86_64 2.1-25.fc38 fedora 53 k kernel-headers x86_64 6.8.3-100.fc38 updates 1.6 M langpacks-core-font-en noarch 3.0-32.fc38 updates 9.6 k libICE x86_64 1.0.10-10.fc38 fedora 71 k libRmath x86_64 4.3.3-1.fc38 updates 122 k libRmath-devel x86_64 4.3.3-1.fc38 updates 16 k libSM x86_64 1.2.3-12.fc38 fedora 41 k libX11 x86_64 1.8.7-1.fc38 updates 650 k libX11-common noarch 1.8.7-1.fc38 updates 176 k libX11-devel x86_64 1.8.7-1.fc38 updates 1.0 M libX11-xcb x86_64 1.8.7-1.fc38 updates 12 k libXau x86_64 1.0.11-2.fc38 fedora 32 k libXau-devel x86_64 1.0.11-2.fc38 fedora 14 k libXcomposite x86_64 0.4.5-9.fc38 fedora 23 k libXext x86_64 1.3.5-2.fc38 fedora 39 k libXft x86_64 2.3.8-2.fc38 updates 72 k libXft-devel x86_64 2.3.8-2.fc38 updates 50 k libXi x86_64 1.8.1-1.fc38 updates 40 k libXmu x86_64 1.1.4-2.fc38 fedora 77 k libXrender x86_64 0.9.11-2.fc38 fedora 27 k libXrender-devel x86_64 0.9.11-2.fc38 fedora 19 k libXt x86_64 1.2.1-4.fc38 fedora 179 k libXtst x86_64 1.2.4-2.fc38 fedora 20 k libb2 x86_64 0.98.1-8.fc38 fedora 25 k libblkid-devel x86_64 2.38.1-4.fc38 fedora 16 k libdatrie x86_64 0.2.13-5.fc38 fedora 32 k libffi-devel x86_64 3.4.4-2.fc38 fedora 29 k libfontenc x86_64 1.1.6-2.fc38 fedora 32 k libgfortran x86_64 13.2.1-7.fc38 updates 910 k libicu x86_64 72.1-2.fc38 fedora 10 M libicu-devel x86_64 72.1-2.fc38 fedora 918 k libjpeg-turbo x86_64 2.1.4-2.fc38 fedora 183 k liblerc x86_64 4.0.0-3.fc38 fedora 202 k libmount-devel x86_64 2.38.1-4.fc38 fedora 18 k libmpc x86_64 1.3.1-2.fc38 fedora 70 k libpng x86_64 2:1.6.37-14.fc38 fedora 120 k libpng-devel x86_64 2:1.6.37-14.fc38 fedora 291 k libquadmath x86_64 13.2.1-7.fc38 updates 200 k libquadmath-devel x86_64 13.2.1-7.fc38 updates 41 k libselinux-devel x86_64 3.5-1.fc38 fedora 151 k libsepol-devel x86_64 3.5-1.fc38 fedora 49 k libstdc++-devel x86_64 13.2.1-7.fc38 updates 2.6 M libthai x86_64 0.1.29-4.fc38 fedora 213 k libtiff x86_64 4.4.0-8.fc38 updates 201 k libtirpc-devel x86_64 1.3.4-1.rc3.fc38 updates 124 k libtool-ltdl x86_64 2.4.7-6.fc38 fedora 37 k libwebp x86_64 1.3.2-2.fc38 updates 284 k libxcb x86_64 1.13.1-11.fc38 fedora 231 k libxcb-devel x86_64 1.13.1-11.fc38 fedora 1.4 M libxcrypt-devel x86_64 4.4.36-1.fc38 updates 30 k libxml2-devel x86_64 2.10.4-1.fc38 updates 531 k lksctp-tools x86_64 1.0.19-3.fc38 fedora 92 k lua x86_64 5.4.4-9.fc38 fedora 190 k lua-posix x86_64 35.1-5.fc38 fedora 138 k make x86_64 1:4.4.1-1.fc38 updates 588 k mkfontscale x86_64 1.2.2-3.fc38 fedora 32 k mpdecimal x86_64 2.5.1-6.fc38 fedora 89 k ncurses x86_64 6.4-7.20230520.fc38.1 updates 415 k nettle x86_64 3.8-3.fc38 fedora 412 k nspr x86_64 4.35.0-17.fc38 updates 137 k nss x86_64 3.99.0-1.fc38 updates 703 k nss-softokn x86_64 3.99.0-1.fc38 updates 419 k nss-softokn-freebl x86_64 3.99.0-1.fc38 updates 381 k nss-sysinit x86_64 3.99.0-1.fc38 updates 18 k nss-util x86_64 3.99.0-1.fc38 updates 87 k openblas x86_64 0.3.21-4.fc38 fedora 35 k openblas-openmp x86_64 0.3.21-4.fc38 fedora 5.1 M openblas-openmp64 x86_64 0.3.21-4.fc38 fedora 4.9 M pango x86_64 1.50.14-1.fc38 fedora 342 k pcre2-devel x86_64 10.42-1.fc38.1 fedora 506 k pcre2-utf16 x86_64 10.42-1.fc38.1 fedora 214 k pcre2-utf32 x86_64 10.42-1.fc38.1 fedora 201 k perl-AutoLoader noarch 5.74-498.fc38 updates 22 k perl-B x86_64 1.83-498.fc38 updates 182 k perl-Carp noarch 1.52-490.fc38 fedora 29 k perl-Class-Struct noarch 0.66-498.fc38 updates 23 k perl-Data-Dumper x86_64 2.184-491.fc38 fedora 56 k perl-Digest noarch 1.20-490.fc38 fedora 25 k perl-Digest-MD5 x86_64 2.58-490.fc38 fedora 36 k perl-DynaLoader x86_64 1.52-498.fc38 updates 27 k perl-Encode x86_64 4:3.19-493.fc38 fedora 1.7 M perl-Errno x86_64 1.36-498.fc38 updates 15 k perl-Exporter noarch 5.77-490.fc38 fedora 31 k perl-Fcntl x86_64 1.15-498.fc38 updates 21 k perl-File-Basename noarch 2.85-498.fc38 updates 18 k perl-File-Path noarch 2.18-490.fc38 fedora 35 k perl-File-Temp noarch 1:0.231.100-490.fc38 fedora 59 k perl-File-stat noarch 1.12-498.fc38 updates 18 k perl-FileHandle noarch 2.03-498.fc38 updates 16 k perl-Getopt-Long noarch 1:2.54-2.fc38 fedora 60 k perl-Getopt-Std noarch 1.13-498.fc38 updates 16 k perl-HTTP-Tiny noarch 0.086-2.fc38 updates 55 k perl-IO x86_64 1.50-498.fc38 updates 92 k perl-IO-Socket-IP noarch 0.41-492.fc38 fedora 41 k perl-IO-Socket-SSL noarch 2.081-1.fc38 fedora 227 k perl-IPC-Open3 noarch 1.22-498.fc38 updates 23 k perl-MIME-Base64 x86_64 3.16-490.fc38 fedora 30 k perl-Mozilla-CA noarch 20221114-2.fc38 fedora 12 k perl-Net-SSLeay x86_64 1.92-5.fc38 fedora 361 k perl-POSIX x86_64 2.03-498.fc38 updates 98 k perl-PathTools x86_64 3.84-490.fc38 fedora 87 k perl-Pod-Escapes noarch 1:1.07-490.fc38 fedora 20 k perl-Pod-Perldoc noarch 3.28.01-491.fc38 fedora 86 k perl-Pod-Simple noarch 1:3.43-491.fc38 fedora 219 k perl-Pod-Usage noarch 4:2.03-4.fc38 fedora 40 k perl-Scalar-List-Utils x86_64 5:1.63-490.fc38 fedora 72 k perl-SelectSaver noarch 1.02-498.fc38 updates 12 k perl-Socket x86_64 4:2.036-2.fc38 fedora 55 k perl-Storable x86_64 1:3.26-490.fc38 fedora 97 k perl-Symbol noarch 1.09-498.fc38 updates 15 k perl-Term-ANSIColor noarch 5.01-491.fc38 fedora 47 k perl-Term-Cap noarch 1.18-1.fc38 fedora 22 k perl-Text-ParseWords noarch 3.31-490.fc38 fedora 16 k perl-Text-Tabs+Wrap noarch 2023.0511-1.fc38 updates 22 k perl-Time-Local noarch 2:1.300-490.fc38 fedora 33 k perl-URI noarch 5.17-2.fc38 fedora 120 k perl-base noarch 2.27-498.fc38 updates 17 k perl-constant noarch 1.33-491.fc38 fedora 23 k perl-if noarch 0.61.000-498.fc38 updates 15 k perl-interpreter x86_64 4:5.36.3-498.fc38 updates 73 k perl-libnet noarch 3.15-1.fc38 fedora 128 k perl-libs x86_64 4:5.36.3-498.fc38 updates 2.2 M perl-locale noarch 1.10-498.fc38 updates 14 k perl-mro x86_64 1.26-498.fc38 updates 29 k perl-overload noarch 1.35-498.fc38 updates 46 k perl-overloading noarch 0.02-498.fc38 updates 13 k perl-parent noarch 1:0.241-1.fc38 fedora 15 k perl-podlators noarch 1:5.01-2.fc38 fedora 125 k perl-vars noarch 1.05-498.fc38 updates 14 k pixman x86_64 0.42.2-1.fc38 fedora 285 k python-pip-wheel noarch 22.3.1-3.fc38 updates 1.4 M python-setuptools-wheel noarch 65.5.1-2.fc38 fedora 715 k python3 x86_64 3.11.8-2.fc38 updates 28 k python3-libs x86_64 3.11.8-2.fc38 updates 9.6 M sysprof-capture-devel x86_64 3.48.0-1.fc38 fedora 58 k tcl x86_64 1:8.6.12-4.fc38 fedora 1.1 M tcl-devel x86_64 1:8.6.12-4.fc38 fedora 169 k tk x86_64 1:8.6.12-4.fc38 fedora 1.6 M tk-devel x86_64 1:8.6.12-4.fc38 fedora 538 k tre x86_64 0.8.0-39.20140228gitc2f5d13.fc38 fedora 43 k tre-common noarch 0.8.0-39.20140228gitc2f5d13.fc38 fedora 31 k tre-devel x86_64 0.8.0-39.20140228gitc2f5d13.fc38 fedora 12 k ttmkfdir x86_64 3.0.9-67.fc38 fedora 54 k tzdata-java noarch 2024a-1.fc38 updates 207 k xclip x86_64 0.13-19.git11cba61.fc38 fedora 37 k xdg-utils noarch 1.1.3-15.fc38 updates 77 k xml-common noarch 0.6.3-60.fc38 fedora 31 k xorg-x11-fonts-Type1 noarch 7.5-35.fc38 fedora 505 k xorg-x11-proto-devel noarch 2022.2-3.fc38 fedora 299 k xz-devel x86_64 5.4.1-1.fc38 fedora 65 k zlib-devel x86_64 1.2.13-3.fc38 fedora 45 k Transaction Summary ======================================================================================== Install 265 Packages Total download size: 333 M Installed size: 1.1 G Downloading Packages: (1/265): R-CRAN-MASS-7.3.60.0.1-1.fc38.copr6895 7.8 MB/s | 1.2 MB 00:00 (2/265): R-CRAN-Matrix-1.6.5-1.fc38.copr6886765 18 MB/s | 4.1 MB 00:00 (3/265): R-CRAN-R6-2.5.1-1.fc38.copr5812135.noa 923 kB/s | 96 kB 00:00 (4/265): R-CRAN-BH-1.84.0.0-1.fc38.copr6880886. 28 MB/s | 9.8 MB 00:00 (5/265): R-CRAN-RColorBrewer-1.1.3-1.fc38.copr5 521 kB/s | 65 kB 00:00 (6/265): R-CRAN-Rcpp-1.0.12-1.fc38.copr6877523. 18 MB/s | 2.0 MB 00:00 (7/265): R-CRAN-bit64-4.0.5-1.fc38.copr5815652. 23 MB/s | 540 kB 00:00 (8/265): R-CRAN-bit-4.0.5-1.fc38.copr5812166.x8 30 MB/s | 1.1 MB 00:00 (9/265): R-CRAN-cli-3.6.2-1.fc38.copr6742501.x8 34 MB/s | 1.3 MB 00:00 (10/265): R-CRAN-clipr-0.8.0-1.fc38.copr5812155 1.9 MB/s | 63 kB 00:00 (11/265): R-CRAN-colorspace-2.1.0-1.fc38.copr58 34 MB/s | 2.4 MB 00:00 (12/265): R-CRAN-crayon-1.5.2-1.fc38.copr581213 3.4 MB/s | 182 kB 00:00 (13/265): R-CRAN-dplyr-1.1.4-1.fc38.copr6663981 37 MB/s | 1.5 MB 00:00 (14/265): R-CRAN-fansi-1.0.6-1.fc38.copr6735917 6.2 MB/s | 341 kB 00:00 (15/265): R-CRAN-farver-2.1.1-1.fc38.copr581219 19 MB/s | 1.3 MB 00:00 (16/265): R-CRAN-generics-0.1.3-1.fc38.copr5812 1.7 MB/s | 99 kB 00:00 (17/265): R-CRAN-data.tree-1.1.0-1.fc38.copr662 6.9 MB/s | 1.2 MB 00:00 (18/265): R-CRAN-glue-1.7.0-1.fc38.copr6877494. 9.1 MB/s | 166 kB 00:00 (19/265): R-CRAN-gtable-0.3.4-1.fc38.copr652358 3.8 MB/s | 232 kB 00:00 (20/265): R-CRAN-ggplot2-3.5.0-1.fc38.copr73067 41 MB/s | 4.6 MB 00:00 (21/265): R-CRAN-gtools-3.9.5-1.fc38.copr667212 3.9 MB/s | 389 kB 00:00 (22/265): R-CRAN-hms-1.1.3-1.fc38.copr5819459.n 2.4 MB/s | 112 kB 00:00 (23/265): R-CRAN-labeling-0.4.3-1.fc38.copr6354 3.1 MB/s | 77 kB 00:00 (24/265): R-CRAN-isoband-0.2.7-1.fc38.copr58132 31 MB/s | 1.6 MB 00:00 (25/265): R-CRAN-lattice-0.22.6-1.fc38.copr7307 18 MB/s | 1.4 MB 00:00 (26/265): R-CRAN-lifecycle-1.0.4-1.fc38.copr661 2.3 MB/s | 131 kB 00:00 (27/265): R-CRAN-lpSolve-5.6.20-1.fc38.copr6739 11 MB/s | 363 kB 00:00 (28/265): R-CRAN-magrittr-2.0.3-1.fc38.copr5812 13 MB/s | 222 kB 00:00 (29/265): R-CRAN-munsell-0.5.1-1.fc38.copr73067 6.3 MB/s | 251 kB 00:00 (30/265): R-CRAN-mgcv-1.9.1-1.fc38.copr6775870. 48 MB/s | 3.3 MB 00:00 (31/265): R-CRAN-nlme-3.1.164-1.fc38.copr670096 16 MB/s | 2.4 MB 00:00 (32/265): R-CRAN-patchwork-1.2.0-1.fc38.copr687 18 MB/s | 3.1 MB 00:00 (33/265): R-CRAN-pillar-1.9.0-1.fc38.copr581945 4.3 MB/s | 624 kB 00:00 (34/265): R-CRAN-pkgconfig-2.0.3-3.fc38.copr581 625 kB/s | 30 kB 00:00 (35/265): R-CRAN-purrr-1.0.2-1.fc38.copr6264939 30 MB/s | 546 kB 00:00 (36/265): R-CRAN-readr-2.1.5-1.fc38.copr6880950 19 MB/s | 785 kB 00:00 (37/265): R-CRAN-rlang-1.1.3-1.fc38.copr6880930 34 MB/s | 1.7 MB 00:00 (38/265): R-CRAN-scales-1.3.0-1.fc38.copr670401 20 MB/s | 705 kB 00:00 (39/265): R-CRAN-stringi-1.8.3-1.fc38.copr67425 42 MB/s | 997 kB 00:00 (40/265): R-CRAN-stringr-1.5.1-1.fc38.copr66369 19 MB/s | 320 kB 00:00 (41/265): R-CRAN-tibble-3.2.1-1.fc38.copr582116 35 MB/s | 632 kB 00:00 (42/265): R-CRAN-tidyselect-1.2.1-1.fc38.copr73 13 MB/s | 232 kB 00:00 (43/265): R-CRAN-tidyr-1.3.1-1.fc38.copr6948918 45 MB/s | 1.1 MB 00:00 (44/265): R-CRAN-tzdb-0.4.0-1.fc38.copr5915135. 25 MB/s | 530 kB 00:00 (45/265): R-CRAN-utf8-1.2.4-1.fc38.copr6555966. 14 MB/s | 151 kB 00:00 (46/265): R-CRAN-vctrs-0.6.5-1.fc38.copr6715464 45 MB/s | 1.3 MB 00:00 (47/265): R-CRAN-viridisLite-0.4.2-1.fc38.copr5 21 MB/s | 1.2 MB 00:00 (48/265): R-CRAN-vroom-1.6.5-1.fc38.copr6727750 13 MB/s | 844 kB 00:00 (49/265): R-CRAN-withr-3.0.0-1.fc38.copr6911503 4.4 MB/s | 268 kB 00:00 (50/265): R-CRAN-yaml-2.3.8-1.fc38.copr6742560. 4.8 MB/s | 124 kB 00:00 (51/265): R-CRAN-zoo-1.8.12-1.fc38.copr5815602. 15 MB/s | 1.0 MB 00:00 (52/265): R-rpm-macros-1.2.1-6.fc38.noarch.rpm 74 kB/s | 11 kB 00:00 (53/265): brotli-devel-1.0.9-11.fc38.x86_64.rpm 138 kB/s | 31 kB 00:00 (54/265): copy-jdk-configs-4.1-2.fc38.noarch.rp 370 kB/s | 28 kB 00:00 (55/265): brotli-1.0.9-11.fc38.x86_64.rpm 372 kB/s | 316 kB 00:00 (56/265): desktop-file-utils-0.26-8.fc38.x86_64 474 kB/s | 71 kB 00:00 (57/265): fonts-filesystem-2.0.5-11.fc38.noarch 109 kB/s | 8.1 kB 00:00 (58/265): crypto-policies-scripts-20230301-1.gi 117 kB/s | 116 kB 00:00 (59/265): bzip2-devel-1.0.8-13.fc38.x86_64.rpm 167 kB/s | 214 kB 00:01 (60/265): freetype-2.13.0-2.fc38.x86_64.rpm 575 kB/s | 414 kB 00:00 (61/265): fribidi-1.0.12-3.fc38.x86_64.rpm 238 kB/s | 89 kB 00:00 (62/265): gc-8.2.2-3.fc38.x86_64.rpm 492 kB/s | 110 kB 00:00 (63/265): gettext-envsubst-0.21.1-2.fc38.x86_64 486 kB/s | 36 kB 00:00 (64/265): gettext-libs-0.21.1-2.fc38.x86_64.rpm 704 kB/s | 320 kB 00:00 (65/265): gettext-runtime-0.21.1-2.fc38.x86_64. 524 kB/s | 117 kB 00:00 (66/265): graphite2-1.3.14-11.fc38.x86_64.rpm 631 kB/s | 95 kB 00:00 (67/265): graphite2-devel-1.3.14-11.fc38.x86_64 271 kB/s | 20 kB 00:00 (68/265): freetype-devel-2.13.0-2.fc38.x86_64.r 252 kB/s | 945 kB 00:03 (69/265): gettext-0.21.1-2.fc38.x86_64.rpm 274 kB/s | 1.0 MB 00:03 (70/265): groff-base-1.22.4-11.fc38.x86_64.rpm 280 kB/s | 1.1 MB 00:03 (71/265): harfbuzz-7.1.0-1.fc38.x86_64.rpm 410 kB/s | 889 kB 00:02 (72/265): harfbuzz-icu-7.1.0-1.fc38.x86_64.rpm 216 kB/s | 16 kB 00:00 (73/265): javapackages-filesystem-6.1.0-7.fc38. 168 kB/s | 13 kB 00:00 (74/265): jbigkit-libs-2.1-25.fc38.x86_64.rpm 355 kB/s | 53 kB 00:00 (75/265): harfbuzz-devel-7.1.0-1.fc38.x86_64.rp 349 kB/s | 445 kB 00:01 (76/265): libICE-1.0.10-10.fc38.x86_64.rpm 472 kB/s | 71 kB 00:00 (77/265): libSM-1.2.3-12.fc38.x86_64.rpm 277 kB/s | 41 kB 00:00 (78/265): libXau-1.0.11-2.fc38.x86_64.rpm 420 kB/s | 32 kB 00:00 (79/265): libXau-devel-1.0.11-2.fc38.x86_64.rpm 181 kB/s | 14 kB 00:00 (80/265): libXcomposite-0.4.5-9.fc38.x86_64.rpm 309 kB/s | 23 kB 00:00 (81/265): libXext-1.3.5-2.fc38.x86_64.rpm 261 kB/s | 39 kB 00:00 (82/265): libXmu-1.1.4-2.fc38.x86_64.rpm 505 kB/s | 77 kB 00:00 (83/265): libXrender-0.9.11-2.fc38.x86_64.rpm 362 kB/s | 27 kB 00:00 (84/265): libXrender-devel-0.9.11-2.fc38.x86_64 252 kB/s | 19 kB 00:00 (85/265): libXtst-1.2.4-2.fc38.x86_64.rpm 271 kB/s | 20 kB 00:00 (86/265): libb2-0.98.1-8.fc38.x86_64.rpm 341 kB/s | 25 kB 00:00 (87/265): libblkid-devel-2.38.1-4.fc38.x86_64.r 218 kB/s | 16 kB 00:00 (88/265): libdatrie-0.2.13-5.fc38.x86_64.rpm 426 kB/s | 32 kB 00:00 (89/265): libffi-devel-3.4.4-2.fc38.x86_64.rpm 379 kB/s | 29 kB 00:00 (90/265): libXt-1.2.1-4.fc38.x86_64.rpm 398 kB/s | 179 kB 00:00 (91/265): libfontenc-1.1.6-2.fc38.x86_64.rpm 427 kB/s | 32 kB 00:00 (92/265): libicu-devel-72.1-2.fc38.x86_64.rpm 586 kB/s | 918 kB 00:01 (93/265): libjpeg-turbo-2.1.4-2.fc38.x86_64.rpm 611 kB/s | 183 kB 00:00 (94/265): liblerc-4.0.0-3.fc38.x86_64.rpm 542 kB/s | 202 kB 00:00 (95/265): libmount-devel-2.38.1-4.fc38.x86_64.r 236 kB/s | 18 kB 00:00 (96/265): libmpc-1.3.1-2.fc38.x86_64.rpm 472 kB/s | 70 kB 00:00 (97/265): libpng-1.6.37-14.fc38.x86_64.rpm 534 kB/s | 120 kB 00:00 (98/265): libpng-devel-1.6.37-14.fc38.x86_64.rp 650 kB/s | 291 kB 00:00 (99/265): libselinux-devel-3.5-1.fc38.x86_64.rp 673 kB/s | 151 kB 00:00 (100/265): libsepol-devel-3.5-1.fc38.x86_64.rpm 649 kB/s | 49 kB 00:00 (101/265): libthai-0.1.29-4.fc38.x86_64.rpm 712 kB/s | 213 kB 00:00 (102/265): libtool-ltdl-2.4.7-6.fc38.x86_64.rpm 487 kB/s | 37 kB 00:00 (103/265): libxcb-1.13.1-11.fc38.x86_64.rpm 614 kB/s | 231 kB 00:00 (104/265): libxcb-devel-1.13.1-11.fc38.x86_64.r 833 kB/s | 1.4 MB 00:01 (105/265): guile22-2.2.7-7.fc38.x86_64.rpm 667 kB/s | 6.5 MB 00:10 (106/265): lksctp-tools-1.0.19-3.fc38.x86_64.rp 610 kB/s | 92 kB 00:00 (107/265): lua-5.4.4-9.fc38.x86_64.rpm 844 kB/s | 190 kB 00:00 (108/265): mkfontscale-1.2.2-3.fc38.x86_64.rpm 430 kB/s | 32 kB 00:00 (109/265): lua-posix-35.1-5.fc38.x86_64.rpm 617 kB/s | 138 kB 00:00 (110/265): mpdecimal-2.5.1-6.fc38.x86_64.rpm 587 kB/s | 89 kB 00:00 (111/265): openblas-0.3.21-4.fc38.x86_64.rpm 432 kB/s | 35 kB 00:00 (112/265): nettle-3.8-3.fc38.x86_64.rpm 173 kB/s | 412 kB 00:02 (113/265): openblas-openmp-0.3.21-4.fc38.x86_64 732 kB/s | 5.1 MB 00:07 (114/265): pango-1.50.14-1.fc38.x86_64.rpm 154 kB/s | 342 kB 00:02 (115/265): libicu-72.1-2.fc38.x86_64.rpm 577 kB/s | 10 MB 00:18 (116/265): pcre2-utf16-10.42-1.fc38.1.x86_64.rp 358 kB/s | 214 kB 00:00 (117/265): pcre2-devel-10.42-1.fc38.1.x86_64.rp 141 kB/s | 506 kB 00:03 (118/265): pcre2-utf32-10.42-1.fc38.1.x86_64.rp 376 kB/s | 201 kB 00:00 (119/265): perl-Carp-1.52-490.fc38.noarch.rpm 193 kB/s | 29 kB 00:00 (120/265): perl-Data-Dumper-2.184-491.fc38.x86_ 376 kB/s | 56 kB 00:00 (121/265): perl-Digest-1.20-490.fc38.noarch.rpm 166 kB/s | 25 kB 00:00 (122/265): perl-Digest-MD5-2.58-490.fc38.x86_64 216 kB/s | 36 kB 00:00 (123/265): perl-Exporter-5.77-490.fc38.noarch.r 411 kB/s | 31 kB 00:00 (124/265): perl-File-Path-2.18-490.fc38.noarch. 235 kB/s | 35 kB 00:00 (125/265): perl-File-Temp-0.231.100-490.fc38.no 393 kB/s | 59 kB 00:00 (126/265): perl-Getopt-Long-2.54-2.fc38.noarch. 400 kB/s | 60 kB 00:00 (127/265): perl-IO-Socket-IP-0.41-492.fc38.noar 277 kB/s | 41 kB 00:00 (128/265): perl-IO-Socket-SSL-2.081-1.fc38.noar 434 kB/s | 227 kB 00:00 (129/265): perl-MIME-Base64-3.16-490.fc38.x86_6 394 kB/s | 30 kB 00:00 (130/265): perl-Mozilla-CA-20221114-2.fc38.noar 67 kB/s | 12 kB 00:00 (131/265): perl-Net-SSLeay-1.92-5.fc38.x86_64.r 260 kB/s | 361 kB 00:01 (132/265): perl-PathTools-3.84-490.fc38.x86_64. 232 kB/s | 87 kB 00:00 (133/265): openblas-openmp64-0.3.21-4.fc38.x86_ 352 kB/s | 4.9 MB 00:14 (134/265): perl-Pod-Escapes-1.07-490.fc38.noarc 260 kB/s | 20 kB 00:00 (135/265): perl-Pod-Perldoc-3.28.01-491.fc38.no 230 kB/s | 86 kB 00:00 (136/265): perl-Pod-Usage-2.03-4.fc38.noarch.rp 266 kB/s | 40 kB 00:00 (137/265): perl-Pod-Simple-3.43-491.fc38.noarch 294 kB/s | 219 kB 00:00 (138/265): perl-Scalar-List-Utils-1.63-490.fc38 243 kB/s | 72 kB 00:00 (139/265): perl-Socket-2.036-2.fc38.x86_64.rpm 246 kB/s | 55 kB 00:00 (140/265): perl-Term-ANSIColor-5.01-491.fc38.no 318 kB/s | 47 kB 00:00 (141/265): perl-Storable-3.26-490.fc38.x86_64.r 260 kB/s | 97 kB 00:00 (142/265): perl-Term-Cap-1.18-1.fc38.noarch.rpm 291 kB/s | 22 kB 00:00 (143/265): perl-Text-ParseWords-3.31-490.fc38.n 217 kB/s | 16 kB 00:00 (144/265): perl-Time-Local-1.300-490.fc38.noarc 223 kB/s | 33 kB 00:00 (145/265): perl-constant-1.33-491.fc38.noarch.r 303 kB/s | 23 kB 00:00 (146/265): perl-URI-5.17-2.fc38.noarch.rpm 322 kB/s | 120 kB 00:00 (147/265): perl-parent-0.241-1.fc38.noarch.rpm 194 kB/s | 15 kB 00:00 (148/265): perl-libnet-3.15-1.fc38.noarch.rpm 345 kB/s | 128 kB 00:00 (149/265): perl-podlators-5.01-2.fc38.noarch.rp 337 kB/s | 125 kB 00:00 (150/265): perl-Encode-3.19-493.fc38.x86_64.rpm 293 kB/s | 1.7 MB 00:05 (151/265): pixman-0.42.2-1.fc38.x86_64.rpm 383 kB/s | 285 kB 00:00 (152/265): sysprof-capture-devel-3.48.0-1.fc38. 386 kB/s | 58 kB 00:00 (153/265): tcl-devel-8.6.12-4.fc38.x86_64.rpm 393 kB/s | 169 kB 00:00 (154/265): python-setuptools-wheel-65.5.1-2.fc3 125 kB/s | 715 kB 00:05 (155/265): tcl-8.6.12-4.fc38.x86_64.rpm 167 kB/s | 1.1 MB 00:06 (156/265): tre-0.8.0-39.20140228gitc2f5d13.fc38 289 kB/s | 43 kB 00:00 (157/265): tre-common-0.8.0-39.20140228gitc2f5d 210 kB/s | 31 kB 00:00 (158/265): tre-devel-0.8.0-39.20140228gitc2f5d1 159 kB/s | 12 kB 00:00 (159/265): ttmkfdir-3.0.9-67.fc38.x86_64.rpm 243 kB/s | 54 kB 00:00 (160/265): xclip-0.13-19.git11cba61.fc38.x86_64 246 kB/s | 37 kB 00:00 (161/265): xml-common-0.6.3-60.fc38.noarch.rpm 208 kB/s | 31 kB 00:00 (162/265): tk-8.6.12-4.fc38.x86_64.rpm 215 kB/s | 1.6 MB 00:07 (163/265): tk-devel-8.6.12-4.fc38.x86_64.rpm 173 kB/s | 538 kB 00:03 (164/265): xz-devel-5.4.1-1.fc38.x86_64.rpm 219 kB/s | 65 kB 00:00 (165/265): zlib-devel-1.2.13-3.fc38.x86_64.rpm 201 kB/s | 45 kB 00:00 (166/265): xorg-x11-proto-devel-2022.2-3.fc38.n 401 kB/s | 299 kB 00:00 (167/265): xorg-x11-fonts-Type1-7.5-35.fc38.noa 397 kB/s | 505 kB 00:01 (168/265): R-devel-4.3.3-1.fc38.x86_64.rpm 71 kB/s | 10 kB 00:00 (169/265): R-java-4.3.3-1.fc38.x86_64.rpm 151 kB/s | 11 kB 00:00 (170/265): R-java-devel-4.3.3-1.fc38.x86_64.rpm 144 kB/s | 10 kB 00:00 (171/265): R-core-devel-4.3.3-1.fc38.x86_64.rpm 264 kB/s | 94 kB 00:00 (172/265): R-littler-0.3.19-1.fc38.x86_64.rpm 361 kB/s | 76 kB 00:00 (173/265): alsa-lib-1.2.11-2.fc38.x86_64.rpm 2.1 MB/s | 520 kB 00:00 (174/265): annobin-docs-12.40-1.fc38.noarch.rpm 1.2 MB/s | 87 kB 00:00 (175/265): avahi-libs-0.8-22.fc38.x86_64.rpm 875 kB/s | 66 kB 00:00 (176/265): annobin-plugin-gcc-12.40-1.fc38.x86_ 6.1 MB/s | 955 kB 00:00 (177/265): cmake-filesystem-3.27.7-1.fc38.x86_6 263 kB/s | 19 kB 00:00 (178/265): cairo-1.17.8-4.fc38.x86_64.rpm 3.2 MB/s | 704 kB 00:00 (179/265): cups-libs-2.4.7-11.fc38.x86_64.rpm 3.5 MB/s | 268 kB 00:00 (180/265): dbus-libs-1.14.10-1.fc38.x86_64.rpm 2.1 MB/s | 156 kB 00:00 (181/265): emacs-filesystem-29.3-1.fc38.noarch. 101 kB/s | 7.2 kB 00:00 (182/265): expat-2.6.0-1.fc38.x86_64.rpm 1.5 MB/s | 112 kB 00:00 (183/265): flexiblas-3.4.2-1.fc38.x86_64.rpm 354 kB/s | 25 kB 00:00 (184/265): cpp-13.2.1-7.fc38.x86_64.rpm 21 MB/s | 11 MB 00:00 (185/265): flexiblas-devel-3.4.2-1.fc38.x86_64. 1.5 MB/s | 121 kB 00:00 (186/265): flexiblas-netlib-3.4.2-1.fc38.x86_64 14 MB/s | 3.1 MB 00:00 (187/265): flexiblas-netlib64-3.4.2-1.fc38.x86_ 13 MB/s | 3.0 MB 00:00 (188/265): flexiblas-openblas-openmp64-3.4.2-1. 247 kB/s | 17 kB 00:00 (189/265): flexiblas-openblas-openmp-3.4.2-1.fc 242 kB/s | 17 kB 00:00 (190/265): fontconfig-devel-2.14.2-2.fc38.x86_6 2.1 MB/s | 163 kB 00:00 (191/265): fontconfig-2.14.2-2.fc38.x86_64.rpm 3.7 MB/s | 295 kB 00:00 (192/265): gcc-c++-13.2.1-7.fc38.x86_64.rpm 20 MB/s | 13 MB 00:00 (193/265): gcc-gfortran-13.2.1-7.fc38.x86_64.rp 16 MB/s | 12 MB 00:00 (194/265): gcc-plugin-annobin-13.2.1-7.fc38.x86 734 kB/s | 52 kB 00:00 (195/265): R-core-4.3.3-1.fc38.x86_64.rpm 18 MB/s | 64 MB 00:03 (196/265): glib2-devel-2.76.6-1.fc38.x86_64.rpm 6.9 MB/s | 586 kB 00:00 (197/265): glibc-devel-2.37-18.fc38.x86_64.rpm 760 kB/s | 54 kB 00:00 (198/265): gcc-13.2.1-7.fc38.x86_64.rpm 18 MB/s | 34 MB 00:01 (199/265): glibc-headers-x86-2.37-18.fc38.noarc 6.9 MB/s | 536 kB 00:00 (200/265): google-noto-fonts-common-20230201-2. 229 kB/s | 16 kB 00:00 (201/265): gnutls-3.8.4-1.fc38.x86_64.rpm 7.6 MB/s | 1.1 MB 00:00 (202/265): google-noto-sans-vf-fonts-20230201-2 7.3 MB/s | 579 kB 00:00 (203/265): java-17-openjdk-17.0.9.0.9-3.fc38.x8 4.1 MB/s | 407 kB 00:00 (204/265): java-17-openjdk-devel-17.0.9.0.9-3.f 19 MB/s | 4.7 MB 00:00 (205/265): glib2-2.76.6-1.fc38.x86_64.rpm 3.2 MB/s | 2.8 MB 00:00 (206/265): kernel-headers-6.8.3-100.fc38.x86_64 18 MB/s | 1.6 MB 00:00 (207/265): langpacks-core-font-en-3.0-32.fc38.n 137 kB/s | 9.6 kB 00:00 (208/265): libRmath-4.3.3-1.fc38.x86_64.rpm 1.7 MB/s | 122 kB 00:00 (209/265): libRmath-devel-4.3.3-1.fc38.x86_64.r 222 kB/s | 16 kB 00:00 (210/265): libX11-common-1.8.7-1.fc38.noarch.rp 2.3 MB/s | 176 kB 00:00 (211/265): libX11-1.8.7-1.fc38.x86_64.rpm 7.8 MB/s | 650 kB 00:00 (212/265): libX11-xcb-1.8.7-1.fc38.x86_64.rpm 164 kB/s | 12 kB 00:00 (213/265): libX11-devel-1.8.7-1.fc38.x86_64.rpm 7.2 MB/s | 1.0 MB 00:00 (214/265): libXft-2.3.8-2.fc38.x86_64.rpm 1.0 MB/s | 72 kB 00:00 (215/265): libXft-devel-2.3.8-2.fc38.x86_64.rpm 704 kB/s | 50 kB 00:00 (216/265): libXi-1.8.1-1.fc38.x86_64.rpm 534 kB/s | 40 kB 00:00 (217/265): libgfortran-13.2.1-7.fc38.x86_64.rpm 11 MB/s | 910 kB 00:00 (218/265): libquadmath-13.2.1-7.fc38.x86_64.rpm 2.6 MB/s | 200 kB 00:00 (219/265): libquadmath-devel-13.2.1-7.fc38.x86_ 581 kB/s | 41 kB 00:00 (220/265): libtiff-4.4.0-8.fc38.x86_64.rpm 2.6 MB/s | 201 kB 00:00 (221/265): libstdc++-devel-13.2.1-7.fc38.x86_64 12 MB/s | 2.6 MB 00:00 (222/265): libtirpc-devel-1.3.4-1.rc3.fc38.x86_ 1.6 MB/s | 124 kB 00:00 (223/265): libxcrypt-devel-4.4.36-1.fc38.x86_64 416 kB/s | 30 kB 00:00 (224/265): libwebp-1.3.2-2.fc38.x86_64.rpm 3.7 MB/s | 284 kB 00:00 (225/265): libxml2-devel-2.10.4-1.fc38.x86_64.r 6.6 MB/s | 531 kB 00:00 (226/265): make-4.4.1-1.fc38.x86_64.rpm 7.0 MB/s | 588 kB 00:00 (227/265): ncurses-6.4-7.20230520.fc38.1.x86_64 5.4 MB/s | 415 kB 00:00 (228/265): nspr-4.35.0-17.fc38.x86_64.rpm 1.8 MB/s | 137 kB 00:00 (229/265): nss-softokn-3.99.0-1.fc38.x86_64.rpm 5.2 MB/s | 419 kB 00:00 (230/265): nss-3.99.0-1.fc38.x86_64.rpm 8.2 MB/s | 703 kB 00:00 (231/265): nss-softokn-freebl-3.99.0-1.fc38.x86 4.8 MB/s | 381 kB 00:00 (232/265): nss-sysinit-3.99.0-1.fc38.x86_64.rpm 239 kB/s | 18 kB 00:00 (233/265): perl-AutoLoader-5.74-498.fc38.noarch 71 kB/s | 22 kB 00:00 (234/265): perl-B-1.83-498.fc38.x86_64.rpm 2.4 MB/s | 182 kB 00:00 (235/265): perl-Class-Struct-0.66-498.fc38.noar 319 kB/s | 23 kB 00:00 (236/265): perl-DynaLoader-1.52-498.fc38.x86_64 374 kB/s | 27 kB 00:00 (237/265): perl-Errno-1.36-498.fc38.x86_64.rpm 211 kB/s | 15 kB 00:00 (238/265): nss-util-3.99.0-1.fc38.x86_64.rpm 145 kB/s | 87 kB 00:00 (239/265): perl-Fcntl-1.15-498.fc38.x86_64.rpm 239 kB/s | 21 kB 00:00 (240/265): perl-File-Basename-2.85-498.fc38.noa 203 kB/s | 18 kB 00:00 (241/265): perl-File-stat-1.12-498.fc38.noarch. 249 kB/s | 18 kB 00:00 (242/265): perl-FileHandle-2.03-498.fc38.noarch 225 kB/s | 16 kB 00:00 (243/265): perl-HTTP-Tiny-0.086-2.fc38.noarch.r 774 kB/s | 55 kB 00:00 (244/265): perl-Getopt-Std-1.13-498.fc38.noarch 225 kB/s | 16 kB 00:00 (245/265): perl-IO-1.50-498.fc38.x86_64.rpm 1.2 MB/s | 92 kB 00:00 (246/265): perl-IPC-Open3-1.22-498.fc38.noarch. 317 kB/s | 23 kB 00:00 (247/265): perl-SelectSaver-1.02-498.fc38.noarc 172 kB/s | 12 kB 00:00 (248/265): perl-POSIX-2.03-498.fc38.x86_64.rpm 1.3 MB/s | 98 kB 00:00 (249/265): perl-Symbol-1.09-498.fc38.noarch.rpm 148 kB/s | 15 kB 00:00 (250/265): perl-Text-Tabs+Wrap-2023.0511-1.fc38 226 kB/s | 22 kB 00:00 (251/265): perl-base-2.27-498.fc38.noarch.rpm 198 kB/s | 17 kB 00:00 (252/265): perl-if-0.61.000-498.fc38.noarch.rpm 171 kB/s | 15 kB 00:00 (253/265): perl-interpreter-5.36.3-498.fc38.x86 885 kB/s | 73 kB 00:00 (254/265): perl-locale-1.10-498.fc38.noarch.rpm 147 kB/s | 14 kB 00:00 (255/265): perl-mro-1.26-498.fc38.x86_64.rpm 386 kB/s | 29 kB 00:00 (256/265): perl-libs-5.36.3-498.fc38.x86_64.rpm 7.6 MB/s | 2.2 MB 00:00 (257/265): perl-overload-1.35-498.fc38.noarch.r 650 kB/s | 46 kB 00:00 (258/265): perl-overloading-0.02-498.fc38.noarc 190 kB/s | 13 kB 00:00 (259/265): perl-vars-1.05-498.fc38.noarch.rpm 191 kB/s | 14 kB 00:00 (260/265): python3-3.11.8-2.fc38.x86_64.rpm 397 kB/s | 28 kB 00:00 (261/265): python-pip-wheel-22.3.1-3.fc38.noarc 8.1 MB/s | 1.4 MB 00:00 (262/265): tzdata-java-2024a-1.fc38.noarch.rpm 2.7 MB/s | 207 kB 00:00 (263/265): xdg-utils-1.1.3-15.fc38.noarch.rpm 1.0 MB/s | 77 kB 00:00 (264/265): python3-libs-3.11.8-2.fc38.x86_64.rp 19 MB/s | 9.6 MB 00:00 (265/265): java-17-openjdk-headless-17.0.9.0.9- 11 MB/s | 44 MB 00:04 -------------------------------------------------------------------------------- Total 6.2 MB/s | 333 MB 00:53 Running transaction check Transaction check succeeded. Running transaction test Transaction test succeeded. Running transaction Running scriptlet: copy-jdk-configs-4.1-2.fc38.noarch 1/1 Running scriptlet: java-17-openjdk-headless-1:17.0.9.0.9-3.fc38.x86_64 1/1 Preparing : 1/1 Installing : zlib-devel-1.2.13-3.fc38.x86_64 1/265 Installing : nspr-4.35.0-17.fc38.x86_64 2/265 Installing : libgfortran-13.2.1-7.fc38.x86_64 3/265 Installing : nss-util-3.99.0-1.fc38.x86_64 4/265 Installing : libquadmath-13.2.1-7.fc38.x86_64 5/265 Installing : xorg-x11-proto-devel-2022.2-3.fc38.noarch 6/265 Installing : libpng-2:1.6.37-14.fc38.x86_64 7/265 Installing : libmpc-1.3.1-2.fc38.x86_64 8/265 Installing : libicu-72.1-2.fc38.x86_64 9/265 Installing : tcl-1:8.6.12-4.fc38.x86_64 10/265 Installing : tcl-devel-1:8.6.12-4.fc38.x86_64 11/265 Installing : libicu-devel-72.1-2.fc38.x86_64 12/265 Installing : libRmath-4.3.3-1.fc38.x86_64 13/265 Installing : xz-devel-5.4.1-1.fc38.x86_64 14/265 Installing : openblas-0.3.21-4.fc38.x86_64 15/265 Installing : libjpeg-turbo-2.1.4-2.fc38.x86_64 16/265 Installing : libXau-1.0.11-2.fc38.x86_64 17/265 Installing : libxcb-1.13.1-11.fc38.x86_64 18/265 Installing : libICE-1.0.10-10.fc38.x86_64 19/265 Installing : graphite2-1.3.14-11.fc38.x86_64 20/265 Installing : gettext-libs-0.21.1-2.fc38.x86_64 21/265 Installing : fonts-filesystem-1:2.0.5-11.fc38.noarch 22/265 Installing : bzip2-devel-1.0.8-13.fc38.x86_64 23/265 Installing : graphite2-devel-1.3.14-11.fc38.x86_64 24/265 Installing : libSM-1.2.3-12.fc38.x86_64 25/265 Installing : libXau-devel-1.0.11-2.fc38.x86_64 26/265 Installing : libxcb-devel-1.13.1-11.fc38.x86_64 27/265 Installing : openblas-openmp-0.3.21-4.fc38.x86_64 28/265 Installing : openblas-openmp64-0.3.21-4.fc38.x86_64 29/265 Installing : flexiblas-netlib64-3.4.2-1.fc38.x86_64 30/265 Installing : flexiblas-netlib-3.4.2-1.fc38.x86_64 31/265 Installing : flexiblas-openblas-openmp-3.4.2-1.fc38.x86_64 32/265 Installing : flexiblas-3.4.2-1.fc38.x86_64 33/265 Installing : flexiblas-openblas-openmp64-3.4.2-1.fc38.x86_64 34/265 Installing : flexiblas-devel-3.4.2-1.fc38.x86_64 35/265 Installing : libRmath-devel-4.3.3-1.fc38.x86_64 36/265 Installing : cpp-13.2.1-7.fc38.x86_64 37/265 Installing : libpng-devel-2:1.6.37-14.fc38.x86_64 38/265 Installing : nss-softokn-freebl-3.99.0-1.fc38.x86_64 39/265 Installing : nss-softokn-3.99.0-1.fc38.x86_64 40/265 Installing : tzdata-java-2024a-1.fc38.noarch 41/265 Installing : python-pip-wheel-22.3.1-3.fc38.noarch 42/265 Installing : ncurses-6.4-7.20230520.fc38.1.x86_64 43/265 Installing : libwebp-1.3.2-2.fc38.x86_64 44/265 Installing : libtirpc-devel-1.3.4-1.rc3.fc38.x86_64 45/265 Installing : libstdc++-devel-13.2.1-7.fc38.x86_64 46/265 Installing : libX11-xcb-1.8.7-1.fc38.x86_64 47/265 Installing : libX11-common-1.8.7-1.fc38.noarch 48/265 Installing : libX11-1.8.7-1.fc38.x86_64 49/265 Installing : libXext-1.3.5-2.fc38.x86_64 50/265 Installing : libXrender-0.9.11-2.fc38.x86_64 51/265 Installing : libX11-devel-1.8.7-1.fc38.x86_64 52/265 Installing : libXi-1.8.1-1.fc38.x86_64 53/265 Installing : libXt-1.2.1-4.fc38.x86_64 54/265 Installing : libXmu-1.1.4-2.fc38.x86_64 55/265 Installing : xclip-0.13-19.git11cba61.fc38.x86_64 56/265 Installing : libXtst-1.2.4-2.fc38.x86_64 57/265 Installing : libXrender-devel-0.9.11-2.fc38.x86_64 58/265 Installing : libXcomposite-0.4.5-9.fc38.x86_64 59/265 Installing : kernel-headers-6.8.3-100.fc38.x86_64 60/265 Installing : google-noto-fonts-common-20230201-2.fc38.noarch 61/265 Installing : google-noto-sans-vf-fonts-20230201-2.fc38.noarch 62/265 Installing : langpacks-core-font-en-3.0-32.fc38.noarch 63/265 Installing : glibc-headers-x86-2.37-18.fc38.noarch 64/265 Installing : libxcrypt-devel-4.4.36-1.fc38.x86_64 65/265 Installing : glibc-devel-2.37-18.fc38.x86_64 66/265 Installing : expat-2.6.0-1.fc38.x86_64 67/265 Installing : emacs-filesystem-1:29.3-1.fc38.noarch 68/265 Installing : dbus-libs-1:1.14.10-1.fc38.x86_64 69/265 Installing : avahi-libs-0.8-22.fc38.x86_64 70/265 Installing : cmake-filesystem-3.27.7-1.fc38.x86_64 71/265 Installing : libxml2-devel-2.10.4-1.fc38.x86_64 72/265 Installing : annobin-docs-12.40-1.fc38.noarch 73/265 Installing : alsa-lib-1.2.11-2.fc38.x86_64 74/265 Running scriptlet: xml-common-0.6.3-60.fc38.noarch 75/265 Installing : xml-common-0.6.3-60.fc38.noarch 75/265 Installing : tre-common-0.8.0-39.20140228gitc2f5d13.fc38.noar 76/265 Installing : tre-0.8.0-39.20140228gitc2f5d13.fc38.x86_64 77/265 Installing : tre-devel-0.8.0-39.20140228gitc2f5d13.fc38.x86_6 78/265 Installing : sysprof-capture-devel-3.48.0-1.fc38.x86_64 79/265 Installing : python-setuptools-wheel-65.5.1-2.fc38.noarch 80/265 Installing : pixman-0.42.2-1.fc38.x86_64 81/265 Installing : pcre2-utf32-10.42-1.fc38.1.x86_64 82/265 Installing : pcre2-utf16-10.42-1.fc38.1.x86_64 83/265 Installing : pcre2-devel-10.42-1.fc38.1.x86_64 84/265 Installing : nettle-3.8-3.fc38.x86_64 85/265 Installing : gnutls-3.8.4-1.fc38.x86_64 86/265 Installing : glib2-2.76.6-1.fc38.x86_64 87/265 Installing : cairo-1.17.8-4.fc38.x86_64 88/265 Installing : harfbuzz-7.1.0-1.fc38.x86_64 89/265 Installing : freetype-2.13.0-2.fc38.x86_64 90/265 Installing : fontconfig-2.14.2-2.fc38.x86_64 91/265 Running scriptlet: fontconfig-2.14.2-2.fc38.x86_64 91/265 Installing : libXft-2.3.8-2.fc38.x86_64 92/265 Running scriptlet: tk-1:8.6.12-4.fc38.x86_64 93/265 Installing : tk-1:8.6.12-4.fc38.x86_64 93/265 Installing : ttmkfdir-3.0.9-67.fc38.x86_64 94/265 Installing : harfbuzz-icu-7.1.0-1.fc38.x86_64 95/265 Installing : desktop-file-utils-0.26-8.fc38.x86_64 96/265 Installing : xdg-utils-1.1.3-15.fc38.noarch 97/265 Installing : cups-libs-1:2.4.7-11.fc38.x86_64 98/265 Installing : mpdecimal-2.5.1-6.fc38.x86_64 99/265 Installing : lua-posix-35.1-5.fc38.x86_64 100/265 Installing : lua-5.4.4-9.fc38.x86_64 101/265 Installing : copy-jdk-configs-4.1-2.fc38.noarch 102/265 Installing : lksctp-tools-1.0.19-3.fc38.x86_64 103/265 Installing : libtool-ltdl-2.4.7-6.fc38.x86_64 104/265 Installing : libsepol-devel-3.5-1.fc38.x86_64 105/265 Installing : libselinux-devel-3.5-1.fc38.x86_64 106/265 Installing : liblerc-4.0.0-3.fc38.x86_64 107/265 Installing : libfontenc-1.1.6-2.fc38.x86_64 108/265 Installing : mkfontscale-1.2.2-3.fc38.x86_64 109/265 Installing : xorg-x11-fonts-Type1-7.5-35.fc38.noarch 110/265 Running scriptlet: xorg-x11-fonts-Type1-7.5-35.fc38.noarch 110/265 Installing : libffi-devel-3.4.4-2.fc38.x86_64 111/265 Installing : libdatrie-0.2.13-5.fc38.x86_64 112/265 Installing : libthai-0.1.29-4.fc38.x86_64 113/265 Installing : libblkid-devel-2.38.1-4.fc38.x86_64 114/265 Installing : libmount-devel-2.38.1-4.fc38.x86_64 115/265 Installing : libb2-0.98.1-8.fc38.x86_64 116/265 Installing : python3-3.11.8-2.fc38.x86_64 117/265 Installing : python3-libs-3.11.8-2.fc38.x86_64 118/265 Installing : crypto-policies-scripts-20230301-1.gita12f7b2.fc 119/265 Installing : nss-sysinit-3.99.0-1.fc38.x86_64 120/265 Installing : nss-3.99.0-1.fc38.x86_64 121/265 Running scriptlet: nss-3.99.0-1.fc38.x86_64 121/265 Installing : glib2-devel-2.76.6-1.fc38.x86_64 122/265 Installing : jbigkit-libs-2.1-25.fc38.x86_64 123/265 Installing : libtiff-4.4.0-8.fc38.x86_64 124/265 Installing : javapackages-filesystem-6.1.0-7.fc38.noarch 125/265 Installing : java-17-openjdk-headless-1:17.0.9.0.9-3.fc38.x86 126/265 Running scriptlet: java-17-openjdk-headless-1:17.0.9.0.9-3.fc38.x86 126/265 Installing : java-17-openjdk-1:17.0.9.0.9-3.fc38.x86_64 127/265 Running scriptlet: java-17-openjdk-1:17.0.9.0.9-3.fc38.x86_64 127/265 Installing : java-17-openjdk-devel-1:17.0.9.0.9-3.fc38.x86_64 128/265 Running scriptlet: java-17-openjdk-devel-1:17.0.9.0.9-3.fc38.x86_64 128/265 Running scriptlet: groff-base-1.22.4-11.fc38.x86_64 129/265 Installing : groff-base-1.22.4-11.fc38.x86_64 129/265 Running scriptlet: groff-base-1.22.4-11.fc38.x86_64 129/265 Installing : perl-Digest-1.20-490.fc38.noarch 130/265 Installing : perl-Digest-MD5-2.58-490.fc38.x86_64 131/265 Installing : perl-B-1.83-498.fc38.x86_64 132/265 Installing : perl-FileHandle-2.03-498.fc38.noarch 133/265 Installing : perl-Data-Dumper-2.184-491.fc38.x86_64 134/265 Installing : perl-libnet-3.15-1.fc38.noarch 135/265 Installing : perl-AutoLoader-5.74-498.fc38.noarch 136/265 Installing : perl-base-2.27-498.fc38.noarch 137/265 Installing : perl-URI-5.17-2.fc38.noarch 138/265 Installing : perl-Time-Local-2:1.300-490.fc38.noarch 139/265 Installing : perl-Mozilla-CA-20221114-2.fc38.noarch 140/265 Installing : perl-Text-Tabs+Wrap-2023.0511-1.fc38.noarch 141/265 Installing : perl-if-0.61.000-498.fc38.noarch 142/265 Installing : perl-locale-1.10-498.fc38.noarch 143/265 Installing : perl-IO-Socket-IP-0.41-492.fc38.noarch 144/265 Installing : perl-File-Path-2.18-490.fc38.noarch 145/265 Installing : perl-IO-Socket-SSL-2.081-1.fc38.noarch 146/265 Installing : perl-Net-SSLeay-1.92-5.fc38.x86_64 147/265 Installing : perl-Pod-Escapes-1:1.07-490.fc38.noarch 148/265 Installing : perl-Term-ANSIColor-5.01-491.fc38.noarch 149/265 Installing : perl-Class-Struct-0.66-498.fc38.noarch 150/265 Installing : perl-POSIX-2.03-498.fc38.x86_64 151/265 Installing : perl-IPC-Open3-1.22-498.fc38.noarch 152/265 Installing : perl-File-Temp-1:0.231.100-490.fc38.noarch 153/265 Installing : perl-HTTP-Tiny-0.086-2.fc38.noarch 154/265 Installing : perl-Term-Cap-1.18-1.fc38.noarch 155/265 Installing : perl-Pod-Simple-1:3.43-491.fc38.noarch 156/265 Installing : perl-Socket-4:2.036-2.fc38.x86_64 157/265 Installing : perl-SelectSaver-1.02-498.fc38.noarch 158/265 Installing : perl-Symbol-1.09-498.fc38.noarch 159/265 Installing : perl-File-stat-1.12-498.fc38.noarch 160/265 Installing : perl-podlators-1:5.01-2.fc38.noarch 161/265 Installing : perl-Pod-Perldoc-3.28.01-491.fc38.noarch 162/265 Installing : perl-Text-ParseWords-3.31-490.fc38.noarch 163/265 Installing : perl-Fcntl-1.15-498.fc38.x86_64 164/265 Installing : perl-mro-1.26-498.fc38.x86_64 165/265 Installing : perl-IO-1.50-498.fc38.x86_64 166/265 Installing : perl-overloading-0.02-498.fc38.noarch 167/265 Installing : perl-Pod-Usage-4:2.03-4.fc38.noarch 168/265 Installing : perl-MIME-Base64-3.16-490.fc38.x86_64 169/265 Installing : perl-Scalar-List-Utils-5:1.63-490.fc38.x86_64 170/265 Installing : perl-constant-1.33-491.fc38.noarch 171/265 Installing : perl-parent-1:0.241-1.fc38.noarch 172/265 Installing : perl-Errno-1.36-498.fc38.x86_64 173/265 Installing : perl-File-Basename-2.85-498.fc38.noarch 174/265 Installing : perl-Getopt-Std-1.13-498.fc38.noarch 175/265 Installing : perl-Storable-1:3.26-490.fc38.x86_64 176/265 Installing : perl-overload-1.35-498.fc38.noarch 177/265 Installing : perl-vars-1.05-498.fc38.noarch 178/265 Installing : perl-Getopt-Long-1:2.54-2.fc38.noarch 179/265 Installing : perl-Carp-1.52-490.fc38.noarch 180/265 Installing : perl-Exporter-5.77-490.fc38.noarch 181/265 Installing : perl-PathTools-3.84-490.fc38.x86_64 182/265 Installing : perl-DynaLoader-1.52-498.fc38.x86_64 183/265 Installing : perl-Encode-4:3.19-493.fc38.x86_64 184/265 Installing : perl-libs-4:5.36.3-498.fc38.x86_64 185/265 Installing : perl-interpreter-4:5.36.3-498.fc38.x86_64 186/265 Installing : gettext-envsubst-0.21.1-2.fc38.x86_64 187/265 Installing : gettext-runtime-0.21.1-2.fc38.x86_64 188/265 Installing : gettext-0.21.1-2.fc38.x86_64 189/265 Installing : gc-8.2.2-3.fc38.x86_64 190/265 Installing : guile22-2.2.7-7.fc38.x86_64 191/265 Installing : make-1:4.4.1-1.fc38.x86_64 192/265 Installing : gcc-13.2.1-7.fc38.x86_64 193/265 Running scriptlet: gcc-13.2.1-7.fc38.x86_64 193/265 Installing : gcc-c++-13.2.1-7.fc38.x86_64 194/265 Installing : libquadmath-devel-13.2.1-7.fc38.x86_64 195/265 Installing : gcc-gfortran-13.2.1-7.fc38.x86_64 196/265 Installing : fribidi-1.0.12-3.fc38.x86_64 197/265 Installing : pango-1.50.14-1.fc38.x86_64 198/265 Installing : R-core-4.3.3-1.fc38.x86_64 199/265 Installing : R-CRAN-rlang-1.1.3-1.fc38.copr6880930.x86_64 200/265 Installing : R-CRAN-cli-3.6.2-1.fc38.copr6742501.x86_64 201/265 Installing : R-CRAN-glue-1.7.0-1.fc38.copr6877494.x86_64 202/265 Installing : R-CRAN-lifecycle-1.0.4-1.fc38.copr6614518.noarch 203/265 Installing : R-CRAN-vctrs-0.6.5-1.fc38.copr6715464.x86_64 204/265 Installing : R-CRAN-magrittr-2.0.3-1.fc38.copr5812133.x86_64 205/265 Installing : R-CRAN-R6-2.5.1-1.fc38.copr5812135.noarch 206/265 Installing : R-CRAN-lattice-0.22.6-1.fc38.copr7307082.x86_64 207/265 Installing : R-CRAN-withr-3.0.0-1.fc38.copr6911503.noarch 208/265 Installing : R-CRAN-tidyselect-1.2.1-1.fc38.copr7306789.noarc 209/265 Installing : R-CRAN-gtable-0.3.4-1.fc38.copr6523581.noarch 210/265 Installing : R-CRAN-crayon-1.5.2-1.fc38.copr5812139.noarch 211/265 Installing : R-CRAN-fansi-1.0.6-1.fc38.copr6735917.x86_64 212/265 Installing : R-CRAN-pkgconfig-2.0.3-3.fc38.copr5812134.noarch 213/265 Installing : R-CRAN-hms-1.1.3-1.fc38.copr5819459.noarch 214/265 Installing : R-CRAN-stringi-1.8.3-1.fc38.copr6742554.x86_64 215/265 Installing : R-CRAN-stringr-1.5.1-1.fc38.copr6636964.noarch 216/265 Installing : R-CRAN-Matrix-1.6.5-1.fc38.copr6886765.x86_64 217/265 Installing : R-CRAN-nlme-3.1.164-1.fc38.copr6700968.x86_64 218/265 Installing : R-CRAN-mgcv-1.9.1-1.fc38.copr6775870.x86_64 219/265 Installing : R-CRAN-purrr-1.0.2-1.fc38.copr6264939.x86_64 220/265 Installing : R-CRAN-MASS-7.3.60.0.1-1.fc38.copr6895092.x86_64 221/265 Installing : R-CRAN-RColorBrewer-1.1.3-1.fc38.copr5812145.noa 222/265 Installing : R-CRAN-bit-4.0.5-1.fc38.copr5812166.x86_64 223/265 Installing : R-CRAN-bit64-4.0.5-1.fc38.copr5815652.x86_64 224/265 Installing : R-CRAN-clipr-0.8.0-1.fc38.copr5812155.noarch 225/265 Installing : R-CRAN-colorspace-2.1.0-1.fc38.copr5812150.x86_6 226/265 Installing : R-CRAN-munsell-0.5.1-1.fc38.copr7306785.noarch 227/265 Installing : R-CRAN-farver-2.1.1-1.fc38.copr5812193.x86_64 228/265 Installing : R-CRAN-generics-0.1.3-1.fc38.copr5812201.noarch 229/265 Installing : R-CRAN-isoband-0.2.7-1.fc38.copr5813294.x86_64 230/265 Installing : R-CRAN-labeling-0.4.3-1.fc38.copr6354313.noarch 231/265 Installing : R-CRAN-tzdb-0.4.0-1.fc38.copr5915135.x86_64 232/265 Installing : R-CRAN-utf8-1.2.4-1.fc38.copr6555966.x86_64 233/265 Installing : R-CRAN-pillar-1.9.0-1.fc38.copr5819458.noarch 234/265 Installing : R-CRAN-tibble-3.2.1-1.fc38.copr5821162.x86_64 235/265 Installing : R-CRAN-dplyr-1.1.4-1.fc38.copr6663981.x86_64 236/265 Installing : R-CRAN-vroom-1.6.5-1.fc38.copr6727750.x86_64 237/265 Installing : R-CRAN-viridisLite-0.4.2-1.fc38.copr5868842.noar 238/265 Installing : R-CRAN-scales-1.3.0-1.fc38.copr6704012.noarch 239/265 Installing : R-CRAN-ggplot2-3.5.0-1.fc38.copr7306791.noarch 240/265 Installing : R-rpm-macros-1.2.1-6.fc38.noarch 241/265 Installing : R-java-4.3.3-1.fc38.x86_64 242/265 Installing : R-littler-0.3.19-1.fc38.x86_64 243/265 Installing : brotli-1.0.9-11.fc38.x86_64 244/265 Installing : brotli-devel-1.0.9-11.fc38.x86_64 245/265 Installing : harfbuzz-devel-7.1.0-1.fc38.x86_64 246/265 Installing : freetype-devel-2.13.0-2.fc38.x86_64 247/265 Installing : fontconfig-devel-2.14.2-2.fc38.x86_64 248/265 Installing : libXft-devel-2.3.8-2.fc38.x86_64 249/265 Installing : tk-devel-1:8.6.12-4.fc38.x86_64 250/265 Installing : R-core-devel-4.3.3-1.fc38.x86_64 251/265 Installing : R-java-devel-4.3.3-1.fc38.x86_64 252/265 Installing : R-devel-4.3.3-1.fc38.x86_64 253/265 Installing : R-CRAN-Rcpp-1.0.12-1.fc38.copr6877523.x86_64 254/265 Installing : R-CRAN-patchwork-1.2.0-1.fc38.copr6873795.noarch 255/265 Installing : R-CRAN-readr-2.1.5-1.fc38.copr6880950.x86_64 256/265 Installing : R-CRAN-tidyr-1.3.1-1.fc38.copr6948918.x86_64 257/265 Installing : R-CRAN-data.tree-1.1.0-1.fc38.copr6627583.noarch 258/265 Installing : R-CRAN-zoo-1.8.12-1.fc38.copr5815602.x86_64 259/265 Installing : R-CRAN-BH-1.84.0.0-1.fc38.copr6880886.noarch 260/265 Installing : R-CRAN-gtools-3.9.5-1.fc38.copr6672122.x86_64 261/265 Installing : R-CRAN-lpSolve-5.6.20-1.fc38.copr6739857.x86_64 262/265 Installing : R-CRAN-yaml-2.3.8-1.fc38.copr6742560.x86_64 263/265 Installing : annobin-plugin-gcc-12.40-1.fc38.x86_64 264/265 Running scriptlet: annobin-plugin-gcc-12.40-1.fc38.x86_64 264/265 Installing : gcc-plugin-annobin-13.2.1-7.fc38.x86_64 265/265 Running scriptlet: gcc-plugin-annobin-13.2.1-7.fc38.x86_64 265/265 Running scriptlet: fontconfig-2.14.2-2.fc38.x86_64 265/265 Running scriptlet: copy-jdk-configs-4.1-2.fc38.noarch 265/265 Running scriptlet: crypto-policies-scripts-20230301-1.gita12f7b2.fc 265/265 Running scriptlet: nss-3.99.0-1.fc38.x86_64 265/265 Running scriptlet: java-17-openjdk-headless-1:17.0.9.0.9-3.fc38.x86 265/265 Running scriptlet: java-17-openjdk-1:17.0.9.0.9-3.fc38.x86_64 265/265 Running scriptlet: java-17-openjdk-devel-1:17.0.9.0.9-3.fc38.x86_64 265/265 Running scriptlet: gcc-plugin-annobin-13.2.1-7.fc38.x86_64 265/265 Verifying : R-CRAN-BH-1.84.0.0-1.fc38.copr6880886.noarch 1/265 Verifying : R-CRAN-MASS-7.3.60.0.1-1.fc38.copr6895092.x86_64 2/265 Verifying : R-CRAN-Matrix-1.6.5-1.fc38.copr6886765.x86_64 3/265 Verifying : R-CRAN-R6-2.5.1-1.fc38.copr5812135.noarch 4/265 Verifying : R-CRAN-RColorBrewer-1.1.3-1.fc38.copr5812145.noa 5/265 Verifying : R-CRAN-Rcpp-1.0.12-1.fc38.copr6877523.x86_64 6/265 Verifying : R-CRAN-bit-4.0.5-1.fc38.copr5812166.x86_64 7/265 Verifying : R-CRAN-bit64-4.0.5-1.fc38.copr5815652.x86_64 8/265 Verifying : R-CRAN-cli-3.6.2-1.fc38.copr6742501.x86_64 9/265 Verifying : R-CRAN-clipr-0.8.0-1.fc38.copr5812155.noarch 10/265 Verifying : R-CRAN-colorspace-2.1.0-1.fc38.copr5812150.x86_6 11/265 Verifying : R-CRAN-crayon-1.5.2-1.fc38.copr5812139.noarch 12/265 Verifying : R-CRAN-data.tree-1.1.0-1.fc38.copr6627583.noarch 13/265 Verifying : R-CRAN-dplyr-1.1.4-1.fc38.copr6663981.x86_64 14/265 Verifying : R-CRAN-fansi-1.0.6-1.fc38.copr6735917.x86_64 15/265 Verifying : R-CRAN-farver-2.1.1-1.fc38.copr5812193.x86_64 16/265 Verifying : R-CRAN-generics-0.1.3-1.fc38.copr5812201.noarch 17/265 Verifying : R-CRAN-ggplot2-3.5.0-1.fc38.copr7306791.noarch 18/265 Verifying : R-CRAN-glue-1.7.0-1.fc38.copr6877494.x86_64 19/265 Verifying : R-CRAN-gtable-0.3.4-1.fc38.copr6523581.noarch 20/265 Verifying : R-CRAN-gtools-3.9.5-1.fc38.copr6672122.x86_64 21/265 Verifying : R-CRAN-hms-1.1.3-1.fc38.copr5819459.noarch 22/265 Verifying : R-CRAN-isoband-0.2.7-1.fc38.copr5813294.x86_64 23/265 Verifying : R-CRAN-labeling-0.4.3-1.fc38.copr6354313.noarch 24/265 Verifying : R-CRAN-lattice-0.22.6-1.fc38.copr7307082.x86_64 25/265 Verifying : R-CRAN-lifecycle-1.0.4-1.fc38.copr6614518.noarch 26/265 Verifying : R-CRAN-lpSolve-5.6.20-1.fc38.copr6739857.x86_64 27/265 Verifying : R-CRAN-magrittr-2.0.3-1.fc38.copr5812133.x86_64 28/265 Verifying : R-CRAN-mgcv-1.9.1-1.fc38.copr6775870.x86_64 29/265 Verifying : R-CRAN-munsell-0.5.1-1.fc38.copr7306785.noarch 30/265 Verifying : R-CRAN-nlme-3.1.164-1.fc38.copr6700968.x86_64 31/265 Verifying : R-CRAN-patchwork-1.2.0-1.fc38.copr6873795.noarch 32/265 Verifying : R-CRAN-pillar-1.9.0-1.fc38.copr5819458.noarch 33/265 Verifying : R-CRAN-pkgconfig-2.0.3-3.fc38.copr5812134.noarch 34/265 Verifying : R-CRAN-purrr-1.0.2-1.fc38.copr6264939.x86_64 35/265 Verifying : R-CRAN-readr-2.1.5-1.fc38.copr6880950.x86_64 36/265 Verifying : R-CRAN-rlang-1.1.3-1.fc38.copr6880930.x86_64 37/265 Verifying : R-CRAN-scales-1.3.0-1.fc38.copr6704012.noarch 38/265 Verifying : R-CRAN-stringi-1.8.3-1.fc38.copr6742554.x86_64 39/265 Verifying : R-CRAN-stringr-1.5.1-1.fc38.copr6636964.noarch 40/265 Verifying : R-CRAN-tibble-3.2.1-1.fc38.copr5821162.x86_64 41/265 Verifying : R-CRAN-tidyr-1.3.1-1.fc38.copr6948918.x86_64 42/265 Verifying : R-CRAN-tidyselect-1.2.1-1.fc38.copr7306789.noarc 43/265 Verifying : R-CRAN-tzdb-0.4.0-1.fc38.copr5915135.x86_64 44/265 Verifying : R-CRAN-utf8-1.2.4-1.fc38.copr6555966.x86_64 45/265 Verifying : R-CRAN-vctrs-0.6.5-1.fc38.copr6715464.x86_64 46/265 Verifying : R-CRAN-viridisLite-0.4.2-1.fc38.copr5868842.noar 47/265 Verifying : R-CRAN-vroom-1.6.5-1.fc38.copr6727750.x86_64 48/265 Verifying : R-CRAN-withr-3.0.0-1.fc38.copr6911503.noarch 49/265 Verifying : R-CRAN-yaml-2.3.8-1.fc38.copr6742560.x86_64 50/265 Verifying : R-CRAN-zoo-1.8.12-1.fc38.copr5815602.x86_64 51/265 Verifying : R-rpm-macros-1.2.1-6.fc38.noarch 52/265 Verifying : brotli-1.0.9-11.fc38.x86_64 53/265 Verifying : brotli-devel-1.0.9-11.fc38.x86_64 54/265 Verifying : bzip2-devel-1.0.8-13.fc38.x86_64 55/265 Verifying : copy-jdk-configs-4.1-2.fc38.noarch 56/265 Verifying : crypto-policies-scripts-20230301-1.gita12f7b2.fc 57/265 Verifying : desktop-file-utils-0.26-8.fc38.x86_64 58/265 Verifying : fonts-filesystem-1:2.0.5-11.fc38.noarch 59/265 Verifying : freetype-2.13.0-2.fc38.x86_64 60/265 Verifying : freetype-devel-2.13.0-2.fc38.x86_64 61/265 Verifying : fribidi-1.0.12-3.fc38.x86_64 62/265 Verifying : gc-8.2.2-3.fc38.x86_64 63/265 Verifying : gettext-0.21.1-2.fc38.x86_64 64/265 Verifying : gettext-envsubst-0.21.1-2.fc38.x86_64 65/265 Verifying : gettext-libs-0.21.1-2.fc38.x86_64 66/265 Verifying : gettext-runtime-0.21.1-2.fc38.x86_64 67/265 Verifying : graphite2-1.3.14-11.fc38.x86_64 68/265 Verifying : graphite2-devel-1.3.14-11.fc38.x86_64 69/265 Verifying : groff-base-1.22.4-11.fc38.x86_64 70/265 Verifying : guile22-2.2.7-7.fc38.x86_64 71/265 Verifying : harfbuzz-7.1.0-1.fc38.x86_64 72/265 Verifying : harfbuzz-devel-7.1.0-1.fc38.x86_64 73/265 Verifying : harfbuzz-icu-7.1.0-1.fc38.x86_64 74/265 Verifying : javapackages-filesystem-6.1.0-7.fc38.noarch 75/265 Verifying : jbigkit-libs-2.1-25.fc38.x86_64 76/265 Verifying : libICE-1.0.10-10.fc38.x86_64 77/265 Verifying : libSM-1.2.3-12.fc38.x86_64 78/265 Verifying : libXau-1.0.11-2.fc38.x86_64 79/265 Verifying : libXau-devel-1.0.11-2.fc38.x86_64 80/265 Verifying : libXcomposite-0.4.5-9.fc38.x86_64 81/265 Verifying : libXext-1.3.5-2.fc38.x86_64 82/265 Verifying : libXmu-1.1.4-2.fc38.x86_64 83/265 Verifying : libXrender-0.9.11-2.fc38.x86_64 84/265 Verifying : libXrender-devel-0.9.11-2.fc38.x86_64 85/265 Verifying : libXt-1.2.1-4.fc38.x86_64 86/265 Verifying : libXtst-1.2.4-2.fc38.x86_64 87/265 Verifying : libb2-0.98.1-8.fc38.x86_64 88/265 Verifying : libblkid-devel-2.38.1-4.fc38.x86_64 89/265 Verifying : libdatrie-0.2.13-5.fc38.x86_64 90/265 Verifying : libffi-devel-3.4.4-2.fc38.x86_64 91/265 Verifying : libfontenc-1.1.6-2.fc38.x86_64 92/265 Verifying : libicu-72.1-2.fc38.x86_64 93/265 Verifying : libicu-devel-72.1-2.fc38.x86_64 94/265 Verifying : libjpeg-turbo-2.1.4-2.fc38.x86_64 95/265 Verifying : liblerc-4.0.0-3.fc38.x86_64 96/265 Verifying : libmount-devel-2.38.1-4.fc38.x86_64 97/265 Verifying : libmpc-1.3.1-2.fc38.x86_64 98/265 Verifying : libpng-2:1.6.37-14.fc38.x86_64 99/265 Verifying : libpng-devel-2:1.6.37-14.fc38.x86_64 100/265 Verifying : libselinux-devel-3.5-1.fc38.x86_64 101/265 Verifying : libsepol-devel-3.5-1.fc38.x86_64 102/265 Verifying : libthai-0.1.29-4.fc38.x86_64 103/265 Verifying : libtool-ltdl-2.4.7-6.fc38.x86_64 104/265 Verifying : libxcb-1.13.1-11.fc38.x86_64 105/265 Verifying : libxcb-devel-1.13.1-11.fc38.x86_64 106/265 Verifying : lksctp-tools-1.0.19-3.fc38.x86_64 107/265 Verifying : lua-5.4.4-9.fc38.x86_64 108/265 Verifying : lua-posix-35.1-5.fc38.x86_64 109/265 Verifying : mkfontscale-1.2.2-3.fc38.x86_64 110/265 Verifying : mpdecimal-2.5.1-6.fc38.x86_64 111/265 Verifying : nettle-3.8-3.fc38.x86_64 112/265 Verifying : openblas-0.3.21-4.fc38.x86_64 113/265 Verifying : openblas-openmp-0.3.21-4.fc38.x86_64 114/265 Verifying : openblas-openmp64-0.3.21-4.fc38.x86_64 115/265 Verifying : pango-1.50.14-1.fc38.x86_64 116/265 Verifying : pcre2-devel-10.42-1.fc38.1.x86_64 117/265 Verifying : pcre2-utf16-10.42-1.fc38.1.x86_64 118/265 Verifying : pcre2-utf32-10.42-1.fc38.1.x86_64 119/265 Verifying : perl-Carp-1.52-490.fc38.noarch 120/265 Verifying : perl-Data-Dumper-2.184-491.fc38.x86_64 121/265 Verifying : perl-Digest-1.20-490.fc38.noarch 122/265 Verifying : perl-Digest-MD5-2.58-490.fc38.x86_64 123/265 Verifying : perl-Encode-4:3.19-493.fc38.x86_64 124/265 Verifying : perl-Exporter-5.77-490.fc38.noarch 125/265 Verifying : perl-File-Path-2.18-490.fc38.noarch 126/265 Verifying : perl-File-Temp-1:0.231.100-490.fc38.noarch 127/265 Verifying : perl-Getopt-Long-1:2.54-2.fc38.noarch 128/265 Verifying : perl-IO-Socket-IP-0.41-492.fc38.noarch 129/265 Verifying : perl-IO-Socket-SSL-2.081-1.fc38.noarch 130/265 Verifying : perl-MIME-Base64-3.16-490.fc38.x86_64 131/265 Verifying : perl-Mozilla-CA-20221114-2.fc38.noarch 132/265 Verifying : perl-Net-SSLeay-1.92-5.fc38.x86_64 133/265 Verifying : perl-PathTools-3.84-490.fc38.x86_64 134/265 Verifying : perl-Pod-Escapes-1:1.07-490.fc38.noarch 135/265 Verifying : perl-Pod-Perldoc-3.28.01-491.fc38.noarch 136/265 Verifying : perl-Pod-Simple-1:3.43-491.fc38.noarch 137/265 Verifying : perl-Pod-Usage-4:2.03-4.fc38.noarch 138/265 Verifying : perl-Scalar-List-Utils-5:1.63-490.fc38.x86_64 139/265 Verifying : perl-Socket-4:2.036-2.fc38.x86_64 140/265 Verifying : perl-Storable-1:3.26-490.fc38.x86_64 141/265 Verifying : perl-Term-ANSIColor-5.01-491.fc38.noarch 142/265 Verifying : perl-Term-Cap-1.18-1.fc38.noarch 143/265 Verifying : perl-Text-ParseWords-3.31-490.fc38.noarch 144/265 Verifying : perl-Time-Local-2:1.300-490.fc38.noarch 145/265 Verifying : perl-URI-5.17-2.fc38.noarch 146/265 Verifying : perl-constant-1.33-491.fc38.noarch 147/265 Verifying : perl-libnet-3.15-1.fc38.noarch 148/265 Verifying : perl-parent-1:0.241-1.fc38.noarch 149/265 Verifying : perl-podlators-1:5.01-2.fc38.noarch 150/265 Verifying : pixman-0.42.2-1.fc38.x86_64 151/265 Verifying : python-setuptools-wheel-65.5.1-2.fc38.noarch 152/265 Verifying : sysprof-capture-devel-3.48.0-1.fc38.x86_64 153/265 Verifying : tcl-1:8.6.12-4.fc38.x86_64 154/265 Verifying : tcl-devel-1:8.6.12-4.fc38.x86_64 155/265 Verifying : tk-1:8.6.12-4.fc38.x86_64 156/265 Verifying : tk-devel-1:8.6.12-4.fc38.x86_64 157/265 Verifying : tre-0.8.0-39.20140228gitc2f5d13.fc38.x86_64 158/265 Verifying : tre-common-0.8.0-39.20140228gitc2f5d13.fc38.noar 159/265 Verifying : tre-devel-0.8.0-39.20140228gitc2f5d13.fc38.x86_6 160/265 Verifying : ttmkfdir-3.0.9-67.fc38.x86_64 161/265 Verifying : xclip-0.13-19.git11cba61.fc38.x86_64 162/265 Verifying : xml-common-0.6.3-60.fc38.noarch 163/265 Verifying : xorg-x11-fonts-Type1-7.5-35.fc38.noarch 164/265 Verifying : xorg-x11-proto-devel-2022.2-3.fc38.noarch 165/265 Verifying : xz-devel-5.4.1-1.fc38.x86_64 166/265 Verifying : zlib-devel-1.2.13-3.fc38.x86_64 167/265 Verifying : R-core-4.3.3-1.fc38.x86_64 168/265 Verifying : R-core-devel-4.3.3-1.fc38.x86_64 169/265 Verifying : R-devel-4.3.3-1.fc38.x86_64 170/265 Verifying : R-java-4.3.3-1.fc38.x86_64 171/265 Verifying : R-java-devel-4.3.3-1.fc38.x86_64 172/265 Verifying : R-littler-0.3.19-1.fc38.x86_64 173/265 Verifying : alsa-lib-1.2.11-2.fc38.x86_64 174/265 Verifying : annobin-docs-12.40-1.fc38.noarch 175/265 Verifying : annobin-plugin-gcc-12.40-1.fc38.x86_64 176/265 Verifying : avahi-libs-0.8-22.fc38.x86_64 177/265 Verifying : cairo-1.17.8-4.fc38.x86_64 178/265 Verifying : cmake-filesystem-3.27.7-1.fc38.x86_64 179/265 Verifying : cpp-13.2.1-7.fc38.x86_64 180/265 Verifying : cups-libs-1:2.4.7-11.fc38.x86_64 181/265 Verifying : dbus-libs-1:1.14.10-1.fc38.x86_64 182/265 Verifying : emacs-filesystem-1:29.3-1.fc38.noarch 183/265 Verifying : expat-2.6.0-1.fc38.x86_64 184/265 Verifying : flexiblas-3.4.2-1.fc38.x86_64 185/265 Verifying : flexiblas-devel-3.4.2-1.fc38.x86_64 186/265 Verifying : flexiblas-netlib-3.4.2-1.fc38.x86_64 187/265 Verifying : flexiblas-netlib64-3.4.2-1.fc38.x86_64 188/265 Verifying : flexiblas-openblas-openmp-3.4.2-1.fc38.x86_64 189/265 Verifying : flexiblas-openblas-openmp64-3.4.2-1.fc38.x86_64 190/265 Verifying : fontconfig-2.14.2-2.fc38.x86_64 191/265 Verifying : fontconfig-devel-2.14.2-2.fc38.x86_64 192/265 Verifying : gcc-13.2.1-7.fc38.x86_64 193/265 Verifying : gcc-c++-13.2.1-7.fc38.x86_64 194/265 Verifying : gcc-gfortran-13.2.1-7.fc38.x86_64 195/265 Verifying : gcc-plugin-annobin-13.2.1-7.fc38.x86_64 196/265 Verifying : glib2-2.76.6-1.fc38.x86_64 197/265 Verifying : glib2-devel-2.76.6-1.fc38.x86_64 198/265 Verifying : glibc-devel-2.37-18.fc38.x86_64 199/265 Verifying : glibc-headers-x86-2.37-18.fc38.noarch 200/265 Verifying : gnutls-3.8.4-1.fc38.x86_64 201/265 Verifying : google-noto-fonts-common-20230201-2.fc38.noarch 202/265 Verifying : google-noto-sans-vf-fonts-20230201-2.fc38.noarch 203/265 Verifying : java-17-openjdk-1:17.0.9.0.9-3.fc38.x86_64 204/265 Verifying : java-17-openjdk-devel-1:17.0.9.0.9-3.fc38.x86_64 205/265 Verifying : java-17-openjdk-headless-1:17.0.9.0.9-3.fc38.x86 206/265 Verifying : kernel-headers-6.8.3-100.fc38.x86_64 207/265 Verifying : langpacks-core-font-en-3.0-32.fc38.noarch 208/265 Verifying : libRmath-4.3.3-1.fc38.x86_64 209/265 Verifying : libRmath-devel-4.3.3-1.fc38.x86_64 210/265 Verifying : libX11-1.8.7-1.fc38.x86_64 211/265 Verifying : libX11-common-1.8.7-1.fc38.noarch 212/265 Verifying : libX11-devel-1.8.7-1.fc38.x86_64 213/265 Verifying : libX11-xcb-1.8.7-1.fc38.x86_64 214/265 Verifying : libXft-2.3.8-2.fc38.x86_64 215/265 Verifying : libXft-devel-2.3.8-2.fc38.x86_64 216/265 Verifying : libXi-1.8.1-1.fc38.x86_64 217/265 Verifying : libgfortran-13.2.1-7.fc38.x86_64 218/265 Verifying : libquadmath-13.2.1-7.fc38.x86_64 219/265 Verifying : libquadmath-devel-13.2.1-7.fc38.x86_64 220/265 Verifying : libstdc++-devel-13.2.1-7.fc38.x86_64 221/265 Verifying : libtiff-4.4.0-8.fc38.x86_64 222/265 Verifying : libtirpc-devel-1.3.4-1.rc3.fc38.x86_64 223/265 Verifying : libwebp-1.3.2-2.fc38.x86_64 224/265 Verifying : libxcrypt-devel-4.4.36-1.fc38.x86_64 225/265 Verifying : libxml2-devel-2.10.4-1.fc38.x86_64 226/265 Verifying : make-1:4.4.1-1.fc38.x86_64 227/265 Verifying : ncurses-6.4-7.20230520.fc38.1.x86_64 228/265 Verifying : nspr-4.35.0-17.fc38.x86_64 229/265 Verifying : nss-3.99.0-1.fc38.x86_64 230/265 Verifying : nss-softokn-3.99.0-1.fc38.x86_64 231/265 Verifying : nss-softokn-freebl-3.99.0-1.fc38.x86_64 232/265 Verifying : nss-sysinit-3.99.0-1.fc38.x86_64 233/265 Verifying : nss-util-3.99.0-1.fc38.x86_64 234/265 Verifying : perl-AutoLoader-5.74-498.fc38.noarch 235/265 Verifying : perl-B-1.83-498.fc38.x86_64 236/265 Verifying : perl-Class-Struct-0.66-498.fc38.noarch 237/265 Verifying : perl-DynaLoader-1.52-498.fc38.x86_64 238/265 Verifying : perl-Errno-1.36-498.fc38.x86_64 239/265 Verifying : perl-Fcntl-1.15-498.fc38.x86_64 240/265 Verifying : perl-File-Basename-2.85-498.fc38.noarch 241/265 Verifying : perl-File-stat-1.12-498.fc38.noarch 242/265 Verifying : perl-FileHandle-2.03-498.fc38.noarch 243/265 Verifying : perl-Getopt-Std-1.13-498.fc38.noarch 244/265 Verifying : perl-HTTP-Tiny-0.086-2.fc38.noarch 245/265 Verifying : perl-IO-1.50-498.fc38.x86_64 246/265 Verifying : perl-IPC-Open3-1.22-498.fc38.noarch 247/265 Verifying : perl-POSIX-2.03-498.fc38.x86_64 248/265 Verifying : perl-SelectSaver-1.02-498.fc38.noarch 249/265 Verifying : perl-Symbol-1.09-498.fc38.noarch 250/265 Verifying : perl-Text-Tabs+Wrap-2023.0511-1.fc38.noarch 251/265 Verifying : perl-base-2.27-498.fc38.noarch 252/265 Verifying : perl-if-0.61.000-498.fc38.noarch 253/265 Verifying : perl-interpreter-4:5.36.3-498.fc38.x86_64 254/265 Verifying : perl-libs-4:5.36.3-498.fc38.x86_64 255/265 Verifying : perl-locale-1.10-498.fc38.noarch 256/265 Verifying : perl-mro-1.26-498.fc38.x86_64 257/265 Verifying : perl-overload-1.35-498.fc38.noarch 258/265 Verifying : perl-overloading-0.02-498.fc38.noarch 259/265 Verifying : perl-vars-1.05-498.fc38.noarch 260/265 Verifying : python-pip-wheel-22.3.1-3.fc38.noarch 261/265 Verifying : python3-3.11.8-2.fc38.x86_64 262/265 Verifying : python3-libs-3.11.8-2.fc38.x86_64 263/265 Verifying : tzdata-java-2024a-1.fc38.noarch 264/265 Verifying : xdg-utils-1.1.3-15.fc38.noarch 265/265 Installed products updated. Installed: R-CRAN-BH-1.84.0.0-1.fc38.copr6880886.noarch R-CRAN-MASS-7.3.60.0.1-1.fc38.copr6895092.x86_64 R-CRAN-Matrix-1.6.5-1.fc38.copr6886765.x86_64 R-CRAN-R6-2.5.1-1.fc38.copr5812135.noarch R-CRAN-RColorBrewer-1.1.3-1.fc38.copr5812145.noarch R-CRAN-Rcpp-1.0.12-1.fc38.copr6877523.x86_64 R-CRAN-bit-4.0.5-1.fc38.copr5812166.x86_64 R-CRAN-bit64-4.0.5-1.fc38.copr5815652.x86_64 R-CRAN-cli-3.6.2-1.fc38.copr6742501.x86_64 R-CRAN-clipr-0.8.0-1.fc38.copr5812155.noarch R-CRAN-colorspace-2.1.0-1.fc38.copr5812150.x86_64 R-CRAN-crayon-1.5.2-1.fc38.copr5812139.noarch R-CRAN-data.tree-1.1.0-1.fc38.copr6627583.noarch R-CRAN-dplyr-1.1.4-1.fc38.copr6663981.x86_64 R-CRAN-fansi-1.0.6-1.fc38.copr6735917.x86_64 R-CRAN-farver-2.1.1-1.fc38.copr5812193.x86_64 R-CRAN-generics-0.1.3-1.fc38.copr5812201.noarch R-CRAN-ggplot2-3.5.0-1.fc38.copr7306791.noarch R-CRAN-glue-1.7.0-1.fc38.copr6877494.x86_64 R-CRAN-gtable-0.3.4-1.fc38.copr6523581.noarch R-CRAN-gtools-3.9.5-1.fc38.copr6672122.x86_64 R-CRAN-hms-1.1.3-1.fc38.copr5819459.noarch R-CRAN-isoband-0.2.7-1.fc38.copr5813294.x86_64 R-CRAN-labeling-0.4.3-1.fc38.copr6354313.noarch R-CRAN-lattice-0.22.6-1.fc38.copr7307082.x86_64 R-CRAN-lifecycle-1.0.4-1.fc38.copr6614518.noarch R-CRAN-lpSolve-5.6.20-1.fc38.copr6739857.x86_64 R-CRAN-magrittr-2.0.3-1.fc38.copr5812133.x86_64 R-CRAN-mgcv-1.9.1-1.fc38.copr6775870.x86_64 R-CRAN-munsell-0.5.1-1.fc38.copr7306785.noarch R-CRAN-nlme-3.1.164-1.fc38.copr6700968.x86_64 R-CRAN-patchwork-1.2.0-1.fc38.copr6873795.noarch R-CRAN-pillar-1.9.0-1.fc38.copr5819458.noarch R-CRAN-pkgconfig-2.0.3-3.fc38.copr5812134.noarch R-CRAN-purrr-1.0.2-1.fc38.copr6264939.x86_64 R-CRAN-readr-2.1.5-1.fc38.copr6880950.x86_64 R-CRAN-rlang-1.1.3-1.fc38.copr6880930.x86_64 R-CRAN-scales-1.3.0-1.fc38.copr6704012.noarch R-CRAN-stringi-1.8.3-1.fc38.copr6742554.x86_64 R-CRAN-stringr-1.5.1-1.fc38.copr6636964.noarch R-CRAN-tibble-3.2.1-1.fc38.copr5821162.x86_64 R-CRAN-tidyr-1.3.1-1.fc38.copr6948918.x86_64 R-CRAN-tidyselect-1.2.1-1.fc38.copr7306789.noarch R-CRAN-tzdb-0.4.0-1.fc38.copr5915135.x86_64 R-CRAN-utf8-1.2.4-1.fc38.copr6555966.x86_64 R-CRAN-vctrs-0.6.5-1.fc38.copr6715464.x86_64 R-CRAN-viridisLite-0.4.2-1.fc38.copr5868842.noarch R-CRAN-vroom-1.6.5-1.fc38.copr6727750.x86_64 R-CRAN-withr-3.0.0-1.fc38.copr6911503.noarch R-CRAN-yaml-2.3.8-1.fc38.copr6742560.x86_64 R-CRAN-zoo-1.8.12-1.fc38.copr5815602.x86_64 R-core-4.3.3-1.fc38.x86_64 R-core-devel-4.3.3-1.fc38.x86_64 R-devel-4.3.3-1.fc38.x86_64 R-java-4.3.3-1.fc38.x86_64 R-java-devel-4.3.3-1.fc38.x86_64 R-littler-0.3.19-1.fc38.x86_64 R-rpm-macros-1.2.1-6.fc38.noarch alsa-lib-1.2.11-2.fc38.x86_64 annobin-docs-12.40-1.fc38.noarch annobin-plugin-gcc-12.40-1.fc38.x86_64 avahi-libs-0.8-22.fc38.x86_64 brotli-1.0.9-11.fc38.x86_64 brotli-devel-1.0.9-11.fc38.x86_64 bzip2-devel-1.0.8-13.fc38.x86_64 cairo-1.17.8-4.fc38.x86_64 cmake-filesystem-3.27.7-1.fc38.x86_64 copy-jdk-configs-4.1-2.fc38.noarch cpp-13.2.1-7.fc38.x86_64 crypto-policies-scripts-20230301-1.gita12f7b2.fc38.noarch cups-libs-1:2.4.7-11.fc38.x86_64 dbus-libs-1:1.14.10-1.fc38.x86_64 desktop-file-utils-0.26-8.fc38.x86_64 emacs-filesystem-1:29.3-1.fc38.noarch expat-2.6.0-1.fc38.x86_64 flexiblas-3.4.2-1.fc38.x86_64 flexiblas-devel-3.4.2-1.fc38.x86_64 flexiblas-netlib-3.4.2-1.fc38.x86_64 flexiblas-netlib64-3.4.2-1.fc38.x86_64 flexiblas-openblas-openmp-3.4.2-1.fc38.x86_64 flexiblas-openblas-openmp64-3.4.2-1.fc38.x86_64 fontconfig-2.14.2-2.fc38.x86_64 fontconfig-devel-2.14.2-2.fc38.x86_64 fonts-filesystem-1:2.0.5-11.fc38.noarch freetype-2.13.0-2.fc38.x86_64 freetype-devel-2.13.0-2.fc38.x86_64 fribidi-1.0.12-3.fc38.x86_64 gc-8.2.2-3.fc38.x86_64 gcc-13.2.1-7.fc38.x86_64 gcc-c++-13.2.1-7.fc38.x86_64 gcc-gfortran-13.2.1-7.fc38.x86_64 gcc-plugin-annobin-13.2.1-7.fc38.x86_64 gettext-0.21.1-2.fc38.x86_64 gettext-envsubst-0.21.1-2.fc38.x86_64 gettext-libs-0.21.1-2.fc38.x86_64 gettext-runtime-0.21.1-2.fc38.x86_64 glib2-2.76.6-1.fc38.x86_64 glib2-devel-2.76.6-1.fc38.x86_64 glibc-devel-2.37-18.fc38.x86_64 glibc-headers-x86-2.37-18.fc38.noarch gnutls-3.8.4-1.fc38.x86_64 google-noto-fonts-common-20230201-2.fc38.noarch google-noto-sans-vf-fonts-20230201-2.fc38.noarch graphite2-1.3.14-11.fc38.x86_64 graphite2-devel-1.3.14-11.fc38.x86_64 groff-base-1.22.4-11.fc38.x86_64 guile22-2.2.7-7.fc38.x86_64 harfbuzz-7.1.0-1.fc38.x86_64 harfbuzz-devel-7.1.0-1.fc38.x86_64 harfbuzz-icu-7.1.0-1.fc38.x86_64 java-17-openjdk-1:17.0.9.0.9-3.fc38.x86_64 java-17-openjdk-devel-1:17.0.9.0.9-3.fc38.x86_64 java-17-openjdk-headless-1:17.0.9.0.9-3.fc38.x86_64 javapackages-filesystem-6.1.0-7.fc38.noarch jbigkit-libs-2.1-25.fc38.x86_64 kernel-headers-6.8.3-100.fc38.x86_64 langpacks-core-font-en-3.0-32.fc38.noarch libICE-1.0.10-10.fc38.x86_64 libRmath-4.3.3-1.fc38.x86_64 libRmath-devel-4.3.3-1.fc38.x86_64 libSM-1.2.3-12.fc38.x86_64 libX11-1.8.7-1.fc38.x86_64 libX11-common-1.8.7-1.fc38.noarch libX11-devel-1.8.7-1.fc38.x86_64 libX11-xcb-1.8.7-1.fc38.x86_64 libXau-1.0.11-2.fc38.x86_64 libXau-devel-1.0.11-2.fc38.x86_64 libXcomposite-0.4.5-9.fc38.x86_64 libXext-1.3.5-2.fc38.x86_64 libXft-2.3.8-2.fc38.x86_64 libXft-devel-2.3.8-2.fc38.x86_64 libXi-1.8.1-1.fc38.x86_64 libXmu-1.1.4-2.fc38.x86_64 libXrender-0.9.11-2.fc38.x86_64 libXrender-devel-0.9.11-2.fc38.x86_64 libXt-1.2.1-4.fc38.x86_64 libXtst-1.2.4-2.fc38.x86_64 libb2-0.98.1-8.fc38.x86_64 libblkid-devel-2.38.1-4.fc38.x86_64 libdatrie-0.2.13-5.fc38.x86_64 libffi-devel-3.4.4-2.fc38.x86_64 libfontenc-1.1.6-2.fc38.x86_64 libgfortran-13.2.1-7.fc38.x86_64 libicu-72.1-2.fc38.x86_64 libicu-devel-72.1-2.fc38.x86_64 libjpeg-turbo-2.1.4-2.fc38.x86_64 liblerc-4.0.0-3.fc38.x86_64 libmount-devel-2.38.1-4.fc38.x86_64 libmpc-1.3.1-2.fc38.x86_64 libpng-2:1.6.37-14.fc38.x86_64 libpng-devel-2:1.6.37-14.fc38.x86_64 libquadmath-13.2.1-7.fc38.x86_64 libquadmath-devel-13.2.1-7.fc38.x86_64 libselinux-devel-3.5-1.fc38.x86_64 libsepol-devel-3.5-1.fc38.x86_64 libstdc++-devel-13.2.1-7.fc38.x86_64 libthai-0.1.29-4.fc38.x86_64 libtiff-4.4.0-8.fc38.x86_64 libtirpc-devel-1.3.4-1.rc3.fc38.x86_64 libtool-ltdl-2.4.7-6.fc38.x86_64 libwebp-1.3.2-2.fc38.x86_64 libxcb-1.13.1-11.fc38.x86_64 libxcb-devel-1.13.1-11.fc38.x86_64 libxcrypt-devel-4.4.36-1.fc38.x86_64 libxml2-devel-2.10.4-1.fc38.x86_64 lksctp-tools-1.0.19-3.fc38.x86_64 lua-5.4.4-9.fc38.x86_64 lua-posix-35.1-5.fc38.x86_64 make-1:4.4.1-1.fc38.x86_64 mkfontscale-1.2.2-3.fc38.x86_64 mpdecimal-2.5.1-6.fc38.x86_64 ncurses-6.4-7.20230520.fc38.1.x86_64 nettle-3.8-3.fc38.x86_64 nspr-4.35.0-17.fc38.x86_64 nss-3.99.0-1.fc38.x86_64 nss-softokn-3.99.0-1.fc38.x86_64 nss-softokn-freebl-3.99.0-1.fc38.x86_64 nss-sysinit-3.99.0-1.fc38.x86_64 nss-util-3.99.0-1.fc38.x86_64 openblas-0.3.21-4.fc38.x86_64 openblas-openmp-0.3.21-4.fc38.x86_64 openblas-openmp64-0.3.21-4.fc38.x86_64 pango-1.50.14-1.fc38.x86_64 pcre2-devel-10.42-1.fc38.1.x86_64 pcre2-utf16-10.42-1.fc38.1.x86_64 pcre2-utf32-10.42-1.fc38.1.x86_64 perl-AutoLoader-5.74-498.fc38.noarch perl-B-1.83-498.fc38.x86_64 perl-Carp-1.52-490.fc38.noarch perl-Class-Struct-0.66-498.fc38.noarch perl-Data-Dumper-2.184-491.fc38.x86_64 perl-Digest-1.20-490.fc38.noarch perl-Digest-MD5-2.58-490.fc38.x86_64 perl-DynaLoader-1.52-498.fc38.x86_64 perl-Encode-4:3.19-493.fc38.x86_64 perl-Errno-1.36-498.fc38.x86_64 perl-Exporter-5.77-490.fc38.noarch perl-Fcntl-1.15-498.fc38.x86_64 perl-File-Basename-2.85-498.fc38.noarch perl-File-Path-2.18-490.fc38.noarch perl-File-Temp-1:0.231.100-490.fc38.noarch perl-File-stat-1.12-498.fc38.noarch perl-FileHandle-2.03-498.fc38.noarch perl-Getopt-Long-1:2.54-2.fc38.noarch perl-Getopt-Std-1.13-498.fc38.noarch perl-HTTP-Tiny-0.086-2.fc38.noarch perl-IO-1.50-498.fc38.x86_64 perl-IO-Socket-IP-0.41-492.fc38.noarch perl-IO-Socket-SSL-2.081-1.fc38.noarch perl-IPC-Open3-1.22-498.fc38.noarch perl-MIME-Base64-3.16-490.fc38.x86_64 perl-Mozilla-CA-20221114-2.fc38.noarch perl-Net-SSLeay-1.92-5.fc38.x86_64 perl-POSIX-2.03-498.fc38.x86_64 perl-PathTools-3.84-490.fc38.x86_64 perl-Pod-Escapes-1:1.07-490.fc38.noarch perl-Pod-Perldoc-3.28.01-491.fc38.noarch perl-Pod-Simple-1:3.43-491.fc38.noarch perl-Pod-Usage-4:2.03-4.fc38.noarch perl-Scalar-List-Utils-5:1.63-490.fc38.x86_64 perl-SelectSaver-1.02-498.fc38.noarch perl-Socket-4:2.036-2.fc38.x86_64 perl-Storable-1:3.26-490.fc38.x86_64 perl-Symbol-1.09-498.fc38.noarch perl-Term-ANSIColor-5.01-491.fc38.noarch perl-Term-Cap-1.18-1.fc38.noarch perl-Text-ParseWords-3.31-490.fc38.noarch perl-Text-Tabs+Wrap-2023.0511-1.fc38.noarch perl-Time-Local-2:1.300-490.fc38.noarch perl-URI-5.17-2.fc38.noarch perl-base-2.27-498.fc38.noarch perl-constant-1.33-491.fc38.noarch perl-if-0.61.000-498.fc38.noarch perl-interpreter-4:5.36.3-498.fc38.x86_64 perl-libnet-3.15-1.fc38.noarch perl-libs-4:5.36.3-498.fc38.x86_64 perl-locale-1.10-498.fc38.noarch perl-mro-1.26-498.fc38.x86_64 perl-overload-1.35-498.fc38.noarch perl-overloading-0.02-498.fc38.noarch perl-parent-1:0.241-1.fc38.noarch perl-podlators-1:5.01-2.fc38.noarch perl-vars-1.05-498.fc38.noarch pixman-0.42.2-1.fc38.x86_64 python-pip-wheel-22.3.1-3.fc38.noarch python-setuptools-wheel-65.5.1-2.fc38.noarch python3-3.11.8-2.fc38.x86_64 python3-libs-3.11.8-2.fc38.x86_64 sysprof-capture-devel-3.48.0-1.fc38.x86_64 tcl-1:8.6.12-4.fc38.x86_64 tcl-devel-1:8.6.12-4.fc38.x86_64 tk-1:8.6.12-4.fc38.x86_64 tk-devel-1:8.6.12-4.fc38.x86_64 tre-0.8.0-39.20140228gitc2f5d13.fc38.x86_64 tre-common-0.8.0-39.20140228gitc2f5d13.fc38.noarch tre-devel-0.8.0-39.20140228gitc2f5d13.fc38.x86_64 ttmkfdir-3.0.9-67.fc38.x86_64 tzdata-java-2024a-1.fc38.noarch xclip-0.13-19.git11cba61.fc38.x86_64 xdg-utils-1.1.3-15.fc38.noarch xml-common-0.6.3-60.fc38.noarch xorg-x11-fonts-Type1-7.5-35.fc38.noarch xorg-x11-proto-devel-2022.2-3.fc38.noarch xz-devel-5.4.1-1.fc38.x86_64 zlib-devel-1.2.13-3.fc38.x86_64 Complete! Finish: build setup for R-CRAN-starvz-0.8.0-1.fc38.copr7307546.src.rpm Start: rpmbuild R-CRAN-starvz-0.8.0-1.fc38.copr7307546.src.rpm warning: source_date_epoch_from_changelog set but %changelog is missing Building target platforms: x86_64 Building for target x86_64 Executing(%prep): /bin/sh -e /var/tmp/rpm-tmp.Qo05h5 + umask 022 + cd /builddir/build/BUILD + cd /builddir/build/BUILD + rm -rf starvz + /usr/bin/mkdir -p starvz + cd starvz + /usr/lib/rpm/rpmuncompress -x /builddir/build/SOURCES/starvz_0.8.0.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.mdpW1o + umask 022 + cd /builddir/build/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 -mtune=generic -fasynchronous-unwind-tables -fstack-clash-protection -fcf-protection -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 -mtune=generic -fasynchronous-unwind-tables -fstack-clash-protection -fcf-protection -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 -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 -mtune=generic -fasynchronous-unwind-tables -fstack-clash-protection -fcf-protection -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 -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 -mtune=generic -fasynchronous-unwind-tables -fstack-clash-protection -fcf-protection -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -I/usr/lib64/gfortran/modules ' + export FCFLAGS + VALAFLAGS=-g + export VALAFLAGS + LDFLAGS='-Wl,-z,relro -Wl,--as-needed -Wl,-z,now -specs=/usr/lib/rpm/redhat/redhat-hardened-ld -specs=/usr/lib/rpm/redhat/redhat-annobin-cc1 -Wl,--build-id=sha1 -specs=/usr/lib/rpm/redhat/redhat-package-notes ' + export LDFLAGS + LT_SYS_LIBRARY_PATH=/usr/lib64: + export LT_SYS_LIBRARY_PATH + CC=gcc + export CC + CXX=g++ + export CXX + cd starvz + RPM_EC=0 ++ jobs -p + exit 0 Executing(%install): /bin/sh -e /var/tmp/rpm-tmp.OO5IhS + umask 022 + cd /builddir/build/BUILD + '[' /builddir/build/BUILDROOT/R-CRAN-starvz-0.8.0-1.fc38.copr7307546.x86_64 '!=' / ']' + rm -rf /builddir/build/BUILDROOT/R-CRAN-starvz-0.8.0-1.fc38.copr7307546.x86_64 ++ dirname /builddir/build/BUILDROOT/R-CRAN-starvz-0.8.0-1.fc38.copr7307546.x86_64 + mkdir -p /builddir/build/BUILDROOT + mkdir /builddir/build/BUILDROOT/R-CRAN-starvz-0.8.0-1.fc38.copr7307546.x86_64 + 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 -mtune=generic -fasynchronous-unwind-tables -fstack-clash-protection -fcf-protection -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 -mtune=generic -fasynchronous-unwind-tables -fstack-clash-protection -fcf-protection -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 -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 -mtune=generic -fasynchronous-unwind-tables -fstack-clash-protection -fcf-protection -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 -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 -mtune=generic -fasynchronous-unwind-tables -fstack-clash-protection -fcf-protection -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -I/usr/lib64/gfortran/modules ' + export FCFLAGS + VALAFLAGS=-g + export VALAFLAGS + LDFLAGS='-Wl,-z,relro -Wl,--as-needed -Wl,-z,now -specs=/usr/lib/rpm/redhat/redhat-hardened-ld -specs=/usr/lib/rpm/redhat/redhat-annobin-cc1 -Wl,--build-id=sha1 -specs=/usr/lib/rpm/redhat/redhat-package-notes ' + export LDFLAGS + LT_SYS_LIBRARY_PATH=/usr/lib64: + export LT_SYS_LIBRARY_PATH + CC=gcc + export CC + CXX=g++ + export CXX + cd starvz + mkdir -p /builddir/build/BUILDROOT/R-CRAN-starvz-0.8.0-1.fc38.copr7307546.x86_64/usr/local/lib/R/library + /usr/bin/R CMD INSTALL -l /builddir/build/BUILDROOT/R-CRAN-starvz-0.8.0-1.fc38.copr7307546.x86_64/usr/local/lib/R/library starvz * installing *source* package 'starvz' ... ** package 'starvz' successfully unpacked and MD5 sums checked ** using staged installation ** libs using C++ compiler: 'g++ (GCC) 13.2.1 20240316 (Red Hat 13.2.1-7)' 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 -mtune=generic -fasynchronous-unwind-tables -fstack-clash-protection -fcf-protection -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 -mtune=generic -fasynchronous-unwind-tables -fstack-clash-protection -fcf-protection -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 -mtune=generic -fasynchronous-unwind-tables -fstack-clash-protection -fcf-protection -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 -mtune=generic -fasynchronous-unwind-tables -fstack-clash-protection -fcf-protection -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 -mtune=generic -fasynchronous-unwind-tables -fstack-clash-protection -fcf-protection -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -c shortest_path.cpp -o shortest_path.o In file included from /usr/local/lib/R/library/BH/include/boost/property_map/property_map.hpp:22, from /usr/local/lib/R/library/BH/include/boost/graph/topological_sort.hpp:15, from /usr/local/lib/R/library/BH/include/boost/graph/dag_shortest_paths.hpp:13, from shortest_path.cpp:4: /usr/local/lib/R/library/BH/include/boost/mpl/assert.hpp:194:21: warning: unnecessary parentheses in declaration of 'assert_arg' [-Wparentheses] 194 | failed ************ (Pred::************ | ^~~~~~~~~~~~~~~~~~~ 195 | assert_arg( void (*)(Pred), typename assert_arg_pred::type ) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 196 | ); | ~ /usr/local/lib/R/library/BH/include/boost/mpl/assert.hpp:194:21: note: remove parentheses 194 | failed ************ (Pred::************ | ^~~~~~~~~~~~~~~~~~~ | - 195 | assert_arg( void (*)(Pred), typename assert_arg_pred::type ) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 196 | ); | ~ | - /usr/local/lib/R/library/BH/include/boost/mpl/assert.hpp:199:21: warning: unnecessary parentheses in declaration of 'assert_not_arg' [-Wparentheses] 199 | failed ************ (boost::mpl::not_::************ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 200 | assert_not_arg( void (*)(Pred), typename assert_arg_pred_not::type ) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 201 | ); | ~ /usr/local/lib/R/library/BH/include/boost/mpl/assert.hpp:199:21: note: remove parentheses 199 | failed ************ (boost::mpl::not_::************ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ | - 200 | assert_not_arg( void (*)(Pred), typename assert_arg_pred_not::type ) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 201 | ); | ~ | - In file included from /usr/local/lib/R/library/BH/include/boost/smart_ptr/shared_ptr.hpp:18, from /usr/local/lib/R/library/BH/include/boost/property_map/vector_property_map.hpp:14, from /usr/local/lib/R/library/BH/include/boost/property_map/property_map.hpp:598: /usr/local/lib/R/library/BH/include/boost/smart_ptr/detail/shared_count.hpp:361:33: warning: 'template class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 361 | explicit shared_count( std::auto_ptr & r ): pi_( new sp_counted_impl_p( r.get() ) ) | ^~~~~~~~ In file included from /usr/include/c++/13/memory:78, from /usr/local/lib/R/library/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /usr/local/lib/R/library/BH/include/boost/smart_ptr/detail/shared_count.hpp:27: /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /usr/local/lib/R/library/BH/include/boost/smart_ptr/shared_ptr.hpp:251:65: warning: 'template class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 251 | template< class T, class R > struct sp_enable_if_auto_ptr< std::auto_ptr< T >, R > | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /usr/local/lib/R/library/BH/include/boost/smart_ptr/shared_ptr.hpp:508:31: warning: 'template class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 508 | explicit shared_ptr( std::auto_ptr & r ): px(r.get()), pn() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /usr/local/lib/R/library/BH/include/boost/smart_ptr/shared_ptr.hpp:521:22: warning: 'template class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 521 | shared_ptr( std::auto_ptr && r ): px(r.get()), pn() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /usr/local/lib/R/library/BH/include/boost/smart_ptr/shared_ptr.hpp:604:34: warning: 'template class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 604 | shared_ptr & operator=( std::auto_ptr & r ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /usr/local/lib/R/library/BH/include/boost/smart_ptr/shared_ptr.hpp:613:34: warning: 'template class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 613 | shared_ptr & operator=( std::auto_ptr && r ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /usr/local/lib/R/library/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function 'boost::shared_ptr& boost::shared_ptr::operator=(std::auto_ptr<_Up>&&)': /usr/local/lib/R/library/BH/include/boost/smart_ptr/shared_ptr.hpp:615:38: warning: 'template class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 615 | this_type( static_cast< std::auto_ptr && >( r ) ).swap( *this ); | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ In file included from /usr/local/lib/R/library/BH/include/boost/scoped_ptr.hpp:13, from /usr/local/lib/R/library/BH/include/boost/smart_ptr.hpp:17, from /usr/local/lib/R/library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:26, from /usr/local/lib/R/library/BH/include/boost/graph/dag_shortest_paths.hpp:14: /usr/local/lib/R/library/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope: /usr/local/lib/R/library/BH/include/boost/smart_ptr/scoped_ptr.hpp:75:31: warning: 'template class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 75 | explicit scoped_ptr( std::auto_ptr p ) BOOST_SP_NOEXCEPT : px( p.release() ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | 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 > >' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:502:3: required from 'struct boost::InputIterator<__gnu_cxx::__normal_iterator > >' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:540:3: required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:568:3: required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >' /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 > > >' /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::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>]' /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]' /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]' shortest_path.cpp:70:28: required from here /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 > >' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:502:3: required from 'struct boost::InputIterator<__gnu_cxx::__normal_iterator > >' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:540:3: required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:568:3: required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >' /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 > > >' /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::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>]' /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]' /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]' shortest_path.cpp:70:28: required from here /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 > >' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:540:3: required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:568:3: required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >' /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 > > >' /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::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>]' /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]' /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]' shortest_path.cpp:70:28: required from here /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 > >' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:568:3: required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >' /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 > > >' /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::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>]' /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]' /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]' shortest_path.cpp:70:28: required from here /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 > >' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >' /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 > >]' /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' /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_ > >)>' /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>]' /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]' /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]' shortest_path.cpp:70:28: required from here /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 > >' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >' /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 > >]' /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' /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_ > >)>' /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>]' /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]' /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]' shortest_path.cpp:70:28: required from here /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 > >' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >' /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 > >]' /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' /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_ > >)>' /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>]' /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]' /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]' shortest_path.cpp:70:28: required from here /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>]' /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]' /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]' shortest_path.cpp:70:28: required from here /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 > >' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:502:3: required from 'struct boost::InputIterator<__gnu_cxx::__normal_iterator > >' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:540:3: required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:568:3: required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >' /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 > > >' /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::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>]' /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]' /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]' shortest_path.cpp:70:28: required from here /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 > >' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:502:3: required from 'struct boost::InputIterator<__gnu_cxx::__normal_iterator > >' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:540:3: required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:568:3: required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >' /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 > > >' /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::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>]' /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]' /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]' shortest_path.cpp:70:28: required from here /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 > >' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:540:3: required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:568:3: required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >' /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 > > >' /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::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>]' /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]' /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]' shortest_path.cpp:70:28: required from here /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 > >' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:568:3: required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >' /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 > > >' /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::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>]' /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]' /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]' shortest_path.cpp:70:28: required from here /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 > >' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >' /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 > >]' /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' /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_ > >)>' /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>]' /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]' /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]' shortest_path.cpp:70:28: required from here /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 > >' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >' /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 > >]' /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' /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_ > >)>' /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>]' /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]' /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]' shortest_path.cpp:70:28: required from here /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 > >' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >' /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 > >]' /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' /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_ > >)>' /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>]' /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]' /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]' shortest_path.cpp:70:28: required from here /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>]' /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]' /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]' shortest_path.cpp:70:28: required from here /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 > > >]' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:145:5: required from 'struct boost::Assignable<__gnu_cxx::__normal_iterator > >' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:502:3: required from 'struct boost::InputIterator<__gnu_cxx::__normal_iterator > >' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:540:3: required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:568:3: required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >' /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 > > >' /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::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>]' /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]' /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]' shortest_path.cpp:70:28: required from here /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 > > >]' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:233:5: required from 'struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:502:3: required from 'struct boost::InputIterator<__gnu_cxx::__normal_iterator > >' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:540:3: required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:568:3: required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >' /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 > > >' /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::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>]' /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]' /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]' shortest_path.cpp:70:28: required from here /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 > > >]' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:512:7: required from 'struct boost::InputIterator<__gnu_cxx::__normal_iterator > >' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:540:3: required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:568:3: required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >' /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 > > >' /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::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>]' /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]' /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]' shortest_path.cpp:70:28: required from here /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 > > >]' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:543:7: required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:568:3: required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >' /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 > > >' /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::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>]' /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]' /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]' shortest_path.cpp:70:28: required from here /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 > > >]' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:571:7: required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >' /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 > > >' /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::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>]' /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]' /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]' shortest_path.cpp:70:28: required from here /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 > > >]' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:253:5: required from 'struct boost::Comparable<__gnu_cxx::__normal_iterator > >' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >' /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 > > >' /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::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>]' /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]' /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]' shortest_path.cpp:70:28: required from here /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 > > >]' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:601:7: required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >' /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 > >]' /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' /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_ > >)>' /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>]' /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]' /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]' shortest_path.cpp:70:28: required from here /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 > > >]' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:145:5: required from 'struct boost::Assignable<__gnu_cxx::__normal_iterator > >' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:502:3: required from 'struct boost::InputIterator<__gnu_cxx::__normal_iterator > >' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:540:3: required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:568:3: required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >' /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 > > >' /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::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>]' /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]' /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]' shortest_path.cpp:70:28: required from here /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 > > >]' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:233:5: required from 'struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:502:3: required from 'struct boost::InputIterator<__gnu_cxx::__normal_iterator > >' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:540:3: required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:568:3: required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >' /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 > > >' /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::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>]' /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]' /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]' shortest_path.cpp:70:28: required from here /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 > > >]' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:512:7: required from 'struct boost::InputIterator<__gnu_cxx::__normal_iterator > >' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:540:3: required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:568:3: required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >' /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 > > >' /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::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>]' /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]' /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]' shortest_path.cpp:70:28: required from here /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 > > >]' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:543:7: required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:568:3: required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >' /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 > > >' /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::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>]' /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]' /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]' shortest_path.cpp:70:28: required from here /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 > > >]' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:571:7: required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >' /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 > > >' /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::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>]' /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]' /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]' shortest_path.cpp:70:28: required from here /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 > > >]' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:253:5: required from 'struct boost::Comparable<__gnu_cxx::__normal_iterator > >' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >' /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 > > >' /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::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>]' /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]' /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]' shortest_path.cpp:70:28: required from here /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 > > >]' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:601:7: required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >' /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 > >]' /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' /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_ > >)>' /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>]' /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]' /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]' shortest_path.cpp:70:28: required from here /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' /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]' /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >::value' /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_)>' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:603:11: required from 'boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]' /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 > >]' /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>]' /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]' /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]' shortest_path.cpp:70:28: required from here /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 >]' /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 > >]' /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>]' /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]' /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]' shortest_path.cpp:70:28: required from here /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 >]' /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 > >]' /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 > > >]' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:512:7: required from 'struct boost::InputIterator<__gnu_cxx::__normal_iterator > >' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:540:3: required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >' /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 > > >' /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::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>]' /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]' /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]' shortest_path.cpp:70:28: required from here /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' /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]' /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >::value' /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_)>' /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 > > >' /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::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>]' /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]' /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]' shortest_path.cpp:70:28: required from here /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 >]' /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 > >]' /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 > > >]' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:512:7: required from 'struct boost::InputIterator<__gnu_cxx::__normal_iterator > >' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:540:3: required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >' /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 > > >' /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::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>]' /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]' /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]' shortest_path.cpp:70:28: required from here /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' /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]' /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >::value' /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_)>' /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 > > >' /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::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>]' /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]' /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]' shortest_path.cpp:70:28: required from here /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 >]' /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 > >]' /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 > > >]' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:543:7: required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:568:3: required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >' /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 > > >' /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::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>]' /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]' /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]' shortest_path.cpp:70:28: required from here /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' /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]' /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >::value' /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_)>' /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 > > >' /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::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>]' /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]' /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]' shortest_path.cpp:70:28: required from here /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 >]' /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 > >]' /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 > > >]' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:571:7: required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >' /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 > > >' /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::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>]' /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]' /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]' shortest_path.cpp:70:28: required from here /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 >]' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:208:5: required from 'struct boost::Convertible' /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]' /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >::value' /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 >]' /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 > >]' /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>]' /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]' /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]' shortest_path.cpp:70:28: required from here /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 > >' /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from 'struct boost::concepts::IncidenceGraph, boost::property > >' /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from 'struct boost::concepts::IncidenceGraphConcept, boost::property > >' /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 > >]' /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' /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]' /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]' /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]' /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]' /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]' shortest_path.cpp:70:28: required from here /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 > >' /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from 'struct boost::concepts::IncidenceGraphConcept, boost::property > >' /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 > >]' /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' /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied, boost::property > > >' /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]' /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]' /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]' /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]' /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]' shortest_path.cpp:70:28: required from here /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]' /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]' /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]' /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]' /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]' /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]' shortest_path.cpp:70:28: required from here /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]' /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]' /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]' /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]' /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]' /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]' shortest_path.cpp:70:28: required from here /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]' /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]' /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]' /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]' /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]' /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]' shortest_path.cpp:70:28: required from here /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' /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:502:1: required from 'struct boost::concepts::ColorValue' /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:502:1: required from 'struct boost::concepts::ColorValueConcept' /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]' /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >::value' /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]' /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]' /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]' /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]' /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]' shortest_path.cpp:70:28: required from here /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' /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:502:1: required from 'struct boost::concepts::ColorValue' /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:502:1: required from 'struct boost::concepts::ColorValueConcept' /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]' /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >::value' /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]' /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]' /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]' /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]' /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]' shortest_path.cpp:70:28: required from here /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' /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:502:1: required from 'struct boost::concepts::ColorValueConcept' /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]' /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >::value' /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: [ 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]' /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]' /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]' /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]' /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]' shortest_path.cpp:70:28: required from here /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]' /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]' /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]' /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]' /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]' /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]' shortest_path.cpp:70:28: required from here /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 >]' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:208:5: required from 'struct boost::Convertible' /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]' /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >::value' /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: [ 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_ > >)>' /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>]' /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]' /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]' shortest_path.cpp:70:28: required from here /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 >]' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:208:5: required from 'struct boost::Convertible' /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]' /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >::value' /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: [ 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_ > >)>' /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>]' /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]' /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]' shortest_path.cpp:70:28: required from here /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 >]' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:208:5: required from 'struct boost::Convertible' /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]' /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >::value' /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: [ 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_ > >)>' /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>]' /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]' /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]' shortest_path.cpp:70:28: required from here /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 > > >]' /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:66:5: required from 'struct boost::concepts::Graph, boost::property > >' /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from 'struct boost::concepts::IncidenceGraph, boost::property > >' /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from 'struct boost::concepts::IncidenceGraphConcept, boost::property > >' /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 > >]' /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]' /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]' /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]' /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]' /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]' shortest_path.cpp:70:28: required from here /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 > > >]' /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:87:5: required from 'struct boost::concepts::IncidenceGraph, boost::property > >' /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from 'struct boost::concepts::IncidenceGraphConcept, boost::property > >' /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 > >]' /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' /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]' /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]' /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]' /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]' /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]' shortest_path.cpp:70:28: required from here /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 > > >' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:165:3: required from 'struct boost::CopyConstructibleConcept > > >' /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 > > >]' /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > > >::value' /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: [ 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]' /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]' /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]' /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]' /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]' shortest_path.cpp:70:28: required from here /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 >]' /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 > >]' /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' /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 > > >' /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]' /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]' /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]' /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]' /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]' shortest_path.cpp:70:28: required from here /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]' /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>]' /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' /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> >' /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]' /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]' /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]' /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]' /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]' shortest_path.cpp:70:28: required from here /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]' /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>]' /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' /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> >' /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]' /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]' /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]' /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]' /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]' shortest_path.cpp:70:28: required from here /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' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:206:3: required from 'struct boost::ConvertibleConcept' /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]' /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >::value' /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: [ 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]' /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]' /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]' /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]' /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]' shortest_path.cpp:70:28: required from here /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]' /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>]' /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' /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> >' /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]' /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]' /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]' /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]' /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]' shortest_path.cpp:70:28: required from here /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 >]' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:233:5: required from 'struct boost::EqualityComparable' /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:502:1: required from 'struct boost::concepts::ColorValue' /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:502:1: required from 'struct boost::concepts::ColorValueConcept' /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]' /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]' /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]' /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]' /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]' /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]' shortest_path.cpp:70:28: required from here /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 >]' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:137:5: required from 'struct boost::DefaultConstructible' /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:502:1: required from 'struct boost::concepts::ColorValue' /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:502:1: required from 'struct boost::concepts::ColorValueConcept' /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]' /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]' /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]' /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]' /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]' /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]' shortest_path.cpp:70:28: required from here /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 >]' /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:505:5: required from 'struct boost::concepts::ColorValue' /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:502:1: required from 'struct boost::concepts::ColorValueConcept' /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]' /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >::value' /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]' /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]' /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]' /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]' /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]' shortest_path.cpp:70:28: required from here /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> >' /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> >]' /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' /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> > >' /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> >)>' /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]' /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]' /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]' /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]' /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]' shortest_path.cpp:70:28: required from here /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 >]' /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 > >]' /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]' /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]' /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]' /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]' /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]' /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]' shortest_path.cpp:70:28: required from here /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 >' /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 >]' /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > >::value' /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_ >)>' /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]' /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]' /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]' /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]' /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]' shortest_path.cpp:70:28: required from here /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 >]' /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 > >]' /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]' /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]' /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]' /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]' /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]' /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]' shortest_path.cpp:70:28: required from here /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 >' /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 >]' /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > >::value' /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_ >)>' /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]' /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]' /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]' /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]' /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]' shortest_path.cpp:70:28: required from here /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 >]' /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 > >]' /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]' /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]' /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]' /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]' /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]' /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]' shortest_path.cpp:70:28: required from here /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 >' /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 >]' /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > >::value' /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_ >)>' /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]' /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]' /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]' /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]' /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]' shortest_path.cpp:70:28: required from here /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 >]' /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 > >]' /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]' /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]' /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]' /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]' /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]' /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]' shortest_path.cpp:70:28: required from here /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' /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]' /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >::value' /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_)>' /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]' /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]' /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]' /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]' /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]' shortest_path.cpp:70:28: required from here /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 >]' /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 > >]' /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]' /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]' /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]' /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]' /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]' /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]' shortest_path.cpp:70:28: required from here /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 > > > >]' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:167:5: required from 'struct boost::CopyConstructible > > >' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:165:3: required from 'struct boost::CopyConstructibleConcept > > >' /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 > > >]' /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > > >::value' /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]' /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]' /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]' /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]' /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]' shortest_path.cpp:70:28: required from here /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' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:206:3: required from 'struct boost::ConvertibleConcept' /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]' /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >::value' /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: [ 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]' /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]' /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]' /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]' /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]' shortest_path.cpp:70:28: required from here /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]' /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>]' /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' /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> >' /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>)>' /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]' /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]' /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]' /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]' /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]' shortest_path.cpp:70:28: required from here /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' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:206:3: required from 'struct boost::ConvertibleConcept' /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]' /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >::value' /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: [ 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]' /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]' /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]' /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]' /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]' shortest_path.cpp:70:28: required from here /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]' /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>]' /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' /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> >' /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>)>' /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]' /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]' /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]' /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]' /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]' shortest_path.cpp:70:28: required from here /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 >]' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:208:5: required from 'struct boost::Convertible' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:206:3: required from 'struct boost::ConvertibleConcept' /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]' /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >::value' /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]' /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]' /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]' /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]' /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]' shortest_path.cpp:70:28: required from here /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' /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]' /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >::value' /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_)>' /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]' /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]' /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]' /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]' /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]' shortest_path.cpp:70:28: required from here /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 >]' /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 > >]' /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 > > >]' /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:66:5: required from 'struct boost::concepts::Graph, boost::property > >' /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from 'struct boost::concepts::IncidenceGraph, boost::property > >' /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]' /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]' /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]' /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]' /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]' shortest_path.cpp:70:28: required from here /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' /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]' /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >::value' /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_)>' /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]' /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]' /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]' /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]' /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]' shortest_path.cpp:70:28: required from here /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 >]' /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 > >]' /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 > > >]' /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:66:5: required from 'struct boost::concepts::Graph, boost::property > >' /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from 'struct boost::concepts::IncidenceGraph, boost::property > >' /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]' /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]' /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]' /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]' /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]' shortest_path.cpp:70:28: required from here /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' /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]' /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >::value' /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_)>' /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]' /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]' /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]' /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]' /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]' shortest_path.cpp:70:28: required from here /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 >]' /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 > >]' /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 > > >]' /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:66:5: required from 'struct boost::concepts::Graph, boost::property > >' /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from 'struct boost::concepts::IncidenceGraph, boost::property > >' /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]' /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]' /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]' /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]' /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]' shortest_path.cpp:70:28: required from here /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> > >]' /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> >' /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> >]' /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' /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> > >' /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]' /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]' /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]' /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]' /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]' shortest_path.cpp:70:28: required from here /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 > >]' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:137:5: required from 'struct boost::DefaultConstructible >' /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 >]' /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > >::value' /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: [ 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]' /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]' /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]' /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]' /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]' shortest_path.cpp:70:28: required from here /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 > >]' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:233:5: required from 'struct boost::EqualityComparable >' /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 >]' /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > >::value' /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: [ 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]' /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]' /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]' /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]' /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]' shortest_path.cpp:70:28: required from here /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 > >]' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:145:5: required from 'struct boost::Assignable >' /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 >]' /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > >::value' /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: [ 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]' /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]' /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]' /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]' /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]' shortest_path.cpp:70:28: required from here /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 >]' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:208:5: required from 'struct boost::Convertible' /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]' /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >::value' /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: [ 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]' /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]' /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]' /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]' /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]' shortest_path.cpp:70:28: required from here /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 >]' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:208:5: required from 'struct boost::Convertible' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:206:3: required from 'struct boost::ConvertibleConcept' /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]' /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >::value' /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]' /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]' /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]' /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]' /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]' shortest_path.cpp:70:28: required from here /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 >]' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:208:5: required from 'struct boost::Convertible' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:206:3: required from 'struct boost::ConvertibleConcept' /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]' /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >::value' /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]' /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]' /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]' /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]' /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]' shortest_path.cpp:70:28: required from here /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 >]' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:137:5: required from 'struct boost::DefaultConstructible' /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]' /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >::value' /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: [ 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]' /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]' /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]' /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]' /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]' shortest_path.cpp:70:28: required from here /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 >]' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:233:5: required from 'struct boost::EqualityComparable' /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]' /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >::value' /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: [ 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]' /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]' /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]' /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]' /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]' shortest_path.cpp:70:28: required from here /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 >]' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:145:5: required from 'struct boost::Assignable' /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]' /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >::value' /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: [ 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]' /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]' /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]' /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]' /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]' shortest_path.cpp:70:28: required from here /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> >' /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> >' /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> >]' /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' /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> > >' /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]' /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]' /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]' /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]' /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]' shortest_path.cpp:70:28: required from here /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> >' /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> >' /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> >]' /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' /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> > >' /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]' /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]' /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]' /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]' /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]' shortest_path.cpp:70:28: required from here /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> >' /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> >]' /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' /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> > >' /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> >)>' /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]' /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]' /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]' /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]' /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]' shortest_path.cpp:70:28: required from here /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>]' /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> >]' /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 >]' /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 > >]' /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]' /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]' /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]' /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]' /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]' /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]' shortest_path.cpp:70:28: required from here /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> > >]' /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> >' /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> >' /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> >]' /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' /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]' /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]' /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]' /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]' /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]' shortest_path.cpp:70:28: required from here /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> > >]' /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> >' /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> >' /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> >]' /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' /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]' /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]' /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]' /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]' /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]' shortest_path.cpp:70:28: required from here /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> > >]' /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> >' /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> >]' /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' /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> > >' /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]' /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]' /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]' /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]' /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]' shortest_path.cpp:70:28: required from here /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>' /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>]' /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' /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> >' /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_, std::input_iterator_tag>)>' /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]' /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]' /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]' /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]' /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]' shortest_path.cpp:70:28: required from here /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>]' /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> >]' /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>]' /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> >]' /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 >]' /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]' /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]' /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]' /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]' /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]' shortest_path.cpp:70:28: required from here /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> >]' /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:208:5: required from 'struct boost::Convertible, std::input_iterator_tag>' /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>]' /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' /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> >' /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]' /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]' /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]' /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]' /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]' shortest_path.cpp:70:28: required from here /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,now -specs=/usr/lib/rpm/redhat/redhat-hardened-ld -specs=/usr/lib/rpm/redhat/redhat-annobin-cc1 -Wl,--build-id=sha1 -o starvz.so RcppExports.o integrate_step.o last.o separate_res.o shortest_path.o -L/usr/lib64/R/lib -lR last.cpp: In function 'get_last_path': last.cpp:192:52: warning: argument 1 value '18446744073709551615' exceeds maximum object size 9223372036854775807 [-Walloc-size-larger-than=] 192 | CharacterVector* results = new CharacterVector[ns]; | ^ /usr/include/c++/13/new:128:26: note: in a call to allocation function 'operator new []' declared here 128 | _GLIBCXX_NODISCARD void* operator new[](std::size_t) _GLIBCXX_THROW (std::bad_alloc) | ^ installing to /builddir/build/BUILDROOT/R-CRAN-starvz-0.8.0-1.fc38.copr7307546.x86_64/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/BUILDROOT/R-CRAN-starvz-0.8.0-1.fc38.copr7307546.x86_64/usr/local/lib/R/library/R.css + find /builddir/build/BUILDROOT/R-CRAN-starvz-0.8.0-1.fc38.copr7307546.x86_64/usr/local/lib/R/library -type f -exec sed -i s@/builddir/build/BUILDROOT/R-CRAN-starvz-0.8.0-1.fc38.copr7307546.x86_64@@g '{}' ';' + /usr/bin/find-debuginfo -j2 --strict-build-id -m -i --build-id-seed 0.8.0-1.fc38.copr7307546 --unique-debug-suffix -0.8.0-1.fc38.copr7307546.x86_64 --unique-debug-src-base R-CRAN-starvz-0.8.0-1.fc38.copr7307546.x86_64 --run-dwz --dwz-low-mem-die-limit 10000000 --dwz-max-die-limit 110000000 -S debugsourcefiles.list /builddir/build/BUILD/starvz find-debuginfo: starting Extracting debug info from 1 files /usr/bin/gdb.minimal 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.0-1.fc38.copr7307546.x86_64 28 blocks find-debuginfo: done + /usr/lib/rpm/check-buildroot + /usr/lib/rpm/redhat/brp-ldconfig + /usr/lib/rpm/brp-compress + /usr/lib/rpm/redhat/brp-strip-lto /usr/bin/strip + /usr/lib/rpm/brp-strip-static-archive /usr/bin/strip + /usr/lib/rpm/redhat/brp-mangle-shebangs *** WARNING: ./usr/local/lib/R/library/starvz/etc/default.yaml is executable but has no shebang, removing executable bit *** 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 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 + /usr/lib/rpm/brp-remove-la-files + env /usr/lib/rpm/redhat/brp-python-bytecompile '' 1 0 -j2 + /usr/lib/rpm/redhat/brp-python-hardlink Processing files: R-CRAN-starvz-0.8.0-1.fc38.copr7307546.x86_64 Provides: R-CRAN-starvz = 0.8.0-1.fc38.copr7307546 R-CRAN-starvz(x86-64) = 0.8.0-1.fc38.copr7307546 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.4)(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.9)(64bit) libstdc++.so.6(GLIBCXX_3.4)(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.29)(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.0-1.fc38.copr7307546.x86_64 Provides: R-CRAN-starvz-debugsource = 0.8.0-1.fc38.copr7307546 R-CRAN-starvz-debugsource(x86-64) = 0.8.0-1.fc38.copr7307546 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.0-1.fc38.copr7307546.x86_64 Provides: R-CRAN-starvz-debuginfo = 0.8.0-1.fc38.copr7307546 R-CRAN-starvz-debuginfo(x86-64) = 0.8.0-1.fc38.copr7307546 debuginfo(build-id) = 44689d1269de91e4f2dfdc8c1488d8a7410385e1 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.0-1.fc38.copr7307546 Checking for unpackaged file(s): /usr/lib/rpm/check-files /builddir/build/BUILDROOT/R-CRAN-starvz-0.8.0-1.fc38.copr7307546.x86_64 Wrote: /builddir/build/RPMS/R-CRAN-starvz-0.8.0-1.fc38.copr7307546.x86_64.rpm Wrote: /builddir/build/RPMS/R-CRAN-starvz-debugsource-0.8.0-1.fc38.copr7307546.x86_64.rpm Wrote: /builddir/build/RPMS/R-CRAN-starvz-debuginfo-0.8.0-1.fc38.copr7307546.x86_64.rpm Executing(%clean): /bin/sh -e /var/tmp/rpm-tmp.Caz23M + umask 022 + cd /builddir/build/BUILD + cd starvz + /usr/bin/rm -rf /builddir/build/BUILDROOT/R-CRAN-starvz-0.8.0-1.fc38.copr7307546.x86_64 + RPM_EC=0 ++ jobs -p + exit 0 Executing(rmbuild): /bin/sh -e /var/tmp/rpm-tmp.uoh3E9 + umask 022 + cd /builddir/build/BUILD + rm -rf starvz starvz.gemspec + RPM_EC=0 ++ jobs -p + exit 0 RPM build warnings: source_date_epoch_from_changelog set but %changelog is missing Finish: rpmbuild R-CRAN-starvz-0.8.0-1.fc38.copr7307546.src.rpm Finish: build phase for R-CRAN-starvz-0.8.0-1.fc38.copr7307546.src.rpm INFO: chroot_scan: 3 files copied to /var/lib/copr-rpmbuild/results/chroot_scan INFO: /var/lib/mock/fedora-38-x86_64-1713076614.308351/root/var/log/dnf.log /var/lib/mock/fedora-38-x86_64-1713076614.308351/root/var/log/dnf.librepo.log /var/lib/mock/fedora-38-x86_64-1713076614.308351/root/var/log/dnf.rpm.log INFO: Done(/var/lib/copr-rpmbuild/results/R-CRAN-starvz-0.8.0-1.fc38.copr7307546.src.rpm) Config(child) 2 minutes 32 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-debuginfo", "epoch": null, "version": "0.8.0", "release": "1.fc38.copr7307546", "arch": "x86_64" }, { "name": "R-CRAN-starvz", "epoch": null, "version": "0.8.0", "release": "1.fc38.copr7307546", "arch": "x86_64" }, { "name": "R-CRAN-starvz-debugsource", "epoch": null, "version": "0.8.0", "release": "1.fc38.copr7307546", "arch": "x86_64" }, { "name": "R-CRAN-starvz", "epoch": null, "version": "0.8.0", "release": "1.fc38.copr7307546", "arch": "src" } ] } RPMResults finished