Warning: Permanently added '3.237.33.245' (ED25519) to the list of known hosts. Running (timeout=18000): unbuffer mock --spec /var/lib/copr-rpmbuild/workspace/workdir-7pfjjy_h/R-CRAN-TBRDist/R-CRAN-TBRDist.spec --sources /var/lib/copr-rpmbuild/workspace/workdir-7pfjjy_h/R-CRAN-TBRDist --resultdir /var/lib/copr-rpmbuild/results --uniqueext 1764990259.129745 -r /var/lib/copr-rpmbuild/results/configs/child.cfg INFO: mock.py version 6.5 starting (python version = 3.13.7, NVR = mock-6.5-1.fc42), args: /usr/libexec/mock/mock --spec /var/lib/copr-rpmbuild/workspace/workdir-7pfjjy_h/R-CRAN-TBRDist/R-CRAN-TBRDist.spec --sources /var/lib/copr-rpmbuild/workspace/workdir-7pfjjy_h/R-CRAN-TBRDist --resultdir /var/lib/copr-rpmbuild/results --uniqueext 1764990259.129745 -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-7pfjjy_h/R-CRAN-TBRDist/R-CRAN-TBRDist.spec) Config(fedora-43-x86_64) Start: clean chroot Finish: clean chroot Mock Version: 6.5 INFO: Mock Version: 6.5 Start: chroot init INFO: mounting tmpfs at /var/lib/mock/fedora-43-x86_64-1764990259.129745/root. INFO: calling preinit hooks INFO: enabled root cache INFO: enabled package manager cache Start: cleaning package manager metadata Finish: cleaning package manager metadata INFO: enabled HW Info plugin INFO: Package manager dnf5 detected and used (fallback) INFO: Buildroot is handled by package management from host and used with --installroot: rpm-4.20.1-1.fc42.x86_64 rpm-sequoia-1.7.0-5.fc42.x86_64 python3-dnf-4.24.0-1.fc42.noarch python3-dnf-plugins-core-4.10.1-1.fc42.noarch dnf5-5.2.17.0-1.fc42.x86_64 dnf5-plugins-5.2.17.0-1.fc42.x86_64 Start: installing minimal buildroot with dnf5 Updating and loading repositories: Copr repository 100% | 1.1 KiB/s | 1.5 KiB | 00m01s fedora 100% | 17.8 KiB/s | 32.5 KiB | 00m02s updates 100% | 7.0 KiB/s | 10.7 KiB | 00m02s Repositories loaded. Package Arch Version Repository Size Installing group/module packages: bash x86_64 5.3.0-2.fc43 fedora 8.4 MiB bzip2 x86_64 1.0.8-21.fc43 fedora 95.3 KiB coreutils x86_64 9.7-6.fc43 fedora 5.4 MiB cpio x86_64 2.15-6.fc43 fedora 1.1 MiB diffutils x86_64 3.12-3.fc43 fedora 1.6 MiB fedora-release-common noarch 43-25 fedora 20.6 KiB findutils x86_64 1:4.10.0-6.fc43 fedora 1.8 MiB gawk x86_64 5.3.2-2.fc43 fedora 1.8 MiB glibc-minimal-langpack x86_64 2.42-4.fc43 fedora 0.0 B grep x86_64 3.12-2.fc43 fedora 1.0 MiB gzip x86_64 1.13-4.fc43 fedora 388.8 KiB info x86_64 7.2-6.fc43 fedora 353.9 KiB patch x86_64 2.8-2.fc43 fedora 222.8 KiB redhat-rpm-config noarch 343-11.fc43 fedora 182.9 KiB rpm-build x86_64 6.0.0-1.fc43 fedora 287.4 KiB sed x86_64 4.9-5.fc43 fedora 857.3 KiB shadow-utils x86_64 2:4.18.0-3.fc43 fedora 3.9 MiB tar x86_64 2:1.35-6.fc43 fedora 2.9 MiB unzip x86_64 6.0-67.fc43 fedora 386.3 KiB util-linux x86_64 2.41.1-17.fc43 fedora 3.5 MiB which x86_64 2.23-3.fc43 fedora 83.5 KiB xz x86_64 1:5.8.1-4.fc43 updates 1.3 MiB Installing dependencies: add-determinism x86_64 0.6.0-2.fc43 fedora 2.4 MiB alternatives x86_64 1.33-3.fc43 updates 62.2 KiB ansible-srpm-macros noarch 1-18.1.fc43 fedora 35.7 KiB audit-libs x86_64 4.1.2-2.fc43 updates 378.8 KiB binutils x86_64 2.45.1-1.fc43 updates 27.3 MiB build-reproducibility-srpm-macros noarch 0.6.0-2.fc43 fedora 735.0 B bzip2-libs x86_64 1.0.8-21.fc43 fedora 80.6 KiB ca-certificates noarch 2025.2.80_v9.0.304-1.1.fc43 fedora 2.7 MiB coreutils-common x86_64 9.7-6.fc43 fedora 11.3 MiB crypto-policies noarch 20251125-1.git63291f8.fc43 updates 147.1 KiB curl x86_64 8.15.0-3.fc43 updates 461.5 KiB cyrus-sasl-lib x86_64 2.1.28-33.fc43 fedora 2.3 MiB debugedit x86_64 5.2-3.fc43 fedora 214.0 KiB dwz x86_64 0.16-2.fc43 fedora 287.1 KiB ed x86_64 1.22.2-1.fc43 fedora 148.1 KiB efi-srpm-macros noarch 6-4.fc43 fedora 40.1 KiB elfutils x86_64 0.194-1.fc43 updates 2.9 MiB elfutils-debuginfod-client x86_64 0.194-1.fc43 updates 84.0 KiB elfutils-default-yama-scope noarch 0.194-1.fc43 updates 1.8 KiB elfutils-libelf x86_64 0.194-1.fc43 updates 1.1 MiB elfutils-libs x86_64 0.194-1.fc43 updates 687.5 KiB fedora-gpg-keys noarch 43-1 fedora 131.2 KiB fedora-release noarch 43-25 fedora 0.0 B fedora-release-identity-basic noarch 43-25 fedora 631.0 B fedora-repos noarch 43-1 fedora 4.9 KiB file x86_64 5.46-8.fc43 fedora 100.2 KiB file-libs x86_64 5.46-8.fc43 fedora 11.9 MiB filesystem x86_64 3.18-50.fc43 fedora 112.0 B filesystem-srpm-macros noarch 3.18-50.fc43 fedora 38.2 KiB fonts-srpm-macros noarch 1:2.0.5-23.fc43 fedora 55.8 KiB forge-srpm-macros noarch 0.4.0-3.fc43 fedora 38.9 KiB fpc-srpm-macros noarch 1.3-15.fc43 fedora 144.0 B gap-srpm-macros noarch 2-1.fc43 fedora 2.1 KiB gdb-minimal x86_64 16.3-6.fc43 fedora 13.3 MiB gdbm-libs x86_64 1:1.23-10.fc43 fedora 129.9 KiB ghc-srpm-macros noarch 1.9.2-3.fc43 fedora 779.0 B glibc x86_64 2.42-4.fc43 fedora 6.7 MiB glibc-common x86_64 2.42-4.fc43 fedora 1.0 MiB glibc-gconv-extra x86_64 2.42-4.fc43 fedora 7.2 MiB gmp x86_64 1:6.3.0-4.fc43 fedora 811.2 KiB gnat-srpm-macros noarch 6-8.fc43 fedora 1.0 KiB gnulib-l10n noarch 20241231-1.fc43 fedora 655.0 KiB gnupg2 x86_64 2.4.8-4.fc43 fedora 6.5 MiB gnupg2-dirmngr x86_64 2.4.8-4.fc43 fedora 618.4 KiB gnupg2-gpg-agent x86_64 2.4.8-4.fc43 fedora 671.4 KiB gnupg2-gpgconf x86_64 2.4.8-4.fc43 fedora 250.0 KiB gnupg2-keyboxd x86_64 2.4.8-4.fc43 fedora 201.4 KiB gnupg2-verify x86_64 2.4.8-4.fc43 fedora 348.5 KiB gnutls x86_64 3.8.11-5.fc43 updates 3.6 MiB go-srpm-macros noarch 3.8.0-1.fc43 fedora 61.9 KiB gpgverify noarch 2.2-3.fc43 fedora 8.7 KiB ima-evm-utils-libs x86_64 1.6.2-6.fc43 fedora 60.7 KiB jansson x86_64 2.14-3.fc43 fedora 89.1 KiB java-srpm-macros noarch 1-7.fc43 fedora 870.0 B json-c x86_64 0.18-7.fc43 fedora 82.7 KiB kernel-srpm-macros noarch 1.0-27.fc43 fedora 1.9 KiB keyutils-libs x86_64 1.6.3-6.fc43 fedora 54.3 KiB krb5-libs x86_64 1.21.3-7.fc43 fedora 2.3 MiB libacl x86_64 2.3.2-4.fc43 fedora 35.9 KiB libarchive x86_64 3.8.1-3.fc43 fedora 951.1 KiB libassuan x86_64 2.5.7-4.fc43 fedora 163.8 KiB libattr x86_64 2.5.2-6.fc43 fedora 24.4 KiB libblkid x86_64 2.41.1-17.fc43 fedora 262.4 KiB libbrotli x86_64 1.1.0-10.fc43 fedora 833.3 KiB libcap x86_64 2.76-3.fc43 fedora 209.1 KiB libcap-ng x86_64 0.8.5-8.fc43 fedora 68.9 KiB libcom_err x86_64 1.47.3-2.fc43 fedora 63.1 KiB libcurl x86_64 8.15.0-3.fc43 updates 903.2 KiB libeconf x86_64 0.7.9-2.fc43 fedora 64.9 KiB libevent x86_64 2.1.12-16.fc43 fedora 883.1 KiB libfdisk x86_64 2.41.1-17.fc43 fedora 380.4 KiB libffi x86_64 3.5.2-1.fc43 updates 83.8 KiB libfsverity x86_64 1.6-3.fc43 fedora 28.5 KiB libgcc x86_64 15.2.1-4.fc43 updates 266.6 KiB libgcrypt x86_64 1.11.1-2.fc43 fedora 1.6 MiB libgomp x86_64 15.2.1-4.fc43 updates 541.6 KiB libgpg-error x86_64 1.55-2.fc43 fedora 915.3 KiB libidn2 x86_64 2.3.8-2.fc43 fedora 552.5 KiB libksba x86_64 1.6.7-4.fc43 fedora 398.5 KiB liblastlog2 x86_64 2.41.1-17.fc43 fedora 33.9 KiB libmount x86_64 2.41.1-17.fc43 fedora 372.7 KiB libnghttp2 x86_64 1.66.0-2.fc43 fedora 162.2 KiB libpkgconf x86_64 2.3.0-3.fc43 fedora 78.1 KiB libpsl x86_64 0.21.5-6.fc43 fedora 76.4 KiB libselinux x86_64 3.9-5.fc43 fedora 193.1 KiB libsemanage x86_64 3.9-4.fc43 fedora 308.5 KiB libsepol x86_64 3.9-2.fc43 fedora 822.0 KiB libsmartcols x86_64 2.41.1-17.fc43 fedora 180.5 KiB libssh x86_64 0.11.3-1.fc43 fedora 567.1 KiB libssh-config noarch 0.11.3-1.fc43 fedora 277.0 B libstdc++ x86_64 15.2.1-4.fc43 updates 2.8 MiB libtasn1 x86_64 4.20.0-2.fc43 fedora 176.3 KiB libtool-ltdl x86_64 2.5.4-8.fc43 updates 70.1 KiB libunistring x86_64 1.1-10.fc43 fedora 1.7 MiB libusb1 x86_64 1.0.29-4.fc43 fedora 171.3 KiB libuuid x86_64 2.41.1-17.fc43 fedora 37.4 KiB libverto x86_64 0.3.2-11.fc43 fedora 25.4 KiB libxcrypt x86_64 4.5.2-1.fc43 updates 285.3 KiB libxml2 x86_64 2.12.10-5.fc43 fedora 1.7 MiB libzstd x86_64 1.5.7-2.fc43 fedora 799.9 KiB lua-libs x86_64 5.4.8-3.fc43 updates 280.8 KiB lua-srpm-macros noarch 1-16.fc43 fedora 1.3 KiB lz4-libs x86_64 1.10.0-3.fc43 fedora 161.4 KiB mpfr x86_64 4.2.2-2.fc43 fedora 832.8 KiB ncurses-base noarch 6.5-7.20250614.fc43 fedora 328.1 KiB ncurses-libs x86_64 6.5-7.20250614.fc43 fedora 946.3 KiB nettle x86_64 3.10.1-2.fc43 fedora 790.6 KiB npth x86_64 1.8-3.fc43 fedora 49.6 KiB ocaml-srpm-macros noarch 11-2.fc43 fedora 1.9 KiB openblas-srpm-macros noarch 2-20.fc43 fedora 112.0 B openldap x86_64 2.6.10-4.fc43 fedora 659.9 KiB openssl-libs x86_64 1:3.5.4-1.fc43 updates 8.9 MiB p11-kit x86_64 0.25.8-1.fc43 fedora 2.3 MiB p11-kit-trust x86_64 0.25.8-1.fc43 fedora 446.5 KiB package-notes-srpm-macros noarch 0.5-14.fc43 fedora 1.6 KiB pam-libs x86_64 1.7.1-3.fc43 fedora 126.8 KiB pcre2 x86_64 10.47-1.fc43 updates 702.6 KiB pcre2-syntax noarch 10.47-1.fc43 updates 281.9 KiB perl-srpm-macros noarch 1-60.fc43 fedora 861.0 B pkgconf x86_64 2.3.0-3.fc43 fedora 88.5 KiB pkgconf-m4 noarch 2.3.0-3.fc43 fedora 14.4 KiB pkgconf-pkg-config x86_64 2.3.0-3.fc43 fedora 989.0 B popt x86_64 1.19-9.fc43 fedora 132.8 KiB publicsuffix-list-dafsa noarch 20250616-2.fc43 fedora 69.1 KiB pyproject-srpm-macros noarch 1.18.6-1.fc43 updates 1.9 KiB python-srpm-macros noarch 3.14-5.fc43 fedora 51.5 KiB qt5-srpm-macros noarch 5.15.18-1.fc43 updates 500.0 B qt6-srpm-macros noarch 6.10.1-1.fc43 updates 464.0 B readline x86_64 8.3-2.fc43 fedora 511.7 KiB rpm x86_64 6.0.0-1.fc43 fedora 3.1 MiB rpm-build-libs x86_64 6.0.0-1.fc43 fedora 268.4 KiB rpm-libs x86_64 6.0.0-1.fc43 fedora 933.7 KiB rpm-sequoia x86_64 1.9.0-2.fc43 fedora 2.5 MiB rpm-sign-libs x86_64 6.0.0-1.fc43 fedora 39.7 KiB rust-srpm-macros noarch 28.0-1.fc43 updates 4.8 KiB setup noarch 2.15.0-26.fc43 fedora 725.0 KiB sqlite-libs x86_64 3.50.2-2.fc43 fedora 1.5 MiB systemd-libs x86_64 258.2-1.fc43 updates 2.3 MiB systemd-standalone-sysusers x86_64 258.2-1.fc43 updates 293.5 KiB tpm2-tss x86_64 4.1.3-8.fc43 fedora 1.6 MiB tree-sitter-srpm-macros noarch 0.4.2-1.fc43 fedora 8.3 KiB util-linux-core x86_64 2.41.1-17.fc43 fedora 1.5 MiB xxhash-libs x86_64 0.8.3-3.fc43 fedora 90.2 KiB xz-libs x86_64 1:5.8.1-4.fc43 updates 217.8 KiB zig-srpm-macros noarch 1-5.fc43 fedora 1.1 KiB zip x86_64 3.0-44.fc43 fedora 694.5 KiB zlib-ng-compat x86_64 2.2.5-2.fc43 fedora 137.6 KiB zstd x86_64 1.5.7-2.fc43 fedora 1.7 MiB Installing groups: Buildsystem building group Transaction Summary: Installing: 170 packages Total size of inbound packages is 59 MiB. Need to download 0 B. After this operation, 200 MiB extra will be used (install 200 MiB, remove 0 B). [ 1/170] tar-2:1.35-6.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 2/170] bzip2-0:1.0.8-21.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 3/170] redhat-rpm-config-0:343-11.fc 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 4/170] rpm-build-0:6.0.0-1.fc43.x86_ 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 5/170] unzip-0:6.0-67.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 6/170] cpio-0:2.15-6.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 7/170] which-0:2.23-3.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 8/170] bash-0:5.3.0-2.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 9/170] coreutils-0:9.7-6.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 10/170] grep-0:3.12-2.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 11/170] patch-0:2.8-2.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 12/170] sed-0:4.9-5.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 13/170] shadow-utils-2:4.18.0-3.fc43. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 14/170] diffutils-0:3.12-3.fc43.x86_6 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 15/170] fedora-release-common-0:43-25 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 16/170] findutils-1:4.10.0-6.fc43.x86 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 17/170] glibc-minimal-langpack-0:2.42 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 18/170] gzip-0:1.13-4.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 19/170] info-0:7.2-6.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 20/170] util-linux-0:2.41.1-17.fc43.x 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 21/170] gawk-0:5.3.2-2.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 22/170] xz-1:5.8.1-4.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 23/170] glibc-0:2.42-4.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 24/170] libacl-0:2.3.2-4.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 25/170] libselinux-0:3.9-5.fc43.x86_6 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 26/170] bzip2-libs-0:1.0.8-21.fc43.x8 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 27/170] ansible-srpm-macros-0:1-18.1. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 28/170] build-reproducibility-srpm-ma 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 29/170] dwz-0:0.16-2.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 30/170] efi-srpm-macros-0:6-4.fc43.no 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 31/170] file-0:5.46-8.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 32/170] filesystem-srpm-macros-0:3.18 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 33/170] fonts-srpm-macros-1:2.0.5-23. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 34/170] forge-srpm-macros-0:0.4.0-3.f 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 35/170] fpc-srpm-macros-0:1.3-15.fc43 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 36/170] gap-srpm-macros-0:2-1.fc43.no 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 37/170] ghc-srpm-macros-0:1.9.2-3.fc4 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 38/170] gnat-srpm-macros-0:6-8.fc43.n 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 39/170] go-srpm-macros-0:3.8.0-1.fc43 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 40/170] java-srpm-macros-0:1-7.fc43.n 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 41/170] kernel-srpm-macros-0:1.0-27.f 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 42/170] lua-srpm-macros-0:1-16.fc43.n 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 43/170] ocaml-srpm-macros-0:11-2.fc43 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 44/170] openblas-srpm-macros-0:2-20.f 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 45/170] package-notes-srpm-macros-0:0 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 46/170] perl-srpm-macros-0:1-60.fc43. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 47/170] python-srpm-macros-0:3.14-5.f 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 48/170] rpm-0:6.0.0-1.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 49/170] tree-sitter-srpm-macros-0:0.4 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 50/170] zig-srpm-macros-0:1-5.fc43.no 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 51/170] zip-0:3.0-44.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 52/170] debugedit-0:5.2-3.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 53/170] libarchive-0:3.8.1-3.fc43.x86 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 54/170] popt-0:1.19-9.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 55/170] readline-0:8.3-2.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 56/170] rpm-build-libs-0:6.0.0-1.fc43 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 57/170] rpm-libs-0:6.0.0-1.fc43.x86_6 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 58/170] zstd-0:1.5.7-2.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 59/170] filesystem-0:3.18-50.fc43.x86 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 60/170] ncurses-libs-0:6.5-7.20250614 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 61/170] coreutils-common-0:9.7-6.fc43 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 62/170] gmp-1:6.3.0-4.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 63/170] libattr-0:2.5.2-6.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 64/170] libcap-0:2.76-3.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 65/170] ed-0:1.22.2-1.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 66/170] libeconf-0:0.7.9-2.fc43.x86_6 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 67/170] libsemanage-0:3.9-4.fc43.x86_ 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 68/170] pam-libs-0:1.7.1-3.fc43.x86_6 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 69/170] setup-0:2.15.0-26.fc43.noarch 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 70/170] fedora-repos-0:43-1.noarch 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 71/170] glibc-common-0:2.42-4.fc43.x8 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 72/170] libblkid-0:2.41.1-17.fc43.x86 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 73/170] libcap-ng-0:0.8.5-8.fc43.x86_ 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 74/170] libfdisk-0:2.41.1-17.fc43.x86 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 75/170] liblastlog2-0:2.41.1-17.fc43. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 76/170] libmount-0:2.41.1-17.fc43.x86 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 77/170] libsmartcols-0:2.41.1-17.fc43 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 78/170] libuuid-0:2.41.1-17.fc43.x86_ 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 79/170] util-linux-core-0:2.41.1-17.f 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 80/170] zlib-ng-compat-0:2.2.5-2.fc43 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 81/170] mpfr-0:4.2.2-2.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 82/170] xz-libs-1:5.8.1-4.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 83/170] glibc-gconv-extra-0:2.42-4.fc 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 84/170] libsepol-0:3.9-2.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 85/170] add-determinism-0:0.6.0-2.fc4 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 86/170] file-libs-0:5.46-8.fc43.x86_6 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 87/170] libxml2-0:2.12.10-5.fc43.x86_ 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 88/170] libzstd-0:1.5.7-2.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 89/170] lz4-libs-0:1.10.0-3.fc43.x86_ 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 90/170] rpm-sign-libs-0:6.0.0-1.fc43. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 91/170] rpm-sequoia-0:1.9.0-2.fc43.x8 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 92/170] sqlite-libs-0:3.50.2-2.fc43.x 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 93/170] ncurses-base-0:6.5-7.20250614 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 94/170] gnulib-l10n-0:20241231-1.fc43 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 95/170] fedora-gpg-keys-0:43-1.noarch 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 96/170] gnupg2-0:2.4.8-4.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 97/170] ima-evm-utils-libs-0:1.6.2-6. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 98/170] libfsverity-0:1.6-3.fc43.x86_ 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 99/170] gpgverify-0:2.2-3.fc43.noarch 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [100/170] gnupg2-dirmngr-0:2.4.8-4.fc43 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [101/170] gnupg2-gpg-agent-0:2.4.8-4.fc 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [102/170] gnupg2-gpgconf-0:2.4.8-4.fc43 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [103/170] gnupg2-keyboxd-0:2.4.8-4.fc43 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [104/170] gnupg2-verify-0:2.4.8-4.fc43. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [105/170] libassuan-0:2.5.7-4.fc43.x86_ 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [106/170] libgcrypt-0:1.11.1-2.fc43.x86 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [107/170] libgpg-error-0:1.55-2.fc43.x8 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [108/170] npth-0:1.8-3.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [109/170] tpm2-tss-0:4.1.3-8.fc43.x86_6 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [110/170] libksba-0:1.6.7-4.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [111/170] openldap-0:2.6.10-4.fc43.x86_ 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [112/170] json-c-0:0.18-7.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [113/170] libusb1-0:1.0.29-4.fc43.x86_6 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [114/170] cyrus-sasl-lib-0:2.1.28-33.fc 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [115/170] libevent-0:2.1.12-16.fc43.x86 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [116/170] gdbm-libs-1:1.23-10.fc43.x86_ 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [117/170] libgcc-0:15.2.1-4.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [118/170] libstdc++-0:15.2.1-4.fc43.x86 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [119/170] libxcrypt-0:4.5.2-1.fc43.x86_ 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [120/170] systemd-libs-0:258.2-1.fc43.x 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [121/170] audit-libs-0:4.1.2-2.fc43.x86 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [122/170] openssl-libs-1:3.5.4-1.fc43.x 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [123/170] ca-certificates-0:2025.2.80_v 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [124/170] lua-libs-0:5.4.8-3.fc43.x86_6 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [125/170] elfutils-libelf-0:0.194-1.fc4 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [126/170] elfutils-libs-0:0.194-1.fc43. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [127/170] elfutils-0:0.194-1.fc43.x86_6 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [128/170] elfutils-debuginfod-client-0: 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [129/170] libgomp-0:15.2.1-4.fc43.x86_6 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [130/170] binutils-0:2.45.1-1.fc43.x86_ 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [131/170] jansson-0:2.14-3.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [132/170] pkgconf-pkg-config-0:2.3.0-3. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [133/170] pkgconf-0:2.3.0-3.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [134/170] pkgconf-m4-0:2.3.0-3.fc43.noa 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [135/170] libpkgconf-0:2.3.0-3.fc43.x86 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [136/170] curl-0:8.15.0-3.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [137/170] pyproject-srpm-macros-0:1.18. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [138/170] qt5-srpm-macros-0:5.15.18-1.f 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [139/170] qt6-srpm-macros-0:6.10.1-1.fc 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [140/170] rust-srpm-macros-0:28.0-1.fc4 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [141/170] libtool-ltdl-0:2.5.4-8.fc43.x 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [142/170] pcre2-0:10.47-1.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [143/170] pcre2-syntax-0:10.47-1.fc43.n 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [144/170] gnutls-0:3.8.11-5.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [145/170] libidn2-0:2.3.8-2.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [146/170] libtasn1-0:4.20.0-2.fc43.x86_ 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [147/170] libunistring-0:1.1-10.fc43.x8 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [148/170] nettle-0:3.10.1-2.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [149/170] p11-kit-0:0.25.8-1.fc43.x86_6 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [150/170] libffi-0:3.5.2-1.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [151/170] p11-kit-trust-0:0.25.8-1.fc43 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [152/170] crypto-policies-0:20251125-1. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [153/170] elfutils-default-yama-scope-0 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [154/170] alternatives-0:1.33-3.fc43.x8 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [155/170] fedora-release-0:43-25.noarch 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [156/170] systemd-standalone-sysusers-0 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [157/170] gdb-minimal-0:16.3-6.fc43.x86 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [158/170] xxhash-libs-0:0.8.3-3.fc43.x8 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [159/170] fedora-release-identity-basic 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [160/170] libcurl-0:8.15.0-3.fc43.x86_6 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [161/170] krb5-libs-0:1.21.3-7.fc43.x86 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [162/170] libbrotli-0:1.1.0-10.fc43.x86 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [163/170] libnghttp2-0:1.66.0-2.fc43.x8 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [164/170] libpsl-0:0.21.5-6.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [165/170] libssh-0:0.11.3-1.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [166/170] keyutils-libs-0:1.6.3-6.fc43. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [167/170] libcom_err-0:1.47.3-2.fc43.x8 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [168/170] libverto-0:0.3.2-11.fc43.x86_ 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [169/170] publicsuffix-list-dafsa-0:202 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [170/170] libssh-config-0:0.11.3-1.fc43 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded -------------------------------------------------------------------------------- [170/170] Total 100% | 0.0 B/s | 0.0 B | 00m00s Running transaction Importing OpenPGP key 0x31645531: UserID : "Fedora (43) " Fingerprint: C6E7F081CF80E13146676E88829B606631645531 From : file:///usr/share/distribution-gpg-keys/fedora/RPM-GPG-KEY-fedora-43-primary The key was successfully imported. [ 1/172] Verify package files 100% | 939.0 B/s | 170.0 B | 00m00s [ 2/172] Prepare transaction 100% | 4.7 KiB/s | 170.0 B | 00m00s [ 3/172] Installing libgcc-0:15.2.1-4. 100% | 262.0 MiB/s | 268.3 KiB | 00m00s [ 4/172] Installing libssh-config-0:0. 100% | 0.0 B/s | 816.0 B | 00m00s [ 5/172] Installing publicsuffix-list- 100% | 0.0 B/s | 69.8 KiB | 00m00s [ 6/172] Installing fedora-release-ide 100% | 0.0 B/s | 888.0 B | 00m00s [ 7/172] Installing fedora-gpg-keys-0: 100% | 58.3 MiB/s | 179.0 KiB | 00m00s [ 8/172] Installing fedora-repos-0:43- 100% | 0.0 B/s | 5.7 KiB | 00m00s [ 9/172] Installing fedora-release-com 100% | 24.3 MiB/s | 24.9 KiB | 00m00s [ 10/172] Installing fedora-release-0:4 100% | 8.6 KiB/s | 124.0 B | 00m00s >>> Running sysusers scriptlet: setup-0:2.15.0-26.fc43.noarch >>> Finished sysusers scriptlet: setup-0:2.15.0-26.fc43.noarch >>> Scriptlet output: >>> Creating group 'adm' with GID 4. >>> Creating group 'audio' with GID 63. >>> Creating group 'cdrom' with GID 11. >>> Creating group 'clock' with GID 103. >>> Creating group 'dialout' with GID 18. >>> Creating group 'disk' with GID 6. >>> Creating group 'floppy' with GID 19. >>> Creating group 'ftp' with GID 50. >>> Creating group 'games' with GID 20. >>> Creating group 'input' with GID 104. >>> Creating group 'kmem' with GID 9. >>> Creating group 'kvm' with GID 36. >>> Creating group 'lock' with GID 54. >>> Creating group 'lp' with GID 7. >>> Creating group 'mail' with GID 12. >>> Creating group 'man' with GID 15. >>> Creating group 'mem' with GID 8. >>> Creating group 'nobody' with GID 65534. >>> Creating group 'render' with GID 105. >>> Creating group 'root' with GID 0. >>> Creating group 'sgx' with GID 106. >>> Creating group 'sys' with GID 3. >>> Creating group 'tape' with GID 33. >>> Creating group 'tty' with GID 5. >>> Creating group 'users' with GID 100. >>> Creating group 'utmp' with GID 22. >>> Creating group 'video' with GID 39. >>> Creating group 'wheel' with GID 10. >>> Creating user 'adm' (adm) with UID 3 and GID 4. >>> Creating group 'bin' with GID 1. >>> Creating user 'bin' (bin) with UID 1 and GID 1. >>> Creating group 'daemon' with GID 2. >>> Creating user 'daemon' (daemon) with UID 2 and GID 2. >>> Creating user 'ftp' (FTP User) with UID 14 and GID 50. >>> Creating user 'games' (games) with UID 12 and GID 100. >>> Creating user 'halt' (halt) with UID 7 and GID 0. >>> Creating user 'lp' (lp) with UID 4 and GID 7. >>> Creating user 'mail' (mail) with UID 8 and GID 12. >>> Creating user 'nobody' (Kernel Overflow User) with UID 65534 and GID 65534. >>> Creating user 'operator' (operator) with UID 11 and GID 0. >>> Creating user 'root' (Super User) with UID 0 and GID 0. >>> Creating user 'shutdown' (shutdown) with UID 6 and GID 0. >>> Creating user 'sync' (sync) with UID 5 and GID 0. >>> [ 11/172] Installing setup-0:2.15.0-26. 100% | 54.9 MiB/s | 730.6 KiB | 00m00s >>> [RPM] /etc/hosts created as /etc/hosts.rpmnew [ 12/172] Installing filesystem-0:3.18- 100% | 3.1 MiB/s | 212.8 KiB | 00m00s [ 13/172] Installing pcre2-syntax-0:10. 100% | 277.7 MiB/s | 284.3 KiB | 00m00s [ 14/172] Installing rust-srpm-macros-0 100% | 0.0 B/s | 5.6 KiB | 00m00s [ 15/172] Installing qt6-srpm-macros-0: 100% | 0.0 B/s | 740.0 B | 00m00s [ 16/172] Installing qt5-srpm-macros-0: 100% | 0.0 B/s | 776.0 B | 00m00s [ 17/172] Installing pkgconf-m4-0:2.3.0 100% | 0.0 B/s | 14.8 KiB | 00m00s [ 18/172] Installing gnulib-l10n-0:2024 100% | 215.5 MiB/s | 661.9 KiB | 00m00s [ 19/172] Installing coreutils-common-0 100% | 434.3 MiB/s | 11.3 MiB | 00m00s [ 20/172] Installing ncurses-base-0:6.5 100% | 115.1 MiB/s | 353.5 KiB | 00m00s [ 21/172] Installing glibc-minimal-lang 100% | 0.0 B/s | 124.0 B | 00m00s [ 22/172] Installing ncurses-libs-0:6.5 100% | 232.6 MiB/s | 952.8 KiB | 00m00s [ 23/172] Installing glibc-0:2.42-4.fc4 100% | 223.5 MiB/s | 6.7 MiB | 00m00s [ 24/172] Installing bash-0:5.3.0-2.fc4 100% | 301.1 MiB/s | 8.4 MiB | 00m00s [ 25/172] Installing glibc-common-0:2.4 100% | 68.0 MiB/s | 1.0 MiB | 00m00s [ 26/172] Installing glibc-gconv-extra- 100% | 281.1 MiB/s | 7.3 MiB | 00m00s [ 27/172] Installing zlib-ng-compat-0:2 100% | 135.2 MiB/s | 138.4 KiB | 00m00s [ 28/172] Installing bzip2-libs-0:1.0.8 100% | 0.0 B/s | 81.7 KiB | 00m00s [ 29/172] Installing libgpg-error-0:1.5 100% | 64.3 MiB/s | 921.1 KiB | 00m00s [ 30/172] Installing libstdc++-0:15.2.1 100% | 406.3 MiB/s | 2.8 MiB | 00m00s [ 31/172] Installing xz-libs-1:5.8.1-4. 100% | 213.8 MiB/s | 218.9 KiB | 00m00s [ 32/172] Installing libassuan-0:2.5.7- 100% | 161.7 MiB/s | 165.6 KiB | 00m00s [ 33/172] Installing libgcrypt-0:1.11.1 100% | 393.8 MiB/s | 1.6 MiB | 00m00s [ 34/172] Installing readline-0:8.3-2.f 100% | 250.9 MiB/s | 513.9 KiB | 00m00s [ 35/172] Installing gmp-1:6.3.0-4.fc43 100% | 397.2 MiB/s | 813.5 KiB | 00m00s [ 36/172] Installing libuuid-0:2.41.1-1 100% | 0.0 B/s | 38.5 KiB | 00m00s [ 37/172] Installing popt-0:1.19-9.fc43 100% | 68.1 MiB/s | 139.4 KiB | 00m00s [ 38/172] Installing npth-0:1.8-3.fc43. 100% | 0.0 B/s | 50.7 KiB | 00m00s [ 39/172] Installing libblkid-0:2.41.1- 100% | 257.2 MiB/s | 263.4 KiB | 00m00s [ 40/172] Installing libzstd-0:1.5.7-2. 100% | 391.2 MiB/s | 801.1 KiB | 00m00s [ 41/172] Installing elfutils-libelf-0: 100% | 373.7 MiB/s | 1.1 MiB | 00m00s [ 42/172] Installing sqlite-libs-0:3.50 100% | 379.1 MiB/s | 1.5 MiB | 00m00s [ 43/172] Installing libxcrypt-0:4.5.2- 100% | 281.3 MiB/s | 288.0 KiB | 00m00s [ 44/172] Installing gnupg2-gpgconf-0:2 100% | 11.7 MiB/s | 252.0 KiB | 00m00s [ 45/172] Installing crypto-policies-0: 100% | 42.0 MiB/s | 172.2 KiB | 00m00s [ 46/172] Installing libattr-0:2.5.2-6. 100% | 0.0 B/s | 25.4 KiB | 00m00s [ 47/172] Installing libacl-0:2.3.2-4.f 100% | 0.0 B/s | 36.8 KiB | 00m00s [ 48/172] Installing libtasn1-0:4.20.0- 100% | 173.9 MiB/s | 178.1 KiB | 00m00s [ 49/172] Installing libunistring-0:1.1 100% | 431.7 MiB/s | 1.7 MiB | 00m00s [ 50/172] Installing libidn2-0:2.3.8-2. 100% | 181.9 MiB/s | 558.7 KiB | 00m00s [ 51/172] Installing dwz-0:0.16-2.fc43. 100% | 23.5 MiB/s | 288.5 KiB | 00m00s [ 52/172] Installing gnupg2-verify-0:2. 100% | 28.5 MiB/s | 349.9 KiB | 00m00s [ 53/172] Installing mpfr-0:4.2.2-2.fc4 100% | 407.4 MiB/s | 834.4 KiB | 00m00s [ 54/172] Installing gawk-0:5.3.2-2.fc4 100% | 113.5 MiB/s | 1.8 MiB | 00m00s [ 55/172] Installing libksba-0:1.6.7-4. 100% | 391.7 MiB/s | 401.1 KiB | 00m00s [ 56/172] Installing unzip-0:6.0-67.fc4 100% | 31.7 MiB/s | 389.8 KiB | 00m00s [ 57/172] Installing file-libs-0:5.46-8 100% | 741.1 MiB/s | 11.9 MiB | 00m00s [ 58/172] Installing file-0:5.46-8.fc43 100% | 9.0 MiB/s | 101.7 KiB | 00m00s [ 59/172] Installing libeconf-0:0.7.9-2 100% | 0.0 B/s | 66.5 KiB | 00m00s [ 60/172] Installing libcap-ng-0:0.8.5- 100% | 69.2 MiB/s | 70.8 KiB | 00m00s [ 61/172] Installing audit-libs-0:4.1.2 100% | 372.6 MiB/s | 381.5 KiB | 00m00s [ 62/172] Installing pam-libs-0:1.7.1-3 100% | 126.0 MiB/s | 129.0 KiB | 00m00s [ 63/172] Installing libcap-0:2.76-3.fc 100% | 17.4 MiB/s | 214.3 KiB | 00m00s [ 64/172] Installing systemd-libs-0:258 100% | 389.4 MiB/s | 2.3 MiB | 00m00s [ 65/172] Installing libsmartcols-0:2.4 100% | 177.3 MiB/s | 181.6 KiB | 00m00s [ 66/172] Installing libsepol-0:3.9-2.f 100% | 401.8 MiB/s | 822.9 KiB | 00m00s [ 67/172] Installing lz4-libs-0:1.10.0- 100% | 158.6 MiB/s | 162.5 KiB | 00m00s [ 68/172] Installing json-c-0:0.18-7.fc 100% | 0.0 B/s | 84.0 KiB | 00m00s [ 69/172] Installing lua-libs-0:5.4.8-3 100% | 275.4 MiB/s | 282.0 KiB | 00m00s [ 70/172] Installing pcre2-0:10.47-1.fc 100% | 343.8 MiB/s | 704.1 KiB | 00m00s [ 71/172] Installing libselinux-0:3.9-5 100% | 189.8 MiB/s | 194.4 KiB | 00m00s [ 72/172] Installing grep-0:3.12-2.fc43 100% | 71.6 MiB/s | 1.0 MiB | 00m00s [ 73/172] Installing sed-0:4.9-5.fc43.x 100% | 60.4 MiB/s | 865.5 KiB | 00m00s [ 74/172] Installing findutils-1:4.10.0 100% | 116.1 MiB/s | 1.9 MiB | 00m00s [ 75/172] Installing xz-1:5.8.1-4.fc43. 100% | 83.2 MiB/s | 1.3 MiB | 00m00s [ 76/172] Installing libmount-0:2.41.1- 100% | 364.9 MiB/s | 373.7 KiB | 00m00s [ 77/172] Installing libffi-0:3.5.2-1.f 100% | 83.2 MiB/s | 85.2 KiB | 00m00s [ 78/172] Installing p11-kit-0:0.25.8-1 100% | 127.3 MiB/s | 2.3 MiB | 00m00s [ 79/172] Installing alternatives-0:1.3 100% | 5.7 MiB/s | 63.8 KiB | 00m00s [ 80/172] Installing p11-kit-trust-0:0. 100% | 20.8 MiB/s | 448.2 KiB | 00m00s [ 81/172] Installing openssl-libs-1:3.5 100% | 405.1 MiB/s | 8.9 MiB | 00m00s [ 82/172] Installing coreutils-0:9.7-6. 100% | 165.2 MiB/s | 5.5 MiB | 00m00s [ 83/172] Installing ca-certificates-0: 100% | 2.1 MiB/s | 2.5 MiB | 00m01s [ 84/172] Installing gzip-0:1.13-4.fc43 100% | 27.5 MiB/s | 394.4 KiB | 00m00s [ 85/172] Installing rpm-sequoia-0:1.9. 100% | 413.1 MiB/s | 2.5 MiB | 00m00s [ 86/172] Installing libfsverity-0:1.6- 100% | 0.0 B/s | 29.5 KiB | 00m00s [ 87/172] Installing libevent-0:2.1.12- 100% | 288.7 MiB/s | 886.8 KiB | 00m00s [ 88/172] Installing util-linux-core-0: 100% | 87.1 MiB/s | 1.5 MiB | 00m00s [ 89/172] Installing tar-2:1.35-6.fc43. 100% | 164.3 MiB/s | 3.0 MiB | 00m00s [ 90/172] Installing libsemanage-0:3.9- 100% | 303.0 MiB/s | 310.2 KiB | 00m00s [ 91/172] Installing systemd-standalone 100% | 23.9 MiB/s | 294.1 KiB | 00m00s [ 92/172] Installing rpm-libs-0:6.0.0-1 100% | 304.4 MiB/s | 935.2 KiB | 00m00s [ 93/172] Installing zstd-0:1.5.7-2.fc4 100% | 122.1 MiB/s | 1.7 MiB | 00m00s [ 94/172] Installing libusb1-0:1.0.29-4 100% | 13.0 MiB/s | 172.9 KiB | 00m00s >>> Running sysusers scriptlet: tpm2-tss-0:4.1.3-8.fc43.x86_64 >>> Finished sysusers scriptlet: tpm2-tss-0:4.1.3-8.fc43.x86_64 >>> Scriptlet output: >>> Creating group 'tss' with GID 59. >>> Creating user 'tss' (Account used for TPM access) with UID 59 and GID 59. >>> [ 95/172] Installing tpm2-tss-0:4.1.3-8 100% | 314.4 MiB/s | 1.6 MiB | 00m00s [ 96/172] Installing ima-evm-utils-libs 100% | 60.5 MiB/s | 62.0 KiB | 00m00s [ 97/172] Installing gnupg2-gpg-agent-0 100% | 31.4 MiB/s | 675.4 KiB | 00m00s [ 98/172] Installing zip-0:3.0-44.fc43. 100% | 52.5 MiB/s | 698.4 KiB | 00m00s [ 99/172] Installing gnupg2-keyboxd-0:2 100% | 28.3 MiB/s | 202.7 KiB | 00m00s [100/172] Installing libpsl-0:0.21.5-6. 100% | 75.7 MiB/s | 77.5 KiB | 00m00s [101/172] Installing liblastlog2-0:2.41 100% | 7.0 MiB/s | 35.9 KiB | 00m00s [102/172] Installing libfdisk-0:2.41.1- 100% | 372.5 MiB/s | 381.4 KiB | 00m00s [103/172] Installing nettle-0:3.10.1-2. 100% | 258.4 MiB/s | 793.7 KiB | 00m00s [104/172] Installing gnutls-0:3.8.11-5. 100% | 405.4 MiB/s | 3.6 MiB | 00m00s [105/172] Installing libxml2-0:2.12.10- 100% | 106.5 MiB/s | 1.7 MiB | 00m00s [106/172] Installing libarchive-0:3.8.1 100% | 310.2 MiB/s | 953.1 KiB | 00m00s [107/172] Installing bzip2-0:1.0.8-21.f 100% | 8.1 MiB/s | 99.8 KiB | 00m00s [108/172] Installing add-determinism-0: 100% | 143.7 MiB/s | 2.4 MiB | 00m00s [109/172] Installing build-reproducibil 100% | 0.0 B/s | 1.0 KiB | 00m00s [110/172] Installing filesystem-srpm-ma 100% | 0.0 B/s | 38.9 KiB | 00m00s [111/172] Installing ed-0:1.22.2-1.fc43 100% | 12.2 MiB/s | 150.4 KiB | 00m00s [112/172] Installing patch-0:2.8-2.fc43 100% | 18.3 MiB/s | 224.3 KiB | 00m00s [113/172] Installing elfutils-default-y 100% | 255.4 KiB/s | 2.0 KiB | 00m00s [114/172] Installing elfutils-libs-0:0. 100% | 224.4 MiB/s | 689.3 KiB | 00m00s [115/172] Installing cpio-0:2.15-6.fc43 100% | 73.3 MiB/s | 1.1 MiB | 00m00s [116/172] Installing diffutils-0:3.12-3 100% | 97.6 MiB/s | 1.6 MiB | 00m00s [117/172] Installing gdbm-libs-1:1.23-1 100% | 128.5 MiB/s | 131.6 KiB | 00m00s [118/172] Installing cyrus-sasl-lib-0:2 100% | 135.1 MiB/s | 2.3 MiB | 00m00s [119/172] Installing libgomp-0:15.2.1-4 100% | 265.1 MiB/s | 543.0 KiB | 00m00s [120/172] Installing jansson-0:2.14-3.f 100% | 88.3 MiB/s | 90.5 KiB | 00m00s [121/172] Installing libpkgconf-0:2.3.0 100% | 77.4 MiB/s | 79.2 KiB | 00m00s [122/172] Installing pkgconf-0:2.3.0-3. 100% | 8.1 MiB/s | 91.0 KiB | 00m00s [123/172] Installing pkgconf-pkg-config 100% | 161.2 KiB/s | 1.8 KiB | 00m00s [124/172] Installing libtool-ltdl-0:2.5 100% | 0.0 B/s | 71.2 KiB | 00m00s [125/172] Installing openldap-0:2.6.10- 100% | 324.1 MiB/s | 663.7 KiB | 00m00s [126/172] Installing gnupg2-dirmngr-0:2 100% | 28.9 MiB/s | 621.1 KiB | 00m00s [127/172] Installing gnupg2-0:2.4.8-4.f 100% | 242.6 MiB/s | 6.6 MiB | 00m00s [128/172] Installing rpm-sign-libs-0:6. 100% | 0.0 B/s | 40.6 KiB | 00m00s [129/172] Installing rpm-build-libs-0:6 100% | 262.9 MiB/s | 269.2 KiB | 00m00s [130/172] Installing gpgverify-0:2.2-3. 100% | 0.0 B/s | 9.4 KiB | 00m00s [131/172] Installing xxhash-libs-0:0.8. 100% | 89.4 MiB/s | 91.6 KiB | 00m00s [132/172] Installing libbrotli-0:1.1.0- 100% | 408.0 MiB/s | 835.6 KiB | 00m00s [133/172] Installing libnghttp2-0:1.66. 100% | 159.5 MiB/s | 163.3 KiB | 00m00s [134/172] Installing keyutils-libs-0:1. 100% | 54.4 MiB/s | 55.7 KiB | 00m00s [135/172] Installing libcom_err-0:1.47. 100% | 0.0 B/s | 64.2 KiB | 00m00s [136/172] Installing libverto-0:0.3.2-1 100% | 26.6 MiB/s | 27.2 KiB | 00m00s [137/172] Installing krb5-libs-0:1.21.3 100% | 327.4 MiB/s | 2.3 MiB | 00m00s [138/172] Installing libssh-0:0.11.3-1. 100% | 277.9 MiB/s | 569.2 KiB | 00m00s [139/172] Installing libcurl-0:8.15.0-3 100% | 294.4 MiB/s | 904.3 KiB | 00m00s [140/172] Installing elfutils-debuginfo 100% | 7.0 MiB/s | 86.3 KiB | 00m00s [141/172] Installing elfutils-0:0.194-1 100% | 162.8 MiB/s | 2.9 MiB | 00m00s [142/172] Installing binutils-0:2.45.1- 100% | 351.0 MiB/s | 27.4 MiB | 00m00s [143/172] Installing gdb-minimal-0:16.3 100% | 315.6 MiB/s | 13.3 MiB | 00m00s [144/172] Installing debugedit-0:5.2-3. 100% | 17.7 MiB/s | 217.3 KiB | 00m00s [145/172] Installing curl-0:8.15.0-3.fc 100% | 19.7 MiB/s | 464.0 KiB | 00m00s [146/172] Installing rpm-0:6.0.0-1.fc43 100% | 80.5 MiB/s | 2.6 MiB | 00m00s [147/172] Installing efi-srpm-macros-0: 100% | 40.2 MiB/s | 41.1 KiB | 00m00s [148/172] Installing java-srpm-macros-0 100% | 0.0 B/s | 1.1 KiB | 00m00s [149/172] Installing lua-srpm-macros-0: 100% | 0.0 B/s | 1.9 KiB | 00m00s [150/172] Installing tree-sitter-srpm-m 100% | 0.0 B/s | 9.3 KiB | 00m00s [151/172] Installing zig-srpm-macros-0: 100% | 0.0 B/s | 1.7 KiB | 00m00s [152/172] Installing perl-srpm-macros-0 100% | 0.0 B/s | 1.1 KiB | 00m00s [153/172] Installing package-notes-srpm 100% | 0.0 B/s | 2.0 KiB | 00m00s [154/172] Installing openblas-srpm-macr 100% | 0.0 B/s | 392.0 B | 00m00s [155/172] Installing ocaml-srpm-macros- 100% | 0.0 B/s | 2.1 KiB | 00m00s [156/172] Installing kernel-srpm-macros 100% | 0.0 B/s | 2.3 KiB | 00m00s [157/172] Installing gnat-srpm-macros-0 100% | 0.0 B/s | 1.3 KiB | 00m00s [158/172] Installing ghc-srpm-macros-0: 100% | 0.0 B/s | 1.0 KiB | 00m00s [159/172] Installing gap-srpm-macros-0: 100% | 0.0 B/s | 2.7 KiB | 00m00s [160/172] Installing fpc-srpm-macros-0: 100% | 0.0 B/s | 420.0 B | 00m00s [161/172] Installing ansible-srpm-macro 100% | 0.0 B/s | 36.2 KiB | 00m00s [162/172] Installing fonts-srpm-macros- 100% | 0.0 B/s | 57.0 KiB | 00m00s [163/172] Installing forge-srpm-macros- 100% | 0.0 B/s | 40.3 KiB | 00m00s [164/172] Installing go-srpm-macros-0:3 100% | 0.0 B/s | 63.0 KiB | 00m00s [165/172] Installing python-srpm-macros 100% | 0.0 B/s | 52.8 KiB | 00m00s [166/172] Installing redhat-rpm-config- 100% | 92.3 MiB/s | 189.1 KiB | 00m00s [167/172] Installing rpm-build-0:6.0.0- 100% | 20.7 MiB/s | 296.5 KiB | 00m00s [168/172] Installing pyproject-srpm-mac 100% | 2.4 MiB/s | 2.5 KiB | 00m00s [169/172] Installing util-linux-0:2.41. 100% | 102.1 MiB/s | 3.6 MiB | 00m00s [170/172] Installing shadow-utils-2:4.1 100% | 147.0 MiB/s | 4.0 MiB | 00m00s [171/172] Installing which-0:2.23-3.fc4 100% | 7.0 MiB/s | 85.7 KiB | 00m00s [172/172] Installing info-0:7.2-6.fc43. 100% | 228.3 KiB/s | 354.3 KiB | 00m02s Complete! Finish: installing minimal buildroot with dnf5 Start: creating root cache Finish: creating root cache Finish: chroot init INFO: Installed packages: INFO: add-determinism-0.6.0-2.fc43.x86_64 alternatives-1.33-3.fc43.x86_64 ansible-srpm-macros-1-18.1.fc43.noarch audit-libs-4.1.2-2.fc43.x86_64 bash-5.3.0-2.fc43.x86_64 binutils-2.45.1-1.fc43.x86_64 build-reproducibility-srpm-macros-0.6.0-2.fc43.noarch bzip2-1.0.8-21.fc43.x86_64 bzip2-libs-1.0.8-21.fc43.x86_64 ca-certificates-2025.2.80_v9.0.304-1.1.fc43.noarch coreutils-9.7-6.fc43.x86_64 coreutils-common-9.7-6.fc43.x86_64 cpio-2.15-6.fc43.x86_64 crypto-policies-20251125-1.git63291f8.fc43.noarch curl-8.15.0-3.fc43.x86_64 cyrus-sasl-lib-2.1.28-33.fc43.x86_64 debugedit-5.2-3.fc43.x86_64 diffutils-3.12-3.fc43.x86_64 dwz-0.16-2.fc43.x86_64 ed-1.22.2-1.fc43.x86_64 efi-srpm-macros-6-4.fc43.noarch elfutils-0.194-1.fc43.x86_64 elfutils-debuginfod-client-0.194-1.fc43.x86_64 elfutils-default-yama-scope-0.194-1.fc43.noarch elfutils-libelf-0.194-1.fc43.x86_64 elfutils-libs-0.194-1.fc43.x86_64 fedora-gpg-keys-43-1.noarch fedora-release-43-25.noarch fedora-release-common-43-25.noarch fedora-release-identity-basic-43-25.noarch fedora-repos-43-1.noarch file-5.46-8.fc43.x86_64 file-libs-5.46-8.fc43.x86_64 filesystem-3.18-50.fc43.x86_64 filesystem-srpm-macros-3.18-50.fc43.noarch findutils-4.10.0-6.fc43.x86_64 fonts-srpm-macros-2.0.5-23.fc43.noarch forge-srpm-macros-0.4.0-3.fc43.noarch fpc-srpm-macros-1.3-15.fc43.noarch gap-srpm-macros-2-1.fc43.noarch gawk-5.3.2-2.fc43.x86_64 gdb-minimal-16.3-6.fc43.x86_64 gdbm-libs-1.23-10.fc43.x86_64 ghc-srpm-macros-1.9.2-3.fc43.noarch glibc-2.42-4.fc43.x86_64 glibc-common-2.42-4.fc43.x86_64 glibc-gconv-extra-2.42-4.fc43.x86_64 glibc-minimal-langpack-2.42-4.fc43.x86_64 gmp-6.3.0-4.fc43.x86_64 gnat-srpm-macros-6-8.fc43.noarch gnulib-l10n-20241231-1.fc43.noarch gnupg2-2.4.8-4.fc43.x86_64 gnupg2-dirmngr-2.4.8-4.fc43.x86_64 gnupg2-gpg-agent-2.4.8-4.fc43.x86_64 gnupg2-gpgconf-2.4.8-4.fc43.x86_64 gnupg2-keyboxd-2.4.8-4.fc43.x86_64 gnupg2-verify-2.4.8-4.fc43.x86_64 gnutls-3.8.11-5.fc43.x86_64 go-srpm-macros-3.8.0-1.fc43.noarch gpg-pubkey-31645531-66b6dccf gpgverify-2.2-3.fc43.noarch grep-3.12-2.fc43.x86_64 gzip-1.13-4.fc43.x86_64 ima-evm-utils-libs-1.6.2-6.fc43.x86_64 info-7.2-6.fc43.x86_64 jansson-2.14-3.fc43.x86_64 java-srpm-macros-1-7.fc43.noarch json-c-0.18-7.fc43.x86_64 kernel-srpm-macros-1.0-27.fc43.noarch keyutils-libs-1.6.3-6.fc43.x86_64 krb5-libs-1.21.3-7.fc43.x86_64 libacl-2.3.2-4.fc43.x86_64 libarchive-3.8.1-3.fc43.x86_64 libassuan-2.5.7-4.fc43.x86_64 libattr-2.5.2-6.fc43.x86_64 libblkid-2.41.1-17.fc43.x86_64 libbrotli-1.1.0-10.fc43.x86_64 libcap-2.76-3.fc43.x86_64 libcap-ng-0.8.5-8.fc43.x86_64 libcom_err-1.47.3-2.fc43.x86_64 libcurl-8.15.0-3.fc43.x86_64 libeconf-0.7.9-2.fc43.x86_64 libevent-2.1.12-16.fc43.x86_64 libfdisk-2.41.1-17.fc43.x86_64 libffi-3.5.2-1.fc43.x86_64 libfsverity-1.6-3.fc43.x86_64 libgcc-15.2.1-4.fc43.x86_64 libgcrypt-1.11.1-2.fc43.x86_64 libgomp-15.2.1-4.fc43.x86_64 libgpg-error-1.55-2.fc43.x86_64 libidn2-2.3.8-2.fc43.x86_64 libksba-1.6.7-4.fc43.x86_64 liblastlog2-2.41.1-17.fc43.x86_64 libmount-2.41.1-17.fc43.x86_64 libnghttp2-1.66.0-2.fc43.x86_64 libpkgconf-2.3.0-3.fc43.x86_64 libpsl-0.21.5-6.fc43.x86_64 libselinux-3.9-5.fc43.x86_64 libsemanage-3.9-4.fc43.x86_64 libsepol-3.9-2.fc43.x86_64 libsmartcols-2.41.1-17.fc43.x86_64 libssh-0.11.3-1.fc43.x86_64 libssh-config-0.11.3-1.fc43.noarch libstdc++-15.2.1-4.fc43.x86_64 libtasn1-4.20.0-2.fc43.x86_64 libtool-ltdl-2.5.4-8.fc43.x86_64 libunistring-1.1-10.fc43.x86_64 libusb1-1.0.29-4.fc43.x86_64 libuuid-2.41.1-17.fc43.x86_64 libverto-0.3.2-11.fc43.x86_64 libxcrypt-4.5.2-1.fc43.x86_64 libxml2-2.12.10-5.fc43.x86_64 libzstd-1.5.7-2.fc43.x86_64 lua-libs-5.4.8-3.fc43.x86_64 lua-srpm-macros-1-16.fc43.noarch lz4-libs-1.10.0-3.fc43.x86_64 mpfr-4.2.2-2.fc43.x86_64 ncurses-base-6.5-7.20250614.fc43.noarch ncurses-libs-6.5-7.20250614.fc43.x86_64 nettle-3.10.1-2.fc43.x86_64 npth-1.8-3.fc43.x86_64 ocaml-srpm-macros-11-2.fc43.noarch openblas-srpm-macros-2-20.fc43.noarch openldap-2.6.10-4.fc43.x86_64 openssl-libs-3.5.4-1.fc43.x86_64 p11-kit-0.25.8-1.fc43.x86_64 p11-kit-trust-0.25.8-1.fc43.x86_64 package-notes-srpm-macros-0.5-14.fc43.noarch pam-libs-1.7.1-3.fc43.x86_64 patch-2.8-2.fc43.x86_64 pcre2-10.47-1.fc43.x86_64 pcre2-syntax-10.47-1.fc43.noarch perl-srpm-macros-1-60.fc43.noarch pkgconf-2.3.0-3.fc43.x86_64 pkgconf-m4-2.3.0-3.fc43.noarch pkgconf-pkg-config-2.3.0-3.fc43.x86_64 popt-1.19-9.fc43.x86_64 publicsuffix-list-dafsa-20250616-2.fc43.noarch pyproject-srpm-macros-1.18.6-1.fc43.noarch python-srpm-macros-3.14-5.fc43.noarch qt5-srpm-macros-5.15.18-1.fc43.noarch qt6-srpm-macros-6.10.1-1.fc43.noarch readline-8.3-2.fc43.x86_64 redhat-rpm-config-343-11.fc43.noarch rpm-6.0.0-1.fc43.x86_64 rpm-build-6.0.0-1.fc43.x86_64 rpm-build-libs-6.0.0-1.fc43.x86_64 rpm-libs-6.0.0-1.fc43.x86_64 rpm-sequoia-1.9.0-2.fc43.x86_64 rpm-sign-libs-6.0.0-1.fc43.x86_64 rust-srpm-macros-28.0-1.fc43.noarch sed-4.9-5.fc43.x86_64 setup-2.15.0-26.fc43.noarch shadow-utils-4.18.0-3.fc43.x86_64 sqlite-libs-3.50.2-2.fc43.x86_64 systemd-libs-258.2-1.fc43.x86_64 systemd-standalone-sysusers-258.2-1.fc43.x86_64 tar-1.35-6.fc43.x86_64 tpm2-tss-4.1.3-8.fc43.x86_64 tree-sitter-srpm-macros-0.4.2-1.fc43.noarch unzip-6.0-67.fc43.x86_64 util-linux-2.41.1-17.fc43.x86_64 util-linux-core-2.41.1-17.fc43.x86_64 which-2.23-3.fc43.x86_64 xxhash-libs-0.8.3-3.fc43.x86_64 xz-5.8.1-4.fc43.x86_64 xz-libs-5.8.1-4.fc43.x86_64 zig-srpm-macros-1-5.fc43.noarch zip-3.0-44.fc43.x86_64 zlib-ng-compat-2.2.5-2.fc43.x86_64 zstd-1.5.7-2.fc43.x86_64 Start: buildsrpm Start: rpmbuild -bs Building target platforms: x86_64 Building for target x86_64 warning: %source_date_epoch_from_changelog is set, but %changelog has no entries to take a date from Wrote: /builddir/build/SRPMS/R-CRAN-TBRDist-1.0.3-1.fc43.copr9878869.src.rpm RPM build warnings: %source_date_epoch_from_changelog is set, but %changelog has no entries to take a date from Finish: rpmbuild -bs INFO: chroot_scan: 1 files copied to /var/lib/copr-rpmbuild/results/chroot_scan INFO: /var/lib/mock/fedora-43-x86_64-1764990259.129745/root/var/log/dnf5.log INFO: chroot_scan: creating tarball /var/lib/copr-rpmbuild/results/chroot_scan.tar.gz /bin/tar: Removing leading `/' from member names Finish: buildsrpm INFO: Done(/var/lib/copr-rpmbuild/workspace/workdir-7pfjjy_h/R-CRAN-TBRDist/R-CRAN-TBRDist.spec) Config(child) 0 minutes 11 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-TBRDist-1.0.3-1.fc43.copr9878869.src.rpm) Config(fedora-43-x86_64) Start: chroot init INFO: mounting tmpfs at /var/lib/mock/fedora-43-x86_64-1764990259.129745/root. INFO: calling preinit hooks INFO: enabled root cache Start: unpacking root cache Finish: unpacking root cache INFO: enabled package manager cache Start: cleaning package manager metadata Finish: cleaning package manager metadata INFO: enabled HW Info plugin INFO: Buildroot is handled by package management from host and used with --installroot: rpm-4.20.1-1.fc42.x86_64 rpm-sequoia-1.7.0-5.fc42.x86_64 python3-dnf-4.24.0-1.fc42.noarch python3-dnf-plugins-core-4.10.1-1.fc42.noarch dnf5-5.2.17.0-1.fc42.x86_64 dnf5-plugins-5.2.17.0-1.fc42.x86_64 Finish: chroot init Start: build phase for R-CRAN-TBRDist-1.0.3-1.fc43.copr9878869.src.rpm Start: build setup for R-CRAN-TBRDist-1.0.3-1.fc43.copr9878869.src.rpm Building target platforms: x86_64 Building for target x86_64 warning: %source_date_epoch_from_changelog is set, but %changelog has no entries to take a date from Wrote: /builddir/build/SRPMS/R-CRAN-TBRDist-1.0.3-1.fc43.copr9878869.src.rpm RPM build warnings: %source_date_epoch_from_changelog is set, but %changelog has no entries to take a date from Updating and loading repositories: Copr repository 100% | 619.0 B/s | 1.5 KiB | 00m03s fedora 100% | 11.5 KiB/s | 32.5 KiB | 00m03s updates 100% | 4.0 KiB/s | 10.7 KiB | 00m03s Repositories loaded. Package Arch Version Repository Size Installing: R-CRAN-BH noarch 1.87.0.1-1.fc43.copr9464372 copr_base 122.2 MiB R-CRAN-Rcpp x86_64 1.1.0-1.fc43.copr9464359 copr_base 4.3 MiB R-CRAN-Rdpack noarch 2.6.4-1.fc43.copr9468160 copr_base 1.0 MiB R-CRAN-TreeDist x86_64 2.11.1-1.fc43.copr9686455 copr_base 2.3 MiB R-CRAN-TreeTools x86_64 2.0.0-1.fc43.copr9595801 copr_base 2.7 MiB R-CRAN-ape x86_64 5.8.1-1.fc43.copr9470522 copr_base 4.1 MiB R-devel x86_64 4.5.2-1.fc43 updates 0.0 B Installing dependencies: R-CRAN-PlotTools noarch 0.3.1-1.fc43.copr9467460 copr_base 52.7 KiB R-CRAN-R6 noarch 2.6.1-1.fc43.copr9464379 copr_base 123.5 KiB R-CRAN-RCurl x86_64 1.98.1.17-1.fc43.copr9468159 copr_base 2.1 MiB R-CRAN-base64enc x86_64 0.1.3-1.fc43.copr9464392 copr_base 52.2 KiB R-CRAN-bit x86_64 4.6.0-1.fc43.copr9464411 copr_base 1.2 MiB R-CRAN-bit64 x86_64 4.6.0.1-1.fc43.copr9468148 copr_base 908.0 KiB R-CRAN-bitops x86_64 1.0.9-1.fc43.copr9464412 copr_base 57.9 KiB R-CRAN-bslib noarch 0.9.0-1.fc43.copr9473421 copr_base 10.9 MiB R-CRAN-cachem x86_64 1.1.0-1.fc43.copr9469598 copr_base 102.7 KiB R-CRAN-cli x86_64 3.6.5-1.fc43.copr9464403 copr_base 2.4 MiB R-CRAN-colorspace x86_64 2.1.2-1.fc43.copr9591776 copr_base 4.1 MiB R-CRAN-commonmark x86_64 2.0.0-1.fc43.copr9464416 copr_base 317.5 KiB R-CRAN-digest x86_64 0.6.39-1.fc43.copr9815423 copr_base 498.7 KiB R-CRAN-fastmap x86_64 1.2.0-1.fc43.copr9465202 copr_base 106.1 KiB R-CRAN-fastmatch x86_64 1.1.6-1.fc43.copr9464539 copr_base 70.2 KiB R-CRAN-fontawesome noarch 0.5.3-1.fc43.copr9471671 copr_base 2.0 MiB R-CRAN-fs x86_64 1.6.6-1.fc43.copr9464442 copr_base 598.8 KiB R-CRAN-glue x86_64 1.8.0-1.fc43.copr9464360 copr_base 345.4 KiB R-CRAN-htmltools x86_64 0.5.9-1.fc43.copr9878781 copr_base 524.5 KiB R-CRAN-httpuv x86_64 1.6.16-1.fc43.copr9472400 copr_base 1.1 MiB R-CRAN-jquerylib noarch 0.1.4-1.fc43.copr9471471 copr_base 1.5 MiB R-CRAN-jsonlite x86_64 2.0.0-1.fc43.copr9464375 copr_base 2.3 MiB R-CRAN-later x86_64 1.4.4-1.fc43.copr9498225 copr_base 309.9 KiB R-CRAN-lattice x86_64 0.22.7-1.fc43.copr9466803 copr_base 2.0 MiB R-CRAN-lifecycle noarch 1.0.4-1.fc43.copr9468727 copr_base 284.4 KiB R-CRAN-magrittr x86_64 2.0.4-1.fc43.copr9552584 copr_base 405.4 KiB R-CRAN-memoise noarch 2.0.1-1.fc43.copr9470491 copr_base 85.3 KiB R-CRAN-mime x86_64 0.13-1.fc43.copr9464382 copr_base 62.1 KiB R-CRAN-nlme x86_64 3.1.168-1.fc43.copr9469546 copr_base 3.8 MiB R-CRAN-otel noarch 0.2.0-1.fc43.copr9507032 copr_base 526.9 KiB R-CRAN-promises noarch 1.5.0-1.fc43.copr9756888 copr_base 2.6 MiB R-CRAN-rappdirs x86_64 0.3.3-1.fc43.copr9464491 copr_base 83.5 KiB R-CRAN-rbibutils x86_64 2.4-1.fc43.copr9777838 copr_base 2.6 MiB R-CRAN-rlang x86_64 1.1.6-1.fc43.copr9464365 copr_base 2.6 MiB R-CRAN-sass x86_64 0.4.10-1.fc43.copr9471293 copr_base 4.3 MiB R-CRAN-shiny noarch 1.12.0-1.fc43.copr9872897 copr_base 10.0 MiB R-CRAN-shinyjs noarch 2.1.0-1.fc43.copr9475880 copr_base 1.5 MiB R-CRAN-sourcetools x86_64 0.1.7.1-1.fc43.copr9464390 copr_base 129.8 KiB R-CRAN-stringi x86_64 1.8.7-1.fc43.copr9464391 copr_base 2.0 MiB R-CRAN-withr noarch 3.0.2-1.fc43.copr9464370 copr_base 397.2 KiB R-CRAN-xtable noarch 1.8.4-3.fc43.copr9464374 copr_base 898.4 KiB R-core x86_64 4.5.2-1.fc43 updates 104.0 MiB R-core-devel x86_64 4.5.2-1.fc43 updates 410.9 KiB R-java x86_64 4.5.2-1.fc43 updates 0.0 B R-java-devel x86_64 4.5.2-1.fc43 updates 0.0 B R-littler x86_64 0.3.19-9.fc43 fedora 162.0 KiB R-rpm-macros noarch 1.3.0-1.fc43 updates 8.4 KiB R-srpm-macros noarch 1.3.0-1.fc43 updates 3.2 KiB abattis-cantarell-vf-fonts noarch 0.301-15.fc43 fedora 192.7 KiB alsa-lib x86_64 1.2.14-4.fc43 fedora 1.4 MiB annobin-docs noarch 12.99-1.fc43 fedora 98.9 KiB annobin-plugin-gcc x86_64 12.99-1.fc43 fedora 1.0 MiB avahi-libs x86_64 0.9~rc2-6.fc43 fedora 171.6 KiB bzip2-devel x86_64 1.0.8-21.fc43 fedora 309.8 KiB cairo x86_64 1.18.4-2.fc43 fedora 1.8 MiB cmake-filesystem x86_64 3.31.6-4.fc43 fedora 0.0 B cpp x86_64 15.2.1-4.fc43 updates 37.9 MiB cups-filesystem noarch 1:2.4.14-3.fc43 updates 0.0 B cups-libs x86_64 1:2.4.14-3.fc43 updates 618.7 KiB dbus-libs x86_64 1:1.16.0-4.fc43 fedora 345.5 KiB default-fonts-core-sans noarch 4.2-5.fc43 fedora 11.9 KiB desktop-file-utils x86_64 0.28-2.fc43 fedora 218.4 KiB emacs-filesystem noarch 1:30.0-5.fc43 fedora 0.0 B flexiblas x86_64 3.5.0-1.fc43 updates 38.0 KiB flexiblas-devel x86_64 3.5.0-1.fc43 updates 11.7 MiB flexiblas-netlib x86_64 3.5.0-1.fc43 updates 16.5 MiB flexiblas-netlib64 x86_64 3.5.0-1.fc43 updates 16.7 MiB flexiblas-openblas-openmp x86_64 3.5.0-1.fc43 updates 39.2 KiB flexiblas-openblas-openmp64 x86_64 3.5.0-1.fc43 updates 39.2 KiB fontconfig x86_64 2.17.0-3.fc43 fedora 765.9 KiB fonts-filesystem noarch 1:2.0.5-23.fc43 fedora 0.0 B freetype x86_64 2.13.3-3.fc43 fedora 850.2 KiB fribidi x86_64 1.0.16-3.fc43 fedora 190.3 KiB gcc x86_64 15.2.1-4.fc43 updates 111.9 MiB gcc-c++ x86_64 15.2.1-4.fc43 updates 41.3 MiB gcc-gfortran x86_64 15.2.1-4.fc43 updates 40.3 MiB gcc-plugin-annobin x86_64 15.2.1-4.fc43 updates 57.2 KiB glib2 x86_64 2.86.2-1.fc43 updates 14.8 MiB glibc-devel x86_64 2.42-4.fc43 fedora 2.3 MiB google-noto-fonts-common noarch 20251101-2.fc43 updates 17.7 KiB google-noto-sans-vf-fonts noarch 20251101-2.fc43 updates 1.4 MiB graphite2 x86_64 1.3.14-19.fc43 fedora 191.8 KiB harfbuzz x86_64 11.5.1-1.fc43 fedora 2.8 MiB java-25-openjdk x86_64 1:25.0.1.0.8-1.fc43 updates 962.5 KiB java-25-openjdk-devel x86_64 1:25.0.1.0.8-1.fc43 updates 11.7 MiB java-25-openjdk-headless x86_64 1:25.0.1.0.8-1.fc43 updates 236.3 MiB javapackages-filesystem noarch 6.4.1-4.fc43 fedora 2.0 KiB jbigkit-libs x86_64 2.1-32.fc43 fedora 113.5 KiB kernel-headers x86_64 6.17.4-300.fc43 updates 6.7 MiB less x86_64 679-2.fc43 fedora 406.1 KiB libICE x86_64 1.1.2-3.fc43 fedora 194.4 KiB libRmath x86_64 4.5.2-1.fc43 updates 242.7 KiB libRmath-devel x86_64 4.5.2-1.fc43 updates 19.9 KiB libSM x86_64 1.2.5-3.fc43 fedora 101.0 KiB libX11 x86_64 1.8.12-1.fc43 fedora 1.3 MiB libX11-common noarch 1.8.12-1.fc43 fedora 1.2 MiB libX11-devel x86_64 1.8.12-1.fc43 fedora 1.0 MiB libX11-xcb x86_64 1.8.12-1.fc43 fedora 10.9 KiB libXau x86_64 1.0.12-3.fc43 fedora 72.9 KiB libXau-devel x86_64 1.0.12-3.fc43 fedora 7.5 KiB libXcomposite x86_64 0.4.6-6.fc43 fedora 40.5 KiB libXext x86_64 1.3.6-4.fc43 fedora 90.0 KiB libXft x86_64 2.3.8-9.fc43 fedora 164.4 KiB libXi x86_64 1.8.2-3.fc43 fedora 80.6 KiB libXmu x86_64 1.2.1-4.fc43 fedora 191.3 KiB libXrender x86_64 0.9.12-3.fc43 fedora 46.0 KiB libXt x86_64 1.3.1-3.fc43 fedora 429.8 KiB libXtst x86_64 1.2.5-3.fc43 fedora 33.5 KiB libdatrie x86_64 0.2.13-12.fc43 fedora 53.8 KiB libdeflate x86_64 1.25-2.fc43 updates 123.1 KiB libdeflate-devel x86_64 1.25-2.fc43 updates 26.0 KiB libfontenc x86_64 1.1.8-4.fc43 fedora 66.9 KiB libgfortran x86_64 15.2.1-4.fc43 updates 3.4 MiB libicu x86_64 77.1-1.fc43 fedora 36.4 MiB libicu-devel x86_64 77.1-1.fc43 fedora 5.0 MiB libjpeg-turbo x86_64 3.1.2-1.fc43 fedora 804.9 KiB liblerc x86_64 4.0.0-9.fc43 fedora 624.1 KiB libmpc x86_64 1.3.1-8.fc43 fedora 160.6 KiB libpng x86_64 2:1.6.51-1.fc43 updates 241.7 KiB libquadmath x86_64 15.2.1-4.fc43 updates 317.9 KiB libquadmath-devel x86_64 15.2.1-4.fc43 updates 22.2 KiB libstdc++-devel x86_64 15.2.1-4.fc43 updates 37.3 MiB libthai x86_64 0.1.29-11.fc43 fedora 783.4 KiB libtiff x86_64 4.7.1-1.fc43 updates 624.4 KiB libtirpc x86_64 1.3.7-1.fc43 updates 200.4 KiB libtirpc-devel x86_64 1.3.7-1.fc43 updates 251.6 KiB libtommath x86_64 1.3.1~rc1-6.fc43 fedora 126.4 KiB libwebp x86_64 1.6.0-2.fc43 fedora 956.6 KiB libxcb x86_64 1.17.0-6.fc43 fedora 1.1 MiB libxcb-devel x86_64 1.17.0-6.fc43 fedora 2.7 MiB libxcrypt-devel x86_64 4.5.2-1.fc43 updates 31.1 KiB libyaml x86_64 0.2.5-17.fc43 fedora 134.6 KiB libzstd-devel x86_64 1.5.7-2.fc43 fedora 208.0 KiB lksctp-tools x86_64 1.0.21-1.fc43 fedora 251.0 KiB lzo x86_64 2.10-15.fc43 fedora 178.9 KiB make x86_64 1:4.4.1-11.fc43 fedora 1.8 MiB mkfontscale x86_64 1.2.3-3.fc43 fedora 45.0 KiB nspr x86_64 4.37.0-7.fc43 updates 315.5 KiB nss x86_64 3.118.1-2.fc43 updates 1.9 MiB nss-softokn x86_64 3.118.1-2.fc43 updates 2.0 MiB nss-softokn-freebl x86_64 3.118.1-2.fc43 updates 990.8 KiB nss-sysinit x86_64 3.118.1-2.fc43 updates 18.1 KiB nss-util x86_64 3.118.1-2.fc43 updates 204.8 KiB openblas x86_64 0.3.29-2.fc43 fedora 111.7 KiB openblas-openmp x86_64 0.3.29-2.fc43 fedora 43.7 MiB openblas-openmp64 x86_64 0.3.29-2.fc43 fedora 43.8 MiB pandoc-cli x86_64 3.6.4-38.fc43 updates 203.5 MiB pandoc-common noarch 3.6.4-36.fc43 fedora 2.0 MiB pango x86_64 1.57.0-1.fc43 fedora 1.0 MiB pcre2-devel x86_64 10.47-1.fc43 updates 2.1 MiB pcre2-utf16 x86_64 10.47-1.fc43 updates 639.2 KiB pcre2-utf32 x86_64 10.47-1.fc43 updates 611.1 KiB pixman x86_64 0.46.2-2.fc43 fedora 710.3 KiB tcl x86_64 1:9.0.2-1.fc43 fedora 4.3 MiB tk x86_64 1:9.0.2-1.fc43 fedora 3.8 MiB tre x86_64 0.9.0-2.fc43 fedora 75.8 KiB tre-common noarch 0.9.0-2.fc43 fedora 75.8 KiB tre-devel x86_64 0.9.0-2.fc43 fedora 13.2 KiB ttmkfdir x86_64 3.0.9-73.fc43 fedora 122.5 KiB tzdata noarch 2025b-3.fc43 fedora 1.6 MiB tzdata-java noarch 2025b-3.fc43 fedora 100.1 KiB xdg-utils noarch 1.2.1-4.fc43 fedora 346.3 KiB xml-common noarch 0.6.3-67.fc43 fedora 78.4 KiB xorg-x11-fonts-Type1 noarch 7.5-41.fc43 fedora 863.3 KiB xorg-x11-proto-devel noarch 2024.1-5.fc43 fedora 1.7 MiB xz-devel x86_64 1:5.8.1-4.fc43 updates 258.8 KiB zlib-ng-compat-devel x86_64 2.2.5-2.fc43 fedora 107.0 KiB Transaction Summary: Installing: 174 packages Total size of inbound packages is 360 MiB. Need to download 62 MiB. After this operation, 1 GiB extra will be used (install 1 GiB, remove 0 B). [ 1/174] R-CRAN-Rcpp-0:1.1.0-1.fc43.co 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 2/174] R-devel-0:4.5.2-1.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 3/174] R-littler-0:0.3.19-9.fc43.x86 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 4/174] R-CRAN-cli-0:3.6.5-1.fc43.cop 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 5/174] R-CRAN-digest-0:0.6.39-1.fc43 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 6/174] R-CRAN-lattice-0:0.22.7-1.fc4 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 7/174] R-core-devel-0:4.5.2-1.fc43.x 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 8/174] R-java-devel-0:4.5.2-1.fc43.x 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 9/174] R-CRAN-jsonlite-0:2.0.0-1.fc4 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 10/174] R-CRAN-bit-0:4.6.0-1.fc43.cop 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 11/174] libicu-0:77.1-1.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 12/174] make-1:4.4.1-11.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 13/174] R-core-0:4.5.2-1.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 14/174] libRmath-devel-0:4.5.2-1.fc43 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 15/174] R-java-0:4.5.2-1.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 16/174] cairo-0:1.18.4-2.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 17/174] less-0:679-2.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 18/174] libX11-0:1.8.12-1.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 19/174] libXmu-0:1.2.1-4.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 20/174] libXt-0:1.3.1-3.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 21/174] libjpeg-turbo-0:3.1.2-1.fc43. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 22/174] pango-0:1.57.0-1.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 23/174] tcl-1:9.0.2-1.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 24/174] tk-1:9.0.2-1.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 25/174] tre-0:0.9.0-2.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 26/174] tzdata-0:2025b-3.fc43.noarch 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 27/174] xdg-utils-0:1.2.1-4.fc43.noar 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 28/174] libRmath-0:4.5.2-1.fc43.x86_6 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 29/174] fontconfig-0:2.17.0-3.fc43.x8 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 30/174] freetype-0:2.13.3-3.fc43.x86_ 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 31/174] libXext-0:1.3.6-4.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 32/174] libXrender-0:0.9.12-3.fc43.x8 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 33/174] libxcb-0:1.17.0-6.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 34/174] lzo-0:2.10-15.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 35/174] pixman-0:0.46.2-2.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 36/174] libX11-common-0:1.8.12-1.fc43 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 37/174] libICE-0:1.1.2-3.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 38/174] libSM-0:1.2.5-3.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 39/174] fribidi-0:1.0.16-3.fc43.x86_6 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 40/174] harfbuzz-0:11.5.1-1.fc43.x86_ 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 41/174] libXft-0:2.3.8-9.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 42/174] libthai-0:0.1.29-11.fc43.x86_ 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 43/174] libtommath-0:1.3.1~rc1-6.fc43 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 44/174] tre-common-0:0.9.0-2.fc43.noa 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 45/174] desktop-file-utils-0:0.28-2.f 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 46/174] default-fonts-core-sans-0:4.2 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 47/174] fonts-filesystem-1:2.0.5-23.f 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 48/174] xml-common-0:0.6.3-67.fc43.no 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 49/174] libXau-0:1.0.12-3.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 50/174] graphite2-0:1.3.14-19.fc43.x8 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 51/174] libdatrie-0:0.2.13-12.fc43.x8 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 52/174] emacs-filesystem-1:30.0-5.fc4 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 53/174] abattis-cantarell-vf-fonts-0: 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 54/174] R-rpm-macros-0:1.3.0-1.fc43.n 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 55/174] R-srpm-macros-0:1.3.0-1.fc43. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 56/174] bzip2-devel-0:1.0.8-21.fc43.x 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 57/174] flexiblas-devel-0:3.5.0-1.fc4 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 58/174] flexiblas-0:3.5.0-1.fc43.x86_ 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 59/174] flexiblas-netlib-0:3.5.0-1.fc 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 60/174] flexiblas-netlib64-0:3.5.0-1. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 61/174] flexiblas-openblas-openmp-0:3 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 62/174] flexiblas-openblas-openmp64-0 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 63/174] openblas-openmp-0:0.3.29-2.fc 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 64/174] openblas-openmp64-0:0.3.29-2. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 65/174] gcc-c++-0:15.2.1-4.fc43.x86_6 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 66/174] libmpc-0:1.3.1-8.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 67/174] gcc-0:15.2.1-4.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 68/174] cpp-0:15.2.1-4.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 69/174] gcc-gfortran-0:15.2.1-4.fc43. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 70/174] libX11-devel-0:1.8.12-1.fc43. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 71/174] libX11-xcb-0:1.8.12-1.fc43.x8 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 72/174] xorg-x11-proto-devel-0:2024.1 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 73/174] libdeflate-devel-0:1.25-2.fc4 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 74/174] cmake-filesystem-0:3.31.6-4.f 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 75/174] libdeflate-0:1.25-2.fc43.x86_ 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 76/174] libicu-devel-0:77.1-1.fc43.x8 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 77/174] libtirpc-devel-0:1.3.7-1.fc43 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 78/174] libtirpc-0:1.3.7-1.fc43.x86_6 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 79/174] libzstd-devel-0:1.5.7-2.fc43. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 80/174] pcre2-devel-0:10.47-1.fc43.x8 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 81/174] pcre2-utf16-0:10.47-1.fc43.x8 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 82/174] pcre2-utf32-0:10.47-1.fc43.x8 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 83/174] tre-devel-0:0.9.0-2.fc43.x86_ 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 84/174] xz-devel-1:5.8.1-4.fc43.x86_6 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 85/174] zlib-ng-compat-devel-0:2.2.5- 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 86/174] glib2-0:2.86.2-1.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 87/174] libpng-2:1.6.51-1.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 88/174] libtiff-0:4.7.1-1.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 89/174] jbigkit-libs-0:2.1-32.fc43.x8 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 90/174] liblerc-0:4.0.0-9.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 91/174] libwebp-0:1.6.0-2.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 92/174] libgfortran-0:15.2.1-4.fc43.x 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 93/174] openblas-0:0.3.29-2.fc43.x86_ 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 94/174] libxcb-devel-0:1.17.0-6.fc43. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 95/174] google-noto-sans-vf-fonts-0:2 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 96/174] google-noto-fonts-common-0:20 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 97/174] R-CRAN-R6-0:2.6.1-1.fc43.copr 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 98/174] R-CRAN-bslib-0:0.9.0-1.fc43.c 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [ 99/174] R-CRAN-cachem-0:1.1.0-1.fc43. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [100/174] R-CRAN-fastmap-0:1.2.0-1.fc43 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [101/174] R-CRAN-fontawesome-0:0.5.3-1. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [102/174] R-CRAN-glue-0:1.8.0-1.fc43.co 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [103/174] R-CRAN-lifecycle-0:1.0.4-1.fc 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [104/174] R-CRAN-mime-0:0.13-1.fc43.cop 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [105/174] R-CRAN-rlang-0:1.1.6-1.fc43.c 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [106/174] R-CRAN-withr-0:3.0.2-1.fc43.c 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [107/174] R-CRAN-base64enc-0:0.1.3-1.fc 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [108/174] R-CRAN-jquerylib-0:0.1.4-1.fc 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [109/174] R-CRAN-memoise-0:2.0.1-1.fc43 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [110/174] R-CRAN-sass-0:0.4.10-1.fc43.c 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [111/174] R-CRAN-magrittr-0:2.0.4-1.fc4 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [112/174] R-CRAN-fs-0:1.6.6-1.fc43.copr 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [113/174] R-CRAN-rappdirs-0:0.3.3-1.fc4 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [114/174] R-CRAN-htmltools-0:0.5.9-1.fc 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [115/174] libquadmath-0:15.2.1-4.fc43.x 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [116/174] libquadmath-devel-0:15.2.1-4. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [117/174] libstdc++-devel-0:15.2.1-4.fc 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [118/174] glibc-devel-0:2.42-4.fc43.x86 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [119/174] libXau-devel-0:1.0.12-3.fc43. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [120/174] kernel-headers-0:6.17.4-300.f 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [121/174] libxcrypt-devel-0:4.5.2-1.fc4 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [122/174] java-25-openjdk-devel-1:25.0. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [123/174] java-25-openjdk-1:25.0.1.0.8- 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [124/174] libXcomposite-0:0.4.6-6.fc43. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [125/174] libXi-0:1.8.2-3.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [126/174] libXtst-0:1.2.5-3.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [127/174] xorg-x11-fonts-Type1-0:7.5-41 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [128/174] java-25-openjdk-headless-1:25 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [129/174] mkfontscale-0:1.2.3-3.fc43.x8 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [130/174] ttmkfdir-0:3.0.9-73.fc43.x86_ 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [131/174] alsa-lib-0:1.2.14-4.fc43.x86_ 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [132/174] javapackages-filesystem-0:6.4 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [133/174] lksctp-tools-0:1.0.21-1.fc43. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [134/174] tzdata-java-0:2025b-3.fc43.no 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [135/174] libfontenc-0:1.1.8-4.fc43.x86 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [136/174] cups-libs-1:2.4.14-3.fc43.x86 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [137/174] avahi-libs-0:0.9~rc2-6.fc43.x 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [138/174] cups-filesystem-1:2.4.14-3.fc 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [139/174] dbus-libs-1:1.16.0-4.fc43.x86 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [140/174] nss-0:3.118.1-2.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [141/174] nss-softokn-0:3.118.1-2.fc43. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [142/174] nss-softokn-freebl-0:3.118.1- 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [143/174] nss-sysinit-0:3.118.1-2.fc43. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [144/174] nspr-0:4.37.0-7.fc43.x86_64 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [145/174] nss-util-0:3.118.1-2.fc43.x86 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [146/174] annobin-plugin-gcc-0:12.99-1. 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [147/174] gcc-plugin-annobin-0:15.2.1-4 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [148/174] annobin-docs-0:12.99-1.fc43.n 100% | 0.0 B/s | 0.0 B | 00m00s >>> Already downloaded [149/174] R-CRAN-Rdpack-0:2.6.4-1.fc43. 100% | 39.3 MiB/s | 683.4 KiB | 00m00s [150/174] R-CRAN-BH-0:1.87.0.1-1.fc43.c 100% | 255.4 MiB/s | 10.0 MiB | 00m00s [151/174] R-CRAN-ape-0:5.8.1-1.fc43.cop 100% | 143.1 MiB/s | 3.0 MiB | 00m00s [152/174] R-CRAN-rbibutils-0:2.4-1.fc43 100% | 216.6 MiB/s | 887.3 KiB | 00m00s [153/174] R-CRAN-colorspace-0:2.1.2-1.f 100% | 275.4 MiB/s | 2.5 MiB | 00m00s [154/174] R-CRAN-TreeDist-0:2.11.1-1.fc 100% | 2.8 MiB/s | 1.2 MiB | 00m00s [155/174] R-CRAN-PlotTools-0:0.3.1-1.fc 100% | 327.5 KiB/s | 47.8 KiB | 00m00s [156/174] R-CRAN-RCurl-0:1.98.1.17-1.fc 100% | 142.3 MiB/s | 874.5 KiB | 00m00s [157/174] R-CRAN-bit64-0:4.6.0.1-1.fc43 100% | 180.9 MiB/s | 555.6 KiB | 00m00s [158/174] R-CRAN-fastmatch-0:1.1.6-1.fc 100% | 49.8 MiB/s | 50.9 KiB | 00m00s [159/174] R-CRAN-stringi-0:1.8.7-1.fc43 100% | 251.5 MiB/s | 1.0 MiB | 00m00s [160/174] R-CRAN-nlme-0:3.1.168-1.fc43. 100% | 202.0 MiB/s | 2.4 MiB | 00m00s [161/174] R-CRAN-bitops-0:1.0.9-1.fc43. 100% | 40.6 MiB/s | 41.6 KiB | 00m00s [162/174] R-CRAN-shiny-0:1.12.0-1.fc43. 100% | 187.1 MiB/s | 3.7 MiB | 00m00s [163/174] R-CRAN-commonmark-0:2.0.0-1.f 100% | 67.2 MiB/s | 137.6 KiB | 00m00s [164/174] R-CRAN-httpuv-0:1.6.16-1.fc43 100% | 93.5 MiB/s | 574.7 KiB | 00m00s [165/174] R-CRAN-later-0:1.4.4-1.fc43.c 100% | 48.5 MiB/s | 149.1 KiB | 00m00s [166/174] R-CRAN-otel-0:0.2.0-1.fc43.co 100% | 102.8 MiB/s | 315.7 KiB | 00m00s [167/174] R-CRAN-promises-0:1.5.0-1.fc4 100% | 193.2 MiB/s | 1.5 MiB | 00m00s [168/174] R-CRAN-sourcetools-0:0.1.7.1- 100% | 10.2 MiB/s | 62.5 KiB | 00m00s [169/174] R-CRAN-xtable-0:1.8.4-3.fc43. 100% | 76.9 MiB/s | 708.4 KiB | 00m00s [170/174] pandoc-cli-0:3.6.4-38.fc43.x8 100% | 168.3 MiB/s | 28.4 MiB | 00m00s [171/174] libyaml-0:0.2.5-17.fc43.x86_6 100% | 14.7 MiB/s | 60.1 KiB | 00m00s [172/174] pandoc-common-0:3.6.4-36.fc43 100% | 19.8 MiB/s | 589.2 KiB | 00m00s [173/174] R-CRAN-shinyjs-0:2.1.0-1.fc43 100% | 224.3 KiB/s | 1.0 MiB | 00m05s [174/174] R-CRAN-TreeTools-0:2.0.0-1.fc 100% | 211.3 KiB/s | 1.8 MiB | 00m09s -------------------------------------------------------------------------------- [174/174] Total 100% | 7.0 MiB/s | 62.2 MiB | 00m09s Running transaction [ 1/176] Verify package files 100% | 172.0 B/s | 174.0 B | 00m01s >>> Running %pretrans scriptlet: java-25-openjdk-headless-1:25.0.1.0.8-1.fc43.x8 >>> Finished %pretrans scriptlet: java-25-openjdk-headless-1:25.0.1.0.8-1.fc43.x >>> [RPM] /var/lib/mock/fedora-43-x86_64-1764990259.129745/root/var/cache/dnf/co [ 2/176] Prepare transaction 100% | 988.0 B/s | 174.0 B | 00m00s [ 3/176] Installing libgfortran-0:15.2 100% | 372.8 MiB/s | 3.4 MiB | 00m00s [ 4/176] Installing nspr-0:4.37.0-7.fc 100% | 309.7 MiB/s | 317.2 KiB | 00m00s [ 5/176] Installing libquadmath-0:15.2 100% | 311.7 MiB/s | 319.2 KiB | 00m00s [ 6/176] Installing nss-util-0:3.118.1 100% | 201.0 MiB/s | 205.8 KiB | 00m00s [ 7/176] Installing glib2-0:2.86.2-1.f 100% | 309.5 MiB/s | 14.9 MiB | 00m00s [ 8/176] Installing libmpc-0:1.3.1-8.f 100% | 158.3 MiB/s | 162.1 KiB | 00m00s [ 9/176] Installing libpng-2:1.6.51-1. 100% | 237.3 MiB/s | 243.0 KiB | 00m00s [ 10/176] Installing fonts-filesystem-1 100% | 0.0 B/s | 788.0 B | 00m00s [ 11/176] Installing libicu-0:77.1-1.fc 100% | 443.8 MiB/s | 36.4 MiB | 00m00s [ 12/176] Installing openblas-0:0.3.29- 100% | 110.8 MiB/s | 113.5 KiB | 00m00s [ 13/176] Installing libtirpc-0:1.3.7-1 100% | 197.7 MiB/s | 202.4 KiB | 00m00s [ 14/176] Installing libdeflate-0:1.25- 100% | 121.6 MiB/s | 124.6 KiB | 00m00s [ 15/176] Installing cmake-filesystem-0 100% | 7.4 MiB/s | 7.6 KiB | 00m00s [ 16/176] Installing xorg-x11-proto-dev 100% | 297.1 MiB/s | 1.8 MiB | 00m00s [ 17/176] Installing libXau-0:1.0.12-3. 100% | 72.7 MiB/s | 74.5 KiB | 00m00s [ 18/176] Installing libxcb-0:1.17.0-6. 100% | 270.0 MiB/s | 1.1 MiB | 00m00s [ 19/176] Installing libICE-0:1.1.2-3.f 100% | 191.2 MiB/s | 195.8 KiB | 00m00s [ 20/176] Installing libRmath-0:4.5.2-1 100% | 237.9 MiB/s | 243.6 KiB | 00m00s [ 21/176] Installing libjpeg-turbo-0:3. 100% | 393.8 MiB/s | 806.6 KiB | 00m00s [ 22/176] Installing make-1:4.4.1-11.fc 100% | 112.5 MiB/s | 1.8 MiB | 00m00s [ 23/176] Installing libRmath-devel-0:4 100% | 0.0 B/s | 20.3 KiB | 00m00s [ 24/176] Installing libSM-0:1.2.5-3.fc 100% | 0.0 B/s | 102.4 KiB | 00m00s [ 25/176] Installing libXau-devel-0:1.0 100% | 1.8 MiB/s | 9.4 KiB | 00m00s [ 26/176] Installing libxcb-devel-0:1.1 100% | 82.9 MiB/s | 3.1 MiB | 00m00s [ 27/176] Installing libdeflate-devel-0 100% | 0.0 B/s | 27.3 KiB | 00m00s [ 28/176] Installing zlib-ng-compat-dev 100% | 106.0 MiB/s | 108.5 KiB | 00m00s [ 29/176] Installing libtirpc-devel-0:1 100% | 128.5 MiB/s | 263.1 KiB | 00m00s [ 30/176] Installing openblas-openmp-0: 100% | 672.1 MiB/s | 43.7 MiB | 00m00s [ 31/176] Installing flexiblas-netlib-0 100% | 351.3 MiB/s | 16.5 MiB | 00m00s [ 32/176] Installing flexiblas-0:3.5.0- 100% | 0.0 B/s | 39.2 KiB | 00m00s [ 33/176] Installing flexiblas-openblas 100% | 0.0 B/s | 40.1 KiB | 00m00s [ 34/176] Installing openblas-openmp64- 100% | 684.8 MiB/s | 43.8 MiB | 00m00s [ 35/176] Installing flexiblas-netlib64 100% | 362.9 MiB/s | 16.7 MiB | 00m00s [ 36/176] Installing flexiblas-openblas 100% | 39.1 MiB/s | 40.1 KiB | 00m00s [ 37/176] Installing flexiblas-devel-0: 100% | 468.3 MiB/s | 11.7 MiB | 00m00s [ 38/176] Installing libicu-devel-0:77. 100% | 211.8 MiB/s | 5.1 MiB | 00m00s [ 39/176] Installing abattis-cantarell- 100% | 189.9 MiB/s | 194.4 KiB | 00m00s [ 40/176] Installing cpp-0:15.2.1-4.fc4 100% | 379.4 MiB/s | 37.9 MiB | 00m00s [ 41/176] Installing nss-softokn-freebl 100% | 323.2 MiB/s | 993.0 KiB | 00m00s [ 42/176] Installing nss-softokn-0:3.11 100% | 393.8 MiB/s | 2.0 MiB | 00m00s [ 43/176] Installing nss-sysinit-0:3.11 100% | 1.6 MiB/s | 19.2 KiB | 00m00s [ 44/176] Installing nss-0:3.118.1-2.fc 100% | 157.4 MiB/s | 1.9 MiB | 00m00s [ 45/176] Installing annobin-docs-0:12. 100% | 97.7 MiB/s | 100.1 KiB | 00m00s [ 46/176] Installing dbus-libs-1:1.16.0 100% | 338.5 MiB/s | 346.6 KiB | 00m00s [ 47/176] Installing avahi-libs-0:0.9~r 100% | 170.0 MiB/s | 174.0 KiB | 00m00s [ 48/176] Installing cups-filesystem-1: 100% | 0.0 B/s | 1.8 KiB | 00m00s [ 49/176] Installing cups-libs-1:2.4.14 100% | 302.9 MiB/s | 620.2 KiB | 00m00s [ 50/176] Installing libfontenc-0:1.1.8 100% | 66.7 MiB/s | 68.3 KiB | 00m00s [ 51/176] Installing tzdata-java-0:2025 100% | 0.0 B/s | 100.5 KiB | 00m00s [ 52/176] Installing lksctp-tools-0:1.0 100% | 17.8 MiB/s | 255.3 KiB | 00m00s [ 53/176] Installing javapackages-files 100% | 5.4 MiB/s | 5.5 KiB | 00m00s [ 54/176] Installing alsa-lib-0:1.2.14- 100% | 85.0 MiB/s | 1.4 MiB | 00m00s [ 55/176] Installing java-25-openjdk-he 100% | 482.5 MiB/s | 236.4 MiB | 00m00s [ 56/176] Installing kernel-headers-0:6 100% | 221.8 MiB/s | 6.9 MiB | 00m00s [ 57/176] Installing libxcrypt-devel-0: 100% | 16.3 MiB/s | 33.4 KiB | 00m00s [ 58/176] Installing glibc-devel-0:2.42 100% | 181.1 MiB/s | 2.4 MiB | 00m00s [ 59/176] Installing gcc-0:15.2.1-4.fc4 100% | 439.1 MiB/s | 112.0 MiB | 00m00s [ 60/176] Installing libquadmath-devel- 100% | 23.1 MiB/s | 23.6 KiB | 00m00s [ 61/176] Installing gcc-gfortran-0:15. 100% | 370.2 MiB/s | 40.4 MiB | 00m00s [ 62/176] Installing libstdc++-devel-0: 100% | 528.0 MiB/s | 37.5 MiB | 00m00s [ 63/176] Installing gcc-c++-0:15.2.1-4 100% | 393.9 MiB/s | 41.4 MiB | 00m00s [ 64/176] Installing pandoc-common-0:3. 100% | 226.9 MiB/s | 2.0 MiB | 00m00s [ 65/176] Installing libyaml-0:0.2.5-17 100% | 132.8 MiB/s | 136.0 KiB | 00m00s [ 66/176] Installing pandoc-cli-0:3.6.4 100% | 639.8 MiB/s | 203.5 MiB | 00m00s [ 67/176] Installing google-noto-fonts- 100% | 0.0 B/s | 18.5 KiB | 00m00s [ 68/176] Installing google-noto-sans-v 100% | 347.8 MiB/s | 1.4 MiB | 00m00s [ 69/176] Installing default-fonts-core 100% | 17.8 MiB/s | 18.2 KiB | 00m00s [ 70/176] Installing libwebp-0:1.6.0-2. 100% | 312.7 MiB/s | 960.7 KiB | 00m00s [ 71/176] Installing liblerc-0:4.0.0-9. 100% | 305.5 MiB/s | 625.6 KiB | 00m00s [ 72/176] Installing jbigkit-libs-0:2.1 100% | 112.7 MiB/s | 115.4 KiB | 00m00s [ 73/176] Installing libtiff-0:4.7.1-1. 100% | 306.0 MiB/s | 626.6 KiB | 00m00s [ 74/176] Installing xz-devel-1:5.8.1-4 100% | 256.4 MiB/s | 262.6 KiB | 00m00s [ 75/176] Installing pcre2-utf32-0:10.4 100% | 298.8 MiB/s | 611.9 KiB | 00m00s [ 76/176] Installing pcre2-utf16-0:10.4 100% | 312.5 MiB/s | 640.0 KiB | 00m00s [ 77/176] Installing pcre2-devel-0:10.4 100% | 117.7 MiB/s | 2.1 MiB | 00m00s [ 78/176] Installing libzstd-devel-0:1. 100% | 203.9 MiB/s | 208.8 KiB | 00m00s [ 79/176] Installing libX11-xcb-0:1.8.1 100% | 0.0 B/s | 11.8 KiB | 00m00s [ 80/176] Installing bzip2-devel-0:1.0. 100% | 303.5 MiB/s | 310.7 KiB | 00m00s [ 81/176] Installing R-srpm-macros-0:1. 100% | 0.0 B/s | 4.0 KiB | 00m00s [ 82/176] Installing emacs-filesystem-1 100% | 0.0 B/s | 544.0 B | 00m00s [ 83/176] Installing desktop-file-utils 100% | 18.1 MiB/s | 222.2 KiB | 00m00s [ 84/176] Installing xdg-utils-0:1.2.1- 100% | 28.4 MiB/s | 349.5 KiB | 00m00s [ 85/176] Installing libdatrie-0:0.2.13 100% | 0.0 B/s | 54.9 KiB | 00m00s [ 86/176] Installing libthai-0:0.1.29-1 100% | 383.4 MiB/s | 785.2 KiB | 00m00s [ 87/176] Installing graphite2-0:1.3.14 100% | 15.8 MiB/s | 193.9 KiB | 00m00s [ 88/176] Installing harfbuzz-0:11.5.1- 100% | 404.0 MiB/s | 2.8 MiB | 00m00s [ 89/176] Installing freetype-0:2.13.3- 100% | 277.3 MiB/s | 851.9 KiB | 00m00s [ 90/176] Installing mkfontscale-0:1.2. 100% | 3.8 MiB/s | 46.4 KiB | 00m00s [ 91/176] Installing ttmkfdir-0:3.0.9-7 100% | 6.7 MiB/s | 123.6 KiB | 00m00s [ 92/176] Installing xml-common-0:0.6.3 100% | 79.2 MiB/s | 81.1 KiB | 00m00s [ 93/176] Installing fontconfig-0:2.17. 100% | 760.2 KiB/s | 785.3 KiB | 00m01s [ 94/176] Installing xorg-x11-fonts-Typ 100% | 24.9 MiB/s | 865.6 KiB | 00m00s [ 95/176] Installing tre-common-0:0.9.0 100% | 76.3 MiB/s | 78.1 KiB | 00m00s [ 96/176] Installing tre-0:0.9.0-2.fc43 100% | 74.8 MiB/s | 76.6 KiB | 00m00s [ 97/176] Installing tre-devel-0:0.9.0- 100% | 0.0 B/s | 14.1 KiB | 00m00s [ 98/176] Installing libtommath-0:1.3.1 100% | 124.5 MiB/s | 127.5 KiB | 00m00s [ 99/176] Installing tcl-1:9.0.2-1.fc43 100% | 160.6 MiB/s | 4.3 MiB | 00m00s [100/176] Installing fribidi-0:1.0.16-3 100% | 14.5 MiB/s | 192.8 KiB | 00m00s [101/176] Installing libX11-common-0:1. 100% | 169.7 MiB/s | 1.2 MiB | 00m00s [102/176] Installing libX11-0:1.8.12-1. 100% | 427.2 MiB/s | 1.3 MiB | 00m00s [103/176] Installing libXext-0:1.3.6-4. 100% | 0.0 B/s | 91.2 KiB | 00m00s [104/176] Installing libXrender-0:0.9.1 100% | 0.0 B/s | 47.3 KiB | 00m00s [105/176] Installing libXft-0:2.3.8-9.f 100% | 162.0 MiB/s | 165.9 KiB | 00m00s [106/176] Installing libXi-0:1.8.2-3.fc 100% | 0.0 B/s | 81.7 KiB | 00m00s [107/176] Installing libXt-0:1.3.1-3.fc 100% | 420.9 MiB/s | 431.0 KiB | 00m00s [108/176] Installing libXmu-0:1.2.1-4.f 100% | 188.7 MiB/s | 193.3 KiB | 00m00s [109/176] Installing libXtst-0:1.2.5-3. 100% | 4.8 MiB/s | 34.6 KiB | 00m00s [110/176] Installing tk-1:9.0.2-1.fc43. 100% | 141.8 MiB/s | 3.8 MiB | 00m00s [111/176] Installing libX11-devel-0:1.8 100% | 86.1 MiB/s | 1.1 MiB | 00m00s [112/176] Installing libXcomposite-0:0. 100% | 41.0 MiB/s | 42.0 KiB | 00m00s [113/176] Installing java-25-openjdk-1: 100% | 94.1 MiB/s | 963.8 KiB | 00m00s [114/176] Installing java-25-openjdk-de 100% | 265.6 MiB/s | 11.7 MiB | 00m00s [115/176] Installing pixman-0:0.46.2-2. 100% | 347.4 MiB/s | 711.4 KiB | 00m00s [116/176] Installing lzo-0:2.10-15.fc43 100% | 176.3 MiB/s | 180.5 KiB | 00m00s [117/176] Installing cairo-0:1.18.4-2.f 100% | 354.4 MiB/s | 1.8 MiB | 00m00s [118/176] Installing pango-0:1.57.0-1.f 100% | 55.1 MiB/s | 1.0 MiB | 00m00s [119/176] Installing tzdata-0:2025b-3.f 100% | 70.1 MiB/s | 1.9 MiB | 00m00s [120/176] Installing less-0:679-2.fc43. 100% | 11.1 MiB/s | 409.4 KiB | 00m00s [121/176] Installing R-core-0:4.5.2-1.f 100% | 280.8 MiB/s | 106.2 MiB | 00m00s [122/176] Installing R-CRAN-rlang-0:1.1 100% | 181.8 MiB/s | 2.7 MiB | 00m00s [123/176] Installing R-CRAN-fastmap-0:1 100% | 109.8 MiB/s | 112.4 KiB | 00m00s [124/176] Installing R-CRAN-R6-0:2.6.1- 100% | 15.8 MiB/s | 129.5 KiB | 00m00s [125/176] Installing R-CRAN-cachem-0:1. 100% | 53.3 MiB/s | 109.1 KiB | 00m00s [126/176] Installing R-CRAN-cli-0:3.6.5 100% | 228.1 MiB/s | 2.5 MiB | 00m00s [127/176] Installing R-CRAN-digest-0:0. 100% | 167.6 MiB/s | 514.8 KiB | 00m00s [128/176] Installing R-CRAN-jsonlite-0: 100% | 471.4 MiB/s | 2.4 MiB | 00m00s [129/176] Installing R-CRAN-lattice-0:0 100% | 233.7 MiB/s | 2.1 MiB | 00m00s [130/176] Installing R-core-devel-0:4.5 100% | 203.8 MiB/s | 417.5 KiB | 00m00s [131/176] Installing R-CRAN-glue-0:1.8. 100% | 174.5 MiB/s | 357.4 KiB | 00m00s [132/176] Installing R-CRAN-lifecycle-0 100% | 145.3 MiB/s | 297.6 KiB | 00m00s [133/176] Installing R-CRAN-mime-0:0.13 100% | 66.1 MiB/s | 67.7 KiB | 00m00s [134/176] Installing R-CRAN-otel-0:0.2. 100% | 180.1 MiB/s | 553.4 KiB | 00m00s [135/176] Installing R-CRAN-base64enc-0 100% | 56.9 MiB/s | 58.3 KiB | 00m00s [136/176] Installing R-CRAN-htmltools-0 100% | 134.8 MiB/s | 552.1 KiB | 00m00s [137/176] Installing R-CRAN-fontawesome 100% | 406.5 MiB/s | 2.0 MiB | 00m00s [138/176] Installing R-CRAN-jquerylib-0 100% | 297.5 MiB/s | 1.5 MiB | 00m00s [139/176] Installing R-CRAN-nlme-0:3.1. 100% | 218.8 MiB/s | 3.9 MiB | 00m00s [140/176] Installing R-CRAN-memoise-0:2 100% | 90.9 MiB/s | 93.0 KiB | 00m00s [141/176] Installing R-littler-0:0.3.19 100% | 11.7 MiB/s | 168.3 KiB | 00m00s [142/176] Installing R-CRAN-Rcpp-0:1.1. 100% | 213.2 MiB/s | 4.5 MiB | 00m00s [143/176] Installing R-CRAN-later-0:1.4 100% | 104.2 MiB/s | 320.0 KiB | 00m00s [144/176] Installing R-CRAN-ape-0:5.8.1 100% | 249.8 MiB/s | 4.2 MiB | 00m00s [145/176] Installing R-CRAN-rbibutils-0 100% | 331.0 MiB/s | 2.6 MiB | 00m00s [146/176] Installing R-CRAN-Rdpack-0:2. 100% | 206.0 MiB/s | 1.0 MiB | 00m00s [147/176] Installing R-CRAN-colorspace- 100% | 317.2 MiB/s | 4.1 MiB | 00m00s [148/176] Installing R-CRAN-PlotTools-0 100% | 58.0 MiB/s | 59.4 KiB | 00m00s [149/176] Installing R-CRAN-fastmatch-0 100% | 37.4 MiB/s | 76.5 KiB | 00m00s [150/176] Installing R-CRAN-stringi-0:1 100% | 210.7 MiB/s | 2.1 MiB | 00m00s [151/176] Installing R-CRAN-bitops-0:1. 100% | 63.4 MiB/s | 65.0 KiB | 00m00s [152/176] Installing R-CRAN-RCurl-0:1.9 100% | 235.0 MiB/s | 2.1 MiB | 00m00s [153/176] Installing R-CRAN-bit-0:4.6.0 100% | 161.3 MiB/s | 1.3 MiB | 00m00s [154/176] Installing R-CRAN-bit64-0:4.6 100% | 134.1 MiB/s | 961.3 KiB | 00m00s [155/176] Installing R-CRAN-TreeTools-0 100% | 216.7 MiB/s | 2.8 MiB | 00m00s [156/176] Installing R-java-0:4.5.2-1.f 100% | 0.0 B/s | 124.0 B | 00m00s [157/176] Installing R-java-devel-0:4.5 100% | 0.0 B/s | 124.0 B | 00m00s [158/176] Installing R-rpm-macros-0:1.3 100% | 0.0 B/s | 9.7 KiB | 00m00s [159/176] Installing R-CRAN-commonmark- 100% | 158.5 MiB/s | 324.5 KiB | 00m00s [160/176] Installing R-CRAN-sourcetools 100% | 47.1 MiB/s | 144.6 KiB | 00m00s [161/176] Installing R-CRAN-withr-0:3.0 100% | 137.7 MiB/s | 423.0 KiB | 00m00s [162/176] Installing R-CRAN-xtable-0:1. 100% | 224.8 MiB/s | 920.6 KiB | 00m00s [163/176] Installing R-CRAN-magrittr-0: 100% | 138.2 MiB/s | 424.4 KiB | 00m00s [164/176] Installing R-CRAN-promises-0: 100% | 325.8 MiB/s | 2.6 MiB | 00m00s [165/176] Installing R-CRAN-httpuv-0:1. 100% | 281.8 MiB/s | 1.1 MiB | 00m00s [166/176] Installing R-CRAN-fs-0:1.6.6- 100% | 151.7 MiB/s | 621.3 KiB | 00m00s [167/176] Installing R-CRAN-rappdirs-0: 100% | 88.8 MiB/s | 90.9 KiB | 00m00s [168/176] Installing R-CRAN-sass-0:0.4. 100% | 309.1 MiB/s | 4.3 MiB | 00m00s [169/176] Installing R-CRAN-bslib-0:0.9 100% | 284.9 MiB/s | 11.1 MiB | 00m00s [170/176] Installing R-CRAN-shiny-0:1.1 100% | 317.6 MiB/s | 10.2 MiB | 00m00s [171/176] Installing R-CRAN-shinyjs-0:2 100% | 255.6 MiB/s | 1.5 MiB | 00m00s [172/176] Installing R-CRAN-TreeDist-0: 100% | 263.7 MiB/s | 2.4 MiB | 00m00s [173/176] Installing R-devel-0:4.5.2-1. 100% | 7.6 KiB/s | 124.0 B | 00m00s [174/176] Installing R-CRAN-BH-0:1.87.0 100% | 320.6 MiB/s | 124.7 MiB | 00m00s [175/176] Installing annobin-plugin-gcc 100% | 65.8 MiB/s | 1.0 MiB | 00m00s [176/176] Installing gcc-plugin-annobin 100% | 196.6 KiB/s | 58.8 KiB | 00m00s Warning: skipped OpenPGP checks for 47 packages from repository: copr_base Complete! Finish: build setup for R-CRAN-TBRDist-1.0.3-1.fc43.copr9878869.src.rpm Start: rpmbuild R-CRAN-TBRDist-1.0.3-1.fc43.copr9878869.src.rpm Building target platforms: x86_64 Building for target x86_64 warning: %source_date_epoch_from_changelog is set, but %changelog has no entries to take a date from Executing(%mkbuilddir): /bin/sh -e /var/tmp/rpm-tmp.lxIbNm Executing(%prep): /bin/sh -e /var/tmp/rpm-tmp.UR3bxx + umask 022 + cd /builddir/build/BUILD/R-CRAN-TBRDist-1.0.3-build + cd /builddir/build/BUILD/R-CRAN-TBRDist-1.0.3-build + rm -rf TBRDist + /usr/bin/mkdir -p TBRDist + cd TBRDist + /usr/lib/rpm/rpmuncompress -x /builddir/build/SOURCES/TBRDist_1.0.3.tar.gz + STATUS=0 + '[' 0 -ne 0 ']' + /usr/bin/chmod -Rf a+rX,u+w,g-w,o-w . + find -type f -executable -exec grep -Iq . '{}' ';' -exec sed -i -e '$a\' '{}' ';' + '[' -d TBRDist/src ']' + find TBRDist/src -type f -exec sed -i s@/usr/bin/strip@/usr/bin/true@g '{}' ';' + '[' -d TBRDist/src ']' + find 'TBRDist/src/Make*' -type f -exec sed -i s@-g0@@g '{}' ';' find: ‘TBRDist/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.078xaS + umask 022 + cd /builddir/build/BUILD/R-CRAN-TBRDist-1.0.3-build + CFLAGS='-O2 -flto=auto -ffat-lto-objects -fexceptions -g -grecord-gcc-switches -pipe -Wall -Werror=format-security -Wp,-U_FORTIFY_SOURCE,-D_FORTIFY_SOURCE=3 -Wp,-D_GLIBCXX_ASSERTIONS -specs=/usr/lib/rpm/redhat/redhat-hardened-cc1 -fstack-protector-strong -specs=/usr/lib/rpm/redhat/redhat-annobin-cc1 -m64 -march=x86-64 -mtune=generic -fasynchronous-unwind-tables -fstack-clash-protection -fcf-protection -mtls-dialect=gnu2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer ' + export CFLAGS + CXXFLAGS='-O2 -flto=auto -ffat-lto-objects -fexceptions -g -grecord-gcc-switches -pipe -Wall -Werror=format-security -Wp,-U_FORTIFY_SOURCE,-D_FORTIFY_SOURCE=3 -Wp,-D_GLIBCXX_ASSERTIONS -specs=/usr/lib/rpm/redhat/redhat-hardened-cc1 -fstack-protector-strong -specs=/usr/lib/rpm/redhat/redhat-annobin-cc1 -m64 -march=x86-64 -mtune=generic -fasynchronous-unwind-tables -fstack-clash-protection -fcf-protection -mtls-dialect=gnu2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer ' + export CXXFLAGS + FFLAGS='-O2 -flto=auto -ffat-lto-objects -fexceptions -g -grecord-gcc-switches -pipe -Wall -Wp,-U_FORTIFY_SOURCE,-D_FORTIFY_SOURCE=3 -Wp,-D_GLIBCXX_ASSERTIONS -specs=/usr/lib/rpm/redhat/redhat-hardened-cc1 -fstack-protector-strong -specs=/usr/lib/rpm/redhat/redhat-annobin-cc1 -m64 -march=x86-64 -mtune=generic -fasynchronous-unwind-tables -fstack-clash-protection -fcf-protection -mtls-dialect=gnu2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -I/usr/lib64/gfortran/modules ' + export FFLAGS + FCFLAGS='-O2 -flto=auto -ffat-lto-objects -fexceptions -g -grecord-gcc-switches -pipe -Wall -Wp,-U_FORTIFY_SOURCE,-D_FORTIFY_SOURCE=3 -Wp,-D_GLIBCXX_ASSERTIONS -specs=/usr/lib/rpm/redhat/redhat-hardened-cc1 -fstack-protector-strong -specs=/usr/lib/rpm/redhat/redhat-annobin-cc1 -m64 -march=x86-64 -mtune=generic -fasynchronous-unwind-tables -fstack-clash-protection -fcf-protection -mtls-dialect=gnu2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -I/usr/lib64/gfortran/modules ' + export FCFLAGS + VALAFLAGS=-g + export VALAFLAGS + RUSTFLAGS='-Copt-level=3 -Cdebuginfo=2 -Ccodegen-units=1 -Cstrip=none -Cforce-frame-pointers=yes -Clink-arg=-specs=/usr/lib/rpm/redhat/redhat-package-notes --cap-lints=warn' + export RUSTFLAGS + LDFLAGS='-Wl,-z,relro -Wl,--as-needed -Wl,-z,pack-relative-relocs -Wl,-z,now -specs=/usr/lib/rpm/redhat/redhat-hardened-ld -specs=/usr/lib/rpm/redhat/redhat-hardened-ld-errors -specs=/usr/lib/rpm/redhat/redhat-annobin-cc1 -Wl,--build-id=sha1 -specs=/usr/lib/rpm/redhat/redhat-package-notes ' + export LDFLAGS + LT_SYS_LIBRARY_PATH=/usr/lib64: + export LT_SYS_LIBRARY_PATH + CC=gcc + export CC + CXX=g++ + export CXX + cd TBRDist + RPM_EC=0 ++ jobs -p + exit 0 Executing(%install): /bin/sh -e /var/tmp/rpm-tmp.dlVsNB + umask 022 + cd /builddir/build/BUILD/R-CRAN-TBRDist-1.0.3-build + '[' /builddir/build/BUILD/R-CRAN-TBRDist-1.0.3-build/BUILDROOT '!=' / ']' + rm -rf /builddir/build/BUILD/R-CRAN-TBRDist-1.0.3-build/BUILDROOT ++ dirname /builddir/build/BUILD/R-CRAN-TBRDist-1.0.3-build/BUILDROOT + mkdir -p /builddir/build/BUILD/R-CRAN-TBRDist-1.0.3-build + mkdir /builddir/build/BUILD/R-CRAN-TBRDist-1.0.3-build/BUILDROOT + CFLAGS='-O2 -flto=auto -ffat-lto-objects -fexceptions -g -grecord-gcc-switches -pipe -Wall -Werror=format-security -Wp,-U_FORTIFY_SOURCE,-D_FORTIFY_SOURCE=3 -Wp,-D_GLIBCXX_ASSERTIONS -specs=/usr/lib/rpm/redhat/redhat-hardened-cc1 -fstack-protector-strong -specs=/usr/lib/rpm/redhat/redhat-annobin-cc1 -m64 -march=x86-64 -mtune=generic -fasynchronous-unwind-tables -fstack-clash-protection -fcf-protection -mtls-dialect=gnu2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer ' + export CFLAGS + CXXFLAGS='-O2 -flto=auto -ffat-lto-objects -fexceptions -g -grecord-gcc-switches -pipe -Wall -Werror=format-security -Wp,-U_FORTIFY_SOURCE,-D_FORTIFY_SOURCE=3 -Wp,-D_GLIBCXX_ASSERTIONS -specs=/usr/lib/rpm/redhat/redhat-hardened-cc1 -fstack-protector-strong -specs=/usr/lib/rpm/redhat/redhat-annobin-cc1 -m64 -march=x86-64 -mtune=generic -fasynchronous-unwind-tables -fstack-clash-protection -fcf-protection -mtls-dialect=gnu2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer ' + export CXXFLAGS + FFLAGS='-O2 -flto=auto -ffat-lto-objects -fexceptions -g -grecord-gcc-switches -pipe -Wall -Wp,-U_FORTIFY_SOURCE,-D_FORTIFY_SOURCE=3 -Wp,-D_GLIBCXX_ASSERTIONS -specs=/usr/lib/rpm/redhat/redhat-hardened-cc1 -fstack-protector-strong -specs=/usr/lib/rpm/redhat/redhat-annobin-cc1 -m64 -march=x86-64 -mtune=generic -fasynchronous-unwind-tables -fstack-clash-protection -fcf-protection -mtls-dialect=gnu2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -I/usr/lib64/gfortran/modules ' + export FFLAGS + FCFLAGS='-O2 -flto=auto -ffat-lto-objects -fexceptions -g -grecord-gcc-switches -pipe -Wall -Wp,-U_FORTIFY_SOURCE,-D_FORTIFY_SOURCE=3 -Wp,-D_GLIBCXX_ASSERTIONS -specs=/usr/lib/rpm/redhat/redhat-hardened-cc1 -fstack-protector-strong -specs=/usr/lib/rpm/redhat/redhat-annobin-cc1 -m64 -march=x86-64 -mtune=generic -fasynchronous-unwind-tables -fstack-clash-protection -fcf-protection -mtls-dialect=gnu2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -I/usr/lib64/gfortran/modules ' + export FCFLAGS + VALAFLAGS=-g + export VALAFLAGS + RUSTFLAGS='-Copt-level=3 -Cdebuginfo=2 -Ccodegen-units=1 -Cstrip=none -Cforce-frame-pointers=yes -Clink-arg=-specs=/usr/lib/rpm/redhat/redhat-package-notes --cap-lints=warn' + export RUSTFLAGS + LDFLAGS='-Wl,-z,relro -Wl,--as-needed -Wl,-z,pack-relative-relocs -Wl,-z,now -specs=/usr/lib/rpm/redhat/redhat-hardened-ld -specs=/usr/lib/rpm/redhat/redhat-hardened-ld-errors -specs=/usr/lib/rpm/redhat/redhat-annobin-cc1 -Wl,--build-id=sha1 -specs=/usr/lib/rpm/redhat/redhat-package-notes ' + export LDFLAGS + LT_SYS_LIBRARY_PATH=/usr/lib64: + export LT_SYS_LIBRARY_PATH + CC=gcc + export CC + CXX=g++ + export CXX + cd TBRDist + mkdir -p /builddir/build/BUILD/R-CRAN-TBRDist-1.0.3-build/BUILDROOT/usr/local/lib/R/library + /usr/bin/R CMD INSTALL -l /builddir/build/BUILD/R-CRAN-TBRDist-1.0.3-build/BUILDROOT/usr/local/lib/R/library TBRDist * installing *source* package ‘TBRDist’ ... ** this is package ‘TBRDist’ version ‘1.0.3’ ** package ‘TBRDist’ successfully unpacked and MD5 sums checked ** using staged installation ** libs using C++ compiler: ‘g++ (GCC) 15.2.1 20251111 (Red Hat 15.2.1-4)’ g++ -std=gnu++17 -I"/usr/include/R" -DNDEBUG -I'/usr/local/lib/R/library/BH/include' -I'/usr/local/lib/R/library/Rcpp/include' -I/usr/local/include -fpic -O2 -flto=auto -ffat-lto-objects -fexceptions -g -grecord-gcc-switches -pipe -Wall -Werror=format-security -Wp,-U_FORTIFY_SOURCE,-D_FORTIFY_SOURCE=3 -Wp,-D_GLIBCXX_ASSERTIONS -specs=/usr/lib/rpm/redhat/redhat-hardened-cc1 -fstack-protector-strong -specs=/usr/lib/rpm/redhat/redhat-annobin-cc1 -m64 -march=x86-64 -mtune=generic -fasynchronous-unwind-tables -fstack-clash-protection -fcf-protection -mtls-dialect=gnu2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -c RcppExports.cpp -o RcppExports.o g++ -std=gnu++17 -I"/usr/include/R" -DNDEBUG -I'/usr/local/lib/R/library/BH/include' -I'/usr/local/lib/R/library/Rcpp/include' -I/usr/local/include -fpic -O2 -flto=auto -ffat-lto-objects -fexceptions -g -grecord-gcc-switches -pipe -Wall -Werror=format-security -Wp,-U_FORTIFY_SOURCE,-D_FORTIFY_SOURCE=3 -Wp,-D_GLIBCXX_ASSERTIONS -specs=/usr/lib/rpm/redhat/redhat-hardened-cc1 -fstack-protector-strong -specs=/usr/lib/rpm/redhat/redhat-annobin-cc1 -m64 -march=x86-64 -mtune=generic -fasynchronous-unwind-tables -fstack-clash-protection -fcf-protection -mtls-dialect=gnu2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -c uspr.cpp -o uspr.o 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/graph/adjacency_list.hpp:22, from uspr/tbr.h:44, from uspr.cpp:18: /usr/local/lib/R/library/BH/include/boost/smart_ptr/scoped_ptr.hpp:75:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 75 | explicit scoped_ptr( std::auto_ptr p ) noexcept : px( p.release() ) | ^~~~~~~~ In file included from /usr/include/c++/15/memory:80, from uspr.cpp:12: /usr/include/c++/15/bits/unique_ptr.h:58:28: note: declared here 58 | template class auto_ptr; | ^~~~~~~~ In file included from /usr/local/lib/R/library/BH/include/boost/mpl/aux_/na_assert.hpp:23, from /usr/local/lib/R/library/BH/include/boost/mpl/arg.hpp:25, from /usr/local/lib/R/library/BH/include/boost/mpl/placeholders.hpp:24, from /usr/local/lib/R/library/BH/include/boost/iterator/iterator_categories.hpp:16, from /usr/local/lib/R/library/BH/include/boost/graph/graph_traits.hpp:25, from /usr/local/lib/R/library/BH/include/boost/graph/adjacency_list.hpp:24: /usr/local/lib/R/library/BH/include/boost/mpl/assert.hpp:194:21: warning: unnecessary parentheses in declaration of ‘assert_arg’ [-Wparentheses] 194 | failed ************ (Pred::************ | ^~~~~~~~~~~~~~~~~~~ 195 | assert_arg( void (*)(Pred), typename assert_arg_pred::type ) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 196 | ); | ~ /usr/local/lib/R/library/BH/include/boost/mpl/assert.hpp:194:21: note: remove parentheses 194 | failed ************ (Pred::************ | ^~~~~~~~~~~~~~~~~~~ | - 195 | assert_arg( void (*)(Pred), typename assert_arg_pred::type ) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 196 | ); | ~ | - /usr/local/lib/R/library/BH/include/boost/mpl/assert.hpp:199:21: warning: unnecessary parentheses in declaration of ‘assert_not_arg’ [-Wparentheses] 199 | failed ************ (boost::mpl::not_::************ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 200 | assert_not_arg( void (*)(Pred), typename assert_arg_pred_not::type ) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 201 | ); | ~ /usr/local/lib/R/library/BH/include/boost/mpl/assert.hpp:199:21: note: remove parentheses 199 | failed ************ (boost::mpl::not_::************ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ | - 200 | assert_not_arg( void (*)(Pred), typename assert_arg_pred_not::type ) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 201 | ); | ~ | - In file included from /usr/local/lib/R/library/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /usr/local/lib/R/library/BH/include/boost/property_map/vector_property_map.hpp:14, from /usr/local/lib/R/library/BH/include/boost/property_map/property_map.hpp:598, from /usr/local/lib/R/library/BH/include/boost/graph/adjacency_list.hpp:27: /usr/local/lib/R/library/BH/include/boost/smart_ptr/detail/shared_count.hpp:326:33: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 326 | explicit shared_count( std::auto_ptr & r ): pi_( new sp_counted_impl_p( r.get() ) ) | ^~~~~~~~ /usr/include/c++/15/bits/unique_ptr.h:58:28: note: declared here 58 | template class auto_ptr; | ^~~~~~~~ /usr/local/lib/R/library/BH/include/boost/smart_ptr/shared_ptr.hpp:354:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 354 | explicit shared_ptr( std::auto_ptr & r ): px(r.get()), pn() | ^~~~~~~~ /usr/include/c++/15/bits/unique_ptr.h:58:28: note: declared here 58 | template class auto_ptr; | ^~~~~~~~ /usr/local/lib/R/library/BH/include/boost/smart_ptr/shared_ptr.hpp:365:22: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 365 | shared_ptr( std::auto_ptr && r ): px(r.get()), pn() | ^~~~~~~~ /usr/include/c++/15/bits/unique_ptr.h:58:28: note: declared here 58 | template class auto_ptr; | ^~~~~~~~ /usr/local/lib/R/library/BH/include/boost/smart_ptr/shared_ptr.hpp:423:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 423 | shared_ptr & operator=( std::auto_ptr & r ) | ^~~~~~~~ /usr/include/c++/15/bits/unique_ptr.h:58:28: note: declared here 58 | template class auto_ptr; | ^~~~~~~~ /usr/local/lib/R/library/BH/include/boost/smart_ptr/shared_ptr.hpp:430:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 430 | shared_ptr & operator=( std::auto_ptr && r ) | ^~~~~~~~ /usr/include/c++/15/bits/unique_ptr.h:58:28: note: declared here 58 | template class auto_ptr; | ^~~~~~~~ /usr/local/lib/R/library/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr& boost::shared_ptr::operator=(std::auto_ptr<_Up>&&)’: /usr/local/lib/R/library/BH/include/boost/smart_ptr/shared_ptr.hpp:432:38: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 432 | this_type( static_cast< std::auto_ptr && >( r ) ).swap( *this ); | ^~~~~~~~ /usr/include/c++/15/bits/unique_ptr.h:58:28: note: declared here 58 | 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::constraint::failed() [with Model = boost::DFSVisitorConcept, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >]’: /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; DFSVisitor = detail::odd_components_counter; ColorMap = shared_array_property_map >; typename graph_traits::vertex_descriptor = long unsigned int]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > >; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /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/max_cardinality_matching.hpp:21, from uspr/tbr.h:45: /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::detail::odd_components_counter; Graph = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > >]’ 39 | 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:167:5: required from ‘struct boost::CopyConstructible >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /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::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::detail::odd_components_counter; Graph = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DFSVisitorConcept, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:130: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:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /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/mpl/aux_/integral_wrapper.hpp:22, from /usr/local/lib/R/library/BH/include/boost/mpl/int.hpp:20, from /usr/local/lib/R/library/BH/include/boost/mpl/lambda_fwd.hpp:23, from /usr/local/lib/R/library/BH/include/boost/mpl/aux_/na_spec.hpp:18, from /usr/local/lib/R/library/BH/include/boost/mpl/if.hpp:19, from /usr/local/lib/R/library/BH/include/boost/graph/graph_traits.hpp:17: /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::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > > >]’: /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /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::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, 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, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > > >]’: /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /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::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, 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::IncidenceGraphConcept, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >]’: /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::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > >; DFSVisitor = odd_components_counter; ColorMap = boost::shared_array_property_map >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; DFSVisitor = detail::odd_components_counter; ColorMap = shared_array_property_map >; typename graph_traits::vertex_descriptor = long unsigned int]’ 286 | detail::depth_first_visit_impl( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 287 | g, start_vertex, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > >; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /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::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >::~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::ReadWritePropertyMapConcept >, 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::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > >; DFSVisitor = odd_components_counter; ColorMap = boost::shared_array_property_map >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; DFSVisitor = detail::odd_components_counter; ColorMap = shared_array_property_map >; typename graph_traits::vertex_descriptor = long unsigned int]’ 286 | detail::depth_first_visit_impl( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 287 | g, start_vertex, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > >; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /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::shared_array_property_map >; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:505:5: required from ‘struct boost::concepts::ColorValue’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /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::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > >; DFSVisitor = odd_components_counter; ColorMap = boost::shared_array_property_map >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; DFSVisitor = detail::odd_components_counter; ColorMap = shared_array_property_map >; typename graph_traits::vertex_descriptor = long unsigned int]’ 286 | detail::depth_first_visit_impl( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 287 | g, start_vertex, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > >; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /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::CopyConstructible >]’: /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /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::detail::odd_components_counter]’ 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/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, 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, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /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::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > >]’ 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::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, 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, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /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::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > >]’ 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::constraint::failed() [with Model = boost::ReadablePropertyMapConcept >, 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::shared_array_property_map >; Key = long unsigned int]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, long unsigned int>]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, long unsigned int> >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, long unsigned int> >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, long unsigned int>)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:134:9: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /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::shared_array_property_map >; 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 >, 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::shared_array_property_map >; Key = long unsigned int]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, long unsigned int>]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, long unsigned int> >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, long unsigned int> >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, long unsigned int>)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:134:9: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /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::shared_array_property_map >; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /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::shared_array_property_map >; Key = long unsigned int]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, long unsigned int>]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, long unsigned int> >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, long unsigned int> >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, long unsigned int>)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:134:9: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /usr/local/lib/R/library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::default_color_type]’ 37 | ~model() | ^ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’: /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::default_color_type]’ 37 | ~model() | ^ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::ColorValue]’: /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:505:5: required from ‘struct boost::concepts::ColorValue’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /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, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /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, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 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, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >]’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > >; DFSVisitor = odd_components_counter; ColorMap = boost::shared_array_property_map >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; DFSVisitor = detail::odd_components_counter; ColorMap = shared_array_property_map >; typename graph_traits::vertex_descriptor = long unsigned int]’ 286 | detail::depth_first_visit_impl( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 287 | g, start_vertex, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:397:42: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /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::iterators::filter_iterator, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:90:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /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::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >]’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > >; DFSVisitor = odd_components_counter; ColorMap = boost::shared_array_property_map >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; DFSVisitor = detail::odd_components_counter; ColorMap = shared_array_property_map >; typename graph_traits::vertex_descriptor = long unsigned int]’ 286 | detail::depth_first_visit_impl( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 287 | g, start_vertex, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:397:42: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:91:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /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::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >]’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > >; DFSVisitor = odd_components_counter; ColorMap = boost::shared_array_property_map >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; DFSVisitor = detail::odd_components_counter; ColorMap = shared_array_property_map >; typename graph_traits::vertex_descriptor = long unsigned int]’ 286 | detail::depth_first_visit_impl( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 287 | g, start_vertex, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:397:42: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:92:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /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::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >]’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > >; DFSVisitor = odd_components_counter; ColorMap = boost::shared_array_property_map >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; DFSVisitor = detail::odd_components_counter; ColorMap = shared_array_property_map >; typename graph_traits::vertex_descriptor = long unsigned int]’ 286 | detail::depth_first_visit_impl( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 287 | g, start_vertex, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:397:42: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:93:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /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::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >]’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > >; DFSVisitor = odd_components_counter; ColorMap = boost::shared_array_property_map >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; DFSVisitor = detail::odd_components_counter; ColorMap = shared_array_property_map >; typename graph_traits::vertex_descriptor = long unsigned int]’ 286 | detail::depth_first_visit_impl( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 287 | g, start_vertex, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:397:42: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /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::undir_adj_list_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/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /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::shared_array_property_map >; Key = long unsigned int]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept >, long unsigned int>]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, long unsigned int> >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, long unsigned int> >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, long unsigned int>)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/property_map/property_map.hpp:206:7: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /usr/local/lib/R/library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /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::shared_array_property_map >; Key = long unsigned int]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::WritablePropertyMapConcept >, long unsigned int>]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, long unsigned int> >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, long unsigned int> >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, long unsigned int>)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/property_map/property_map.hpp:207:7: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /usr/local/lib/R/library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::read_write_property_map_tag]’ 37 | ~model() | ^ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:68:9: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /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::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:69:9: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /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::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:70:9: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /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::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /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, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /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, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /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::iterators::filter_iterator, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’: /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /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::undir_adj_list_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::writable_property_map_tag]’ 37 | ~model() | ^ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’: /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’: /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /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, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ 502 | BOOST_concept(InputIterator,(TT)) | ^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /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, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 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, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ 502 | BOOST_concept(InputIterator,(TT)) | ^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /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, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 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, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /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, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 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, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >]’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > >; DFSVisitor = odd_components_counter; ColorMap = boost::shared_array_property_map >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:286:39: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /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::iterators::filter_iterator, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 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, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /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, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ 502 | BOOST_concept(InputIterator,(TT)) | ^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /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::iterators::filter_iterator, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 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, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /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, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ 502 | BOOST_concept(InputIterator,(TT)) | ^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /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::iterators::filter_iterator, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 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, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /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, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /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::iterators::filter_iterator, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 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::SignedInteger]’: /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:514:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::iterators::filter_iterator, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /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, std::input_iterator_tag> >]’: /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::input_iterator_tag>)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:515:9: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /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::iterators::filter_iterator, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’: /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ 45 | typedef boost::integral_constant type; | ^~~~ /usr/local/lib/R/library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/local/lib/R/library/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /usr/local/lib/R/library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /usr/local/lib/R/library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -shared -L/usr/lib64/R/lib -Wl,-z,relro -Wl,--as-needed -Wl,-z,pack-relative-relocs -Wl,-z,now -specs=/usr/lib/rpm/redhat/redhat-hardened-ld -specs=/usr/lib/rpm/redhat/redhat-hardened-ld-errors -specs=/usr/lib/rpm/redhat/redhat-annobin-cc1 -Wl,--build-id=sha1 -o TBRDist.so RcppExports.o uspr.o -L/usr/lib64/R/lib -lR installing to /builddir/build/BUILD/R-CRAN-TBRDist-1.0.3-build/BUILDROOT/usr/local/lib/R/library/00LOCK-TBRDist/00new/TBRDist/libs ** R ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices converting help for package ‘TBRDist’ finding HTML links ... done TreeRearrangementDistances html dot-PrepareTrees html internals html ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** checking absolute paths in shared objects and dynamic libraries ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (TBRDist) + test -d TBRDist/src + cd TBRDist/src + rm -f RcppExports.o uspr.o TBRDist.so + rm -f /builddir/build/BUILD/R-CRAN-TBRDist-1.0.3-build/BUILDROOT/usr/local/lib/R/library/R.css + find /builddir/build/BUILD/R-CRAN-TBRDist-1.0.3-build/BUILDROOT/usr/local/lib/R/library -type f -exec sed -i s@/builddir/build/BUILD/R-CRAN-TBRDist-1.0.3-build/BUILDROOT@@g '{}' ';' + /usr/bin/find-debuginfo -j4 --strict-build-id -m -i --build-id-seed 1.0.3-1.fc43.copr9878869 --unique-debug-suffix -1.0.3-1.fc43.copr9878869.x86_64 --unique-debug-src-base R-CRAN-TBRDist-1.0.3-1.fc43.copr9878869.x86_64 --run-dwz --dwz-low-mem-die-limit 10000000 --dwz-max-die-limit 110000000 -S debugsourcefiles.list /builddir/build/BUILD/R-CRAN-TBRDist-1.0.3-build/TBRDist find-debuginfo: starting Extracting debug info from 1 files warning: Unsupported auto-load script at offset 0 in section .debug_gdb_scripts of file /builddir/build/BUILD/R-CRAN-TBRDist-1.0.3-build/BUILDROOT/usr/local/lib/R/library/TBRDist/libs/TBRDist.so. Use `info auto-load python-scripts [REGEXP]' to list them. DWARF-compressing 1 files sepdebugcrcfix: Updated 1 CRC32s, 0 CRC32s did match. Creating .debug symlinks for symlinks to ELF files Copying sources found by 'debugedit -l' to /usr/src/debug/R-CRAN-TBRDist-1.0.3-1.fc43.copr9878869.x86_64 find-debuginfo: done + /usr/lib/rpm/check-buildroot + /usr/lib/rpm/redhat/brp-ldconfig + /usr/lib/rpm/brp-compress + /usr/lib/rpm/redhat/brp-strip-lto /usr/bin/strip + /usr/lib/rpm/redhat/brp-mangle-shebangs + /usr/lib/rpm/brp-remove-la-files + /usr/lib/rpm/redhat/brp-python-rpm-in-distinfo + env /usr/lib/rpm/redhat/brp-python-bytecompile '' 1 0 -j4 + /usr/lib/rpm/redhat/brp-python-hardlink + /usr/bin/add-determinism --brp -j4 /builddir/build/BUILD/R-CRAN-TBRDist-1.0.3-build/BUILDROOT Handler jar skipped: jar handler requires $SOURCE_DATE_EPOCH to be set Handler gzip skipped: gzip handler requires $SOURCE_DATE_EPOCH to be set Handler zip skipped: zip handler requires $SOURCE_DATE_EPOCH to be set Scanned 28 directories and 50 files, processed 16 inodes, 0 modified (0 replaced + 0 rewritten), 0 unsupported format, 0 errors Reading /builddir/build/BUILD/R-CRAN-TBRDist-1.0.3-build/SPECPARTS/rpm-debuginfo.specpart Processing files: R-CRAN-TBRDist-1.0.3-1.fc43.copr9878869.x86_64 Provides: R-CRAN-TBRDist = 1.0.3-1.fc43.copr9878869 R-CRAN-TBRDist(x86-64) = 1.0.3-1.fc43.copr9878869 Requires(rpmlib): rpmlib(CompressedFileNames) <= 3.0.4-1 rpmlib(FileDigests) <= 4.6.0-1 rpmlib(PayloadFilesHavePrefix) <= 4.0-1 Requires: libR.so()(64bit) libc.so.6()(64bit) libc.so.6(GLIBC_2.11)(64bit) libc.so.6(GLIBC_2.14)(64bit) libc.so.6(GLIBC_2.2.5)(64bit) libc.so.6(GLIBC_2.38)(64bit) libc.so.6(GLIBC_2.4)(64bit) libc.so.6(GLIBC_ABI_DT_RELR)(64bit) libgcc_s.so.1()(64bit) libgcc_s.so.1(GCC_3.0)(64bit) libgcc_s.so.1(GCC_3.3.1)(64bit) libstdc++.so.6()(64bit) libstdc++.so.6(CXXABI_1.3)(64bit) libstdc++.so.6(CXXABI_1.3.9)(64bit) libstdc++.so.6(GLIBCXX_3.4)(64bit) libstdc++.so.6(GLIBCXX_3.4.11)(64bit) libstdc++.so.6(GLIBCXX_3.4.15)(64bit) libstdc++.so.6(GLIBCXX_3.4.20)(64bit) libstdc++.so.6(GLIBCXX_3.4.21)(64bit) libstdc++.so.6(GLIBCXX_3.4.26)(64bit) libstdc++.so.6(GLIBCXX_3.4.30)(64bit) libstdc++.so.6(GLIBCXX_3.4.32)(64bit) libstdc++.so.6(GLIBCXX_3.4.9)(64bit) rtld(GNU_HASH) Processing files: R-CRAN-TBRDist-debugsource-1.0.3-1.fc43.copr9878869.x86_64 Provides: R-CRAN-TBRDist-debugsource = 1.0.3-1.fc43.copr9878869 R-CRAN-TBRDist-debugsource(x86-64) = 1.0.3-1.fc43.copr9878869 Requires(rpmlib): rpmlib(CompressedFileNames) <= 3.0.4-1 rpmlib(FileDigests) <= 4.6.0-1 rpmlib(PayloadFilesHavePrefix) <= 4.0-1 Processing files: R-CRAN-TBRDist-debuginfo-1.0.3-1.fc43.copr9878869.x86_64 Provides: R-CRAN-TBRDist-debuginfo = 1.0.3-1.fc43.copr9878869 R-CRAN-TBRDist-debuginfo(x86-64) = 1.0.3-1.fc43.copr9878869 debuginfo(build-id) = e709b269d48b43693d0329fb58e50bb862619e98 Requires(rpmlib): rpmlib(CompressedFileNames) <= 3.0.4-1 rpmlib(FileDigests) <= 4.6.0-1 rpmlib(PayloadFilesHavePrefix) <= 4.0-1 Recommends: R-CRAN-TBRDist-debugsource(x86-64) = 1.0.3-1.fc43.copr9878869 Checking for unpackaged file(s): /usr/lib/rpm/check-files /builddir/build/BUILD/R-CRAN-TBRDist-1.0.3-build/BUILDROOT Wrote: /builddir/build/RPMS/R-CRAN-TBRDist-debugsource-1.0.3-1.fc43.copr9878869.x86_64.rpm Wrote: /builddir/build/RPMS/R-CRAN-TBRDist-1.0.3-1.fc43.copr9878869.x86_64.rpm Wrote: /builddir/build/RPMS/R-CRAN-TBRDist-debuginfo-1.0.3-1.fc43.copr9878869.x86_64.rpm Executing(rmbuild): /bin/sh -e /var/tmp/rpm-tmp.8krAg7 + umask 022 + cd /builddir/build/BUILD/R-CRAN-TBRDist-1.0.3-build + test -d /builddir/build/BUILD/R-CRAN-TBRDist-1.0.3-build + /usr/bin/chmod -Rf a+rX,u+w,g-w,o-w /builddir/build/BUILD/R-CRAN-TBRDist-1.0.3-build + rm -rf /builddir/build/BUILD/R-CRAN-TBRDist-1.0.3-build + RPM_EC=0 ++ jobs -p + exit 0 RPM build warnings: %source_date_epoch_from_changelog is set, but %changelog has no entries to take a date from Finish: rpmbuild R-CRAN-TBRDist-1.0.3-1.fc43.copr9878869.src.rpm Finish: build phase for R-CRAN-TBRDist-1.0.3-1.fc43.copr9878869.src.rpm INFO: chroot_scan: 1 files copied to /var/lib/copr-rpmbuild/results/chroot_scan INFO: /var/lib/mock/fedora-43-x86_64-1764990259.129745/root/var/log/dnf5.log INFO: chroot_scan: creating tarball /var/lib/copr-rpmbuild/results/chroot_scan.tar.gz /bin/tar: Removing leading `/' from member names INFO: Done(/var/lib/copr-rpmbuild/results/R-CRAN-TBRDist-1.0.3-1.fc43.copr9878869.src.rpm) Config(child) 0 minutes 41 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-TBRDist-debugsource", "epoch": null, "version": "1.0.3", "release": "1.fc43.copr9878869", "arch": "x86_64" }, { "name": "R-CRAN-TBRDist-debuginfo", "epoch": null, "version": "1.0.3", "release": "1.fc43.copr9878869", "arch": "x86_64" }, { "name": "R-CRAN-TBRDist", "epoch": null, "version": "1.0.3", "release": "1.fc43.copr9878869", "arch": "src" }, { "name": "R-CRAN-TBRDist", "epoch": null, "version": "1.0.3", "release": "1.fc43.copr9878869", "arch": "x86_64" } ] } RPMResults finished