Warning: Permanently added '2620:52:3:1:dead:beef:cafe:c191' (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/7998582-fedora-39-x86_64 --chroot fedora-39-x86_64 Version: 0.73 PID: 14549 Logging PID: 14550 Task: {'allow_user_ssh': False, 'appstream': False, 'background': False, 'bootstrap': 'off', 'build_id': 7998582, 'buildroot_pkgs': [], 'chroot': 'fedora-39-x86_64', 'enable_net': False, 'fedora_review': False, 'git_hash': 'c4bcfc41b9918f29e8a585d13275db97c9ea9866', '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.2-1.copr7998582', 'project_dirname': 'cran', 'project_name': 'cran', 'project_owner': 'iucar', 'repo_priority': None, 'repos': [{'baseurl': 'https://download.copr.fedorainfracloud.org/results/iucar/cran/fedora-39-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': '7998582-fedora-39-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-cye1w62y/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-cye1w62y/R-CRAN-starvz', '--depth', '500', '--no-single-branch', '--recursive'] cwd: . rc: 0 stdout: stderr: Cloning into '/var/lib/copr-rpmbuild/workspace/workdir-cye1w62y/R-CRAN-starvz'... Running: git checkout c4bcfc41b9918f29e8a585d13275db97c9ea9866 -- cmd: ['git', 'checkout', 'c4bcfc41b9918f29e8a585d13275db97c9ea9866', '--'] cwd: /var/lib/copr-rpmbuild/workspace/workdir-cye1w62y/R-CRAN-starvz rc: 0 stdout: stderr: Note: switching to 'c4bcfc41b9918f29e8a585d13275db97c9ea9866'. 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 c4bcfc4 automatic import of R-CRAN-starvz Running: copr-distgit-client sources cmd: ['copr-distgit-client', 'sources'] cwd: /var/lib/copr-rpmbuild/workspace/workdir-cye1w62y/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.2.tar.gz INFO: Reading stdout from command: curl --help all INFO: Calling: curl -H Pragma: -o starvz_0.8.2.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.2.tar.gz/md5/6a236e2262a51d04f3d04668e1839f4e/starvz_0.8.2.tar.gz /usr/bin/tail: /var/lib/copr-rpmbuild/main.log: file truncated % Total % Received % Xferd Average Speed Time Time Time Current Dload Upload Total Spent Left Speed 100 291k 100 291k 0 0 4299k 0 --:--:-- --:--:-- --:--:-- 4348k INFO: Reading stdout from command: md5sum starvz_0.8.2.tar.gz Running (timeout=18000): unbuffer mock --spec /var/lib/copr-rpmbuild/workspace/workdir-cye1w62y/R-CRAN-starvz/R-CRAN-starvz.spec --sources /var/lib/copr-rpmbuild/workspace/workdir-cye1w62y/R-CRAN-starvz --resultdir /var/lib/copr-rpmbuild/results --uniqueext 1725845921.254522 -r /var/lib/copr-rpmbuild/results/configs/child.cfg INFO: mock.py version 5.6 starting (python version = 3.12.1, NVR = mock-5.6-1.fc39), args: /usr/libexec/mock/mock --spec /var/lib/copr-rpmbuild/workspace/workdir-cye1w62y/R-CRAN-starvz/R-CRAN-starvz.spec --sources /var/lib/copr-rpmbuild/workspace/workdir-cye1w62y/R-CRAN-starvz --resultdir /var/lib/copr-rpmbuild/results --uniqueext 1725845921.254522 -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-cye1w62y/R-CRAN-starvz/R-CRAN-starvz.spec) Config(fedora-39-x86_64) Start: clean chroot Finish: clean chroot Mock Version: 5.6 INFO: Mock Version: 5.6 Start: chroot init INFO: mounting tmpfs at /var/lib/mock/fedora-39-x86_64-1725845921.254522/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.21.1-1.fc39.noarch python3-dnf-plugins-core-4.9.0-1.fc39.noarch yum-4.21.1-1.fc39.noarch dnf5-5.1.17-2.fc39.x86_64 dnf5-plugins-5.1.17-2.fc39.x86_64 Start: installing minimal buildroot with 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 65 MB/s | 27 MB 00:00 fedora 34 MB/s | 89 MB 00:02 updates 20 MB/s | 41 MB 00:02 Last metadata expiration check: 0:00:05 ago on Mon Sep 9 01:39:11 2024. Dependencies resolved. ================================================================================ Package Arch Version Repo Size ================================================================================ Installing group/module packages: bash x86_64 5.2.26-1.fc39 updates 1.8 M bzip2 x86_64 1.0.8-16.fc39 fedora 52 k coreutils x86_64 9.3-6.fc39 updates 1.1 M cpio x86_64 2.14-4.fc39 fedora 279 k diffutils x86_64 3.10-3.fc39 fedora 398 k fedora-release-common noarch 39-36 updates 19 k findutils x86_64 1:4.9.0-6.fc39 updates 490 k gawk x86_64 5.2.2-2.fc39 fedora 1.1 M glibc-minimal-langpack x86_64 2.38-18.fc39 updates 73 k grep x86_64 3.11-3.fc39 fedora 298 k gzip x86_64 1.12-6.fc39 fedora 166 k info x86_64 7.0.3-3.fc39 fedora 182 k patch x86_64 2.7.6-22.fc39 fedora 125 k redhat-rpm-config noarch 266-1.fc39 updates 78 k rpm-build x86_64 4.19.1.1-1.fc39 updates 78 k sed x86_64 4.8-14.fc39 fedora 306 k shadow-utils x86_64 2:4.14.0-2.fc39 updates 1.3 M tar x86_64 2:1.35-2.fc39 fedora 864 k unzip x86_64 6.0-62.fc39 fedora 184 k util-linux x86_64 2.39.4-1.fc39 updates 1.2 M which x86_64 2.21-40.fc39 fedora 42 k xz x86_64 5.4.4-1.fc39 fedora 556 k Installing dependencies: alternatives x86_64 1.26-1.fc39 updates 39 k ansible-srpm-macros noarch 1-12.fc39 updates 21 k audit-libs x86_64 3.1.5-1.fc39 updates 123 k authselect x86_64 1.4.3-1.fc39 fedora 149 k authselect-libs x86_64 1.4.3-1.fc39 fedora 249 k basesystem noarch 11-18.fc39 fedora 7.2 k binutils x86_64 2.40-14.fc39 updates 5.6 M binutils-gold x86_64 2.40-14.fc39 updates 795 k bzip2-libs x86_64 1.0.8-16.fc39 fedora 41 k ca-certificates noarch 2023.2.60_v7.0.306-2.fc39 fedora 837 k coreutils-common x86_64 9.3-6.fc39 updates 2.1 M cracklib x86_64 2.9.11-2.fc39 fedora 94 k crypto-policies noarch 20231204-1.git1e3a2e4.fc39 updates 100 k curl x86_64 8.2.1-5.fc39 updates 344 k cyrus-sasl-lib x86_64 2.1.28-11.fc39 fedora 793 k debugedit x86_64 5.0-12.fc39 updates 79 k dwz x86_64 0.15-3.fc39 fedora 134 k ed x86_64 1.19-4.fc39 fedora 79 k efi-srpm-macros noarch 5-9.fc39 fedora 22 k elfutils x86_64 0.191-2.fc39 updates 559 k elfutils-debuginfod-client x86_64 0.191-2.fc39 updates 38 k elfutils-default-yama-scope noarch 0.191-2.fc39 updates 13 k elfutils-libelf x86_64 0.191-2.fc39 updates 209 k elfutils-libs x86_64 0.191-2.fc39 updates 263 k fedora-gpg-keys noarch 39-2 updates 130 k fedora-release noarch 39-36 updates 8.6 k fedora-release-identity-basic noarch 39-36 updates 9.4 k fedora-repos noarch 39-2 updates 9.3 k file x86_64 5.44-5.fc39 fedora 49 k file-libs x86_64 5.44-5.fc39 fedora 729 k filesystem x86_64 3.18-6.fc39 fedora 1.1 M fonts-srpm-macros noarch 1:2.0.5-12.fc39 fedora 26 k forge-srpm-macros noarch 0.3.1-1.fc39 updates 19 k fpc-srpm-macros noarch 1.3-8.fc39 fedora 7.4 k gdb-minimal x86_64 15.1-1.fc39 updates 4.3 M gdbm-libs x86_64 1:1.23-4.fc39 fedora 56 k ghc-srpm-macros noarch 1.6.1-2.fc39 fedora 7.8 k glibc x86_64 2.38-18.fc39 updates 2.2 M glibc-common x86_64 2.38-18.fc39 updates 353 k glibc-gconv-extra x86_64 2.38-18.fc39 updates 1.6 M gmp x86_64 1:6.2.1-5.fc39 fedora 313 k gnat-srpm-macros noarch 6-3.fc39 fedora 8.8 k go-srpm-macros noarch 3.5.0-1.fc39 updates 28 k jansson x86_64 2.13.1-7.fc39 fedora 44 k kernel-srpm-macros noarch 1.0-20.fc39 fedora 10 k keyutils-libs x86_64 1.6.3-1.fc39 updates 31 k krb5-libs x86_64 1.21.3-1.fc39 updates 764 k libacl x86_64 2.3.1-9.fc39 updates 23 k libarchive x86_64 3.7.1-2.fc39 updates 407 k libattr x86_64 2.5.1-8.fc39 fedora 18 k libblkid x86_64 2.39.4-1.fc39 updates 116 k libbrotli x86_64 1.1.0-1.fc39 fedora 336 k libcap x86_64 2.48-9.fc39 updates 68 k libcap-ng x86_64 0.8.3-8.fc39 fedora 32 k libcom_err x86_64 1.47.0-2.fc39 fedora 26 k libcurl x86_64 8.2.1-5.fc39 updates 322 k libdb x86_64 5.3.28-56.fc39 fedora 760 k libeconf x86_64 0.5.2-2.fc39 updates 30 k libevent x86_64 2.1.12-9.fc39 fedora 258 k libfdisk x86_64 2.39.4-1.fc39 updates 161 k libffi x86_64 3.4.4-4.fc39 fedora 40 k libgcc x86_64 13.3.1-1.fc39 updates 118 k libgomp x86_64 13.3.1-1.fc39 updates 328 k libidn2 x86_64 2.3.7-1.fc39 updates 119 k libmount x86_64 2.39.4-1.fc39 updates 154 k libnghttp2 x86_64 1.55.1-5.fc39 updates 75 k libnsl2 x86_64 2.0.0-6.fc39 fedora 30 k libpkgconf x86_64 1.9.5-2.fc39 fedora 38 k libpsl x86_64 0.21.2-4.fc39 fedora 63 k libpwquality x86_64 1.4.5-6.fc39 fedora 120 k libselinux x86_64 3.5-5.fc39 fedora 87 k libsemanage x86_64 3.5-4.fc39 fedora 120 k libsepol x86_64 3.5-2.fc39 fedora 324 k libsigsegv x86_64 2.14-5.fc39 fedora 27 k libsmartcols x86_64 2.39.4-1.fc39 updates 67 k libssh x86_64 0.10.6-2.fc39 updates 212 k libssh-config noarch 0.10.6-2.fc39 updates 9.0 k libstdc++ x86_64 13.3.1-1.fc39 updates 869 k libtasn1 x86_64 4.19.0-3.fc39 fedora 74 k libtirpc x86_64 1.3.5-0.fc39 updates 94 k libtool-ltdl x86_64 2.4.7-7.fc39 fedora 36 k libunistring x86_64 1.1-5.fc39 fedora 543 k libutempter x86_64 1.2.1-10.fc39 fedora 26 k libuuid x86_64 2.39.4-1.fc39 updates 28 k libverto x86_64 0.3.2-6.fc39 fedora 20 k libxcrypt x86_64 4.4.36-2.fc39 fedora 119 k libxml2 x86_64 2.10.4-3.fc39 fedora 701 k libzstd x86_64 1.5.6-1.fc39 updates 312 k lua-libs x86_64 5.4.6-3.fc39 fedora 133 k lua-srpm-macros noarch 1-13.fc39 updates 8.7 k lz4-libs x86_64 1.9.4-4.fc39 fedora 67 k mpfr x86_64 4.2.0-3.fc39 fedora 344 k ncurses-base noarch 6.4-7.20230520.fc39.1 updates 88 k ncurses-libs x86_64 6.4-7.20230520.fc39.1 updates 336 k ocaml-srpm-macros noarch 8-2.fc39 fedora 14 k openblas-srpm-macros noarch 2-14.fc39 fedora 7.5 k openldap x86_64 2.6.7-1.fc39 updates 254 k openssl-libs x86_64 1:3.1.4-3.fc39 updates 2.2 M p11-kit x86_64 0.25.5-1.fc39 updates 515 k p11-kit-trust x86_64 0.25.5-1.fc39 updates 138 k package-notes-srpm-macros noarch 0.5-9.fc39 fedora 11 k pam x86_64 1.5.3-3.fc39 updates 542 k pam-libs x86_64 1.5.3-3.fc39 updates 56 k pcre2 x86_64 10.42-1.fc39.2 fedora 233 k pcre2-syntax noarch 10.42-1.fc39.2 fedora 143 k perl-srpm-macros noarch 1-51.fc39 fedora 8.0 k pkgconf x86_64 1.9.5-2.fc39 fedora 42 k pkgconf-m4 noarch 1.9.5-2.fc39 fedora 14 k pkgconf-pkg-config x86_64 1.9.5-2.fc39 fedora 9.6 k popt x86_64 1.19-3.fc39 fedora 66 k publicsuffix-list-dafsa noarch 20240107-1.fc39 updates 58 k pyproject-srpm-macros noarch 1.13.0-1.fc39 updates 13 k python-srpm-macros noarch 3.12-8.fc39 updates 23 k qt5-srpm-macros noarch 5.15.14-2.fc39 updates 8.9 k qt6-srpm-macros noarch 6.6.2-1.fc39 updates 8.9 k readline x86_64 8.2-6.fc39 updates 212 k rpm x86_64 4.19.1.1-1.fc39 updates 538 k rpm-build-libs x86_64 4.19.1.1-1.fc39 updates 95 k rpm-libs x86_64 4.19.1.1-1.fc39 updates 312 k rpm-sequoia x86_64 1.7.0-1.fc39 updates 904 k rpmautospec-rpm-macros noarch 0.7.1-1.fc39 updates 10 k rust-srpm-macros noarch 26.3-1.fc39 updates 13 k setup noarch 2.14.4-1.fc39 fedora 154 k sqlite-libs x86_64 3.42.0-7.fc39 fedora 678 k systemd-libs x86_64 254.16-1.fc39 updates 683 k util-linux-core x86_64 2.39.4-1.fc39 updates 507 k xxhash-libs x86_64 0.8.2-1.fc39 fedora 37 k xz-libs x86_64 5.4.4-1.fc39 fedora 108 k zip x86_64 3.0-39.fc39 fedora 266 k zlib x86_64 1.2.13-4.fc39 fedora 94 k zstd x86_64 1.5.6-1.fc39 updates 479 k Installing Groups: Buildsystem building group Transaction Summary ================================================================================ Install 153 Packages Total download size: 52 M Installed size: 179 M Downloading Packages: (1/153): basesystem-11-18.fc39.noarch.rpm 59 kB/s | 7.2 kB 00:00 (2/153): bzip2-1.0.8-16.fc39.x86_64.rpm 621 kB/s | 52 kB 00:00 (3/153): authselect-1.4.3-1.fc39.x86_64.rpm 617 kB/s | 149 kB 00:00 (4/153): authselect-libs-1.4.3-1.fc39.x86_64.rp 1.0 MB/s | 249 kB 00:00 (5/153): bzip2-libs-1.0.8-16.fc39.x86_64.rpm 830 kB/s | 41 kB 00:00 (6/153): cpio-2.14-4.fc39.x86_64.rpm 4.2 MB/s | 279 kB 00:00 (7/153): cracklib-2.9.11-2.fc39.x86_64.rpm 1.3 MB/s | 94 kB 00:00 (8/153): ca-certificates-2023.2.60_v7.0.306-2.f 6.4 MB/s | 837 kB 00:00 (9/153): cyrus-sasl-lib-2.1.28-11.fc39.x86_64.r 10 MB/s | 793 kB 00:00 (10/153): dwz-0.15-3.fc39.x86_64.rpm 3.7 MB/s | 134 kB 00:00 (11/153): ed-1.19-4.fc39.x86_64.rpm 2.3 MB/s | 79 kB 00:00 (12/153): diffutils-3.10-3.fc39.x86_64.rpm 3.9 MB/s | 398 kB 00:00 (13/153): efi-srpm-macros-5-9.fc39.noarch.rpm 674 kB/s | 22 kB 00:00 (14/153): file-5.44-5.fc39.x86_64.rpm 1.5 MB/s | 49 kB 00:00 (15/153): fonts-srpm-macros-2.0.5-12.fc39.noarc 816 kB/s | 26 kB 00:00 (16/153): filesystem-3.18-6.fc39.x86_64.rpm 18 MB/s | 1.1 MB 00:00 (17/153): file-libs-5.44-5.fc39.x86_64.rpm 9.5 MB/s | 729 kB 00:00 (18/153): fpc-srpm-macros-1.3-8.fc39.noarch.rpm 229 kB/s | 7.4 kB 00:00 (19/153): gdbm-libs-1.23-4.fc39.x86_64.rpm 1.6 MB/s | 56 kB 00:00 (20/153): ghc-srpm-macros-1.6.1-2.fc39.noarch.r 240 kB/s | 7.8 kB 00:00 (21/153): gawk-5.2.2-2.fc39.x86_64.rpm 20 MB/s | 1.1 MB 00:00 (22/153): gmp-6.2.1-5.fc39.x86_64.rpm 7.7 MB/s | 313 kB 00:00 (23/153): gnat-srpm-macros-6-3.fc39.noarch.rpm 268 kB/s | 8.8 kB 00:00 (24/153): grep-3.11-3.fc39.x86_64.rpm 7.5 MB/s | 298 kB 00:00 (25/153): gzip-1.12-6.fc39.x86_64.rpm 4.5 MB/s | 166 kB 00:00 (26/153): info-7.0.3-3.fc39.x86_64.rpm 5.0 MB/s | 182 kB 00:00 (27/153): jansson-2.13.1-7.fc39.x86_64.rpm 1.3 MB/s | 44 kB 00:00 (28/153): kernel-srpm-macros-1.0-20.fc39.noarch 320 kB/s | 10 kB 00:00 (29/153): libattr-2.5.1-8.fc39.x86_64.rpm 535 kB/s | 18 kB 00:00 (30/153): libbrotli-1.1.0-1.fc39.x86_64.rpm 8.2 MB/s | 336 kB 00:00 (31/153): libcap-ng-0.8.3-8.fc39.x86_64.rpm 972 kB/s | 32 kB 00:00 (32/153): libcom_err-1.47.0-2.fc39.x86_64.rpm 782 kB/s | 26 kB 00:00 (33/153): libdb-5.3.28-56.fc39.x86_64.rpm 15 MB/s | 760 kB 00:00 (34/153): libevent-2.1.12-9.fc39.x86_64.rpm 6.4 MB/s | 258 kB 00:00 (35/153): libffi-3.4.4-4.fc39.x86_64.rpm 1.2 MB/s | 40 kB 00:00 (36/153): libnsl2-2.0.0-6.fc39.x86_64.rpm 914 kB/s | 30 kB 00:00 (37/153): libpkgconf-1.9.5-2.fc39.x86_64.rpm 1.1 MB/s | 38 kB 00:00 (38/153): libpsl-0.21.2-4.fc39.x86_64.rpm 1.8 MB/s | 63 kB 00:00 (39/153): libpwquality-1.4.5-6.fc39.x86_64.rpm 3.4 MB/s | 120 kB 00:00 (40/153): libselinux-3.5-5.fc39.x86_64.rpm 2.5 MB/s | 87 kB 00:00 (41/153): libsemanage-3.5-4.fc39.x86_64.rpm 3.4 MB/s | 120 kB 00:00 (42/153): libsigsegv-2.14-5.fc39.x86_64.rpm 809 kB/s | 27 kB 00:00 (43/153): libsepol-3.5-2.fc39.x86_64.rpm 8.0 MB/s | 324 kB 00:00 (44/153): libtasn1-4.19.0-3.fc39.x86_64.rpm 2.1 MB/s | 74 kB 00:00 (45/153): libtool-ltdl-2.4.7-7.fc39.x86_64.rpm 1.1 MB/s | 36 kB 00:00 (46/153): libutempter-1.2.1-10.fc39.x86_64.rpm 793 kB/s | 26 kB 00:00 (47/153): libunistring-1.1-5.fc39.x86_64.rpm 12 MB/s | 543 kB 00:00 (48/153): libverto-0.3.2-6.fc39.x86_64.rpm 617 kB/s | 20 kB 00:00 (49/153): libxcrypt-4.4.36-2.fc39.x86_64.rpm 3.4 MB/s | 119 kB 00:00 (50/153): libxml2-2.10.4-3.fc39.x86_64.rpm 14 MB/s | 701 kB 00:00 (51/153): lua-libs-5.4.6-3.fc39.x86_64.rpm 3.7 MB/s | 133 kB 00:00 (52/153): lz4-libs-1.9.4-4.fc39.x86_64.rpm 2.0 MB/s | 67 kB 00:00 (53/153): ocaml-srpm-macros-8-2.fc39.noarch.rpm 413 kB/s | 14 kB 00:00 (54/153): mpfr-4.2.0-3.fc39.x86_64.rpm 8.4 MB/s | 344 kB 00:00 (55/153): openblas-srpm-macros-2-14.fc39.noarch 229 kB/s | 7.5 kB 00:00 (56/153): package-notes-srpm-macros-0.5-9.fc39. 340 kB/s | 11 kB 00:00 (57/153): patch-2.7.6-22.fc39.x86_64.rpm 3.5 MB/s | 125 kB 00:00 (58/153): pcre2-10.42-1.fc39.2.x86_64.rpm 6.2 MB/s | 233 kB 00:00 (59/153): pcre2-syntax-10.42-1.fc39.2.noarch.rp 3.9 MB/s | 143 kB 00:00 (60/153): perl-srpm-macros-1-51.fc39.noarch.rpm 248 kB/s | 8.0 kB 00:00 (61/153): pkgconf-1.9.5-2.fc39.x86_64.rpm 1.2 MB/s | 42 kB 00:00 (62/153): pkgconf-m4-1.9.5-2.fc39.noarch.rpm 422 kB/s | 14 kB 00:00 (63/153): pkgconf-pkg-config-1.9.5-2.fc39.x86_6 297 kB/s | 9.6 kB 00:00 (64/153): popt-1.19-3.fc39.x86_64.rpm 1.9 MB/s | 66 kB 00:00 (65/153): setup-2.14.4-1.fc39.noarch.rpm 4.2 MB/s | 154 kB 00:00 (66/153): sed-4.8-14.fc39.x86_64.rpm 7.7 MB/s | 306 kB 00:00 (67/153): sqlite-libs-3.42.0-7.fc39.x86_64.rpm 15 MB/s | 678 kB 00:00 (68/153): unzip-6.0-62.fc39.x86_64.rpm 4.9 MB/s | 184 kB 00:00 (69/153): which-2.21-40.fc39.x86_64.rpm 1.2 MB/s | 42 kB 00:00 (70/153): tar-1.35-2.fc39.x86_64.rpm 16 MB/s | 864 kB 00:00 (71/153): xxhash-libs-0.8.2-1.fc39.x86_64.rpm 1.1 MB/s | 37 kB 00:00 (72/153): xz-libs-5.4.4-1.fc39.x86_64.rpm 3.0 MB/s | 108 kB 00:00 (73/153): xz-5.4.4-1.fc39.x86_64.rpm 13 MB/s | 556 kB 00:00 (74/153): zip-3.0-39.fc39.x86_64.rpm 6.8 MB/s | 266 kB 00:00 (75/153): zlib-1.2.13-4.fc39.x86_64.rpm 2.7 MB/s | 94 kB 00:00 (76/153): alternatives-1.26-1.fc39.x86_64.rpm 284 kB/s | 39 kB 00:00 (77/153): ansible-srpm-macros-1-12.fc39.noarch. 171 kB/s | 21 kB 00:00 (78/153): audit-libs-3.1.5-1.fc39.x86_64.rpm 767 kB/s | 123 kB 00:00 (79/153): binutils-gold-2.40-14.fc39.x86_64.rpm 10 MB/s | 795 kB 00:00 (80/153): bash-5.2.26-1.fc39.x86_64.rpm 11 MB/s | 1.8 MB 00:00 (81/153): binutils-2.40-14.fc39.x86_64.rpm 28 MB/s | 5.6 MB 00:00 (82/153): coreutils-9.3-6.fc39.x86_64.rpm 15 MB/s | 1.1 MB 00:00 (83/153): crypto-policies-20231204-1.git1e3a2e4 2.1 MB/s | 100 kB 00:00 (84/153): curl-8.2.1-5.fc39.x86_64.rpm 7.2 MB/s | 344 kB 00:00 (85/153): debugedit-5.0-12.fc39.x86_64.rpm 1.9 MB/s | 79 kB 00:00 (86/153): elfutils-0.191-2.fc39.x86_64.rpm 12 MB/s | 559 kB 00:00 (87/153): elfutils-debuginfod-client-0.191-2.fc 978 kB/s | 38 kB 00:00 (88/153): elfutils-default-yama-scope-0.191-2.f 345 kB/s | 13 kB 00:00 (89/153): elfutils-libelf-0.191-2.fc39.x86_64.r 5.0 MB/s | 209 kB 00:00 (90/153): elfutils-libs-0.191-2.fc39.x86_64.rpm 6.2 MB/s | 263 kB 00:00 (91/153): fedora-gpg-keys-39-2.noarch.rpm 3.2 MB/s | 130 kB 00:00 (92/153): fedora-release-39-36.noarch.rpm 224 kB/s | 8.6 kB 00:00 (93/153): fedora-release-common-39-36.noarch.rp 476 kB/s | 19 kB 00:00 (94/153): fedora-release-identity-basic-39-36.n 246 kB/s | 9.4 kB 00:00 (95/153): coreutils-common-9.3-6.fc39.x86_64.rp 7.1 MB/s | 2.1 MB 00:00 (96/153): fedora-repos-39-2.noarch.rpm 241 kB/s | 9.3 kB 00:00 (97/153): findutils-4.9.0-6.fc39.x86_64.rpm 11 MB/s | 490 kB 00:00 (98/153): forge-srpm-macros-0.3.1-1.fc39.noarch 502 kB/s | 19 kB 00:00 (99/153): glibc-common-2.38-18.fc39.x86_64.rpm 6.6 MB/s | 353 kB 00:00 (100/153): glibc-2.38-18.fc39.x86_64.rpm 25 MB/s | 2.2 MB 00:00 (101/153): gdb-minimal-15.1-1.fc39.x86_64.rpm 37 MB/s | 4.3 MB 00:00 (102/153): glibc-gconv-extra-2.38-18.fc39.x86_6 25 MB/s | 1.6 MB 00:00 (103/153): glibc-minimal-langpack-2.38-18.fc39. 1.6 MB/s | 73 kB 00:00 (104/153): go-srpm-macros-3.5.0-1.fc39.noarch.r 705 kB/s | 28 kB 00:00 (105/153): keyutils-libs-1.6.3-1.fc39.x86_64.rp 804 kB/s | 31 kB 00:00 (106/153): krb5-libs-1.21.3-1.fc39.x86_64.rpm 16 MB/s | 764 kB 00:00 (107/153): libacl-2.3.1-9.fc39.x86_64.rpm 598 kB/s | 23 kB 00:00 (108/153): libarchive-3.7.1-2.fc39.x86_64.rpm 9.4 MB/s | 407 kB 00:00 (109/153): libblkid-2.39.4-1.fc39.x86_64.rpm 2.9 MB/s | 116 kB 00:00 (110/153): libcap-2.48-9.fc39.x86_64.rpm 1.7 MB/s | 68 kB 00:00 (111/153): libeconf-0.5.2-2.fc39.x86_64.rpm 753 kB/s | 30 kB 00:00 (112/153): libcurl-8.2.1-5.fc39.x86_64.rpm 7.0 MB/s | 322 kB 00:00 (113/153): libfdisk-2.39.4-1.fc39.x86_64.rpm 3.9 MB/s | 161 kB 00:00 (114/153): libgcc-13.3.1-1.fc39.x86_64.rpm 2.9 MB/s | 118 kB 00:00 (115/153): libgomp-13.3.1-1.fc39.x86_64.rpm 7.6 MB/s | 328 kB 00:00 (116/153): libidn2-2.3.7-1.fc39.x86_64.rpm 2.9 MB/s | 119 kB 00:00 (117/153): libmount-2.39.4-1.fc39.x86_64.rpm 3.7 MB/s | 154 kB 00:00 (118/153): libnghttp2-1.55.1-5.fc39.x86_64.rpm 1.9 MB/s | 75 kB 00:00 (119/153): libsmartcols-2.39.4-1.fc39.x86_64.rp 1.7 MB/s | 67 kB 00:00 (120/153): libssh-0.10.6-2.fc39.x86_64.rpm 5.1 MB/s | 212 kB 00:00 (121/153): libssh-config-0.10.6-2.fc39.noarch.r 224 kB/s | 9.0 kB 00:00 (122/153): libstdc++-13.3.1-1.fc39.x86_64.rpm 18 MB/s | 869 kB 00:00 (123/153): libuuid-2.39.4-1.fc39.x86_64.rpm 716 kB/s | 28 kB 00:00 (124/153): libtirpc-1.3.5-0.fc39.x86_64.rpm 2.3 MB/s | 94 kB 00:00 (125/153): libzstd-1.5.6-1.fc39.x86_64.rpm 7.3 MB/s | 312 kB 00:00 (126/153): lua-srpm-macros-1-13.fc39.noarch.rpm 228 kB/s | 8.7 kB 00:00 (127/153): ncurses-base-6.4-7.20230520.fc39.1.n 2.2 MB/s | 88 kB 00:00 (128/153): ncurses-libs-6.4-7.20230520.fc39.1.x 7.9 MB/s | 336 kB 00:00 (129/153): openldap-2.6.7-1.fc39.x86_64.rpm 5.9 MB/s | 254 kB 00:00 (130/153): p11-kit-0.25.5-1.fc39.x86_64.rpm 11 MB/s | 515 kB 00:00 (131/153): openssl-libs-3.1.4-3.fc39.x86_64.rpm 31 MB/s | 2.2 MB 00:00 (132/153): p11-kit-trust-0.25.5-1.fc39.x86_64.r 3.2 MB/s | 138 kB 00:00 (133/153): pam-1.5.3-3.fc39.x86_64.rpm 12 MB/s | 542 kB 00:00 (134/153): pam-libs-1.5.3-3.fc39.x86_64.rpm 1.4 MB/s | 56 kB 00:00 (135/153): publicsuffix-list-dafsa-20240107-1.f 1.4 MB/s | 58 kB 00:00 (136/153): pyproject-srpm-macros-1.13.0-1.fc39. 334 kB/s | 13 kB 00:00 (137/153): python-srpm-macros-3.12-8.fc39.noarc 565 kB/s | 23 kB 00:00 (138/153): qt5-srpm-macros-5.15.14-2.fc39.noarc 226 kB/s | 8.9 kB 00:00 (139/153): qt6-srpm-macros-6.6.2-1.fc39.noarch. 233 kB/s | 8.9 kB 00:00 (140/153): readline-8.2-6.fc39.x86_64.rpm 5.1 MB/s | 212 kB 00:00 (141/153): redhat-rpm-config-266-1.fc39.noarch. 1.9 MB/s | 78 kB 00:00 (142/153): rpm-4.19.1.1-1.fc39.x86_64.rpm 12 MB/s | 538 kB 00:00 (143/153): rpm-build-4.19.1.1-1.fc39.x86_64.rpm 2.0 MB/s | 78 kB 00:00 (144/153): rpm-build-libs-4.19.1.1-1.fc39.x86_6 2.2 MB/s | 95 kB 00:00 (145/153): rpm-libs-4.19.1.1-1.fc39.x86_64.rpm 7.3 MB/s | 312 kB 00:00 (146/153): rpm-sequoia-1.7.0-1.fc39.x86_64.rpm 18 MB/s | 904 kB 00:00 (147/153): rpmautospec-rpm-macros-0.7.1-1.fc39. 262 kB/s | 10 kB 00:00 (148/153): rust-srpm-macros-26.3-1.fc39.noarch. 326 kB/s | 13 kB 00:00 (149/153): systemd-libs-254.16-1.fc39.x86_64.rp 13 MB/s | 683 kB 00:00 (150/153): shadow-utils-4.14.0-2.fc39.x86_64.rp 21 MB/s | 1.3 MB 00:00 (151/153): util-linux-2.39.4-1.fc39.x86_64.rpm 20 MB/s | 1.2 MB 00:00 (152/153): util-linux-core-2.39.4-1.fc39.x86_64 11 MB/s | 507 kB 00:00 (153/153): zstd-1.5.6-1.fc39.x86_64.rpm 9.6 MB/s | 479 kB 00:00 -------------------------------------------------------------------------------- Total 19 MB/s | 52 MB 00:02 fedora 1.6 MB/s | 1.6 kB 00:00 Importing GPG key 0x18B8E74C: Userid : "Fedora (39) " Fingerprint: E8F2 3996 F232 1864 0CB4 4CBE 75CF 5AC4 18B8 E74C From : /usr/share/distribution-gpg-keys/fedora/RPM-GPG-KEY-fedora-39-primary Key imported successfully Running transaction check Transaction check succeeded. Running transaction test Transaction test succeeded. Running transaction Running scriptlet: filesystem-3.18-6.fc39.x86_64 1/1 Preparing : 1/1 Installing : libgcc-13.3.1-1.fc39.x86_64 1/153 Running scriptlet: libgcc-13.3.1-1.fc39.x86_64 1/153 Installing : crypto-policies-20231204-1.git1e3a2e4.fc39.noarc 2/153 Running scriptlet: crypto-policies-20231204-1.git1e3a2e4.fc39.noarc 2/153 Installing : fedora-release-identity-basic-39-36.noarch 3/153 Installing : fedora-gpg-keys-39-2.noarch 4/153 Installing : fedora-repos-39-2.noarch 5/153 Installing : fedora-release-common-39-36.noarch 6/153 Installing : fedora-release-39-36.noarch 7/153 Installing : setup-2.14.4-1.fc39.noarch 8/153 warning: /etc/hosts created as /etc/hosts.rpmnew Running scriptlet: setup-2.14.4-1.fc39.noarch 8/153 Installing : filesystem-3.18-6.fc39.x86_64 9/153 Installing : basesystem-11-18.fc39.noarch 10/153 Installing : rust-srpm-macros-26.3-1.fc39.noarch 11/153 Installing : qt6-srpm-macros-6.6.2-1.fc39.noarch 12/153 Installing : qt5-srpm-macros-5.15.14-2.fc39.noarch 13/153 Installing : publicsuffix-list-dafsa-20240107-1.fc39.noarch 14/153 Installing : ncurses-base-6.4-7.20230520.fc39.1.noarch 15/153 Installing : glibc-gconv-extra-2.38-18.fc39.x86_64 16/153 Running scriptlet: glibc-gconv-extra-2.38-18.fc39.x86_64 16/153 Installing : glibc-minimal-langpack-2.38-18.fc39.x86_64 17/153 Installing : glibc-common-2.38-18.fc39.x86_64 18/153 Running scriptlet: glibc-2.38-18.fc39.x86_64 19/153 Installing : glibc-2.38-18.fc39.x86_64 19/153 Running scriptlet: glibc-2.38-18.fc39.x86_64 19/153 Installing : ncurses-libs-6.4-7.20230520.fc39.1.x86_64 20/153 Installing : bash-5.2.26-1.fc39.x86_64 21/153 Running scriptlet: bash-5.2.26-1.fc39.x86_64 21/153 Installing : zlib-1.2.13-4.fc39.x86_64 22/153 Installing : xz-libs-5.4.4-1.fc39.x86_64 23/153 Installing : bzip2-libs-1.0.8-16.fc39.x86_64 24/153 Installing : popt-1.19-3.fc39.x86_64 25/153 Installing : libstdc++-13.3.1-1.fc39.x86_64 26/153 Installing : libuuid-2.39.4-1.fc39.x86_64 27/153 Installing : libzstd-1.5.6-1.fc39.x86_64 28/153 Installing : elfutils-libelf-0.191-2.fc39.x86_64 29/153 Installing : libblkid-2.39.4-1.fc39.x86_64 30/153 Installing : readline-8.2-6.fc39.x86_64 31/153 Installing : gmp-1:6.2.1-5.fc39.x86_64 32/153 Installing : libattr-2.5.1-8.fc39.x86_64 33/153 Installing : libacl-2.3.1-9.fc39.x86_64 34/153 Installing : libxcrypt-4.4.36-2.fc39.x86_64 35/153 Installing : libcap-2.48-9.fc39.x86_64 36/153 Installing : lz4-libs-1.9.4-4.fc39.x86_64 37/153 Installing : libeconf-0.5.2-2.fc39.x86_64 38/153 Installing : systemd-libs-254.16-1.fc39.x86_64 39/153 Installing : mpfr-4.2.0-3.fc39.x86_64 40/153 Installing : dwz-0.15-3.fc39.x86_64 41/153 Installing : unzip-6.0-62.fc39.x86_64 42/153 Installing : file-libs-5.44-5.fc39.x86_64 43/153 Installing : file-5.44-5.fc39.x86_64 44/153 Installing : jansson-2.13.1-7.fc39.x86_64 45/153 Installing : libcap-ng-0.8.3-8.fc39.x86_64 46/153 Installing : audit-libs-3.1.5-1.fc39.x86_64 47/153 Installing : pam-libs-1.5.3-3.fc39.x86_64 48/153 Installing : libcom_err-1.47.0-2.fc39.x86_64 49/153 Installing : libsepol-3.5-2.fc39.x86_64 50/153 Installing : libtasn1-4.19.0-3.fc39.x86_64 51/153 Installing : libunistring-1.1-5.fc39.x86_64 52/153 Installing : libidn2-2.3.7-1.fc39.x86_64 53/153 Installing : lua-libs-5.4.6-3.fc39.x86_64 54/153 Installing : alternatives-1.26-1.fc39.x86_64 55/153 Installing : libsmartcols-2.39.4-1.fc39.x86_64 56/153 Installing : libpsl-0.21.2-4.fc39.x86_64 57/153 Installing : zip-3.0-39.fc39.x86_64 58/153 Installing : zstd-1.5.6-1.fc39.x86_64 59/153 Installing : libfdisk-2.39.4-1.fc39.x86_64 60/153 Installing : bzip2-1.0.8-16.fc39.x86_64 61/153 Installing : libxml2-2.10.4-3.fc39.x86_64 62/153 Installing : sqlite-libs-3.42.0-7.fc39.x86_64 63/153 Installing : ed-1.19-4.fc39.x86_64 64/153 Installing : elfutils-default-yama-scope-0.191-2.fc39.noarch 65/153 Running scriptlet: elfutils-default-yama-scope-0.191-2.fc39.noarch 65/153 Installing : cpio-2.14-4.fc39.x86_64 66/153 Installing : diffutils-3.10-3.fc39.x86_64 67/153 Installing : gdbm-libs-1:1.23-4.fc39.x86_64 68/153 Installing : cyrus-sasl-lib-2.1.28-11.fc39.x86_64 69/153 Installing : libbrotli-1.1.0-1.fc39.x86_64 70/153 Installing : libdb-5.3.28-56.fc39.x86_64 71/153 Installing : libffi-3.4.4-4.fc39.x86_64 72/153 Installing : p11-kit-0.25.5-1.fc39.x86_64 73/153 Installing : p11-kit-trust-0.25.5-1.fc39.x86_64 74/153 Running scriptlet: p11-kit-trust-0.25.5-1.fc39.x86_64 74/153 Installing : libpkgconf-1.9.5-2.fc39.x86_64 75/153 Installing : pkgconf-1.9.5-2.fc39.x86_64 76/153 Installing : libsigsegv-2.14-5.fc39.x86_64 77/153 Installing : gawk-5.2.2-2.fc39.x86_64 78/153 Installing : libtool-ltdl-2.4.7-7.fc39.x86_64 79/153 Installing : libverto-0.3.2-6.fc39.x86_64 80/153 Installing : xxhash-libs-0.8.2-1.fc39.x86_64 81/153 Installing : keyutils-libs-1.6.3-1.fc39.x86_64 82/153 Installing : libgomp-13.3.1-1.fc39.x86_64 83/153 Installing : libnghttp2-1.55.1-5.fc39.x86_64 84/153 Installing : libssh-config-0.10.6-2.fc39.noarch 85/153 Installing : coreutils-common-9.3-6.fc39.x86_64 86/153 Installing : ansible-srpm-macros-1-12.fc39.noarch 87/153 Installing : pkgconf-m4-1.9.5-2.fc39.noarch 88/153 Installing : pkgconf-pkg-config-1.9.5-2.fc39.x86_64 89/153 Installing : perl-srpm-macros-1-51.fc39.noarch 90/153 Installing : pcre2-syntax-10.42-1.fc39.2.noarch 91/153 Installing : pcre2-10.42-1.fc39.2.x86_64 92/153 Installing : libselinux-3.5-5.fc39.x86_64 93/153 Installing : sed-4.8-14.fc39.x86_64 94/153 Installing : grep-3.11-3.fc39.x86_64 95/153 Installing : findutils-1:4.9.0-6.fc39.x86_64 96/153 Installing : xz-5.4.4-1.fc39.x86_64 97/153 Installing : libmount-2.39.4-1.fc39.x86_64 98/153 Installing : util-linux-core-2.39.4-1.fc39.x86_64 99/153 Installing : openssl-libs-1:3.1.4-3.fc39.x86_64 100/153 Installing : coreutils-9.3-6.fc39.x86_64 101/153 Running scriptlet: ca-certificates-2023.2.60_v7.0.306-2.fc39.noarch 102/153 Installing : ca-certificates-2023.2.60_v7.0.306-2.fc39.noarch 102/153 Running scriptlet: ca-certificates-2023.2.60_v7.0.306-2.fc39.noarch 102/153 Installing : krb5-libs-1.21.3-1.fc39.x86_64 103/153 Installing : libtirpc-1.3.5-0.fc39.x86_64 104/153 Running scriptlet: authselect-libs-1.4.3-1.fc39.x86_64 105/153 Installing : authselect-libs-1.4.3-1.fc39.x86_64 105/153 Installing : gzip-1.12-6.fc39.x86_64 106/153 Installing : libarchive-3.7.1-2.fc39.x86_64 107/153 Installing : cracklib-2.9.11-2.fc39.x86_64 108/153 Installing : libpwquality-1.4.5-6.fc39.x86_64 109/153 Installing : authselect-1.4.3-1.fc39.x86_64 110/153 Installing : libnsl2-2.0.0-6.fc39.x86_64 111/153 Installing : pam-1.5.3-3.fc39.x86_64 112/153 Installing : libssh-0.10.6-2.fc39.x86_64 113/153 Installing : libevent-2.1.12-9.fc39.x86_64 114/153 Installing : openldap-2.6.7-1.fc39.x86_64 115/153 Installing : libcurl-8.2.1-5.fc39.x86_64 116/153 Installing : elfutils-libs-0.191-2.fc39.x86_64 117/153 Installing : elfutils-debuginfod-client-0.191-2.fc39.x86_64 118/153 Installing : binutils-gold-2.40-14.fc39.x86_64 119/153 Running scriptlet: binutils-gold-2.40-14.fc39.x86_64 119/153 Installing : binutils-2.40-14.fc39.x86_64 120/153 Running scriptlet: binutils-2.40-14.fc39.x86_64 120/153 Installing : elfutils-0.191-2.fc39.x86_64 121/153 Installing : gdb-minimal-15.1-1.fc39.x86_64 122/153 Installing : debugedit-5.0-12.fc39.x86_64 123/153 Installing : curl-8.2.1-5.fc39.x86_64 124/153 Installing : rpm-sequoia-1.7.0-1.fc39.x86_64 125/153 Installing : rpm-libs-4.19.1.1-1.fc39.x86_64 126/153 Running scriptlet: rpm-4.19.1.1-1.fc39.x86_64 127/153 Installing : rpm-4.19.1.1-1.fc39.x86_64 127/153 Installing : efi-srpm-macros-5-9.fc39.noarch 128/153 Installing : lua-srpm-macros-1-13.fc39.noarch 129/153 Installing : rpmautospec-rpm-macros-0.7.1-1.fc39.noarch 130/153 Installing : rpm-build-libs-4.19.1.1-1.fc39.x86_64 131/153 Installing : libsemanage-3.5-4.fc39.x86_64 132/153 Installing : shadow-utils-2:4.14.0-2.fc39.x86_64 133/153 Running scriptlet: libutempter-1.2.1-10.fc39.x86_64 134/153 Installing : libutempter-1.2.1-10.fc39.x86_64 134/153 Installing : patch-2.7.6-22.fc39.x86_64 135/153 Installing : tar-2:1.35-2.fc39.x86_64 136/153 Installing : package-notes-srpm-macros-0.5-9.fc39.noarch 137/153 Installing : openblas-srpm-macros-2-14.fc39.noarch 138/153 Installing : ocaml-srpm-macros-8-2.fc39.noarch 139/153 Installing : kernel-srpm-macros-1.0-20.fc39.noarch 140/153 Installing : gnat-srpm-macros-6-3.fc39.noarch 141/153 Installing : ghc-srpm-macros-1.6.1-2.fc39.noarch 142/153 Installing : fpc-srpm-macros-1.3-8.fc39.noarch 143/153 Installing : fonts-srpm-macros-1:2.0.5-12.fc39.noarch 144/153 Installing : forge-srpm-macros-0.3.1-1.fc39.noarch 145/153 Installing : go-srpm-macros-3.5.0-1.fc39.noarch 146/153 Installing : python-srpm-macros-3.12-8.fc39.noarch 147/153 Installing : redhat-rpm-config-266-1.fc39.noarch 148/153 Installing : rpm-build-4.19.1.1-1.fc39.x86_64 149/153 Installing : pyproject-srpm-macros-1.13.0-1.fc39.noarch 150/153 Installing : util-linux-2.39.4-1.fc39.x86_64 151/153 Running scriptlet: util-linux-2.39.4-1.fc39.x86_64 151/153 Installing : which-2.21-40.fc39.x86_64 152/153 Installing : info-7.0.3-3.fc39.x86_64 153/153 Running scriptlet: filesystem-3.18-6.fc39.x86_64 153/153 Running scriptlet: ca-certificates-2023.2.60_v7.0.306-2.fc39.noarch 153/153 Running scriptlet: authselect-libs-1.4.3-1.fc39.x86_64 153/153 Running scriptlet: rpm-4.19.1.1-1.fc39.x86_64 153/153 Running scriptlet: info-7.0.3-3.fc39.x86_64 153/153 Verifying : authselect-1.4.3-1.fc39.x86_64 1/153 Verifying : authselect-libs-1.4.3-1.fc39.x86_64 2/153 Verifying : basesystem-11-18.fc39.noarch 3/153 Verifying : bzip2-1.0.8-16.fc39.x86_64 4/153 Verifying : bzip2-libs-1.0.8-16.fc39.x86_64 5/153 Verifying : ca-certificates-2023.2.60_v7.0.306-2.fc39.noarch 6/153 Verifying : cpio-2.14-4.fc39.x86_64 7/153 Verifying : cracklib-2.9.11-2.fc39.x86_64 8/153 Verifying : cyrus-sasl-lib-2.1.28-11.fc39.x86_64 9/153 Verifying : diffutils-3.10-3.fc39.x86_64 10/153 Verifying : dwz-0.15-3.fc39.x86_64 11/153 Verifying : ed-1.19-4.fc39.x86_64 12/153 Verifying : efi-srpm-macros-5-9.fc39.noarch 13/153 Verifying : file-5.44-5.fc39.x86_64 14/153 Verifying : file-libs-5.44-5.fc39.x86_64 15/153 Verifying : filesystem-3.18-6.fc39.x86_64 16/153 Verifying : fonts-srpm-macros-1:2.0.5-12.fc39.noarch 17/153 Verifying : fpc-srpm-macros-1.3-8.fc39.noarch 18/153 Verifying : gawk-5.2.2-2.fc39.x86_64 19/153 Verifying : gdbm-libs-1:1.23-4.fc39.x86_64 20/153 Verifying : ghc-srpm-macros-1.6.1-2.fc39.noarch 21/153 Verifying : gmp-1:6.2.1-5.fc39.x86_64 22/153 Verifying : gnat-srpm-macros-6-3.fc39.noarch 23/153 Verifying : grep-3.11-3.fc39.x86_64 24/153 Verifying : gzip-1.12-6.fc39.x86_64 25/153 Verifying : info-7.0.3-3.fc39.x86_64 26/153 Verifying : jansson-2.13.1-7.fc39.x86_64 27/153 Verifying : kernel-srpm-macros-1.0-20.fc39.noarch 28/153 Verifying : libattr-2.5.1-8.fc39.x86_64 29/153 Verifying : libbrotli-1.1.0-1.fc39.x86_64 30/153 Verifying : libcap-ng-0.8.3-8.fc39.x86_64 31/153 Verifying : libcom_err-1.47.0-2.fc39.x86_64 32/153 Verifying : libdb-5.3.28-56.fc39.x86_64 33/153 Verifying : libevent-2.1.12-9.fc39.x86_64 34/153 Verifying : libffi-3.4.4-4.fc39.x86_64 35/153 Verifying : libnsl2-2.0.0-6.fc39.x86_64 36/153 Verifying : libpkgconf-1.9.5-2.fc39.x86_64 37/153 Verifying : libpsl-0.21.2-4.fc39.x86_64 38/153 Verifying : libpwquality-1.4.5-6.fc39.x86_64 39/153 Verifying : libselinux-3.5-5.fc39.x86_64 40/153 Verifying : libsemanage-3.5-4.fc39.x86_64 41/153 Verifying : libsepol-3.5-2.fc39.x86_64 42/153 Verifying : libsigsegv-2.14-5.fc39.x86_64 43/153 Verifying : libtasn1-4.19.0-3.fc39.x86_64 44/153 Verifying : libtool-ltdl-2.4.7-7.fc39.x86_64 45/153 Verifying : libunistring-1.1-5.fc39.x86_64 46/153 Verifying : libutempter-1.2.1-10.fc39.x86_64 47/153 Verifying : libverto-0.3.2-6.fc39.x86_64 48/153 Verifying : libxcrypt-4.4.36-2.fc39.x86_64 49/153 Verifying : libxml2-2.10.4-3.fc39.x86_64 50/153 Verifying : lua-libs-5.4.6-3.fc39.x86_64 51/153 Verifying : lz4-libs-1.9.4-4.fc39.x86_64 52/153 Verifying : mpfr-4.2.0-3.fc39.x86_64 53/153 Verifying : ocaml-srpm-macros-8-2.fc39.noarch 54/153 Verifying : openblas-srpm-macros-2-14.fc39.noarch 55/153 Verifying : package-notes-srpm-macros-0.5-9.fc39.noarch 56/153 Verifying : patch-2.7.6-22.fc39.x86_64 57/153 Verifying : pcre2-10.42-1.fc39.2.x86_64 58/153 Verifying : pcre2-syntax-10.42-1.fc39.2.noarch 59/153 Verifying : perl-srpm-macros-1-51.fc39.noarch 60/153 Verifying : pkgconf-1.9.5-2.fc39.x86_64 61/153 Verifying : pkgconf-m4-1.9.5-2.fc39.noarch 62/153 Verifying : pkgconf-pkg-config-1.9.5-2.fc39.x86_64 63/153 Verifying : popt-1.19-3.fc39.x86_64 64/153 Verifying : sed-4.8-14.fc39.x86_64 65/153 Verifying : setup-2.14.4-1.fc39.noarch 66/153 Verifying : sqlite-libs-3.42.0-7.fc39.x86_64 67/153 Verifying : tar-2:1.35-2.fc39.x86_64 68/153 Verifying : unzip-6.0-62.fc39.x86_64 69/153 Verifying : which-2.21-40.fc39.x86_64 70/153 Verifying : xxhash-libs-0.8.2-1.fc39.x86_64 71/153 Verifying : xz-5.4.4-1.fc39.x86_64 72/153 Verifying : xz-libs-5.4.4-1.fc39.x86_64 73/153 Verifying : zip-3.0-39.fc39.x86_64 74/153 Verifying : zlib-1.2.13-4.fc39.x86_64 75/153 Verifying : alternatives-1.26-1.fc39.x86_64 76/153 Verifying : ansible-srpm-macros-1-12.fc39.noarch 77/153 Verifying : audit-libs-3.1.5-1.fc39.x86_64 78/153 Verifying : bash-5.2.26-1.fc39.x86_64 79/153 Verifying : binutils-2.40-14.fc39.x86_64 80/153 Verifying : binutils-gold-2.40-14.fc39.x86_64 81/153 Verifying : coreutils-9.3-6.fc39.x86_64 82/153 Verifying : coreutils-common-9.3-6.fc39.x86_64 83/153 Verifying : crypto-policies-20231204-1.git1e3a2e4.fc39.noarc 84/153 Verifying : curl-8.2.1-5.fc39.x86_64 85/153 Verifying : debugedit-5.0-12.fc39.x86_64 86/153 Verifying : elfutils-0.191-2.fc39.x86_64 87/153 Verifying : elfutils-debuginfod-client-0.191-2.fc39.x86_64 88/153 Verifying : elfutils-default-yama-scope-0.191-2.fc39.noarch 89/153 Verifying : elfutils-libelf-0.191-2.fc39.x86_64 90/153 Verifying : elfutils-libs-0.191-2.fc39.x86_64 91/153 Verifying : fedora-gpg-keys-39-2.noarch 92/153 Verifying : fedora-release-39-36.noarch 93/153 Verifying : fedora-release-common-39-36.noarch 94/153 Verifying : fedora-release-identity-basic-39-36.noarch 95/153 Verifying : fedora-repos-39-2.noarch 96/153 Verifying : findutils-1:4.9.0-6.fc39.x86_64 97/153 Verifying : forge-srpm-macros-0.3.1-1.fc39.noarch 98/153 Verifying : gdb-minimal-15.1-1.fc39.x86_64 99/153 Verifying : glibc-2.38-18.fc39.x86_64 100/153 Verifying : glibc-common-2.38-18.fc39.x86_64 101/153 Verifying : glibc-gconv-extra-2.38-18.fc39.x86_64 102/153 Verifying : glibc-minimal-langpack-2.38-18.fc39.x86_64 103/153 Verifying : go-srpm-macros-3.5.0-1.fc39.noarch 104/153 Verifying : keyutils-libs-1.6.3-1.fc39.x86_64 105/153 Verifying : krb5-libs-1.21.3-1.fc39.x86_64 106/153 Verifying : libacl-2.3.1-9.fc39.x86_64 107/153 Verifying : libarchive-3.7.1-2.fc39.x86_64 108/153 Verifying : libblkid-2.39.4-1.fc39.x86_64 109/153 Verifying : libcap-2.48-9.fc39.x86_64 110/153 Verifying : libcurl-8.2.1-5.fc39.x86_64 111/153 Verifying : libeconf-0.5.2-2.fc39.x86_64 112/153 Verifying : libfdisk-2.39.4-1.fc39.x86_64 113/153 Verifying : libgcc-13.3.1-1.fc39.x86_64 114/153 Verifying : libgomp-13.3.1-1.fc39.x86_64 115/153 Verifying : libidn2-2.3.7-1.fc39.x86_64 116/153 Verifying : libmount-2.39.4-1.fc39.x86_64 117/153 Verifying : libnghttp2-1.55.1-5.fc39.x86_64 118/153 Verifying : libsmartcols-2.39.4-1.fc39.x86_64 119/153 Verifying : libssh-0.10.6-2.fc39.x86_64 120/153 Verifying : libssh-config-0.10.6-2.fc39.noarch 121/153 Verifying : libstdc++-13.3.1-1.fc39.x86_64 122/153 Verifying : libtirpc-1.3.5-0.fc39.x86_64 123/153 Verifying : libuuid-2.39.4-1.fc39.x86_64 124/153 Verifying : libzstd-1.5.6-1.fc39.x86_64 125/153 Verifying : lua-srpm-macros-1-13.fc39.noarch 126/153 Verifying : ncurses-base-6.4-7.20230520.fc39.1.noarch 127/153 Verifying : ncurses-libs-6.4-7.20230520.fc39.1.x86_64 128/153 Verifying : openldap-2.6.7-1.fc39.x86_64 129/153 Verifying : openssl-libs-1:3.1.4-3.fc39.x86_64 130/153 Verifying : p11-kit-0.25.5-1.fc39.x86_64 131/153 Verifying : p11-kit-trust-0.25.5-1.fc39.x86_64 132/153 Verifying : pam-1.5.3-3.fc39.x86_64 133/153 Verifying : pam-libs-1.5.3-3.fc39.x86_64 134/153 Verifying : publicsuffix-list-dafsa-20240107-1.fc39.noarch 135/153 Verifying : pyproject-srpm-macros-1.13.0-1.fc39.noarch 136/153 Verifying : python-srpm-macros-3.12-8.fc39.noarch 137/153 Verifying : qt5-srpm-macros-5.15.14-2.fc39.noarch 138/153 Verifying : qt6-srpm-macros-6.6.2-1.fc39.noarch 139/153 Verifying : readline-8.2-6.fc39.x86_64 140/153 Verifying : redhat-rpm-config-266-1.fc39.noarch 141/153 Verifying : rpm-4.19.1.1-1.fc39.x86_64 142/153 Verifying : rpm-build-4.19.1.1-1.fc39.x86_64 143/153 Verifying : rpm-build-libs-4.19.1.1-1.fc39.x86_64 144/153 Verifying : rpm-libs-4.19.1.1-1.fc39.x86_64 145/153 Verifying : rpm-sequoia-1.7.0-1.fc39.x86_64 146/153 Verifying : rpmautospec-rpm-macros-0.7.1-1.fc39.noarch 147/153 Verifying : rust-srpm-macros-26.3-1.fc39.noarch 148/153 Verifying : shadow-utils-2:4.14.0-2.fc39.x86_64 149/153 Verifying : systemd-libs-254.16-1.fc39.x86_64 150/153 Verifying : util-linux-2.39.4-1.fc39.x86_64 151/153 Verifying : util-linux-core-2.39.4-1.fc39.x86_64 152/153 Verifying : zstd-1.5.6-1.fc39.x86_64 153/153 Installed products updated. Installed: alternatives-1.26-1.fc39.x86_64 ansible-srpm-macros-1-12.fc39.noarch audit-libs-3.1.5-1.fc39.x86_64 authselect-1.4.3-1.fc39.x86_64 authselect-libs-1.4.3-1.fc39.x86_64 basesystem-11-18.fc39.noarch bash-5.2.26-1.fc39.x86_64 binutils-2.40-14.fc39.x86_64 binutils-gold-2.40-14.fc39.x86_64 bzip2-1.0.8-16.fc39.x86_64 bzip2-libs-1.0.8-16.fc39.x86_64 ca-certificates-2023.2.60_v7.0.306-2.fc39.noarch coreutils-9.3-6.fc39.x86_64 coreutils-common-9.3-6.fc39.x86_64 cpio-2.14-4.fc39.x86_64 cracklib-2.9.11-2.fc39.x86_64 crypto-policies-20231204-1.git1e3a2e4.fc39.noarch curl-8.2.1-5.fc39.x86_64 cyrus-sasl-lib-2.1.28-11.fc39.x86_64 debugedit-5.0-12.fc39.x86_64 diffutils-3.10-3.fc39.x86_64 dwz-0.15-3.fc39.x86_64 ed-1.19-4.fc39.x86_64 efi-srpm-macros-5-9.fc39.noarch elfutils-0.191-2.fc39.x86_64 elfutils-debuginfod-client-0.191-2.fc39.x86_64 elfutils-default-yama-scope-0.191-2.fc39.noarch elfutils-libelf-0.191-2.fc39.x86_64 elfutils-libs-0.191-2.fc39.x86_64 fedora-gpg-keys-39-2.noarch fedora-release-39-36.noarch fedora-release-common-39-36.noarch fedora-release-identity-basic-39-36.noarch fedora-repos-39-2.noarch file-5.44-5.fc39.x86_64 file-libs-5.44-5.fc39.x86_64 filesystem-3.18-6.fc39.x86_64 findutils-1:4.9.0-6.fc39.x86_64 fonts-srpm-macros-1:2.0.5-12.fc39.noarch forge-srpm-macros-0.3.1-1.fc39.noarch fpc-srpm-macros-1.3-8.fc39.noarch gawk-5.2.2-2.fc39.x86_64 gdb-minimal-15.1-1.fc39.x86_64 gdbm-libs-1:1.23-4.fc39.x86_64 ghc-srpm-macros-1.6.1-2.fc39.noarch glibc-2.38-18.fc39.x86_64 glibc-common-2.38-18.fc39.x86_64 glibc-gconv-extra-2.38-18.fc39.x86_64 glibc-minimal-langpack-2.38-18.fc39.x86_64 gmp-1:6.2.1-5.fc39.x86_64 gnat-srpm-macros-6-3.fc39.noarch go-srpm-macros-3.5.0-1.fc39.noarch grep-3.11-3.fc39.x86_64 gzip-1.12-6.fc39.x86_64 info-7.0.3-3.fc39.x86_64 jansson-2.13.1-7.fc39.x86_64 kernel-srpm-macros-1.0-20.fc39.noarch keyutils-libs-1.6.3-1.fc39.x86_64 krb5-libs-1.21.3-1.fc39.x86_64 libacl-2.3.1-9.fc39.x86_64 libarchive-3.7.1-2.fc39.x86_64 libattr-2.5.1-8.fc39.x86_64 libblkid-2.39.4-1.fc39.x86_64 libbrotli-1.1.0-1.fc39.x86_64 libcap-2.48-9.fc39.x86_64 libcap-ng-0.8.3-8.fc39.x86_64 libcom_err-1.47.0-2.fc39.x86_64 libcurl-8.2.1-5.fc39.x86_64 libdb-5.3.28-56.fc39.x86_64 libeconf-0.5.2-2.fc39.x86_64 libevent-2.1.12-9.fc39.x86_64 libfdisk-2.39.4-1.fc39.x86_64 libffi-3.4.4-4.fc39.x86_64 libgcc-13.3.1-1.fc39.x86_64 libgomp-13.3.1-1.fc39.x86_64 libidn2-2.3.7-1.fc39.x86_64 libmount-2.39.4-1.fc39.x86_64 libnghttp2-1.55.1-5.fc39.x86_64 libnsl2-2.0.0-6.fc39.x86_64 libpkgconf-1.9.5-2.fc39.x86_64 libpsl-0.21.2-4.fc39.x86_64 libpwquality-1.4.5-6.fc39.x86_64 libselinux-3.5-5.fc39.x86_64 libsemanage-3.5-4.fc39.x86_64 libsepol-3.5-2.fc39.x86_64 libsigsegv-2.14-5.fc39.x86_64 libsmartcols-2.39.4-1.fc39.x86_64 libssh-0.10.6-2.fc39.x86_64 libssh-config-0.10.6-2.fc39.noarch libstdc++-13.3.1-1.fc39.x86_64 libtasn1-4.19.0-3.fc39.x86_64 libtirpc-1.3.5-0.fc39.x86_64 libtool-ltdl-2.4.7-7.fc39.x86_64 libunistring-1.1-5.fc39.x86_64 libutempter-1.2.1-10.fc39.x86_64 libuuid-2.39.4-1.fc39.x86_64 libverto-0.3.2-6.fc39.x86_64 libxcrypt-4.4.36-2.fc39.x86_64 libxml2-2.10.4-3.fc39.x86_64 libzstd-1.5.6-1.fc39.x86_64 lua-libs-5.4.6-3.fc39.x86_64 lua-srpm-macros-1-13.fc39.noarch lz4-libs-1.9.4-4.fc39.x86_64 mpfr-4.2.0-3.fc39.x86_64 ncurses-base-6.4-7.20230520.fc39.1.noarch ncurses-libs-6.4-7.20230520.fc39.1.x86_64 ocaml-srpm-macros-8-2.fc39.noarch openblas-srpm-macros-2-14.fc39.noarch openldap-2.6.7-1.fc39.x86_64 openssl-libs-1:3.1.4-3.fc39.x86_64 p11-kit-0.25.5-1.fc39.x86_64 p11-kit-trust-0.25.5-1.fc39.x86_64 package-notes-srpm-macros-0.5-9.fc39.noarch pam-1.5.3-3.fc39.x86_64 pam-libs-1.5.3-3.fc39.x86_64 patch-2.7.6-22.fc39.x86_64 pcre2-10.42-1.fc39.2.x86_64 pcre2-syntax-10.42-1.fc39.2.noarch perl-srpm-macros-1-51.fc39.noarch pkgconf-1.9.5-2.fc39.x86_64 pkgconf-m4-1.9.5-2.fc39.noarch pkgconf-pkg-config-1.9.5-2.fc39.x86_64 popt-1.19-3.fc39.x86_64 publicsuffix-list-dafsa-20240107-1.fc39.noarch pyproject-srpm-macros-1.13.0-1.fc39.noarch python-srpm-macros-3.12-8.fc39.noarch qt5-srpm-macros-5.15.14-2.fc39.noarch qt6-srpm-macros-6.6.2-1.fc39.noarch readline-8.2-6.fc39.x86_64 redhat-rpm-config-266-1.fc39.noarch rpm-4.19.1.1-1.fc39.x86_64 rpm-build-4.19.1.1-1.fc39.x86_64 rpm-build-libs-4.19.1.1-1.fc39.x86_64 rpm-libs-4.19.1.1-1.fc39.x86_64 rpm-sequoia-1.7.0-1.fc39.x86_64 rpmautospec-rpm-macros-0.7.1-1.fc39.noarch rust-srpm-macros-26.3-1.fc39.noarch sed-4.8-14.fc39.x86_64 setup-2.14.4-1.fc39.noarch shadow-utils-2:4.14.0-2.fc39.x86_64 sqlite-libs-3.42.0-7.fc39.x86_64 systemd-libs-254.16-1.fc39.x86_64 tar-2:1.35-2.fc39.x86_64 unzip-6.0-62.fc39.x86_64 util-linux-2.39.4-1.fc39.x86_64 util-linux-core-2.39.4-1.fc39.x86_64 which-2.21-40.fc39.x86_64 xxhash-libs-0.8.2-1.fc39.x86_64 xz-5.4.4-1.fc39.x86_64 xz-libs-5.4.4-1.fc39.x86_64 zip-3.0-39.fc39.x86_64 zlib-1.2.13-4.fc39.x86_64 zstd-1.5.6-1.fc39.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.fc39.x86_64 ansible-srpm-macros-1-12.fc39.noarch audit-libs-3.1.5-1.fc39.x86_64 authselect-1.4.3-1.fc39.x86_64 authselect-libs-1.4.3-1.fc39.x86_64 basesystem-11-18.fc39.noarch bash-5.2.26-1.fc39.x86_64 binutils-2.40-14.fc39.x86_64 binutils-gold-2.40-14.fc39.x86_64 bzip2-1.0.8-16.fc39.x86_64 bzip2-libs-1.0.8-16.fc39.x86_64 ca-certificates-2023.2.60_v7.0.306-2.fc39.noarch coreutils-9.3-6.fc39.x86_64 coreutils-common-9.3-6.fc39.x86_64 cpio-2.14-4.fc39.x86_64 cracklib-2.9.11-2.fc39.x86_64 crypto-policies-20231204-1.git1e3a2e4.fc39.noarch curl-8.2.1-5.fc39.x86_64 cyrus-sasl-lib-2.1.28-11.fc39.x86_64 debugedit-5.0-12.fc39.x86_64 diffutils-3.10-3.fc39.x86_64 dwz-0.15-3.fc39.x86_64 ed-1.19-4.fc39.x86_64 efi-srpm-macros-5-9.fc39.noarch elfutils-0.191-2.fc39.x86_64 elfutils-debuginfod-client-0.191-2.fc39.x86_64 elfutils-default-yama-scope-0.191-2.fc39.noarch elfutils-libelf-0.191-2.fc39.x86_64 elfutils-libs-0.191-2.fc39.x86_64 fedora-gpg-keys-39-2.noarch fedora-release-39-36.noarch fedora-release-common-39-36.noarch fedora-release-identity-basic-39-36.noarch fedora-repos-39-2.noarch file-5.44-5.fc39.x86_64 file-libs-5.44-5.fc39.x86_64 filesystem-3.18-6.fc39.x86_64 findutils-4.9.0-6.fc39.x86_64 fonts-srpm-macros-2.0.5-12.fc39.noarch forge-srpm-macros-0.3.1-1.fc39.noarch fpc-srpm-macros-1.3-8.fc39.noarch gawk-5.2.2-2.fc39.x86_64 gdb-minimal-15.1-1.fc39.x86_64 gdbm-libs-1.23-4.fc39.x86_64 ghc-srpm-macros-1.6.1-2.fc39.noarch glibc-2.38-18.fc39.x86_64 glibc-common-2.38-18.fc39.x86_64 glibc-gconv-extra-2.38-18.fc39.x86_64 glibc-minimal-langpack-2.38-18.fc39.x86_64 gmp-6.2.1-5.fc39.x86_64 gnat-srpm-macros-6-3.fc39.noarch go-srpm-macros-3.5.0-1.fc39.noarch gpg-pubkey-18b8e74c-62f2920f grep-3.11-3.fc39.x86_64 gzip-1.12-6.fc39.x86_64 info-7.0.3-3.fc39.x86_64 jansson-2.13.1-7.fc39.x86_64 kernel-srpm-macros-1.0-20.fc39.noarch keyutils-libs-1.6.3-1.fc39.x86_64 krb5-libs-1.21.3-1.fc39.x86_64 libacl-2.3.1-9.fc39.x86_64 libarchive-3.7.1-2.fc39.x86_64 libattr-2.5.1-8.fc39.x86_64 libblkid-2.39.4-1.fc39.x86_64 libbrotli-1.1.0-1.fc39.x86_64 libcap-2.48-9.fc39.x86_64 libcap-ng-0.8.3-8.fc39.x86_64 libcom_err-1.47.0-2.fc39.x86_64 libcurl-8.2.1-5.fc39.x86_64 libdb-5.3.28-56.fc39.x86_64 libeconf-0.5.2-2.fc39.x86_64 libevent-2.1.12-9.fc39.x86_64 libfdisk-2.39.4-1.fc39.x86_64 libffi-3.4.4-4.fc39.x86_64 libgcc-13.3.1-1.fc39.x86_64 libgomp-13.3.1-1.fc39.x86_64 libidn2-2.3.7-1.fc39.x86_64 libmount-2.39.4-1.fc39.x86_64 libnghttp2-1.55.1-5.fc39.x86_64 libnsl2-2.0.0-6.fc39.x86_64 libpkgconf-1.9.5-2.fc39.x86_64 libpsl-0.21.2-4.fc39.x86_64 libpwquality-1.4.5-6.fc39.x86_64 libselinux-3.5-5.fc39.x86_64 libsemanage-3.5-4.fc39.x86_64 libsepol-3.5-2.fc39.x86_64 libsigsegv-2.14-5.fc39.x86_64 libsmartcols-2.39.4-1.fc39.x86_64 libssh-0.10.6-2.fc39.x86_64 libssh-config-0.10.6-2.fc39.noarch libstdc++-13.3.1-1.fc39.x86_64 libtasn1-4.19.0-3.fc39.x86_64 libtirpc-1.3.5-0.fc39.x86_64 libtool-ltdl-2.4.7-7.fc39.x86_64 libunistring-1.1-5.fc39.x86_64 libutempter-1.2.1-10.fc39.x86_64 libuuid-2.39.4-1.fc39.x86_64 libverto-0.3.2-6.fc39.x86_64 libxcrypt-4.4.36-2.fc39.x86_64 libxml2-2.10.4-3.fc39.x86_64 libzstd-1.5.6-1.fc39.x86_64 lua-libs-5.4.6-3.fc39.x86_64 lua-srpm-macros-1-13.fc39.noarch lz4-libs-1.9.4-4.fc39.x86_64 mpfr-4.2.0-3.fc39.x86_64 ncurses-base-6.4-7.20230520.fc39.1.noarch ncurses-libs-6.4-7.20230520.fc39.1.x86_64 ocaml-srpm-macros-8-2.fc39.noarch openblas-srpm-macros-2-14.fc39.noarch openldap-2.6.7-1.fc39.x86_64 openssl-libs-3.1.4-3.fc39.x86_64 p11-kit-0.25.5-1.fc39.x86_64 p11-kit-trust-0.25.5-1.fc39.x86_64 package-notes-srpm-macros-0.5-9.fc39.noarch pam-1.5.3-3.fc39.x86_64 pam-libs-1.5.3-3.fc39.x86_64 patch-2.7.6-22.fc39.x86_64 pcre2-10.42-1.fc39.2.x86_64 pcre2-syntax-10.42-1.fc39.2.noarch perl-srpm-macros-1-51.fc39.noarch pkgconf-1.9.5-2.fc39.x86_64 pkgconf-m4-1.9.5-2.fc39.noarch pkgconf-pkg-config-1.9.5-2.fc39.x86_64 popt-1.19-3.fc39.x86_64 publicsuffix-list-dafsa-20240107-1.fc39.noarch pyproject-srpm-macros-1.13.0-1.fc39.noarch python-srpm-macros-3.12-8.fc39.noarch qt5-srpm-macros-5.15.14-2.fc39.noarch qt6-srpm-macros-6.6.2-1.fc39.noarch readline-8.2-6.fc39.x86_64 redhat-rpm-config-266-1.fc39.noarch rpm-4.19.1.1-1.fc39.x86_64 rpm-build-4.19.1.1-1.fc39.x86_64 rpm-build-libs-4.19.1.1-1.fc39.x86_64 rpm-libs-4.19.1.1-1.fc39.x86_64 rpm-sequoia-1.7.0-1.fc39.x86_64 rpmautospec-rpm-macros-0.7.1-1.fc39.noarch rust-srpm-macros-26.3-1.fc39.noarch sed-4.8-14.fc39.x86_64 setup-2.14.4-1.fc39.noarch shadow-utils-4.14.0-2.fc39.x86_64 sqlite-libs-3.42.0-7.fc39.x86_64 systemd-libs-254.16-1.fc39.x86_64 tar-1.35-2.fc39.x86_64 unzip-6.0-62.fc39.x86_64 util-linux-2.39.4-1.fc39.x86_64 util-linux-core-2.39.4-1.fc39.x86_64 which-2.21-40.fc39.x86_64 xxhash-libs-0.8.2-1.fc39.x86_64 xz-5.4.4-1.fc39.x86_64 xz-libs-5.4.4-1.fc39.x86_64 zip-3.0-39.fc39.x86_64 zlib-1.2.13-4.fc39.x86_64 zstd-1.5.6-1.fc39.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.2-1.fc39.copr7998582.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-39-x86_64-1725845921.254522/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-39-x86_64-1725845921.254522/root/var/log/dnf.log /var/lib/mock/fedora-39-x86_64-1725845921.254522/root/var/log/dnf.librepo.log /var/lib/mock/fedora-39-x86_64-1725845921.254522/root/var/log/dnf.rpm.log Finish: buildsrpm INFO: Done(/var/lib/copr-rpmbuild/workspace/workdir-cye1w62y/R-CRAN-starvz/R-CRAN-starvz.spec) Config(child) 0 minutes 57 seconds INFO: Results and/or logs in: /var/lib/copr-rpmbuild/results INFO: Cleaning up build root ('cleanup_on_success=True') Start: clean chroot INFO: unmounting tmpfs. Finish: clean chroot INFO: Start(/var/lib/copr-rpmbuild/results/R-CRAN-starvz-0.8.2-1.fc39.copr7998582.src.rpm) Config(fedora-39-x86_64) Start: chroot init INFO: mounting tmpfs at /var/lib/mock/fedora-39-x86_64-1725845921.254522/root. INFO: calling preinit hooks INFO: enabled root cache Start: unpacking root cache Finish: unpacking root cache INFO: enabled package manager cache Start: cleaning package manager metadata Finish: cleaning package manager metadata INFO: enabled HW Info plugin INFO: Buildroot is handled by package management from host and used with --installroot: rpm-4.19.1.1-1.fc39.x86_64 rpm-sequoia-1.6.0-1.fc39.x86_64 python3-dnf-4.21.1-1.fc39.noarch python3-dnf-plugins-core-4.9.0-1.fc39.noarch yum-4.21.1-1.fc39.noarch dnf5-5.1.17-2.fc39.x86_64 dnf5-plugins-5.1.17-2.fc39.x86_64 Finish: chroot init Start: build phase for R-CRAN-starvz-0.8.2-1.fc39.copr7998582.src.rpm Start: build setup for R-CRAN-starvz-0.8.2-1.fc39.copr7998582.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.2-1.fc39.copr7998582.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 14 kB/s | 1.5 kB 00:00 Copr repository 65 MB/s | 27 MB 00:00 fedora 1.1 MB/s | 30 kB 00:00 updates 212 kB/s | 28 kB 00:00 updates 1.5 MB/s | 1.8 MB 00:01 Dependencies resolved. ========================================================================================== Package Arch Version Repo Size ========================================================================================== Installing: R-CRAN-BH noarch 1.84.0.0-1.fc39.copr6880886 copr_base 9.8 M R-CRAN-RColorBrewer noarch 1.1.3-1.fc39.copr6279333 copr_base 65 k R-CRAN-Rcpp x86_64 1.0.13-1.fc39.copr7745410 copr_base 2.0 M R-CRAN-data.tree noarch 1.1.0-1.fc39.copr6627583 copr_base 1.2 M R-CRAN-dplyr x86_64 1.1.4-1.fc39.copr6691319 copr_base 1.5 M R-CRAN-ggplot2 noarch 3.5.1-1.fc39.copr7342639 copr_base 4.8 M R-CRAN-gtools x86_64 3.9.5-1.fc39.copr6672122 copr_base 389 k R-CRAN-lpSolve x86_64 5.6.20-1.fc39.copr6739857 copr_base 362 k R-CRAN-magrittr x86_64 2.0.3-1.fc39.copr6279321 copr_base 222 k R-CRAN-patchwork noarch 1.2.0-1.fc39.copr6873795 copr_base 3.1 M R-CRAN-purrr x86_64 1.0.2-1.fc39.copr6286812 copr_base 546 k R-CRAN-readr x86_64 2.1.5-1.fc39.copr6880950 copr_base 781 k R-CRAN-rlang x86_64 1.1.4-1.fc39.copr7531082 copr_base 1.6 M R-CRAN-stringr noarch 1.5.1-1.fc39.copr6636964 copr_base 319 k R-CRAN-tibble x86_64 3.2.1-1.fc39.copr6288598 copr_base 632 k R-CRAN-tidyr x86_64 1.3.1-1.fc39.copr6948918 copr_base 1.1 M R-CRAN-yaml x86_64 2.3.10-1.fc39.copr7795167 copr_base 124 k R-CRAN-zoo x86_64 1.8.12-1.fc39.copr6282861 copr_base 1.0 M R-core x86_64 4.3.3-2.fc39 updates 64 M R-devel x86_64 4.3.3-2.fc39 updates 10 k Installing dependencies: R-CRAN-MASS x86_64 7.3.60.0.1-1.fc39.copr6895092 copr_base 1.2 M R-CRAN-Matrix x86_64 1.6.5-1.fc39.copr6886765 copr_base 4.1 M R-CRAN-R6 noarch 2.5.1-1.fc39.copr6279323 copr_base 96 k R-CRAN-bit x86_64 4.0.5-1.fc39.copr6279356 copr_base 1.1 M R-CRAN-bit64 x86_64 4.0.5-1.fc39.copr6282913 copr_base 541 k R-CRAN-cli x86_64 3.6.3-1.fc39.copr7649835 copr_base 1.3 M R-CRAN-clipr noarch 0.8.0-1.fc39.copr6279344 copr_base 63 k R-CRAN-colorspace x86_64 2.1.1-1.fc39.copr7795131 copr_base 2.5 M R-CRAN-crayon noarch 1.5.3-1.fc39.copr7633037 copr_base 181 k R-CRAN-fansi x86_64 1.0.6-1.fc39.copr6735917 copr_base 339 k R-CRAN-farver x86_64 2.1.2-1.fc39.copr7442181 copr_base 1.3 M R-CRAN-generics noarch 0.1.3-1.fc39.copr6279393 copr_base 100 k R-CRAN-glue x86_64 1.7.0-1.fc39.copr6877494 copr_base 165 k R-CRAN-gtable noarch 0.3.5-1.fc39.copr7338149 copr_base 231 k R-CRAN-hms noarch 1.1.3-1.fc39.copr6286819 copr_base 113 k R-CRAN-isoband x86_64 0.2.7-1.fc39.copr6280488 copr_base 1.6 M R-CRAN-labeling noarch 0.4.3-1.fc39.copr6354313 copr_base 77 k R-CRAN-lattice x86_64 0.22.6-1.fc39.copr7307082 copr_base 1.4 M R-CRAN-lifecycle noarch 1.0.4-1.fc39.copr6614518 copr_base 130 k R-CRAN-mgcv x86_64 1.9.1-1.fc39.copr6775870 copr_base 3.3 M R-CRAN-munsell noarch 0.5.1-1.fc39.copr7306785 copr_base 251 k R-CRAN-nlme x86_64 3.1.166-1.fc39.copr7936970 copr_base 2.4 M R-CRAN-pillar noarch 1.9.0-1.fc39.copr6286818 copr_base 626 k R-CRAN-pkgconfig noarch 2.0.3-3.fc39.copr6279322 copr_base 30 k R-CRAN-scales noarch 1.3.0-1.fc39.copr6704012 copr_base 707 k R-CRAN-stringi x86_64 1.8.4-1.fc39.copr7422034 copr_base 993 k R-CRAN-tidyselect noarch 1.2.1-1.fc39.copr7306789 copr_base 230 k R-CRAN-tzdb x86_64 0.4.0-1.fc39.copr6284697 copr_base 528 k R-CRAN-utf8 x86_64 1.2.4-1.fc39.copr6555966 copr_base 150 k R-CRAN-vctrs x86_64 0.6.5-1.fc39.copr6715464 copr_base 1.3 M R-CRAN-viridisLite noarch 0.4.2-1.fc39.copr6279312 copr_base 1.2 M R-CRAN-vroom x86_64 1.6.5-1.fc39.copr6727750 copr_base 842 k R-CRAN-withr noarch 3.0.1-1.fc39.copr7810684 copr_base 246 k R-core-devel x86_64 4.3.3-2.fc39 updates 93 k R-java x86_64 4.3.3-2.fc39 updates 11 k R-java-devel x86_64 4.3.3-2.fc39 updates 10 k R-littler x86_64 0.3.19-1.fc39 updates 76 k R-rpm-macros noarch 1.2.1-7.fc39 fedora 11 k abattis-cantarell-vf-fonts noarch 0.301-10.fc39 fedora 121 k alsa-lib x86_64 1.2.12-1.fc39 updates 521 k annobin-docs noarch 12.60-1.fc39 updates 88 k annobin-plugin-gcc x86_64 12.60-1.fc39 updates 965 k avahi-libs x86_64 0.8-24.fc39 fedora 67 k brotli x86_64 1.1.0-1.fc39 fedora 20 k brotli-devel x86_64 1.1.0-1.fc39 fedora 34 k bzip2-devel x86_64 1.0.8-16.fc39 fedora 214 k cairo x86_64 1.18.0-1.fc39 fedora 710 k cmake-filesystem x86_64 3.27.7-1.fc39 fedora 19 k copy-jdk-configs noarch 4.1-3.fc39 fedora 28 k cpp x86_64 13.3.1-1.fc39 updates 11 M crypto-policies-scripts noarch 20231204-1.git1e3a2e4.fc39 updates 117 k cups-libs x86_64 1:2.4.10-6.fc39 updates 269 k dbus-libs x86_64 1:1.14.10-1.fc39 fedora 156 k default-fonts-core-sans noarch 4.0-9.fc39 fedora 32 k desktop-file-utils x86_64 0.26-9.fc39 fedora 72 k emacs-filesystem noarch 1:29.4-2.fc39 updates 7.3 k expat x86_64 2.6.2-1.fc39 updates 114 k flexiblas x86_64 3.4.4-1.fc39 updates 25 k flexiblas-devel x86_64 3.4.4-1.fc39 updates 121 k flexiblas-netlib x86_64 3.4.4-1.fc39 updates 3.1 M flexiblas-netlib64 x86_64 3.4.4-1.fc39 updates 3.0 M flexiblas-openblas-openmp x86_64 3.4.4-1.fc39 updates 17 k flexiblas-openblas-openmp64 x86_64 3.4.4-1.fc39 updates 17 k fontconfig x86_64 2.14.2-6.fc39 updates 296 k fontconfig-devel x86_64 2.14.2-6.fc39 updates 164 k fonts-filesystem noarch 1:2.0.5-12.fc39 fedora 8.2 k freetype x86_64 2.13.1-2.fc39 fedora 414 k freetype-devel x86_64 2.13.1-2.fc39 fedora 950 k fribidi x86_64 1.0.13-2.fc39 fedora 91 k gc x86_64 8.2.2-4.fc39 fedora 110 k gcc x86_64 13.3.1-1.fc39 updates 34 M gcc-c++ x86_64 13.3.1-1.fc39 updates 13 M gcc-gfortran x86_64 13.3.1-1.fc39 updates 12 M gcc-plugin-annobin x86_64 13.3.1-1.fc39 updates 56 k gettext x86_64 0.22-2.fc39 fedora 1.1 M gettext-envsubst x86_64 0.22-2.fc39 fedora 36 k gettext-libs x86_64 0.22-2.fc39 fedora 328 k gettext-runtime x86_64 0.22-2.fc39 fedora 120 k glib2 x86_64 2.78.6-1.fc39 updates 2.8 M glib2-devel x86_64 2.78.6-1.fc39 updates 594 k glibc-devel x86_64 2.38-18.fc39 updates 86 k glibc-headers-x86 noarch 2.38-18.fc39 updates 571 k gnutls x86_64 3.8.6-1.fc39 updates 1.1 M google-noto-fonts-common noarch 20240101-1.fc39 updates 17 k google-noto-sans-vf-fonts noarch 20240101-1.fc39 updates 593 k graphite2 x86_64 1.3.14-12.fc39 fedora 95 k graphite2-devel x86_64 1.3.14-12.fc39 fedora 20 k groff-base x86_64 1.23.0-3.fc39 updates 1.1 M guile22 x86_64 2.2.7-9.fc39 fedora 6.5 M harfbuzz x86_64 8.2.1-2.fc39 fedora 975 k harfbuzz-devel x86_64 8.2.1-2.fc39 fedora 450 k harfbuzz-icu x86_64 8.2.1-2.fc39 fedora 17 k java-21-openjdk x86_64 1:21.0.4.0.7-2.fc39 updates 426 k java-21-openjdk-devel x86_64 1:21.0.4.0.7-2.fc39 updates 5.0 M java-21-openjdk-headless x86_64 1:21.0.4.0.7-2.fc39 updates 48 M javapackages-filesystem noarch 6.1.0-10.fc39 fedora 12 k jbigkit-libs x86_64 2.1-26.fc39 fedora 53 k kernel-headers x86_64 6.10.3-200.fc39 updates 1.6 M libICE x86_64 1.0.10-11.fc39 fedora 70 k libRmath x86_64 4.3.3-2.fc39 updates 121 k libRmath-devel x86_64 4.3.3-2.fc39 updates 16 k libSM x86_64 1.2.3-13.fc39 fedora 41 k libX11 x86_64 1.8.9-1.fc39 updates 650 k libX11-common noarch 1.8.9-1.fc39 updates 176 k libX11-devel x86_64 1.8.9-1.fc39 updates 1.0 M libX11-xcb x86_64 1.8.9-1.fc39 updates 12 k libXau x86_64 1.0.11-3.fc39 fedora 31 k libXau-devel x86_64 1.0.11-3.fc39 fedora 14 k libXcomposite x86_64 0.4.5-10.fc39 fedora 23 k libXext x86_64 1.3.5-3.fc39 fedora 39 k libXft x86_64 2.3.8-3.fc39 fedora 72 k libXft-devel x86_64 2.3.8-3.fc39 fedora 50 k libXi x86_64 1.8.1-2.fc39 fedora 40 k libXmu x86_64 1.1.4-3.fc39 fedora 76 k libXrender x86_64 0.9.11-3.fc39 fedora 27 k libXrender-devel x86_64 0.9.11-3.fc39 fedora 19 k libXt x86_64 1.2.1-5.fc39 fedora 178 k libXtst x86_64 1.2.4-3.fc39 fedora 20 k libb2 x86_64 0.98.1-9.fc39 fedora 25 k libblkid-devel x86_64 2.39.4-1.fc39 updates 18 k libdatrie x86_64 0.2.13-7.fc39 fedora 32 k libffi-devel x86_64 3.4.4-4.fc39 fedora 29 k libfontenc x86_64 1.1.6-3.fc39 fedora 32 k libgfortran x86_64 13.3.1-1.fc39 updates 906 k libicu x86_64 73.2-2.fc39 fedora 11 M libicu-devel x86_64 73.2-2.fc39 fedora 924 k libjpeg-turbo x86_64 2.1.4-3.fc39 fedora 183 k liblerc x86_64 4.0.0-4.fc39 fedora 201 k libmount-devel x86_64 2.39.4-1.fc39 updates 18 k libmpc x86_64 1.3.1-3.fc39 fedora 70 k libpng x86_64 2:1.6.37-15.fc39 fedora 119 k libpng-devel x86_64 2:1.6.37-15.fc39 fedora 291 k libquadmath x86_64 13.3.1-1.fc39 updates 203 k libquadmath-devel x86_64 13.3.1-1.fc39 updates 45 k libselinux-devel x86_64 3.5-5.fc39 fedora 151 k libsepol-devel x86_64 3.5-2.fc39 fedora 49 k libstdc++-devel x86_64 13.3.1-1.fc39 updates 2.6 M libthai x86_64 0.1.29-6.fc39 fedora 213 k libtiff x86_64 4.4.0-8.fc39 fedora 202 k libtirpc-devel x86_64 1.3.5-0.fc39 updates 125 k libwebp x86_64 1.3.2-2.fc39 fedora 284 k libxcb x86_64 1.13.1-12.fc39 fedora 233 k libxcb-devel x86_64 1.13.1-12.fc39 fedora 1.4 M libxcrypt-devel x86_64 4.4.36-2.fc39 fedora 30 k libxml2-devel x86_64 2.10.4-3.fc39 fedora 527 k lksctp-tools x86_64 1.0.19-4.fc39 fedora 92 k lua x86_64 5.4.6-3.fc39 fedora 191 k lua-posix x86_64 36.2.1-3.fc39 fedora 143 k make x86_64 1:4.4.1-2.fc39 fedora 589 k mkfontscale x86_64 1.2.2-4.fc39 fedora 32 k mpdecimal x86_64 2.5.1-7.fc39 fedora 89 k ncurses x86_64 6.4-7.20230520.fc39.1 updates 416 k nettle x86_64 3.9.1-2.fc39 fedora 425 k nspr x86_64 4.35.0-22.fc39 updates 136 k nss x86_64 3.103.0-1.fc39 updates 708 k nss-softokn x86_64 3.103.0-1.fc39 updates 419 k nss-softokn-freebl x86_64 3.103.0-1.fc39 updates 300 k nss-sysinit x86_64 3.103.0-1.fc39 updates 18 k nss-util x86_64 3.103.0-1.fc39 updates 88 k openblas x86_64 0.3.21-6.fc39 fedora 35 k openblas-openmp x86_64 0.3.21-6.fc39 fedora 4.9 M openblas-openmp64 x86_64 0.3.21-6.fc39 fedora 4.8 M pango x86_64 1.51.0-1.fc39 fedora 343 k pcre2-devel x86_64 10.42-1.fc39.2 fedora 505 k pcre2-utf16 x86_64 10.42-1.fc39.2 fedora 212 k pcre2-utf32 x86_64 10.42-1.fc39.2 fedora 200 k perl-AutoLoader noarch 5.74-502.fc39 updates 21 k perl-B x86_64 1.88-502.fc39 updates 177 k perl-Carp noarch 1.54-500.fc39 fedora 29 k perl-Class-Struct noarch 0.68-502.fc39 updates 22 k perl-Data-Dumper x86_64 2.188-501.fc39 fedora 56 k perl-Digest noarch 1.20-500.fc39 fedora 25 k perl-Digest-MD5 x86_64 2.58-500.fc39 fedora 35 k perl-DynaLoader x86_64 1.54-502.fc39 updates 26 k perl-Encode x86_64 4:3.19-500.fc39 fedora 1.7 M perl-Errno x86_64 1.37-502.fc39 updates 15 k perl-Exporter noarch 5.77-500.fc39 fedora 31 k perl-Fcntl x86_64 1.15-502.fc39 updates 21 k perl-File-Basename noarch 2.86-502.fc39 updates 17 k perl-File-Path noarch 2.18-500.fc39 fedora 35 k perl-File-Temp noarch 1:0.231.100-500.fc39 fedora 58 k perl-File-stat noarch 1.13-502.fc39 updates 17 k perl-FileHandle noarch 2.05-502.fc39 updates 16 k perl-Getopt-Long noarch 1:2.54-500.fc39 fedora 60 k perl-Getopt-Std noarch 1.13-502.fc39 updates 16 k perl-HTTP-Tiny noarch 0.088-3.fc39 fedora 56 k perl-IO x86_64 1.52-502.fc39 updates 82 k perl-IO-Socket-IP noarch 0.42-1.fc39 fedora 42 k perl-IO-Socket-SSL noarch 2.083-3.fc39 fedora 225 k perl-IPC-Open3 noarch 1.22-502.fc39 updates 22 k perl-MIME-Base64 x86_64 3.16-500.fc39 fedora 29 k perl-Mozilla-CA noarch 20230801-1.fc39 fedora 13 k perl-Net-SSLeay x86_64 1.92-10.fc39 fedora 360 k perl-POSIX x86_64 2.13-502.fc39 updates 97 k perl-PathTools x86_64 3.89-500.fc39 fedora 87 k perl-Pod-Escapes noarch 1:1.07-500.fc39 fedora 20 k perl-Pod-Perldoc noarch 3.28.01-501.fc39 fedora 86 k perl-Pod-Simple noarch 1:3.45-4.fc39 fedora 218 k perl-Pod-Usage noarch 4:2.03-500.fc39 fedora 39 k perl-Scalar-List-Utils x86_64 5:1.63-500.fc39 fedora 72 k perl-SelectSaver noarch 1.02-502.fc39 updates 12 k perl-Socket x86_64 4:2.037-3.fc39 fedora 55 k perl-Storable x86_64 1:3.32-500.fc39 fedora 99 k perl-Symbol noarch 1.09-502.fc39 updates 14 k perl-Term-ANSIColor noarch 5.01-501.fc39 fedora 47 k perl-Term-Cap noarch 1.18-500.fc39 fedora 22 k perl-Text-ParseWords noarch 3.31-500.fc39 fedora 16 k perl-Text-Tabs+Wrap noarch 2023.0511-3.fc39 fedora 22 k perl-Time-Local noarch 2:1.350-3.fc39 fedora 34 k perl-URI noarch 5.21-1.fc39 fedora 125 k perl-base noarch 2.27-502.fc39 updates 16 k perl-constant noarch 1.33-501.fc39 fedora 22 k perl-if noarch 0.61.000-502.fc39 updates 14 k perl-interpreter x86_64 4:5.38.2-502.fc39 updates 72 k perl-libnet noarch 3.15-501.fc39 fedora 129 k perl-libs x86_64 4:5.38.2-502.fc39 updates 2.4 M perl-locale noarch 1.10-502.fc39 updates 14 k perl-mro x86_64 1.28-502.fc39 updates 29 k perl-overload noarch 1.37-502.fc39 updates 46 k perl-overloading noarch 0.02-502.fc39 updates 13 k perl-parent noarch 1:0.241-500.fc39 fedora 14 k perl-podlators noarch 1:5.01-500.fc39 fedora 125 k perl-vars noarch 1.05-502.fc39 updates 13 k pixman x86_64 0.42.2-2.fc39 fedora 288 k python-pip-wheel noarch 23.2.1-2.fc39 updates 1.5 M python3 x86_64 3.12.5-1.fc39 updates 28 k python3-libs x86_64 3.12.5-1.fc39 updates 9.2 M python3-setuptools noarch 67.7.2-8.fc39 updates 1.5 M sysprof-capture-devel x86_64 45.1-1.fc39 updates 59 k tcl x86_64 1:8.6.12-5.fc39 fedora 1.1 M tcl-devel x86_64 1:8.6.12-5.fc39 fedora 169 k tk x86_64 1:8.6.12-5.fc39 fedora 1.6 M tk-devel x86_64 1:8.6.12-5.fc39 fedora 537 k tre x86_64 0.8.0-41.20140228gitc2f5d13.fc39 fedora 43 k tre-common noarch 0.8.0-41.20140228gitc2f5d13.fc39 fedora 31 k tre-devel x86_64 0.8.0-41.20140228gitc2f5d13.fc39 fedora 12 k ttmkfdir x86_64 3.0.9-69.fc39 fedora 56 k tzdata noarch 2024a-2.fc39 updates 715 k tzdata-java noarch 2024a-2.fc39 updates 208 k xclip x86_64 0.13-20.git11cba61.fc39 fedora 37 k xdg-utils noarch 1.1.3-15.fc39 fedora 77 k xml-common noarch 0.6.3-61.fc39 fedora 31 k xorg-x11-fonts-Type1 noarch 7.5-36.fc39 fedora 504 k xorg-x11-proto-devel noarch 2023.2-2.fc39 fedora 298 k xz-devel x86_64 5.4.4-1.fc39 fedora 66 k zlib-devel x86_64 1.2.13-4.fc39 fedora 45 k Transaction Summary ========================================================================================== Install 266 Packages Total download size: 337 M Installed size: 1.1 G Downloading Packages: (1/266): R-CRAN-MASS-7.3.60.0.1-1.fc39.copr6895 6.3 MB/s | 1.2 MB 00:00 (2/266): R-CRAN-BH-1.84.0.0-1.fc39.copr6880886. 35 MB/s | 9.8 MB 00:00 (3/266): R-CRAN-Matrix-1.6.5-1.fc39.copr6886765 14 MB/s | 4.1 MB 00:00 (4/266): R-CRAN-R6-2.5.1-1.fc39.copr6279323.noa 1.0 MB/s | 96 kB 00:00 (5/266): R-CRAN-RColorBrewer-1.1.3-1.fc39.copr6 6.2 MB/s | 65 kB 00:00 (6/266): R-CRAN-bit-4.0.5-1.fc39.copr6279356.x8 27 MB/s | 1.1 MB 00:00 (7/266): R-CRAN-Rcpp-1.0.13-1.fc39.copr7745410. 44 MB/s | 2.0 MB 00:00 (8/266): R-CRAN-bit64-4.0.5-1.fc39.copr6282913. 12 MB/s | 541 kB 00:00 (9/266): R-CRAN-cli-3.6.3-1.fc39.copr7649835.x8 58 MB/s | 1.3 MB 00:00 (10/266): R-CRAN-clipr-0.8.0-1.fc39.copr6279344 2.1 MB/s | 63 kB 00:00 (11/266): R-CRAN-colorspace-2.1.1-1.fc39.copr77 59 MB/s | 2.5 MB 00:00 (12/266): R-CRAN-crayon-1.5.3-1.fc39.copr763303 6.9 MB/s | 181 kB 00:00 (13/266): R-CRAN-fansi-1.0.6-1.fc39.copr6735917 21 MB/s | 339 kB 00:00 (14/266): R-CRAN-dplyr-1.1.4-1.fc39.copr6691319 53 MB/s | 1.5 MB 00:00 (15/266): R-CRAN-farver-2.1.2-1.fc39.copr744218 57 MB/s | 1.3 MB 00:00 (16/266): R-CRAN-generics-0.1.3-1.fc39.copr6279 7.7 MB/s | 100 kB 00:00 (17/266): R-CRAN-glue-1.7.0-1.fc39.copr6877494. 8.1 MB/s | 165 kB 00:00 (18/266): R-CRAN-ggplot2-3.5.1-1.fc39.copr73426 76 MB/s | 4.8 MB 00:00 (19/266): R-CRAN-gtable-0.3.5-1.fc39.copr733814 4.9 MB/s | 231 kB 00:00 (20/266): R-CRAN-data.tree-1.1.0-1.fc39.copr662 9.6 MB/s | 1.2 MB 00:00 (21/266): R-CRAN-hms-1.1.3-1.fc39.copr6286819.n 9.4 MB/s | 113 kB 00:00 (22/266): R-CRAN-isoband-0.2.7-1.fc39.copr62804 60 MB/s | 1.6 MB 00:00 (23/266): R-CRAN-labeling-0.4.3-1.fc39.copr6354 4.5 MB/s | 77 kB 00:00 (24/266): R-CRAN-lifecycle-1.0.4-1.fc39.copr661 8.6 MB/s | 130 kB 00:00 (25/266): R-CRAN-lattice-0.22.6-1.fc39.copr7307 56 MB/s | 1.4 MB 00:00 (26/266): R-CRAN-gtools-3.9.5-1.fc39.copr667212 6.4 MB/s | 389 kB 00:00 (27/266): R-CRAN-lpSolve-5.6.20-1.fc39.copr6739 23 MB/s | 362 kB 00:00 (28/266): R-CRAN-magrittr-2.0.3-1.fc39.copr6279 20 MB/s | 222 kB 00:00 (29/266): R-CRAN-munsell-0.5.1-1.fc39.copr73067 17 MB/s | 251 kB 00:00 (30/266): R-CRAN-mgcv-1.9.1-1.fc39.copr6775870. 51 MB/s | 3.3 MB 00:00 (31/266): R-CRAN-nlme-3.1.166-1.fc39.copr793697 41 MB/s | 2.4 MB 00:00 (32/266): R-CRAN-patchwork-1.2.0-1.fc39.copr687 39 MB/s | 3.1 MB 00:00 (33/266): R-CRAN-pillar-1.9.0-1.fc39.copr628681 17 MB/s | 626 kB 00:00 (34/266): R-CRAN-pkgconfig-2.0.3-3.fc39.copr627 919 kB/s | 30 kB 00:00 (35/266): R-CRAN-purrr-1.0.2-1.fc39.copr6286812 36 MB/s | 546 kB 00:00 (36/266): R-CRAN-readr-2.1.5-1.fc39.copr6880950 25 MB/s | 781 kB 00:00 (37/266): R-CRAN-scales-1.3.0-1.fc39.copr670401 26 MB/s | 707 kB 00:00 (38/266): R-CRAN-rlang-1.1.4-1.fc39.copr7531082 39 MB/s | 1.6 MB 00:00 (39/266): R-CRAN-stringi-1.8.4-1.fc39.copr74220 48 MB/s | 993 kB 00:00 (40/266): R-CRAN-stringr-1.5.1-1.fc39.copr66369 23 MB/s | 319 kB 00:00 (41/266): R-CRAN-tibble-3.2.1-1.fc39.copr628859 21 MB/s | 632 kB 00:00 (42/266): R-CRAN-tidyselect-1.2.1-1.fc39.copr73 7.3 MB/s | 230 kB 00:00 (43/266): R-CRAN-tidyr-1.3.1-1.fc39.copr6948918 30 MB/s | 1.1 MB 00:00 (44/266): R-CRAN-tzdb-0.4.0-1.fc39.copr6284697. 22 MB/s | 528 kB 00:00 (45/266): R-CRAN-utf8-1.2.4-1.fc39.copr6555966. 9.4 MB/s | 150 kB 00:00 (46/266): R-CRAN-vctrs-0.6.5-1.fc39.copr6715464 50 MB/s | 1.3 MB 00:00 (47/266): R-CRAN-viridisLite-0.4.2-1.fc39.copr6 42 MB/s | 1.2 MB 00:00 (48/266): R-CRAN-vroom-1.6.5-1.fc39.copr6727750 25 MB/s | 842 kB 00:00 (49/266): R-CRAN-withr-3.0.1-1.fc39.copr7810684 12 MB/s | 246 kB 00:00 (50/266): R-CRAN-yaml-2.3.10-1.fc39.copr7795167 8.3 MB/s | 124 kB 00:00 (51/266): R-CRAN-zoo-1.8.12-1.fc39.copr6282861. 44 MB/s | 1.0 MB 00:00 (52/266): R-rpm-macros-1.2.1-7.fc39.noarch.rpm 130 kB/s | 11 kB 00:00 (53/266): brotli-1.1.0-1.fc39.x86_64.rpm 560 kB/s | 20 kB 00:00 (54/266): avahi-libs-0.8-24.fc39.x86_64.rpm 487 kB/s | 67 kB 00:00 (55/266): abattis-cantarell-vf-fonts-0.301-10.f 760 kB/s | 121 kB 00:00 (56/266): brotli-devel-1.1.0-1.fc39.x86_64.rpm 664 kB/s | 34 kB 00:00 (57/266): cmake-filesystem-3.27.7-1.fc39.x86_64 651 kB/s | 19 kB 00:00 (58/266): copy-jdk-configs-4.1-3.fc39.noarch.rp 870 kB/s | 28 kB 00:00 (59/266): bzip2-devel-1.0.8-16.fc39.x86_64.rpm 2.8 MB/s | 214 kB 00:00 (60/266): cairo-1.18.0-1.fc39.x86_64.rpm 7.2 MB/s | 710 kB 00:00 (61/266): default-fonts-core-sans-4.0-9.fc39.no 1.2 MB/s | 32 kB 00:00 (62/266): fonts-filesystem-2.0.5-12.fc39.noarch 213 kB/s | 8.2 kB 00:00 (63/266): desktop-file-utils-0.26-9.fc39.x86_64 1.8 MB/s | 72 kB 00:00 (64/266): dbus-libs-1.14.10-1.fc39.x86_64.rpm 2.2 MB/s | 156 kB 00:00 (65/266): fribidi-1.0.13-2.fc39.x86_64.rpm 2.7 MB/s | 91 kB 00:00 (66/266): freetype-devel-2.13.1-2.fc39.x86_64.r 18 MB/s | 950 kB 00:00 (67/266): freetype-2.13.1-2.fc39.x86_64.rpm 7.1 MB/s | 414 kB 00:00 (68/266): gc-8.2.2-4.fc39.x86_64.rpm 3.1 MB/s | 110 kB 00:00 (69/266): gettext-envsubst-0.22-2.fc39.x86_64.r 1.4 MB/s | 36 kB 00:00 (70/266): gettext-0.22-2.fc39.x86_64.rpm 29 MB/s | 1.1 MB 00:00 (71/266): gettext-runtime-0.22-2.fc39.x86_64.rp 4.2 MB/s | 120 kB 00:00 (72/266): graphite2-1.3.14-12.fc39.x86_64.rpm 3.6 MB/s | 95 kB 00:00 (73/266): gettext-libs-0.22-2.fc39.x86_64.rpm 5.7 MB/s | 328 kB 00:00 (74/266): graphite2-devel-1.3.14-12.fc39.x86_64 808 kB/s | 20 kB 00:00 (75/266): harfbuzz-devel-8.2.1-2.fc39.x86_64.rp 9.9 MB/s | 450 kB 00:00 (76/266): harfbuzz-icu-8.2.1-2.fc39.x86_64.rpm 643 kB/s | 17 kB 00:00 (77/266): guile22-2.2.7-9.fc39.x86_64.rpm 52 MB/s | 6.5 MB 00:00 (78/266): javapackages-filesystem-6.1.0-10.fc39 382 kB/s | 12 kB 00:00 (79/266): harfbuzz-8.2.1-2.fc39.x86_64.rpm 7.6 MB/s | 975 kB 00:00 (80/266): jbigkit-libs-2.1-26.fc39.x86_64.rpm 2.0 MB/s | 53 kB 00:00 (81/266): libICE-1.0.10-11.fc39.x86_64.rpm 2.6 MB/s | 70 kB 00:00 (82/266): libSM-1.2.3-13.fc39.x86_64.rpm 1.6 MB/s | 41 kB 00:00 (83/266): libXau-1.0.11-3.fc39.x86_64.rpm 1.2 MB/s | 31 kB 00:00 (84/266): libXau-devel-1.0.11-3.fc39.x86_64.rpm 544 kB/s | 14 kB 00:00 (85/266): libXcomposite-0.4.5-10.fc39.x86_64.rp 925 kB/s | 23 kB 00:00 (86/266): libXext-1.3.5-3.fc39.x86_64.rpm 1.5 MB/s | 39 kB 00:00 (87/266): libXft-2.3.8-3.fc39.x86_64.rpm 2.7 MB/s | 72 kB 00:00 (88/266): libXft-devel-2.3.8-3.fc39.x86_64.rpm 1.9 MB/s | 50 kB 00:00 (89/266): libXi-1.8.1-2.fc39.x86_64.rpm 1.5 MB/s | 40 kB 00:00 (90/266): libXmu-1.1.4-3.fc39.x86_64.rpm 2.8 MB/s | 76 kB 00:00 (91/266): libXrender-0.9.11-3.fc39.x86_64.rpm 1.1 MB/s | 27 kB 00:00 (92/266): libXrender-devel-0.9.11-3.fc39.x86_64 749 kB/s | 19 kB 00:00 (93/266): libXt-1.2.1-5.fc39.x86_64.rpm 5.9 MB/s | 178 kB 00:00 (94/266): libXtst-1.2.4-3.fc39.x86_64.rpm 806 kB/s | 20 kB 00:00 (95/266): libb2-0.98.1-9.fc39.x86_64.rpm 1.0 MB/s | 25 kB 00:00 (96/266): libdatrie-0.2.13-7.fc39.x86_64.rpm 1.2 MB/s | 32 kB 00:00 (97/266): libffi-devel-3.4.4-4.fc39.x86_64.rpm 1.1 MB/s | 29 kB 00:00 (98/266): libfontenc-1.1.6-3.fc39.x86_64.rpm 1.2 MB/s | 32 kB 00:00 (99/266): libjpeg-turbo-2.1.4-3.fc39.x86_64.rpm 6.5 MB/s | 183 kB 00:00 (100/266): libicu-devel-73.2-2.fc39.x86_64.rpm 20 MB/s | 924 kB 00:00 (101/266): liblerc-4.0.0-4.fc39.x86_64.rpm 7.3 MB/s | 201 kB 00:00 (102/266): libmpc-1.3.1-3.fc39.x86_64.rpm 2.7 MB/s | 70 kB 00:00 (103/266): libpng-1.6.37-15.fc39.x86_64.rpm 4.3 MB/s | 119 kB 00:00 (104/266): libpng-devel-1.6.37-15.fc39.x86_64.r 8.2 MB/s | 291 kB 00:00 (105/266): libselinux-devel-3.5-5.fc39.x86_64.r 4.3 MB/s | 151 kB 00:00 (106/266): libsepol-devel-3.5-2.fc39.x86_64.rpm 1.5 MB/s | 49 kB 00:00 (107/266): libthai-0.1.29-6.fc39.x86_64.rpm 7.4 MB/s | 213 kB 00:00 (108/266): libtiff-4.4.0-8.fc39.x86_64.rpm 7.0 MB/s | 202 kB 00:00 (109/266): libicu-73.2-2.fc39.x86_64.rpm 53 MB/s | 11 MB 00:00 (110/266): libwebp-1.3.2-2.fc39.x86_64.rpm 8.1 MB/s | 284 kB 00:00 (111/266): libxcb-1.13.1-12.fc39.x86_64.rpm 8.0 MB/s | 233 kB 00:00 (112/266): libxcrypt-devel-4.4.36-2.fc39.x86_64 1.0 MB/s | 30 kB 00:00 (113/266): libxml2-devel-2.10.4-3.fc39.x86_64.r 14 MB/s | 527 kB 00:00 (114/266): lksctp-tools-1.0.19-4.fc39.x86_64.rp 3.5 MB/s | 92 kB 00:00 (115/266): lua-5.4.6-3.fc39.x86_64.rpm 6.9 MB/s | 191 kB 00:00 (116/266): lua-posix-36.2.1-3.fc39.x86_64.rpm 5.1 MB/s | 143 kB 00:00 (117/266): libxcb-devel-1.13.1-12.fc39.x86_64.r 15 MB/s | 1.4 MB 00:00 (118/266): make-4.4.1-2.fc39.x86_64.rpm 19 MB/s | 589 kB 00:00 (119/266): mkfontscale-1.2.2-4.fc39.x86_64.rpm 1.3 MB/s | 32 kB 00:00 (120/266): nettle-3.9.1-2.fc39.x86_64.rpm 14 MB/s | 425 kB 00:00 (121/266): mpdecimal-2.5.1-7.fc39.x86_64.rpm 2.4 MB/s | 89 kB 00:00 (122/266): openblas-0.3.21-6.fc39.x86_64.rpm 1.3 MB/s | 35 kB 00:00 (123/266): openblas-openmp64-0.3.21-6.fc39.x86_ 54 MB/s | 4.8 MB 00:00 (124/266): pcre2-devel-10.42-1.fc39.2.x86_64.rp 16 MB/s | 505 kB 00:00 (125/266): pcre2-utf16-10.42-1.fc39.2.x86_64.rp 7.7 MB/s | 212 kB 00:00 (126/266): pcre2-utf32-10.42-1.fc39.2.x86_64.rp 7.2 MB/s | 200 kB 00:00 (127/266): perl-Carp-1.54-500.fc39.noarch.rpm 1.1 MB/s | 29 kB 00:00 (128/266): pango-1.51.0-1.fc39.x86_64.rpm 1.6 MB/s | 343 kB 00:00 (129/266): perl-Data-Dumper-2.188-501.fc39.x86_ 2.2 MB/s | 56 kB 00:00 (130/266): perl-Digest-MD5-2.58-500.fc39.x86_64 1.4 MB/s | 35 kB 00:00 (131/266): perl-Digest-1.20-500.fc39.noarch.rpm 749 kB/s | 25 kB 00:00 (132/266): perl-Exporter-5.77-500.fc39.noarch.r 811 kB/s | 31 kB 00:00 (133/266): perl-Encode-3.19-500.fc39.x86_64.rpm 38 MB/s | 1.7 MB 00:00 (134/266): perl-File-Temp-0.231.100-500.fc39.no 2.3 MB/s | 58 kB 00:00 (135/266): perl-File-Path-2.18-500.fc39.noarch. 938 kB/s | 35 kB 00:00 (136/266): perl-Getopt-Long-2.54-500.fc39.noarc 2.3 MB/s | 60 kB 00:00 (137/266): perl-IO-Socket-IP-0.42-1.fc39.noarch 1.6 MB/s | 42 kB 00:00 (138/266): perl-HTTP-Tiny-0.088-3.fc39.noarch.r 1.2 MB/s | 56 kB 00:00 (139/266): perl-IO-Socket-SSL-2.083-3.fc39.noar 8.0 MB/s | 225 kB 00:00 (140/266): perl-MIME-Base64-3.16-500.fc39.x86_6 841 kB/s | 29 kB 00:00 (141/266): perl-Mozilla-CA-20230801-1.fc39.noar 513 kB/s | 13 kB 00:00 (142/266): openblas-openmp-0.3.21-6.fc39.x86_64 11 MB/s | 4.9 MB 00:00 (143/266): perl-PathTools-3.89-500.fc39.x86_64. 3.3 MB/s | 87 kB 00:00 (144/266): perl-Pod-Escapes-1.07-500.fc39.noarc 780 kB/s | 20 kB 00:00 (145/266): perl-Pod-Perldoc-3.28.01-501.fc39.no 3.3 MB/s | 86 kB 00:00 (146/266): perl-Pod-Simple-3.45-4.fc39.noarch.r 6.6 MB/s | 218 kB 00:00 (147/266): perl-Pod-Usage-2.03-500.fc39.noarch. 1.5 MB/s | 39 kB 00:00 (148/266): perl-Scalar-List-Utils-1.63-500.fc39 2.6 MB/s | 72 kB 00:00 (149/266): perl-Socket-2.037-3.fc39.x86_64.rpm 2.1 MB/s | 55 kB 00:00 (150/266): perl-Net-SSLeay-1.92-10.fc39.x86_64. 2.7 MB/s | 360 kB 00:00 (151/266): perl-Storable-3.32-500.fc39.x86_64.r 3.5 MB/s | 99 kB 00:00 (152/266): perl-Term-ANSIColor-5.01-501.fc39.no 1.8 MB/s | 47 kB 00:00 (153/266): perl-Term-Cap-1.18-500.fc39.noarch.r 748 kB/s | 22 kB 00:00 (154/266): perl-Text-ParseWords-3.31-500.fc39.n 635 kB/s | 16 kB 00:00 (155/266): perl-Text-Tabs+Wrap-2023.0511-3.fc39 896 kB/s | 22 kB 00:00 (156/266): perl-URI-5.21-1.fc39.noarch.rpm 4.3 MB/s | 125 kB 00:00 (157/266): perl-Time-Local-1.350-3.fc39.noarch. 1.0 MB/s | 34 kB 00:00 (158/266): perl-constant-1.33-501.fc39.noarch.r 893 kB/s | 22 kB 00:00 (159/266): perl-parent-0.241-500.fc39.noarch.rp 574 kB/s | 14 kB 00:00 (160/266): perl-podlators-5.01-500.fc39.noarch. 4.7 MB/s | 125 kB 00:00 (161/266): perl-libnet-3.15-501.fc39.noarch.rpm 2.3 MB/s | 129 kB 00:00 (162/266): pixman-0.42.2-2.fc39.x86_64.rpm 5.1 MB/s | 288 kB 00:00 (163/266): tcl-8.6.12-5.fc39.x86_64.rpm 21 MB/s | 1.1 MB 00:00 (164/266): tk-devel-8.6.12-5.fc39.x86_64.rpm 17 MB/s | 537 kB 00:00 (165/266): tcl-devel-8.6.12-5.fc39.x86_64.rpm 2.7 MB/s | 169 kB 00:00 (166/266): tre-0.8.0-41.20140228gitc2f5d13.fc39 1.7 MB/s | 43 kB 00:00 (167/266): tre-common-0.8.0-41.20140228gitc2f5d 1.0 MB/s | 31 kB 00:00 (168/266): tk-8.6.12-5.fc39.x86_64.rpm 20 MB/s | 1.6 MB 00:00 (169/266): tre-devel-0.8.0-41.20140228gitc2f5d1 472 kB/s | 12 kB 00:00 (170/266): ttmkfdir-3.0.9-69.fc39.x86_64.rpm 1.5 MB/s | 56 kB 00:00 (171/266): xclip-0.13-20.git11cba61.fc39.x86_64 728 kB/s | 37 kB 00:00 (172/266): xdg-utils-1.1.3-15.fc39.noarch.rpm 1.6 MB/s | 77 kB 00:00 (173/266): xml-common-0.6.3-61.fc39.noarch.rpm 861 kB/s | 31 kB 00:00 (174/266): xorg-x11-proto-devel-2023.2-2.fc39.n 10 MB/s | 298 kB 00:00 (175/266): xorg-x11-fonts-Type1-7.5-36.fc39.noa 12 MB/s | 504 kB 00:00 (176/266): xz-devel-5.4.4-1.fc39.x86_64.rpm 1.7 MB/s | 66 kB 00:00 (177/266): zlib-devel-1.2.13-4.fc39.x86_64.rpm 1.7 MB/s | 45 kB 00:00 (178/266): R-devel-4.3.3-2.fc39.x86_64.rpm 79 kB/s | 10 kB 00:00 (179/266): R-java-4.3.3-2.fc39.x86_64.rpm 368 kB/s | 11 kB 00:00 (180/266): R-java-devel-4.3.3-2.fc39.x86_64.rpm 295 kB/s | 10 kB 00:00 (181/266): R-core-devel-4.3.3-2.fc39.x86_64.rpm 425 kB/s | 93 kB 00:00 (182/266): R-littler-0.3.19-1.fc39.x86_64.rpm 746 kB/s | 76 kB 00:00 (183/266): annobin-docs-12.60-1.fc39.noarch.rpm 1.5 MB/s | 88 kB 00:00 (184/266): alsa-lib-1.2.12-1.fc39.x86_64.rpm 2.2 MB/s | 521 kB 00:00 (185/266): annobin-plugin-gcc-12.60-1.fc39.x86_ 2.3 MB/s | 965 kB 00:00 (186/266): crypto-policies-scripts-20231204-1.g 2.0 MB/s | 117 kB 00:00 (187/266): cups-libs-2.4.10-6.fc39.x86_64.rpm 2.3 MB/s | 269 kB 00:00 (188/266): emacs-filesystem-29.4-2.fc39.noarch. 255 kB/s | 7.3 kB 00:00 (189/266): expat-2.6.2-1.fc39.x86_64.rpm 1.9 MB/s | 114 kB 00:00 (190/266): flexiblas-3.4.4-1.fc39.x86_64.rpm 881 kB/s | 25 kB 00:00 (191/266): flexiblas-devel-3.4.4-1.fc39.x86_64. 2.0 MB/s | 121 kB 00:00 (192/266): flexiblas-netlib-3.4.4-1.fc39.x86_64 2.4 MB/s | 3.1 MB 00:01 (193/266): flexiblas-netlib64-3.4.4-1.fc39.x86_ 2.3 MB/s | 3.0 MB 00:01 (194/266): flexiblas-openblas-openmp-3.4.4-1.fc 593 kB/s | 17 kB 00:00 (195/266): flexiblas-openblas-openmp64-3.4.4-1. 597 kB/s | 17 kB 00:00 (196/266): fontconfig-2.14.2-6.fc39.x86_64.rpm 2.0 MB/s | 296 kB 00:00 (197/266): fontconfig-devel-2.14.2-6.fc39.x86_6 1.9 MB/s | 164 kB 00:00 (198/266): cpp-13.3.1-1.fc39.x86_64.rpm 2.4 MB/s | 11 MB 00:04 (199/266): gcc-c++-13.3.1-1.fc39.x86_64.rpm 2.7 MB/s | 13 MB 00:04 (200/266): R-core-4.3.3-2.fc39.x86_64.rpm 6.1 MB/s | 64 MB 00:10 (201/266): gcc-plugin-annobin-13.3.1-1.fc39.x86 1.8 MB/s | 56 kB 00:00 (202/266): glib2-2.78.6-1.fc39.x86_64.rpm 42 MB/s | 2.8 MB 00:00 (203/266): glib2-devel-2.78.6-1.fc39.x86_64.rpm 10 MB/s | 594 kB 00:00 (204/266): glibc-devel-2.38-18.fc39.x86_64.rpm 2.9 MB/s | 86 kB 00:00 (205/266): glibc-headers-x86-2.38-18.fc39.noarc 16 MB/s | 571 kB 00:00 (206/266): gnutls-3.8.6-1.fc39.x86_64.rpm 28 MB/s | 1.1 MB 00:00 (207/266): google-noto-fonts-common-20240101-1. 586 kB/s | 17 kB 00:00 (208/266): gcc-gfortran-13.3.1-1.fc39.x86_64.rp 15 MB/s | 12 MB 00:00 (209/266): google-noto-sans-vf-fonts-20240101-1 16 MB/s | 593 kB 00:00 (210/266): java-21-openjdk-21.0.4.0.7-2.fc39.x8 10 MB/s | 426 kB 00:00 (211/266): groff-base-1.23.0-3.fc39.x86_64.rpm 17 MB/s | 1.1 MB 00:00 (212/266): java-21-openjdk-devel-21.0.4.0.7-2.f 35 MB/s | 5.0 MB 00:00 (213/266): kernel-headers-6.10.3-200.fc39.x86_6 31 MB/s | 1.6 MB 00:00 (214/266): libRmath-4.3.3-2.fc39.x86_64.rpm 3.6 MB/s | 121 kB 00:00 (215/266): libRmath-devel-4.3.3-2.fc39.x86_64.r 541 kB/s | 16 kB 00:00 (216/266): libX11-1.8.9-1.fc39.x86_64.rpm 18 MB/s | 650 kB 00:00 (217/266): libX11-common-1.8.9-1.fc39.noarch.rp 5.6 MB/s | 176 kB 00:00 (218/266): libX11-devel-1.8.9-1.fc39.x86_64.rpm 23 MB/s | 1.0 MB 00:00 (219/266): libX11-xcb-1.8.9-1.fc39.x86_64.rpm 386 kB/s | 12 kB 00:00 (220/266): libblkid-devel-2.39.4-1.fc39.x86_64. 606 kB/s | 18 kB 00:00 (221/266): libgfortran-13.3.1-1.fc39.x86_64.rpm 23 MB/s | 906 kB 00:00 (222/266): libmount-devel-2.39.4-1.fc39.x86_64. 591 kB/s | 18 kB 00:00 (223/266): libquadmath-13.3.1-1.fc39.x86_64.rpm 6.1 MB/s | 203 kB 00:00 (224/266): libquadmath-devel-13.3.1-1.fc39.x86_ 1.4 MB/s | 45 kB 00:00 (225/266): libstdc++-devel-13.3.1-1.fc39.x86_64 32 MB/s | 2.6 MB 00:00 (226/266): libtirpc-devel-1.3.5-0.fc39.x86_64.r 3.9 MB/s | 125 kB 00:00 (227/266): ncurses-6.4-7.20230520.fc39.1.x86_64 12 MB/s | 416 kB 00:00 (228/266): nspr-4.35.0-22.fc39.x86_64.rpm 4.4 MB/s | 136 kB 00:00 (229/266): nss-3.103.0-1.fc39.x86_64.rpm 19 MB/s | 708 kB 00:00 (230/266): nss-softokn-3.103.0-1.fc39.x86_64.rp 12 MB/s | 419 kB 00:00 (231/266): nss-softokn-freebl-3.103.0-1.fc39.x8 9.2 MB/s | 300 kB 00:00 (232/266): nss-sysinit-3.103.0-1.fc39.x86_64.rp 631 kB/s | 18 kB 00:00 (233/266): nss-util-3.103.0-1.fc39.x86_64.rpm 2.9 MB/s | 88 kB 00:00 (234/266): perl-AutoLoader-5.74-502.fc39.noarch 738 kB/s | 21 kB 00:00 (235/266): perl-B-1.88-502.fc39.x86_64.rpm 5.7 MB/s | 177 kB 00:00 (236/266): perl-Class-Struct-0.68-502.fc39.noar 768 kB/s | 22 kB 00:00 (237/266): perl-DynaLoader-1.54-502.fc39.x86_64 907 kB/s | 26 kB 00:00 (238/266): perl-Errno-1.37-502.fc39.x86_64.rpm 503 kB/s | 15 kB 00:00 (239/266): perl-Fcntl-1.15-502.fc39.x86_64.rpm 716 kB/s | 21 kB 00:00 (240/266): perl-File-Basename-2.86-502.fc39.noa 564 kB/s | 17 kB 00:00 (241/266): perl-File-stat-1.13-502.fc39.noarch. 601 kB/s | 17 kB 00:00 (242/266): perl-FileHandle-2.05-502.fc39.noarch 538 kB/s | 16 kB 00:00 (243/266): perl-Getopt-Std-1.13-502.fc39.noarch 548 kB/s | 16 kB 00:00 (244/266): perl-IO-1.52-502.fc39.x86_64.rpm 2.7 MB/s | 82 kB 00:00 (245/266): perl-IPC-Open3-1.22-502.fc39.noarch. 756 kB/s | 22 kB 00:00 (246/266): perl-POSIX-2.13-502.fc39.x86_64.rpm 3.2 MB/s | 97 kB 00:00 (247/266): perl-SelectSaver-1.02-502.fc39.noarc 410 kB/s | 12 kB 00:00 (248/266): perl-Symbol-1.09-502.fc39.noarch.rpm 497 kB/s | 14 kB 00:00 (249/266): perl-base-2.27-502.fc39.noarch.rpm 549 kB/s | 16 kB 00:00 (250/266): perl-if-0.61.000-502.fc39.noarch.rpm 463 kB/s | 14 kB 00:00 (251/266): perl-interpreter-5.38.2-502.fc39.x86 2.2 MB/s | 72 kB 00:00 (252/266): perl-libs-5.38.2-502.fc39.x86_64.rpm 43 MB/s | 2.4 MB 00:00 (253/266): perl-locale-1.10-502.fc39.noarch.rpm 461 kB/s | 14 kB 00:00 (254/266): perl-mro-1.28-502.fc39.x86_64.rpm 997 kB/s | 29 kB 00:00 (255/266): perl-overload-1.37-502.fc39.noarch.r 1.5 MB/s | 46 kB 00:00 (256/266): perl-overloading-0.02-502.fc39.noarc 455 kB/s | 13 kB 00:00 (257/266): perl-vars-1.05-502.fc39.noarch.rpm 458 kB/s | 13 kB 00:00 (258/266): python-pip-wheel-23.2.1-2.fc39.noarc 31 MB/s | 1.5 MB 00:00 (259/266): python3-3.12.5-1.fc39.x86_64.rpm 959 kB/s | 28 kB 00:00 (260/266): python3-libs-3.12.5-1.fc39.x86_64.rp 63 MB/s | 9.2 MB 00:00 (261/266): python3-setuptools-67.7.2-8.fc39.noa 30 MB/s | 1.5 MB 00:00 (262/266): sysprof-capture-devel-45.1-1.fc39.x8 2.0 MB/s | 59 kB 00:00 (263/266): tzdata-2024a-2.fc39.noarch.rpm 19 MB/s | 715 kB 00:00 (264/266): tzdata-java-2024a-2.fc39.noarch.rpm 4.8 MB/s | 208 kB 00:00 (265/266): java-21-openjdk-headless-21.0.4.0.7- 18 MB/s | 48 MB 00:02 (266/266): gcc-13.3.1-1.fc39.x86_64.rpm 2.5 MB/s | 34 MB 00:13 -------------------------------------------------------------------------------- Total 17 MB/s | 337 MB 00:20 Running transaction check Transaction check succeeded. Running transaction test Transaction test succeeded. Running transaction Running scriptlet: copy-jdk-configs-4.1-3.fc39.noarch 1/1 Running scriptlet: java-21-openjdk-headless-1:21.0.4.0.7-2.fc39.x86_64 1/1 Preparing : 1/1 Installing : zlib-devel-1.2.13-4.fc39.x86_64 1/266 Installing : nspr-4.35.0-22.fc39.x86_64 2/266 Installing : libgfortran-13.3.1-1.fc39.x86_64 3/266 Installing : nss-util-3.103.0-1.fc39.x86_64 4/266 Installing : libquadmath-13.3.1-1.fc39.x86_64 5/266 Installing : xorg-x11-proto-devel-2023.2-2.fc39.noarch 6/266 Installing : libpng-2:1.6.37-15.fc39.x86_64 7/266 Installing : libmpc-1.3.1-3.fc39.x86_64 8/266 Installing : libicu-73.2-2.fc39.x86_64 9/266 Installing : tcl-1:8.6.12-5.fc39.x86_64 10/266 Installing : fonts-filesystem-1:2.0.5-12.fc39.noarch 11/266 Installing : tcl-devel-1:8.6.12-5.fc39.x86_64 12/266 Installing : libicu-devel-73.2-2.fc39.x86_64 13/266 Installing : libRmath-4.3.3-2.fc39.x86_64 14/266 Installing : xz-devel-5.4.4-1.fc39.x86_64 15/266 Installing : openblas-0.3.21-6.fc39.x86_64 16/266 Installing : libjpeg-turbo-2.1.4-3.fc39.x86_64 17/266 Installing : libXau-1.0.11-3.fc39.x86_64 18/266 Installing : libxcb-1.13.1-12.fc39.x86_64 19/266 Installing : libICE-1.0.10-11.fc39.x86_64 20/266 Installing : graphite2-1.3.14-12.fc39.x86_64 21/266 Installing : gettext-libs-0.22-2.fc39.x86_64 22/266 Installing : bzip2-devel-1.0.8-16.fc39.x86_64 23/266 Installing : graphite2-devel-1.3.14-12.fc39.x86_64 24/266 Installing : libSM-1.2.3-13.fc39.x86_64 25/266 Installing : libXau-devel-1.0.11-3.fc39.x86_64 26/266 Installing : libxcb-devel-1.13.1-12.fc39.x86_64 27/266 Installing : openblas-openmp-0.3.21-6.fc39.x86_64 28/266 Installing : openblas-openmp64-0.3.21-6.fc39.x86_64 29/266 Installing : flexiblas-netlib64-3.4.4-1.fc39.x86_64 30/266 Installing : flexiblas-netlib-3.4.4-1.fc39.x86_64 31/266 Installing : flexiblas-openblas-openmp-3.4.4-1.fc39.x86_64 32/266 Installing : flexiblas-3.4.4-1.fc39.x86_64 33/266 Installing : flexiblas-openblas-openmp64-3.4.4-1.fc39.x86_64 34/266 Installing : flexiblas-devel-3.4.4-1.fc39.x86_64 35/266 Installing : libRmath-devel-4.3.3-2.fc39.x86_64 36/266 Installing : abattis-cantarell-vf-fonts-0.301-10.fc39.noarch 37/266 Installing : cpp-13.3.1-1.fc39.x86_64 38/266 Installing : libpng-devel-2:1.6.37-15.fc39.x86_64 39/266 Installing : nss-softokn-freebl-3.103.0-1.fc39.x86_64 40/266 Installing : nss-softokn-3.103.0-1.fc39.x86_64 41/266 Installing : tzdata-java-2024a-2.fc39.noarch 42/266 Installing : tzdata-2024a-2.fc39.noarch 43/266 Installing : sysprof-capture-devel-45.1-1.fc39.x86_64 44/266 Installing : python-pip-wheel-23.2.1-2.fc39.noarch 45/266 Installing : ncurses-6.4-7.20230520.fc39.1.x86_64 46/266 Installing : libtirpc-devel-1.3.5-0.fc39.x86_64 47/266 Installing : libstdc++-devel-13.3.1-1.fc39.x86_64 48/266 Installing : libblkid-devel-2.39.4-1.fc39.x86_64 49/266 Installing : libX11-xcb-1.8.9-1.fc39.x86_64 50/266 Installing : libX11-common-1.8.9-1.fc39.noarch 51/266 Installing : libX11-1.8.9-1.fc39.x86_64 52/266 Installing : libXext-1.3.5-3.fc39.x86_64 53/266 Installing : libXrender-0.9.11-3.fc39.x86_64 54/266 Installing : libX11-devel-1.8.9-1.fc39.x86_64 55/266 Installing : libXi-1.8.1-2.fc39.x86_64 56/266 Installing : libXt-1.2.1-5.fc39.x86_64 57/266 Installing : libXmu-1.1.4-3.fc39.x86_64 58/266 Installing : xclip-0.13-20.git11cba61.fc39.x86_64 59/266 Installing : libXtst-1.2.4-3.fc39.x86_64 60/266 Installing : libXrender-devel-0.9.11-3.fc39.x86_64 61/266 Installing : libXcomposite-0.4.5-10.fc39.x86_64 62/266 Installing : kernel-headers-6.10.3-200.fc39.x86_64 63/266 Running scriptlet: groff-base-1.23.0-3.fc39.x86_64 64/266 Installing : groff-base-1.23.0-3.fc39.x86_64 64/266 Running scriptlet: groff-base-1.23.0-3.fc39.x86_64 64/266 Installing : perl-Digest-1.20-500.fc39.noarch 65/266 Installing : perl-Digest-MD5-2.58-500.fc39.x86_64 66/266 Installing : perl-B-1.88-502.fc39.x86_64 67/266 Installing : perl-FileHandle-2.05-502.fc39.noarch 68/266 Installing : perl-Data-Dumper-2.188-501.fc39.x86_64 69/266 Installing : perl-libnet-3.15-501.fc39.noarch 70/266 Installing : perl-AutoLoader-5.74-502.fc39.noarch 71/266 Installing : perl-base-2.27-502.fc39.noarch 72/266 Installing : perl-URI-5.21-1.fc39.noarch 73/266 Installing : perl-Pod-Escapes-1:1.07-500.fc39.noarch 74/266 Installing : perl-Text-Tabs+Wrap-2023.0511-3.fc39.noarch 75/266 Installing : perl-Time-Local-2:1.350-3.fc39.noarch 76/266 Installing : perl-Net-SSLeay-1.92-10.fc39.x86_64 77/266 Installing : perl-Mozilla-CA-20230801-1.fc39.noarch 78/266 Installing : perl-File-Path-2.18-500.fc39.noarch 79/266 Installing : perl-if-0.61.000-502.fc39.noarch 80/266 Installing : perl-locale-1.10-502.fc39.noarch 81/266 Installing : perl-IO-Socket-IP-0.42-1.fc39.noarch 82/266 Installing : perl-IO-Socket-SSL-2.083-3.fc39.noarch 83/266 Installing : perl-Term-ANSIColor-5.01-501.fc39.noarch 84/266 Installing : perl-Term-Cap-1.18-500.fc39.noarch 85/266 Installing : perl-Class-Struct-0.68-502.fc39.noarch 86/266 Installing : perl-POSIX-2.13-502.fc39.x86_64 87/266 Installing : perl-File-Temp-1:0.231.100-500.fc39.noarch 88/266 Installing : perl-HTTP-Tiny-0.088-3.fc39.noarch 89/266 Installing : perl-Pod-Simple-1:3.45-4.fc39.noarch 90/266 Installing : perl-IPC-Open3-1.22-502.fc39.noarch 91/266 Installing : perl-Socket-4:2.037-3.fc39.x86_64 92/266 Installing : perl-SelectSaver-1.02-502.fc39.noarch 93/266 Installing : perl-Symbol-1.09-502.fc39.noarch 94/266 Installing : perl-podlators-1:5.01-500.fc39.noarch 95/266 Installing : perl-Pod-Perldoc-3.28.01-501.fc39.noarch 96/266 Installing : perl-File-stat-1.13-502.fc39.noarch 97/266 Installing : perl-Text-ParseWords-3.31-500.fc39.noarch 98/266 Installing : perl-Fcntl-1.15-502.fc39.x86_64 99/266 Installing : perl-mro-1.28-502.fc39.x86_64 100/266 Installing : perl-Pod-Usage-4:2.03-500.fc39.noarch 101/266 Installing : perl-IO-1.52-502.fc39.x86_64 102/266 Installing : perl-overloading-0.02-502.fc39.noarch 103/266 Installing : perl-MIME-Base64-3.16-500.fc39.x86_64 104/266 Installing : perl-Scalar-List-Utils-5:1.63-500.fc39.x86_64 105/266 Installing : perl-constant-1.33-501.fc39.noarch 106/266 Installing : perl-parent-1:0.241-500.fc39.noarch 107/266 Installing : perl-Errno-1.37-502.fc39.x86_64 108/266 Installing : perl-File-Basename-2.86-502.fc39.noarch 109/266 Installing : perl-Getopt-Std-1.13-502.fc39.noarch 110/266 Installing : perl-Storable-1:3.32-500.fc39.x86_64 111/266 Installing : perl-Getopt-Long-1:2.54-500.fc39.noarch 112/266 Installing : perl-overload-1.37-502.fc39.noarch 113/266 Installing : perl-vars-1.05-502.fc39.noarch 114/266 Installing : perl-Exporter-5.77-500.fc39.noarch 115/266 Installing : perl-PathTools-3.89-500.fc39.x86_64 116/266 Installing : perl-Encode-4:3.19-500.fc39.x86_64 117/266 Installing : perl-DynaLoader-1.54-502.fc39.x86_64 118/266 Installing : perl-Carp-1.54-500.fc39.noarch 119/266 Installing : perl-libs-4:5.38.2-502.fc39.x86_64 120/266 Installing : perl-interpreter-4:5.38.2-502.fc39.x86_64 121/266 Installing : google-noto-fonts-common-20240101-1.fc39.noarch 122/266 Installing : google-noto-sans-vf-fonts-20240101-1.fc39.noarch 123/266 Installing : default-fonts-core-sans-4.0-9.fc39.noarch 124/266 Installing : glibc-headers-x86-2.38-18.fc39.noarch 125/266 Installing : glibc-devel-2.38-18.fc39.x86_64 126/266 Installing : libxcrypt-devel-4.4.36-2.fc39.x86_64 127/266 Installing : expat-2.6.2-1.fc39.x86_64 128/266 Installing : emacs-filesystem-1:29.4-2.fc39.noarch 129/266 Installing : annobin-docs-12.60-1.fc39.noarch 130/266 Installing : alsa-lib-1.2.12-1.fc39.x86_64 131/266 Running scriptlet: xml-common-0.6.3-61.fc39.noarch 132/266 Installing : xml-common-0.6.3-61.fc39.noarch 132/266 Installing : tre-common-0.8.0-41.20140228gitc2f5d13.fc39.noar 133/266 Installing : tre-0.8.0-41.20140228gitc2f5d13.fc39.x86_64 134/266 Installing : tre-devel-0.8.0-41.20140228gitc2f5d13.fc39.x86_6 135/266 Installing : pixman-0.42.2-2.fc39.x86_64 136/266 Installing : pcre2-utf32-10.42-1.fc39.2.x86_64 137/266 Installing : pcre2-utf16-10.42-1.fc39.2.x86_64 138/266 Installing : pcre2-devel-10.42-1.fc39.2.x86_64 139/266 Installing : nettle-3.9.1-2.fc39.x86_64 140/266 Installing : gnutls-3.8.6-1.fc39.x86_64 141/266 Installing : glib2-2.78.6-1.fc39.x86_64 142/266 Installing : cairo-1.18.0-1.fc39.x86_64 143/266 Installing : harfbuzz-8.2.1-2.fc39.x86_64 144/266 Installing : freetype-2.13.1-2.fc39.x86_64 145/266 Installing : fontconfig-2.14.2-6.fc39.x86_64 146/266 Running scriptlet: fontconfig-2.14.2-6.fc39.x86_64 146/266 Installing : libXft-2.3.8-3.fc39.x86_64 147/266 Running scriptlet: tk-1:8.6.12-5.fc39.x86_64 148/266 Installing : tk-1:8.6.12-5.fc39.x86_64 148/266 Installing : ttmkfdir-3.0.9-69.fc39.x86_64 149/266 Installing : harfbuzz-icu-8.2.1-2.fc39.x86_64 150/266 Installing : desktop-file-utils-0.26-9.fc39.x86_64 151/266 Installing : xdg-utils-1.1.3-15.fc39.noarch 152/266 Installing : mpdecimal-2.5.1-7.fc39.x86_64 153/266 Installing : lua-posix-36.2.1-3.fc39.x86_64 154/266 Installing : lua-5.4.6-3.fc39.x86_64 155/266 Installing : copy-jdk-configs-4.1-3.fc39.noarch 156/266 Installing : lksctp-tools-1.0.19-4.fc39.x86_64 157/266 Installing : libwebp-1.3.2-2.fc39.x86_64 158/266 Installing : libsepol-devel-3.5-2.fc39.x86_64 159/266 Installing : libselinux-devel-3.5-5.fc39.x86_64 160/266 Installing : libmount-devel-2.39.4-1.fc39.x86_64 161/266 Installing : liblerc-4.0.0-4.fc39.x86_64 162/266 Installing : libfontenc-1.1.6-3.fc39.x86_64 163/266 Installing : mkfontscale-1.2.2-4.fc39.x86_64 164/266 Installing : xorg-x11-fonts-Type1-7.5-36.fc39.noarch 165/266 Running scriptlet: xorg-x11-fonts-Type1-7.5-36.fc39.noarch 165/266 Installing : libffi-devel-3.4.4-4.fc39.x86_64 166/266 Installing : libdatrie-0.2.13-7.fc39.x86_64 167/266 Installing : libthai-0.1.29-6.fc39.x86_64 168/266 Installing : libb2-0.98.1-9.fc39.x86_64 169/266 Installing : python3-3.12.5-1.fc39.x86_64 170/266 Installing : python3-libs-3.12.5-1.fc39.x86_64 171/266 Installing : crypto-policies-scripts-20231204-1.git1e3a2e4.fc 172/266 Installing : nss-sysinit-3.103.0-1.fc39.x86_64 173/266 Installing : nss-3.103.0-1.fc39.x86_64 174/266 Running scriptlet: nss-3.103.0-1.fc39.x86_64 174/266 Installing : python3-setuptools-67.7.2-8.fc39.noarch 175/266 Installing : glib2-devel-2.78.6-1.fc39.x86_64 176/266 Installing : jbigkit-libs-2.1-26.fc39.x86_64 177/266 Installing : libtiff-4.4.0-8.fc39.x86_64 178/266 Installing : javapackages-filesystem-6.1.0-10.fc39.noarch 179/266 Installing : gettext-envsubst-0.22-2.fc39.x86_64 180/266 Installing : gettext-runtime-0.22-2.fc39.x86_64 181/266 Installing : gettext-0.22-2.fc39.x86_64 182/266 Installing : gc-8.2.2-4.fc39.x86_64 183/266 Installing : guile22-2.2.7-9.fc39.x86_64 184/266 Installing : make-1:4.4.1-2.fc39.x86_64 185/266 Installing : gcc-13.3.1-1.fc39.x86_64 186/266 Running scriptlet: gcc-13.3.1-1.fc39.x86_64 186/266 Installing : gcc-c++-13.3.1-1.fc39.x86_64 187/266 Installing : libquadmath-devel-13.3.1-1.fc39.x86_64 188/266 Installing : gcc-gfortran-13.3.1-1.fc39.x86_64 189/266 Installing : fribidi-1.0.13-2.fc39.x86_64 190/266 Installing : pango-1.51.0-1.fc39.x86_64 191/266 Installing : R-core-4.3.3-2.fc39.x86_64 192/266 Installing : R-CRAN-rlang-1.1.4-1.fc39.copr7531082.x86_64 193/266 Installing : R-CRAN-cli-3.6.3-1.fc39.copr7649835.x86_64 194/266 Installing : R-CRAN-glue-1.7.0-1.fc39.copr6877494.x86_64 195/266 Installing : R-CRAN-lifecycle-1.0.4-1.fc39.copr6614518.noarch 196/266 Installing : R-CRAN-vctrs-0.6.5-1.fc39.copr6715464.x86_64 197/266 Installing : R-CRAN-magrittr-2.0.3-1.fc39.copr6279321.x86_64 198/266 Installing : R-CRAN-R6-2.5.1-1.fc39.copr6279323.noarch 199/266 Installing : R-CRAN-lattice-0.22.6-1.fc39.copr7307082.x86_64 200/266 Installing : R-CRAN-withr-3.0.1-1.fc39.copr7810684.noarch 201/266 Installing : R-CRAN-tidyselect-1.2.1-1.fc39.copr7306789.noarc 202/266 Installing : R-CRAN-gtable-0.3.5-1.fc39.copr7338149.noarch 203/266 Installing : R-CRAN-crayon-1.5.3-1.fc39.copr7633037.noarch 204/266 Installing : R-CRAN-fansi-1.0.6-1.fc39.copr6735917.x86_64 205/266 Installing : R-CRAN-pkgconfig-2.0.3-3.fc39.copr6279322.noarch 206/266 Installing : R-CRAN-hms-1.1.3-1.fc39.copr6286819.noarch 207/266 Installing : R-CRAN-stringi-1.8.4-1.fc39.copr7422034.x86_64 208/266 Installing : R-CRAN-stringr-1.5.1-1.fc39.copr6636964.noarch 209/266 Installing : R-CRAN-Matrix-1.6.5-1.fc39.copr6886765.x86_64 210/266 Installing : R-CRAN-nlme-3.1.166-1.fc39.copr7936970.x86_64 211/266 Installing : R-CRAN-mgcv-1.9.1-1.fc39.copr6775870.x86_64 212/266 Installing : R-CRAN-purrr-1.0.2-1.fc39.copr6286812.x86_64 213/266 Installing : R-CRAN-MASS-7.3.60.0.1-1.fc39.copr6895092.x86_64 214/266 Installing : R-CRAN-RColorBrewer-1.1.3-1.fc39.copr6279333.noa 215/266 Installing : R-CRAN-bit-4.0.5-1.fc39.copr6279356.x86_64 216/266 Installing : R-CRAN-bit64-4.0.5-1.fc39.copr6282913.x86_64 217/266 Installing : R-CRAN-clipr-0.8.0-1.fc39.copr6279344.noarch 218/266 Installing : R-CRAN-colorspace-2.1.1-1.fc39.copr7795131.x86_6 219/266 Installing : R-CRAN-munsell-0.5.1-1.fc39.copr7306785.noarch 220/266 Installing : R-CRAN-farver-2.1.2-1.fc39.copr7442181.x86_64 221/266 Installing : R-CRAN-generics-0.1.3-1.fc39.copr6279393.noarch 222/266 Installing : R-CRAN-isoband-0.2.7-1.fc39.copr6280488.x86_64 223/266 Installing : R-CRAN-labeling-0.4.3-1.fc39.copr6354313.noarch 224/266 Installing : R-CRAN-tzdb-0.4.0-1.fc39.copr6284697.x86_64 225/266 Installing : R-CRAN-utf8-1.2.4-1.fc39.copr6555966.x86_64 226/266 Installing : R-CRAN-pillar-1.9.0-1.fc39.copr6286818.noarch 227/266 Installing : R-CRAN-tibble-3.2.1-1.fc39.copr6288598.x86_64 228/266 Installing : R-CRAN-dplyr-1.1.4-1.fc39.copr6691319.x86_64 229/266 Installing : R-CRAN-vroom-1.6.5-1.fc39.copr6727750.x86_64 230/266 Installing : R-CRAN-viridisLite-0.4.2-1.fc39.copr6279312.noar 231/266 Installing : R-CRAN-scales-1.3.0-1.fc39.copr6704012.noarch 232/266 Installing : R-CRAN-ggplot2-3.5.1-1.fc39.copr7342639.noarch 233/266 Installing : R-rpm-macros-1.2.1-7.fc39.noarch 234/266 Installing : R-littler-0.3.19-1.fc39.x86_64 235/266 Installing : dbus-libs-1:1.14.10-1.fc39.x86_64 236/266 Installing : avahi-libs-0.8-24.fc39.x86_64 237/266 Installing : cups-libs-1:2.4.10-6.fc39.x86_64 238/266 Installing : java-21-openjdk-headless-1:21.0.4.0.7-2.fc39.x86 239/266 Running scriptlet: java-21-openjdk-headless-1:21.0.4.0.7-2.fc39.x86 239/266 Installing : R-java-4.3.3-2.fc39.x86_64 240/266 Installing : java-21-openjdk-1:21.0.4.0.7-2.fc39.x86_64 241/266 Running scriptlet: java-21-openjdk-1:21.0.4.0.7-2.fc39.x86_64 241/266 Installing : java-21-openjdk-devel-1:21.0.4.0.7-2.fc39.x86_64 242/266 Running scriptlet: java-21-openjdk-devel-1:21.0.4.0.7-2.fc39.x86_64 242/266 Installing : cmake-filesystem-3.27.7-1.fc39.x86_64 243/266 Installing : libxml2-devel-2.10.4-3.fc39.x86_64 244/266 Installing : brotli-1.1.0-1.fc39.x86_64 245/266 Installing : brotli-devel-1.1.0-1.fc39.x86_64 246/266 Installing : freetype-devel-2.13.1-2.fc39.x86_64 247/266 Installing : harfbuzz-devel-8.2.1-2.fc39.x86_64 248/266 Installing : fontconfig-devel-2.14.2-6.fc39.x86_64 249/266 Installing : libXft-devel-2.3.8-3.fc39.x86_64 250/266 Installing : tk-devel-1:8.6.12-5.fc39.x86_64 251/266 Installing : R-core-devel-4.3.3-2.fc39.x86_64 252/266 Installing : R-java-devel-4.3.3-2.fc39.x86_64 253/266 Installing : R-devel-4.3.3-2.fc39.x86_64 254/266 Installing : R-CRAN-Rcpp-1.0.13-1.fc39.copr7745410.x86_64 255/266 Installing : R-CRAN-patchwork-1.2.0-1.fc39.copr6873795.noarch 256/266 Installing : R-CRAN-readr-2.1.5-1.fc39.copr6880950.x86_64 257/266 Installing : R-CRAN-tidyr-1.3.1-1.fc39.copr6948918.x86_64 258/266 Installing : R-CRAN-data.tree-1.1.0-1.fc39.copr6627583.noarch 259/266 Installing : R-CRAN-zoo-1.8.12-1.fc39.copr6282861.x86_64 260/266 Installing : R-CRAN-BH-1.84.0.0-1.fc39.copr6880886.noarch 261/266 Installing : R-CRAN-gtools-3.9.5-1.fc39.copr6672122.x86_64 262/266 Installing : R-CRAN-lpSolve-5.6.20-1.fc39.copr6739857.x86_64 263/266 Installing : R-CRAN-yaml-2.3.10-1.fc39.copr7795167.x86_64 264/266 Installing : annobin-plugin-gcc-12.60-1.fc39.x86_64 265/266 Running scriptlet: annobin-plugin-gcc-12.60-1.fc39.x86_64 265/266 Installing : gcc-plugin-annobin-13.3.1-1.fc39.x86_64 266/266 Running scriptlet: gcc-plugin-annobin-13.3.1-1.fc39.x86_64 266/266 Running scriptlet: fontconfig-2.14.2-6.fc39.x86_64 266/266 Running scriptlet: copy-jdk-configs-4.1-3.fc39.noarch 266/266 Running scriptlet: crypto-policies-scripts-20231204-1.git1e3a2e4.fc 266/266 Running scriptlet: nss-3.103.0-1.fc39.x86_64 266/266 Running scriptlet: java-21-openjdk-headless-1:21.0.4.0.7-2.fc39.x86 266/266 Running scriptlet: java-21-openjdk-1:21.0.4.0.7-2.fc39.x86_64 266/266 Running scriptlet: java-21-openjdk-devel-1:21.0.4.0.7-2.fc39.x86_64 266/266 Running scriptlet: gcc-plugin-annobin-13.3.1-1.fc39.x86_64 266/266 Verifying : R-CRAN-BH-1.84.0.0-1.fc39.copr6880886.noarch 1/266 Verifying : R-CRAN-MASS-7.3.60.0.1-1.fc39.copr6895092.x86_64 2/266 Verifying : R-CRAN-Matrix-1.6.5-1.fc39.copr6886765.x86_64 3/266 Verifying : R-CRAN-R6-2.5.1-1.fc39.copr6279323.noarch 4/266 Verifying : R-CRAN-RColorBrewer-1.1.3-1.fc39.copr6279333.noa 5/266 Verifying : R-CRAN-Rcpp-1.0.13-1.fc39.copr7745410.x86_64 6/266 Verifying : R-CRAN-bit-4.0.5-1.fc39.copr6279356.x86_64 7/266 Verifying : R-CRAN-bit64-4.0.5-1.fc39.copr6282913.x86_64 8/266 Verifying : R-CRAN-cli-3.6.3-1.fc39.copr7649835.x86_64 9/266 Verifying : R-CRAN-clipr-0.8.0-1.fc39.copr6279344.noarch 10/266 Verifying : R-CRAN-colorspace-2.1.1-1.fc39.copr7795131.x86_6 11/266 Verifying : R-CRAN-crayon-1.5.3-1.fc39.copr7633037.noarch 12/266 Verifying : R-CRAN-data.tree-1.1.0-1.fc39.copr6627583.noarch 13/266 Verifying : R-CRAN-dplyr-1.1.4-1.fc39.copr6691319.x86_64 14/266 Verifying : R-CRAN-fansi-1.0.6-1.fc39.copr6735917.x86_64 15/266 Verifying : R-CRAN-farver-2.1.2-1.fc39.copr7442181.x86_64 16/266 Verifying : R-CRAN-generics-0.1.3-1.fc39.copr6279393.noarch 17/266 Verifying : R-CRAN-ggplot2-3.5.1-1.fc39.copr7342639.noarch 18/266 Verifying : R-CRAN-glue-1.7.0-1.fc39.copr6877494.x86_64 19/266 Verifying : R-CRAN-gtable-0.3.5-1.fc39.copr7338149.noarch 20/266 Verifying : R-CRAN-gtools-3.9.5-1.fc39.copr6672122.x86_64 21/266 Verifying : R-CRAN-hms-1.1.3-1.fc39.copr6286819.noarch 22/266 Verifying : R-CRAN-isoband-0.2.7-1.fc39.copr6280488.x86_64 23/266 Verifying : R-CRAN-labeling-0.4.3-1.fc39.copr6354313.noarch 24/266 Verifying : R-CRAN-lattice-0.22.6-1.fc39.copr7307082.x86_64 25/266 Verifying : R-CRAN-lifecycle-1.0.4-1.fc39.copr6614518.noarch 26/266 Verifying : R-CRAN-lpSolve-5.6.20-1.fc39.copr6739857.x86_64 27/266 Verifying : R-CRAN-magrittr-2.0.3-1.fc39.copr6279321.x86_64 28/266 Verifying : R-CRAN-mgcv-1.9.1-1.fc39.copr6775870.x86_64 29/266 Verifying : R-CRAN-munsell-0.5.1-1.fc39.copr7306785.noarch 30/266 Verifying : R-CRAN-nlme-3.1.166-1.fc39.copr7936970.x86_64 31/266 Verifying : R-CRAN-patchwork-1.2.0-1.fc39.copr6873795.noarch 32/266 Verifying : R-CRAN-pillar-1.9.0-1.fc39.copr6286818.noarch 33/266 Verifying : R-CRAN-pkgconfig-2.0.3-3.fc39.copr6279322.noarch 34/266 Verifying : R-CRAN-purrr-1.0.2-1.fc39.copr6286812.x86_64 35/266 Verifying : R-CRAN-readr-2.1.5-1.fc39.copr6880950.x86_64 36/266 Verifying : R-CRAN-rlang-1.1.4-1.fc39.copr7531082.x86_64 37/266 Verifying : R-CRAN-scales-1.3.0-1.fc39.copr6704012.noarch 38/266 Verifying : R-CRAN-stringi-1.8.4-1.fc39.copr7422034.x86_64 39/266 Verifying : R-CRAN-stringr-1.5.1-1.fc39.copr6636964.noarch 40/266 Verifying : R-CRAN-tibble-3.2.1-1.fc39.copr6288598.x86_64 41/266 Verifying : R-CRAN-tidyr-1.3.1-1.fc39.copr6948918.x86_64 42/266 Verifying : R-CRAN-tidyselect-1.2.1-1.fc39.copr7306789.noarc 43/266 Verifying : R-CRAN-tzdb-0.4.0-1.fc39.copr6284697.x86_64 44/266 Verifying : R-CRAN-utf8-1.2.4-1.fc39.copr6555966.x86_64 45/266 Verifying : R-CRAN-vctrs-0.6.5-1.fc39.copr6715464.x86_64 46/266 Verifying : R-CRAN-viridisLite-0.4.2-1.fc39.copr6279312.noar 47/266 Verifying : R-CRAN-vroom-1.6.5-1.fc39.copr6727750.x86_64 48/266 Verifying : R-CRAN-withr-3.0.1-1.fc39.copr7810684.noarch 49/266 Verifying : R-CRAN-yaml-2.3.10-1.fc39.copr7795167.x86_64 50/266 Verifying : R-CRAN-zoo-1.8.12-1.fc39.copr6282861.x86_64 51/266 Verifying : R-rpm-macros-1.2.1-7.fc39.noarch 52/266 Verifying : abattis-cantarell-vf-fonts-0.301-10.fc39.noarch 53/266 Verifying : avahi-libs-0.8-24.fc39.x86_64 54/266 Verifying : brotli-1.1.0-1.fc39.x86_64 55/266 Verifying : brotli-devel-1.1.0-1.fc39.x86_64 56/266 Verifying : bzip2-devel-1.0.8-16.fc39.x86_64 57/266 Verifying : cairo-1.18.0-1.fc39.x86_64 58/266 Verifying : cmake-filesystem-3.27.7-1.fc39.x86_64 59/266 Verifying : copy-jdk-configs-4.1-3.fc39.noarch 60/266 Verifying : dbus-libs-1:1.14.10-1.fc39.x86_64 61/266 Verifying : default-fonts-core-sans-4.0-9.fc39.noarch 62/266 Verifying : desktop-file-utils-0.26-9.fc39.x86_64 63/266 Verifying : fonts-filesystem-1:2.0.5-12.fc39.noarch 64/266 Verifying : freetype-2.13.1-2.fc39.x86_64 65/266 Verifying : freetype-devel-2.13.1-2.fc39.x86_64 66/266 Verifying : fribidi-1.0.13-2.fc39.x86_64 67/266 Verifying : gc-8.2.2-4.fc39.x86_64 68/266 Verifying : gettext-0.22-2.fc39.x86_64 69/266 Verifying : gettext-envsubst-0.22-2.fc39.x86_64 70/266 Verifying : gettext-libs-0.22-2.fc39.x86_64 71/266 Verifying : gettext-runtime-0.22-2.fc39.x86_64 72/266 Verifying : graphite2-1.3.14-12.fc39.x86_64 73/266 Verifying : graphite2-devel-1.3.14-12.fc39.x86_64 74/266 Verifying : guile22-2.2.7-9.fc39.x86_64 75/266 Verifying : harfbuzz-8.2.1-2.fc39.x86_64 76/266 Verifying : harfbuzz-devel-8.2.1-2.fc39.x86_64 77/266 Verifying : harfbuzz-icu-8.2.1-2.fc39.x86_64 78/266 Verifying : javapackages-filesystem-6.1.0-10.fc39.noarch 79/266 Verifying : jbigkit-libs-2.1-26.fc39.x86_64 80/266 Verifying : libICE-1.0.10-11.fc39.x86_64 81/266 Verifying : libSM-1.2.3-13.fc39.x86_64 82/266 Verifying : libXau-1.0.11-3.fc39.x86_64 83/266 Verifying : libXau-devel-1.0.11-3.fc39.x86_64 84/266 Verifying : libXcomposite-0.4.5-10.fc39.x86_64 85/266 Verifying : libXext-1.3.5-3.fc39.x86_64 86/266 Verifying : libXft-2.3.8-3.fc39.x86_64 87/266 Verifying : libXft-devel-2.3.8-3.fc39.x86_64 88/266 Verifying : libXi-1.8.1-2.fc39.x86_64 89/266 Verifying : libXmu-1.1.4-3.fc39.x86_64 90/266 Verifying : libXrender-0.9.11-3.fc39.x86_64 91/266 Verifying : libXrender-devel-0.9.11-3.fc39.x86_64 92/266 Verifying : libXt-1.2.1-5.fc39.x86_64 93/266 Verifying : libXtst-1.2.4-3.fc39.x86_64 94/266 Verifying : libb2-0.98.1-9.fc39.x86_64 95/266 Verifying : libdatrie-0.2.13-7.fc39.x86_64 96/266 Verifying : libffi-devel-3.4.4-4.fc39.x86_64 97/266 Verifying : libfontenc-1.1.6-3.fc39.x86_64 98/266 Verifying : libicu-73.2-2.fc39.x86_64 99/266 Verifying : libicu-devel-73.2-2.fc39.x86_64 100/266 Verifying : libjpeg-turbo-2.1.4-3.fc39.x86_64 101/266 Verifying : liblerc-4.0.0-4.fc39.x86_64 102/266 Verifying : libmpc-1.3.1-3.fc39.x86_64 103/266 Verifying : libpng-2:1.6.37-15.fc39.x86_64 104/266 Verifying : libpng-devel-2:1.6.37-15.fc39.x86_64 105/266 Verifying : libselinux-devel-3.5-5.fc39.x86_64 106/266 Verifying : libsepol-devel-3.5-2.fc39.x86_64 107/266 Verifying : libthai-0.1.29-6.fc39.x86_64 108/266 Verifying : libtiff-4.4.0-8.fc39.x86_64 109/266 Verifying : libwebp-1.3.2-2.fc39.x86_64 110/266 Verifying : libxcb-1.13.1-12.fc39.x86_64 111/266 Verifying : libxcb-devel-1.13.1-12.fc39.x86_64 112/266 Verifying : libxcrypt-devel-4.4.36-2.fc39.x86_64 113/266 Verifying : libxml2-devel-2.10.4-3.fc39.x86_64 114/266 Verifying : lksctp-tools-1.0.19-4.fc39.x86_64 115/266 Verifying : lua-5.4.6-3.fc39.x86_64 116/266 Verifying : lua-posix-36.2.1-3.fc39.x86_64 117/266 Verifying : make-1:4.4.1-2.fc39.x86_64 118/266 Verifying : mkfontscale-1.2.2-4.fc39.x86_64 119/266 Verifying : mpdecimal-2.5.1-7.fc39.x86_64 120/266 Verifying : nettle-3.9.1-2.fc39.x86_64 121/266 Verifying : openblas-0.3.21-6.fc39.x86_64 122/266 Verifying : openblas-openmp-0.3.21-6.fc39.x86_64 123/266 Verifying : openblas-openmp64-0.3.21-6.fc39.x86_64 124/266 Verifying : pango-1.51.0-1.fc39.x86_64 125/266 Verifying : pcre2-devel-10.42-1.fc39.2.x86_64 126/266 Verifying : pcre2-utf16-10.42-1.fc39.2.x86_64 127/266 Verifying : pcre2-utf32-10.42-1.fc39.2.x86_64 128/266 Verifying : perl-Carp-1.54-500.fc39.noarch 129/266 Verifying : perl-Data-Dumper-2.188-501.fc39.x86_64 130/266 Verifying : perl-Digest-1.20-500.fc39.noarch 131/266 Verifying : perl-Digest-MD5-2.58-500.fc39.x86_64 132/266 Verifying : perl-Encode-4:3.19-500.fc39.x86_64 133/266 Verifying : perl-Exporter-5.77-500.fc39.noarch 134/266 Verifying : perl-File-Path-2.18-500.fc39.noarch 135/266 Verifying : perl-File-Temp-1:0.231.100-500.fc39.noarch 136/266 Verifying : perl-Getopt-Long-1:2.54-500.fc39.noarch 137/266 Verifying : perl-HTTP-Tiny-0.088-3.fc39.noarch 138/266 Verifying : perl-IO-Socket-IP-0.42-1.fc39.noarch 139/266 Verifying : perl-IO-Socket-SSL-2.083-3.fc39.noarch 140/266 Verifying : perl-MIME-Base64-3.16-500.fc39.x86_64 141/266 Verifying : perl-Mozilla-CA-20230801-1.fc39.noarch 142/266 Verifying : perl-Net-SSLeay-1.92-10.fc39.x86_64 143/266 Verifying : perl-PathTools-3.89-500.fc39.x86_64 144/266 Verifying : perl-Pod-Escapes-1:1.07-500.fc39.noarch 145/266 Verifying : perl-Pod-Perldoc-3.28.01-501.fc39.noarch 146/266 Verifying : perl-Pod-Simple-1:3.45-4.fc39.noarch 147/266 Verifying : perl-Pod-Usage-4:2.03-500.fc39.noarch 148/266 Verifying : perl-Scalar-List-Utils-5:1.63-500.fc39.x86_64 149/266 Verifying : perl-Socket-4:2.037-3.fc39.x86_64 150/266 Verifying : perl-Storable-1:3.32-500.fc39.x86_64 151/266 Verifying : perl-Term-ANSIColor-5.01-501.fc39.noarch 152/266 Verifying : perl-Term-Cap-1.18-500.fc39.noarch 153/266 Verifying : perl-Text-ParseWords-3.31-500.fc39.noarch 154/266 Verifying : perl-Text-Tabs+Wrap-2023.0511-3.fc39.noarch 155/266 Verifying : perl-Time-Local-2:1.350-3.fc39.noarch 156/266 Verifying : perl-URI-5.21-1.fc39.noarch 157/266 Verifying : perl-constant-1.33-501.fc39.noarch 158/266 Verifying : perl-libnet-3.15-501.fc39.noarch 159/266 Verifying : perl-parent-1:0.241-500.fc39.noarch 160/266 Verifying : perl-podlators-1:5.01-500.fc39.noarch 161/266 Verifying : pixman-0.42.2-2.fc39.x86_64 162/266 Verifying : tcl-1:8.6.12-5.fc39.x86_64 163/266 Verifying : tcl-devel-1:8.6.12-5.fc39.x86_64 164/266 Verifying : tk-1:8.6.12-5.fc39.x86_64 165/266 Verifying : tk-devel-1:8.6.12-5.fc39.x86_64 166/266 Verifying : tre-0.8.0-41.20140228gitc2f5d13.fc39.x86_64 167/266 Verifying : tre-common-0.8.0-41.20140228gitc2f5d13.fc39.noar 168/266 Verifying : tre-devel-0.8.0-41.20140228gitc2f5d13.fc39.x86_6 169/266 Verifying : ttmkfdir-3.0.9-69.fc39.x86_64 170/266 Verifying : xclip-0.13-20.git11cba61.fc39.x86_64 171/266 Verifying : xdg-utils-1.1.3-15.fc39.noarch 172/266 Verifying : xml-common-0.6.3-61.fc39.noarch 173/266 Verifying : xorg-x11-fonts-Type1-7.5-36.fc39.noarch 174/266 Verifying : xorg-x11-proto-devel-2023.2-2.fc39.noarch 175/266 Verifying : xz-devel-5.4.4-1.fc39.x86_64 176/266 Verifying : zlib-devel-1.2.13-4.fc39.x86_64 177/266 Verifying : R-core-4.3.3-2.fc39.x86_64 178/266 Verifying : R-core-devel-4.3.3-2.fc39.x86_64 179/266 Verifying : R-devel-4.3.3-2.fc39.x86_64 180/266 Verifying : R-java-4.3.3-2.fc39.x86_64 181/266 Verifying : R-java-devel-4.3.3-2.fc39.x86_64 182/266 Verifying : R-littler-0.3.19-1.fc39.x86_64 183/266 Verifying : alsa-lib-1.2.12-1.fc39.x86_64 184/266 Verifying : annobin-docs-12.60-1.fc39.noarch 185/266 Verifying : annobin-plugin-gcc-12.60-1.fc39.x86_64 186/266 Verifying : cpp-13.3.1-1.fc39.x86_64 187/266 Verifying : crypto-policies-scripts-20231204-1.git1e3a2e4.fc 188/266 Verifying : cups-libs-1:2.4.10-6.fc39.x86_64 189/266 Verifying : emacs-filesystem-1:29.4-2.fc39.noarch 190/266 Verifying : expat-2.6.2-1.fc39.x86_64 191/266 Verifying : flexiblas-3.4.4-1.fc39.x86_64 192/266 Verifying : flexiblas-devel-3.4.4-1.fc39.x86_64 193/266 Verifying : flexiblas-netlib-3.4.4-1.fc39.x86_64 194/266 Verifying : flexiblas-netlib64-3.4.4-1.fc39.x86_64 195/266 Verifying : flexiblas-openblas-openmp-3.4.4-1.fc39.x86_64 196/266 Verifying : flexiblas-openblas-openmp64-3.4.4-1.fc39.x86_64 197/266 Verifying : fontconfig-2.14.2-6.fc39.x86_64 198/266 Verifying : fontconfig-devel-2.14.2-6.fc39.x86_64 199/266 Verifying : gcc-13.3.1-1.fc39.x86_64 200/266 Verifying : gcc-c++-13.3.1-1.fc39.x86_64 201/266 Verifying : gcc-gfortran-13.3.1-1.fc39.x86_64 202/266 Verifying : gcc-plugin-annobin-13.3.1-1.fc39.x86_64 203/266 Verifying : glib2-2.78.6-1.fc39.x86_64 204/266 Verifying : glib2-devel-2.78.6-1.fc39.x86_64 205/266 Verifying : glibc-devel-2.38-18.fc39.x86_64 206/266 Verifying : glibc-headers-x86-2.38-18.fc39.noarch 207/266 Verifying : gnutls-3.8.6-1.fc39.x86_64 208/266 Verifying : google-noto-fonts-common-20240101-1.fc39.noarch 209/266 Verifying : google-noto-sans-vf-fonts-20240101-1.fc39.noarch 210/266 Verifying : groff-base-1.23.0-3.fc39.x86_64 211/266 Verifying : java-21-openjdk-1:21.0.4.0.7-2.fc39.x86_64 212/266 Verifying : java-21-openjdk-devel-1:21.0.4.0.7-2.fc39.x86_64 213/266 Verifying : java-21-openjdk-headless-1:21.0.4.0.7-2.fc39.x86 214/266 Verifying : kernel-headers-6.10.3-200.fc39.x86_64 215/266 Verifying : libRmath-4.3.3-2.fc39.x86_64 216/266 Verifying : libRmath-devel-4.3.3-2.fc39.x86_64 217/266 Verifying : libX11-1.8.9-1.fc39.x86_64 218/266 Verifying : libX11-common-1.8.9-1.fc39.noarch 219/266 Verifying : libX11-devel-1.8.9-1.fc39.x86_64 220/266 Verifying : libX11-xcb-1.8.9-1.fc39.x86_64 221/266 Verifying : libblkid-devel-2.39.4-1.fc39.x86_64 222/266 Verifying : libgfortran-13.3.1-1.fc39.x86_64 223/266 Verifying : libmount-devel-2.39.4-1.fc39.x86_64 224/266 Verifying : libquadmath-13.3.1-1.fc39.x86_64 225/266 Verifying : libquadmath-devel-13.3.1-1.fc39.x86_64 226/266 Verifying : libstdc++-devel-13.3.1-1.fc39.x86_64 227/266 Verifying : libtirpc-devel-1.3.5-0.fc39.x86_64 228/266 Verifying : ncurses-6.4-7.20230520.fc39.1.x86_64 229/266 Verifying : nspr-4.35.0-22.fc39.x86_64 230/266 Verifying : nss-3.103.0-1.fc39.x86_64 231/266 Verifying : nss-softokn-3.103.0-1.fc39.x86_64 232/266 Verifying : nss-softokn-freebl-3.103.0-1.fc39.x86_64 233/266 Verifying : nss-sysinit-3.103.0-1.fc39.x86_64 234/266 Verifying : nss-util-3.103.0-1.fc39.x86_64 235/266 Verifying : perl-AutoLoader-5.74-502.fc39.noarch 236/266 Verifying : perl-B-1.88-502.fc39.x86_64 237/266 Verifying : perl-Class-Struct-0.68-502.fc39.noarch 238/266 Verifying : perl-DynaLoader-1.54-502.fc39.x86_64 239/266 Verifying : perl-Errno-1.37-502.fc39.x86_64 240/266 Verifying : perl-Fcntl-1.15-502.fc39.x86_64 241/266 Verifying : perl-File-Basename-2.86-502.fc39.noarch 242/266 Verifying : perl-File-stat-1.13-502.fc39.noarch 243/266 Verifying : perl-FileHandle-2.05-502.fc39.noarch 244/266 Verifying : perl-Getopt-Std-1.13-502.fc39.noarch 245/266 Verifying : perl-IO-1.52-502.fc39.x86_64 246/266 Verifying : perl-IPC-Open3-1.22-502.fc39.noarch 247/266 Verifying : perl-POSIX-2.13-502.fc39.x86_64 248/266 Verifying : perl-SelectSaver-1.02-502.fc39.noarch 249/266 Verifying : perl-Symbol-1.09-502.fc39.noarch 250/266 Verifying : perl-base-2.27-502.fc39.noarch 251/266 Verifying : perl-if-0.61.000-502.fc39.noarch 252/266 Verifying : perl-interpreter-4:5.38.2-502.fc39.x86_64 253/266 Verifying : perl-libs-4:5.38.2-502.fc39.x86_64 254/266 Verifying : perl-locale-1.10-502.fc39.noarch 255/266 Verifying : perl-mro-1.28-502.fc39.x86_64 256/266 Verifying : perl-overload-1.37-502.fc39.noarch 257/266 Verifying : perl-overloading-0.02-502.fc39.noarch 258/266 Verifying : perl-vars-1.05-502.fc39.noarch 259/266 Verifying : python-pip-wheel-23.2.1-2.fc39.noarch 260/266 Verifying : python3-3.12.5-1.fc39.x86_64 261/266 Verifying : python3-libs-3.12.5-1.fc39.x86_64 262/266 Verifying : python3-setuptools-67.7.2-8.fc39.noarch 263/266 Verifying : sysprof-capture-devel-45.1-1.fc39.x86_64 264/266 Verifying : tzdata-2024a-2.fc39.noarch 265/266 Verifying : tzdata-java-2024a-2.fc39.noarch 266/266 Installed products updated. Installed: R-CRAN-BH-1.84.0.0-1.fc39.copr6880886.noarch R-CRAN-MASS-7.3.60.0.1-1.fc39.copr6895092.x86_64 R-CRAN-Matrix-1.6.5-1.fc39.copr6886765.x86_64 R-CRAN-R6-2.5.1-1.fc39.copr6279323.noarch R-CRAN-RColorBrewer-1.1.3-1.fc39.copr6279333.noarch R-CRAN-Rcpp-1.0.13-1.fc39.copr7745410.x86_64 R-CRAN-bit-4.0.5-1.fc39.copr6279356.x86_64 R-CRAN-bit64-4.0.5-1.fc39.copr6282913.x86_64 R-CRAN-cli-3.6.3-1.fc39.copr7649835.x86_64 R-CRAN-clipr-0.8.0-1.fc39.copr6279344.noarch R-CRAN-colorspace-2.1.1-1.fc39.copr7795131.x86_64 R-CRAN-crayon-1.5.3-1.fc39.copr7633037.noarch R-CRAN-data.tree-1.1.0-1.fc39.copr6627583.noarch R-CRAN-dplyr-1.1.4-1.fc39.copr6691319.x86_64 R-CRAN-fansi-1.0.6-1.fc39.copr6735917.x86_64 R-CRAN-farver-2.1.2-1.fc39.copr7442181.x86_64 R-CRAN-generics-0.1.3-1.fc39.copr6279393.noarch R-CRAN-ggplot2-3.5.1-1.fc39.copr7342639.noarch R-CRAN-glue-1.7.0-1.fc39.copr6877494.x86_64 R-CRAN-gtable-0.3.5-1.fc39.copr7338149.noarch R-CRAN-gtools-3.9.5-1.fc39.copr6672122.x86_64 R-CRAN-hms-1.1.3-1.fc39.copr6286819.noarch R-CRAN-isoband-0.2.7-1.fc39.copr6280488.x86_64 R-CRAN-labeling-0.4.3-1.fc39.copr6354313.noarch R-CRAN-lattice-0.22.6-1.fc39.copr7307082.x86_64 R-CRAN-lifecycle-1.0.4-1.fc39.copr6614518.noarch R-CRAN-lpSolve-5.6.20-1.fc39.copr6739857.x86_64 R-CRAN-magrittr-2.0.3-1.fc39.copr6279321.x86_64 R-CRAN-mgcv-1.9.1-1.fc39.copr6775870.x86_64 R-CRAN-munsell-0.5.1-1.fc39.copr7306785.noarch R-CRAN-nlme-3.1.166-1.fc39.copr7936970.x86_64 R-CRAN-patchwork-1.2.0-1.fc39.copr6873795.noarch R-CRAN-pillar-1.9.0-1.fc39.copr6286818.noarch R-CRAN-pkgconfig-2.0.3-3.fc39.copr6279322.noarch R-CRAN-purrr-1.0.2-1.fc39.copr6286812.x86_64 R-CRAN-readr-2.1.5-1.fc39.copr6880950.x86_64 R-CRAN-rlang-1.1.4-1.fc39.copr7531082.x86_64 R-CRAN-scales-1.3.0-1.fc39.copr6704012.noarch R-CRAN-stringi-1.8.4-1.fc39.copr7422034.x86_64 R-CRAN-stringr-1.5.1-1.fc39.copr6636964.noarch R-CRAN-tibble-3.2.1-1.fc39.copr6288598.x86_64 R-CRAN-tidyr-1.3.1-1.fc39.copr6948918.x86_64 R-CRAN-tidyselect-1.2.1-1.fc39.copr7306789.noarch R-CRAN-tzdb-0.4.0-1.fc39.copr6284697.x86_64 R-CRAN-utf8-1.2.4-1.fc39.copr6555966.x86_64 R-CRAN-vctrs-0.6.5-1.fc39.copr6715464.x86_64 R-CRAN-viridisLite-0.4.2-1.fc39.copr6279312.noarch R-CRAN-vroom-1.6.5-1.fc39.copr6727750.x86_64 R-CRAN-withr-3.0.1-1.fc39.copr7810684.noarch R-CRAN-yaml-2.3.10-1.fc39.copr7795167.x86_64 R-CRAN-zoo-1.8.12-1.fc39.copr6282861.x86_64 R-core-4.3.3-2.fc39.x86_64 R-core-devel-4.3.3-2.fc39.x86_64 R-devel-4.3.3-2.fc39.x86_64 R-java-4.3.3-2.fc39.x86_64 R-java-devel-4.3.3-2.fc39.x86_64 R-littler-0.3.19-1.fc39.x86_64 R-rpm-macros-1.2.1-7.fc39.noarch abattis-cantarell-vf-fonts-0.301-10.fc39.noarch alsa-lib-1.2.12-1.fc39.x86_64 annobin-docs-12.60-1.fc39.noarch annobin-plugin-gcc-12.60-1.fc39.x86_64 avahi-libs-0.8-24.fc39.x86_64 brotli-1.1.0-1.fc39.x86_64 brotli-devel-1.1.0-1.fc39.x86_64 bzip2-devel-1.0.8-16.fc39.x86_64 cairo-1.18.0-1.fc39.x86_64 cmake-filesystem-3.27.7-1.fc39.x86_64 copy-jdk-configs-4.1-3.fc39.noarch cpp-13.3.1-1.fc39.x86_64 crypto-policies-scripts-20231204-1.git1e3a2e4.fc39.noarch cups-libs-1:2.4.10-6.fc39.x86_64 dbus-libs-1:1.14.10-1.fc39.x86_64 default-fonts-core-sans-4.0-9.fc39.noarch desktop-file-utils-0.26-9.fc39.x86_64 emacs-filesystem-1:29.4-2.fc39.noarch expat-2.6.2-1.fc39.x86_64 flexiblas-3.4.4-1.fc39.x86_64 flexiblas-devel-3.4.4-1.fc39.x86_64 flexiblas-netlib-3.4.4-1.fc39.x86_64 flexiblas-netlib64-3.4.4-1.fc39.x86_64 flexiblas-openblas-openmp-3.4.4-1.fc39.x86_64 flexiblas-openblas-openmp64-3.4.4-1.fc39.x86_64 fontconfig-2.14.2-6.fc39.x86_64 fontconfig-devel-2.14.2-6.fc39.x86_64 fonts-filesystem-1:2.0.5-12.fc39.noarch freetype-2.13.1-2.fc39.x86_64 freetype-devel-2.13.1-2.fc39.x86_64 fribidi-1.0.13-2.fc39.x86_64 gc-8.2.2-4.fc39.x86_64 gcc-13.3.1-1.fc39.x86_64 gcc-c++-13.3.1-1.fc39.x86_64 gcc-gfortran-13.3.1-1.fc39.x86_64 gcc-plugin-annobin-13.3.1-1.fc39.x86_64 gettext-0.22-2.fc39.x86_64 gettext-envsubst-0.22-2.fc39.x86_64 gettext-libs-0.22-2.fc39.x86_64 gettext-runtime-0.22-2.fc39.x86_64 glib2-2.78.6-1.fc39.x86_64 glib2-devel-2.78.6-1.fc39.x86_64 glibc-devel-2.38-18.fc39.x86_64 glibc-headers-x86-2.38-18.fc39.noarch gnutls-3.8.6-1.fc39.x86_64 google-noto-fonts-common-20240101-1.fc39.noarch google-noto-sans-vf-fonts-20240101-1.fc39.noarch graphite2-1.3.14-12.fc39.x86_64 graphite2-devel-1.3.14-12.fc39.x86_64 groff-base-1.23.0-3.fc39.x86_64 guile22-2.2.7-9.fc39.x86_64 harfbuzz-8.2.1-2.fc39.x86_64 harfbuzz-devel-8.2.1-2.fc39.x86_64 harfbuzz-icu-8.2.1-2.fc39.x86_64 java-21-openjdk-1:21.0.4.0.7-2.fc39.x86_64 java-21-openjdk-devel-1:21.0.4.0.7-2.fc39.x86_64 java-21-openjdk-headless-1:21.0.4.0.7-2.fc39.x86_64 javapackages-filesystem-6.1.0-10.fc39.noarch jbigkit-libs-2.1-26.fc39.x86_64 kernel-headers-6.10.3-200.fc39.x86_64 libICE-1.0.10-11.fc39.x86_64 libRmath-4.3.3-2.fc39.x86_64 libRmath-devel-4.3.3-2.fc39.x86_64 libSM-1.2.3-13.fc39.x86_64 libX11-1.8.9-1.fc39.x86_64 libX11-common-1.8.9-1.fc39.noarch libX11-devel-1.8.9-1.fc39.x86_64 libX11-xcb-1.8.9-1.fc39.x86_64 libXau-1.0.11-3.fc39.x86_64 libXau-devel-1.0.11-3.fc39.x86_64 libXcomposite-0.4.5-10.fc39.x86_64 libXext-1.3.5-3.fc39.x86_64 libXft-2.3.8-3.fc39.x86_64 libXft-devel-2.3.8-3.fc39.x86_64 libXi-1.8.1-2.fc39.x86_64 libXmu-1.1.4-3.fc39.x86_64 libXrender-0.9.11-3.fc39.x86_64 libXrender-devel-0.9.11-3.fc39.x86_64 libXt-1.2.1-5.fc39.x86_64 libXtst-1.2.4-3.fc39.x86_64 libb2-0.98.1-9.fc39.x86_64 libblkid-devel-2.39.4-1.fc39.x86_64 libdatrie-0.2.13-7.fc39.x86_64 libffi-devel-3.4.4-4.fc39.x86_64 libfontenc-1.1.6-3.fc39.x86_64 libgfortran-13.3.1-1.fc39.x86_64 libicu-73.2-2.fc39.x86_64 libicu-devel-73.2-2.fc39.x86_64 libjpeg-turbo-2.1.4-3.fc39.x86_64 liblerc-4.0.0-4.fc39.x86_64 libmount-devel-2.39.4-1.fc39.x86_64 libmpc-1.3.1-3.fc39.x86_64 libpng-2:1.6.37-15.fc39.x86_64 libpng-devel-2:1.6.37-15.fc39.x86_64 libquadmath-13.3.1-1.fc39.x86_64 libquadmath-devel-13.3.1-1.fc39.x86_64 libselinux-devel-3.5-5.fc39.x86_64 libsepol-devel-3.5-2.fc39.x86_64 libstdc++-devel-13.3.1-1.fc39.x86_64 libthai-0.1.29-6.fc39.x86_64 libtiff-4.4.0-8.fc39.x86_64 libtirpc-devel-1.3.5-0.fc39.x86_64 libwebp-1.3.2-2.fc39.x86_64 libxcb-1.13.1-12.fc39.x86_64 libxcb-devel-1.13.1-12.fc39.x86_64 libxcrypt-devel-4.4.36-2.fc39.x86_64 libxml2-devel-2.10.4-3.fc39.x86_64 lksctp-tools-1.0.19-4.fc39.x86_64 lua-5.4.6-3.fc39.x86_64 lua-posix-36.2.1-3.fc39.x86_64 make-1:4.4.1-2.fc39.x86_64 mkfontscale-1.2.2-4.fc39.x86_64 mpdecimal-2.5.1-7.fc39.x86_64 ncurses-6.4-7.20230520.fc39.1.x86_64 nettle-3.9.1-2.fc39.x86_64 nspr-4.35.0-22.fc39.x86_64 nss-3.103.0-1.fc39.x86_64 nss-softokn-3.103.0-1.fc39.x86_64 nss-softokn-freebl-3.103.0-1.fc39.x86_64 nss-sysinit-3.103.0-1.fc39.x86_64 nss-util-3.103.0-1.fc39.x86_64 openblas-0.3.21-6.fc39.x86_64 openblas-openmp-0.3.21-6.fc39.x86_64 openblas-openmp64-0.3.21-6.fc39.x86_64 pango-1.51.0-1.fc39.x86_64 pcre2-devel-10.42-1.fc39.2.x86_64 pcre2-utf16-10.42-1.fc39.2.x86_64 pcre2-utf32-10.42-1.fc39.2.x86_64 perl-AutoLoader-5.74-502.fc39.noarch perl-B-1.88-502.fc39.x86_64 perl-Carp-1.54-500.fc39.noarch perl-Class-Struct-0.68-502.fc39.noarch perl-Data-Dumper-2.188-501.fc39.x86_64 perl-Digest-1.20-500.fc39.noarch perl-Digest-MD5-2.58-500.fc39.x86_64 perl-DynaLoader-1.54-502.fc39.x86_64 perl-Encode-4:3.19-500.fc39.x86_64 perl-Errno-1.37-502.fc39.x86_64 perl-Exporter-5.77-500.fc39.noarch perl-Fcntl-1.15-502.fc39.x86_64 perl-File-Basename-2.86-502.fc39.noarch perl-File-Path-2.18-500.fc39.noarch perl-File-Temp-1:0.231.100-500.fc39.noarch perl-File-stat-1.13-502.fc39.noarch perl-FileHandle-2.05-502.fc39.noarch perl-Getopt-Long-1:2.54-500.fc39.noarch perl-Getopt-Std-1.13-502.fc39.noarch perl-HTTP-Tiny-0.088-3.fc39.noarch perl-IO-1.52-502.fc39.x86_64 perl-IO-Socket-IP-0.42-1.fc39.noarch perl-IO-Socket-SSL-2.083-3.fc39.noarch perl-IPC-Open3-1.22-502.fc39.noarch perl-MIME-Base64-3.16-500.fc39.x86_64 perl-Mozilla-CA-20230801-1.fc39.noarch perl-Net-SSLeay-1.92-10.fc39.x86_64 perl-POSIX-2.13-502.fc39.x86_64 perl-PathTools-3.89-500.fc39.x86_64 perl-Pod-Escapes-1:1.07-500.fc39.noarch perl-Pod-Perldoc-3.28.01-501.fc39.noarch perl-Pod-Simple-1:3.45-4.fc39.noarch perl-Pod-Usage-4:2.03-500.fc39.noarch perl-Scalar-List-Utils-5:1.63-500.fc39.x86_64 perl-SelectSaver-1.02-502.fc39.noarch perl-Socket-4:2.037-3.fc39.x86_64 perl-Storable-1:3.32-500.fc39.x86_64 perl-Symbol-1.09-502.fc39.noarch perl-Term-ANSIColor-5.01-501.fc39.noarch perl-Term-Cap-1.18-500.fc39.noarch perl-Text-ParseWords-3.31-500.fc39.noarch perl-Text-Tabs+Wrap-2023.0511-3.fc39.noarch perl-Time-Local-2:1.350-3.fc39.noarch perl-URI-5.21-1.fc39.noarch perl-base-2.27-502.fc39.noarch perl-constant-1.33-501.fc39.noarch perl-if-0.61.000-502.fc39.noarch perl-interpreter-4:5.38.2-502.fc39.x86_64 perl-libnet-3.15-501.fc39.noarch perl-libs-4:5.38.2-502.fc39.x86_64 perl-locale-1.10-502.fc39.noarch perl-mro-1.28-502.fc39.x86_64 perl-overload-1.37-502.fc39.noarch perl-overloading-0.02-502.fc39.noarch perl-parent-1:0.241-500.fc39.noarch perl-podlators-1:5.01-500.fc39.noarch perl-vars-1.05-502.fc39.noarch pixman-0.42.2-2.fc39.x86_64 python-pip-wheel-23.2.1-2.fc39.noarch python3-3.12.5-1.fc39.x86_64 python3-libs-3.12.5-1.fc39.x86_64 python3-setuptools-67.7.2-8.fc39.noarch sysprof-capture-devel-45.1-1.fc39.x86_64 tcl-1:8.6.12-5.fc39.x86_64 tcl-devel-1:8.6.12-5.fc39.x86_64 tk-1:8.6.12-5.fc39.x86_64 tk-devel-1:8.6.12-5.fc39.x86_64 tre-0.8.0-41.20140228gitc2f5d13.fc39.x86_64 tre-common-0.8.0-41.20140228gitc2f5d13.fc39.noarch tre-devel-0.8.0-41.20140228gitc2f5d13.fc39.x86_64 ttmkfdir-3.0.9-69.fc39.x86_64 tzdata-2024a-2.fc39.noarch tzdata-java-2024a-2.fc39.noarch xclip-0.13-20.git11cba61.fc39.x86_64 xdg-utils-1.1.3-15.fc39.noarch xml-common-0.6.3-61.fc39.noarch xorg-x11-fonts-Type1-7.5-36.fc39.noarch xorg-x11-proto-devel-2023.2-2.fc39.noarch xz-devel-5.4.4-1.fc39.x86_64 zlib-devel-1.2.13-4.fc39.x86_64 Complete! Finish: build setup for R-CRAN-starvz-0.8.2-1.fc39.copr7998582.src.rpm Start: rpmbuild R-CRAN-starvz-0.8.2-1.fc39.copr7998582.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.CC3WPq + 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.2.tar.gz + STATUS=0 + '[' 0 -ne 0 ']' + rm -rf /builddir/build/BUILD/starvz-SPECPARTS + /usr/bin/mkdir -p /builddir/build/BUILD/starvz-SPECPARTS + /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.TiwUJD + 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 -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 -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 + RUSTFLAGS='-Copt-level=3 -Cdebuginfo=2 -Ccodegen-units=1 -Cstrip=none -Cforce-frame-pointers=yes -Clink-arg=-specs=/usr/lib/rpm/redhat/redhat-package-notes --cap-lints=warn' + export RUSTFLAGS + LDFLAGS='-Wl,-z,relro -Wl,--as-needed -Wl,-z,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.9pFz8c + umask 022 + cd /builddir/build/BUILD + '[' /builddir/build/BUILDROOT/R-CRAN-starvz-0.8.2-1.fc39.copr7998582.x86_64 '!=' / ']' + rm -rf /builddir/build/BUILDROOT/R-CRAN-starvz-0.8.2-1.fc39.copr7998582.x86_64 ++ dirname /builddir/build/BUILDROOT/R-CRAN-starvz-0.8.2-1.fc39.copr7998582.x86_64 + mkdir -p /builddir/build/BUILDROOT + mkdir /builddir/build/BUILDROOT/R-CRAN-starvz-0.8.2-1.fc39.copr7998582.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 -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 -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 + RUSTFLAGS='-Copt-level=3 -Cdebuginfo=2 -Ccodegen-units=1 -Cstrip=none -Cforce-frame-pointers=yes -Clink-arg=-specs=/usr/lib/rpm/redhat/redhat-package-notes --cap-lints=warn' + export RUSTFLAGS + LDFLAGS='-Wl,-z,relro -Wl,--as-needed -Wl,-z,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.2-1.fc39.copr7998582.x86_64/usr/local/lib/R/library + /usr/bin/R CMD INSTALL -l /builddir/build/BUILDROOT/R-CRAN-starvz-0.8.2-1.fc39.copr7998582.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.3.1 20240522 (Red Hat 13.3.1-1)’ g++ -std=gnu++17 -I"/usr/include/R" -DNDEBUG -I'/usr/local/lib/R/library/Rcpp/include' -I'/usr/local/lib/R/library/BH/include' -I/usr/local/include -fpic -O2 -flto=auto -ffat-lto-objects -fexceptions -g -grecord-gcc-switches -pipe -Wall -Werror=format-security -Wp,-U_FORTIFY_SOURCE,-D_FORTIFY_SOURCE=3 -Wp,-D_GLIBCXX_ASSERTIONS -specs=/usr/lib/rpm/redhat/redhat-hardened-cc1 -fstack-protector-strong -specs=/usr/lib/rpm/redhat/redhat-annobin-cc1 -m64 -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.2-1.fc39.copr7998582.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.2-1.fc39.copr7998582.x86_64/usr/local/lib/R/library/R.css + find /builddir/build/BUILDROOT/R-CRAN-starvz-0.8.2-1.fc39.copr7998582.x86_64/usr/local/lib/R/library -type f -exec sed -i s@/builddir/build/BUILDROOT/R-CRAN-starvz-0.8.2-1.fc39.copr7998582.x86_64@@g '{}' ';' + /usr/bin/find-debuginfo -j2 --strict-build-id -m -i --build-id-seed 0.8.2-1.fc39.copr7998582 --unique-debug-suffix -0.8.2-1.fc39.copr7998582.x86_64 --unique-debug-src-base R-CRAN-starvz-0.8.2-1.fc39.copr7998582.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 DWARF-compressing 1 files sepdebugcrcfix: Updated 1 CRC32s, 0 CRC32s did match. Creating .debug symlinks for symlinks to ELF files Copying sources found by 'debugedit -l' to /usr/src/debug/R-CRAN-starvz-0.8.2-1.fc39.copr7998582.x86_64 28 blocks find-debuginfo: done + /usr/lib/rpm/check-buildroot + /usr/lib/rpm/redhat/brp-ldconfig + /usr/lib/rpm/brp-compress + /usr/lib/rpm/redhat/brp-strip-lto /usr/bin/strip + /usr/lib/rpm/brp-strip-static-archive /usr/bin/strip + /usr/lib/rpm/redhat/brp-mangle-shebangs *** 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.2-1.fc39.copr7998582.x86_64 Provides: R-CRAN-starvz = 0.8.2-1.fc39.copr7998582 R-CRAN-starvz(x86-64) = 0.8.2-1.fc39.copr7998582 Requires(rpmlib): rpmlib(CompressedFileNames) <= 3.0.4-1 rpmlib(FileDigests) <= 4.6.0-1 rpmlib(PayloadFilesHavePrefix) <= 4.0-1 Requires: /usr/bin/Rscript /usr/bin/bash libR.so()(64bit) libc.so.6()(64bit) libc.so.6(GLIBC_2.11)(64bit) libc.so.6(GLIBC_2.14)(64bit) libc.so.6(GLIBC_2.2.5)(64bit) libc.so.6(GLIBC_2.38)(64bit) libc.so.6(GLIBC_2.4)(64bit) 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.11)(64bit) libstdc++.so.6(GLIBCXX_3.4.15)(64bit) libstdc++.so.6(GLIBCXX_3.4.20)(64bit) libstdc++.so.6(GLIBCXX_3.4.21)(64bit) libstdc++.so.6(GLIBCXX_3.4.26)(64bit) libstdc++.so.6(GLIBCXX_3.4.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.2-1.fc39.copr7998582.x86_64 Provides: R-CRAN-starvz-debugsource = 0.8.2-1.fc39.copr7998582 R-CRAN-starvz-debugsource(x86-64) = 0.8.2-1.fc39.copr7998582 Requires(rpmlib): rpmlib(CompressedFileNames) <= 3.0.4-1 rpmlib(FileDigests) <= 4.6.0-1 rpmlib(PayloadFilesHavePrefix) <= 4.0-1 Processing files: R-CRAN-starvz-debuginfo-0.8.2-1.fc39.copr7998582.x86_64 Provides: R-CRAN-starvz-debuginfo = 0.8.2-1.fc39.copr7998582 R-CRAN-starvz-debuginfo(x86-64) = 0.8.2-1.fc39.copr7998582 debuginfo(build-id) = 473bb610f2d05f443de89b653932b4ad6c42b45a Requires(rpmlib): rpmlib(CompressedFileNames) <= 3.0.4-1 rpmlib(FileDigests) <= 4.6.0-1 rpmlib(PayloadFilesHavePrefix) <= 4.0-1 Recommends: R-CRAN-starvz-debugsource(x86-64) = 0.8.2-1.fc39.copr7998582 Checking for unpackaged file(s): /usr/lib/rpm/check-files /builddir/build/BUILDROOT/R-CRAN-starvz-0.8.2-1.fc39.copr7998582.x86_64 Wrote: /builddir/build/RPMS/R-CRAN-starvz-0.8.2-1.fc39.copr7998582.x86_64.rpm Wrote: /builddir/build/RPMS/R-CRAN-starvz-debugsource-0.8.2-1.fc39.copr7998582.x86_64.rpm Wrote: /builddir/build/RPMS/R-CRAN-starvz-debuginfo-0.8.2-1.fc39.copr7998582.x86_64.rpm Executing(%clean): /bin/sh -e /var/tmp/rpm-tmp.4sShqM + umask 022 + cd /builddir/build/BUILD + cd starvz + /usr/bin/rm -rf /builddir/build/BUILDROOT/R-CRAN-starvz-0.8.2-1.fc39.copr7998582.x86_64 + RPM_EC=0 ++ jobs -p + exit 0 Executing(rmbuild): /bin/sh -e /var/tmp/rpm-tmp.7QbEcG + umask 022 + cd /builddir/build/BUILD + rm -rf /builddir/build/BUILD/starvz-SPECPARTS + 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.2-1.fc39.copr7998582.src.rpm Finish: build phase for R-CRAN-starvz-0.8.2-1.fc39.copr7998582.src.rpm INFO: chroot_scan: 3 files copied to /var/lib/copr-rpmbuild/results/chroot_scan INFO: /var/lib/mock/fedora-39-x86_64-1725845921.254522/root/var/log/dnf.log /var/lib/mock/fedora-39-x86_64-1725845921.254522/root/var/log/dnf.librepo.log /var/lib/mock/fedora-39-x86_64-1725845921.254522/root/var/log/dnf.rpm.log INFO: Done(/var/lib/copr-rpmbuild/results/R-CRAN-starvz-0.8.2-1.fc39.copr7998582.src.rpm) Config(child) 1 minutes 25 seconds INFO: Results and/or logs in: /var/lib/copr-rpmbuild/results INFO: Cleaning up build root ('cleanup_on_success=True') Start: clean chroot INFO: unmounting tmpfs. Finish: clean chroot Finish: run Running RPMResults tool Package info: { "packages": [ { "name": "R-CRAN-starvz", "epoch": null, "version": "0.8.2", "release": "1.fc39.copr7998582", "arch": "src" }, { "name": "R-CRAN-starvz", "epoch": null, "version": "0.8.2", "release": "1.fc39.copr7998582", "arch": "x86_64" }, { "name": "R-CRAN-starvz-debugsource", "epoch": null, "version": "0.8.2", "release": "1.fc39.copr7998582", "arch": "x86_64" }, { "name": "R-CRAN-starvz-debuginfo", "epoch": null, "version": "0.8.2", "release": "1.fc39.copr7998582", "arch": "x86_64" } ] } RPMResults finished