https://launchpad.net/ubuntu/+archive/test-rebuild-20191220-focal/+build/18319570 RUN: /usr/share/launchpad-buildd/bin/builder-prep Kernel version: Linux bos02-arm64-045 4.4.0-170-generic #199-Ubuntu SMP Thu Nov 14 01:46:18 UTC 2019 aarch64 Buildd toolchain package versions: launchpad-buildd_183 python-lpbuildd_183 sbuild_0.67.0-2ubuntu7.1 bzr-builder_0.7.3+bzr174~ppa13~ubuntu14.10.1 bzr_2.7.0-2ubuntu3.1 git-build-recipe_0.3.6~git201906051340.ff11471~ubuntu16.04.1 git_1:2.7.4-0ubuntu1.7 dpkg-dev_1.18.4ubuntu1.6 python-debian_0.1.27ubuntu2. Syncing the system clock with the buildd NTP service... 5 Jan 13:48:04 ntpdate[1934]: adjust time server 10.211.37.1 offset 0.006247 sec RUN: /usr/share/launchpad-buildd/bin/in-target unpack-chroot --backend=chroot --series=focal --arch=armhf PACKAGEBUILD-18319570 --image-type chroot /home/buildd/filecache-default/f005b6164729459c78307140747b338a2f357aa2 Creating target for build PACKAGEBUILD-18319570 RUN: /usr/share/launchpad-buildd/bin/in-target mount-chroot --backend=chroot --series=focal --arch=armhf PACKAGEBUILD-18319570 Starting target for build PACKAGEBUILD-18319570 RUN: /usr/share/launchpad-buildd/bin/in-target override-sources-list --backend=chroot --series=focal --arch=armhf PACKAGEBUILD-18319570 'deb http://ftpmaster.internal/ubuntu focal main restricted universe multiverse' Overriding sources.list in build-PACKAGEBUILD-18319570 RUN: /usr/share/launchpad-buildd/bin/in-target update-debian-chroot --backend=chroot --series=focal --arch=armhf PACKAGEBUILD-18319570 Updating target for build PACKAGEBUILD-18319570 Get:1 http://ftpmaster.internal/ubuntu focal InRelease [255 kB] Get:2 http://ftpmaster.internal/ubuntu focal/main armhf Packages [931 kB] Get:3 http://ftpmaster.internal/ubuntu focal/main Translation-en [499 kB] Get:4 http://ftpmaster.internal/ubuntu focal/restricted armhf Packages [7048 B] Get:5 http://ftpmaster.internal/ubuntu focal/restricted Translation-en [5768 B] Get:6 http://ftpmaster.internal/ubuntu focal/universe armhf Packages [8423 kB] Get:7 http://ftpmaster.internal/ubuntu focal/universe Translation-en [5195 kB] Get:8 http://ftpmaster.internal/ubuntu focal/multiverse armhf Packages [123 kB] Get:9 http://ftpmaster.internal/ubuntu focal/multiverse Translation-en [110 kB] Fetched 15.5 MB in 12s (1337 kB/s) Reading package lists... Reading package lists... Building dependency tree... Reading state information... Calculating upgrade... The following packages were automatically installed and are no longer required: libhogweed4 libisl21 libnettle6 libperl5.28 perl-modules-5.28 Use 'sudo apt autoremove' to remove them. The following NEW packages will be installed: libhogweed5 libisl22 libnettle7 libperl5.30 perl-modules-5.30 The following packages will be upgraded: apt base-files base-passwd bash binutils binutils-arm-linux-gnueabihf binutils-common bsdutils bzip2 cpp-9 debianutils fdisk g++-9 gcc-9 gcc-9-base gpg gpg-agent gpgconf gpgv gzip hostname libacl1 libapparmor1 libapt-pkg5.90 libasan5 libatomic1 libattr1 libaudit-common libaudit1 libbinutils libblkid1 libbz2-1.0 libc-bin libc-dev-bin libc6 libc6-dev libcap-ng0 libcap2 libcc1-0 libcryptsetup12 libdebconfclient0 libdevmapper1.02.1 libfdisk1 libgcc-9-dev libgcc1 libgcrypt20 libgnutls30 libgomp1 libjson-c4 libkmod2 liblockfile-bin liblockfile1 liblz4-1 libmount1 libncurses6 libncursesw6 libp11-kit0 libpam-modules libpam-modules-bin libpam-runtime libpam0g libpcre2-8-0 libseccomp2 libselinux1 libsemanage-common libsemanage1 libsepol1 libsmartcols1 libsqlite3-0 libstdc++-9-dev libstdc++6 libsystemd0 libtasn1-6 libtinfo6 libubsan1 libudev1 libuuid1 libzstd1 linux-libc-dev lsb-base mount ncurses-base ncurses-bin perl perl-base sensible-utils systemd systemd-sysv sysvinit-utils util-linux 90 upgraded, 5 newly installed, 0 to remove and 0 not upgraded. Need to get 57.8 MB of archives. After this operation, 41.0 MB of additional disk space will be used. Get:1 http://ftpmaster.internal/ubuntu focal/main armhf libc6-dev armhf 2.30-0ubuntu3 [1943 kB] Get:2 http://ftpmaster.internal/ubuntu focal/main armhf libc-dev-bin armhf 2.30-0ubuntu3 [63.6 kB] Get:3 http://ftpmaster.internal/ubuntu focal/main armhf linux-libc-dev armhf 5.3.0-24.26 [1079 kB] Get:4 http://ftpmaster.internal/ubuntu focal/main armhf libisl22 armhf 0.22-2 [460 kB] Get:5 http://ftpmaster.internal/ubuntu focal/main armhf libcc1-0 armhf 9.2.1-21ubuntu1 [41.8 kB] Get:6 http://ftpmaster.internal/ubuntu focal/main armhf binutils-arm-linux-gnueabihf armhf 2.33.1-6ubuntu3 [2102 kB] Get:7 http://ftpmaster.internal/ubuntu focal/main armhf libbinutils armhf 2.33.1-6ubuntu3 [315 kB] Get:8 http://ftpmaster.internal/ubuntu focal/main armhf binutils-common armhf 2.33.1-6ubuntu3 [203 kB] Get:9 http://ftpmaster.internal/ubuntu focal/main armhf binutils armhf 2.33.1-6ubuntu3 [3352 B] Get:10 http://ftpmaster.internal/ubuntu focal/main armhf gcc-9-base armhf 9.2.1-21ubuntu1 [19.0 kB] Get:11 http://ftpmaster.internal/ubuntu focal/main armhf libgcc1 armhf 1:9.2.1-21ubuntu1 [37.4 kB] Get:12 http://ftpmaster.internal/ubuntu focal/main armhf libgomp1 armhf 9.2.1-21ubuntu1 [77.4 kB] Get:13 http://ftpmaster.internal/ubuntu focal/main armhf libatomic1 armhf 9.2.1-21ubuntu1 [7104 B] Get:14 http://ftpmaster.internal/ubuntu focal/main armhf libasan5 armhf 9.2.1-21ubuntu1 [387 kB] Get:15 http://ftpmaster.internal/ubuntu focal/main armhf libubsan1 armhf 9.2.1-21ubuntu1 [118 kB] Get:16 http://ftpmaster.internal/ubuntu focal/main armhf g++-9 armhf 9.2.1-21ubuntu1 [8541 kB] Get:17 http://ftpmaster.internal/ubuntu focal/main armhf libstdc++-9-dev armhf 9.2.1-21ubuntu1 [1777 kB] Get:18 http://ftpmaster.internal/ubuntu focal/main armhf libgcc-9-dev armhf 9.2.1-21ubuntu1 [690 kB] Get:19 http://ftpmaster.internal/ubuntu focal/main armhf gcc-9 armhf 9.2.1-21ubuntu1 [8073 kB] Get:20 http://ftpmaster.internal/ubuntu focal/main armhf cpp-9 armhf 9.2.1-21ubuntu1 [7470 kB] Get:21 http://ftpmaster.internal/ubuntu focal/main armhf libstdc++6 armhf 9.2.1-21ubuntu1 [451 kB] Get:22 http://ftpmaster.internal/ubuntu focal/main armhf libc6 armhf 2.30-0ubuntu3 [2144 kB] Get:23 http://ftpmaster.internal/ubuntu focal/main armhf base-files armhf 11ubuntu2 [59.8 kB] Get:24 http://ftpmaster.internal/ubuntu focal/main armhf debianutils armhf 4.9.1 [84.6 kB] Get:25 http://ftpmaster.internal/ubuntu focal/main armhf bash armhf 5.0-5ubuntu1 [576 kB] Get:26 http://ftpmaster.internal/ubuntu focal/main armhf bsdutils armhf 1:2.34-0.1ubuntu4 [58.4 kB] Get:27 http://ftpmaster.internal/ubuntu focal/main armhf gzip armhf 1.10-0ubuntu4 [91.1 kB] Get:28 http://ftpmaster.internal/ubuntu focal/main armhf hostname armhf 3.23 [10.4 kB] Get:29 http://ftpmaster.internal/ubuntu focal/main armhf ncurses-bin armhf 6.1+20191019-1ubuntu1 [163 kB] Get:30 http://ftpmaster.internal/ubuntu focal/main armhf perl-modules-5.30 all 5.30.0-9 [2739 kB] Get:31 http://ftpmaster.internal/ubuntu focal/main armhf libperl5.30 armhf 5.30.0-9 [3286 kB] Get:32 http://ftpmaster.internal/ubuntu focal/main armhf perl armhf 5.30.0-9 [224 kB] Get:33 http://ftpmaster.internal/ubuntu focal/main armhf perl-base armhf 5.30.0-9 [1408 kB] Get:34 http://ftpmaster.internal/ubuntu focal/main armhf bzip2 armhf 1.0.8-2 [32.4 kB] Get:35 http://ftpmaster.internal/ubuntu focal/main armhf libbz2-1.0 armhf 1.0.8-2 [31.0 kB] Get:36 http://ftpmaster.internal/ubuntu focal/main armhf libblkid1 armhf 2.34-0.1ubuntu4 [124 kB] Get:37 http://ftpmaster.internal/ubuntu focal/main armhf libuuid1 armhf 2.34-0.1ubuntu4 [19.8 kB] Get:38 http://ftpmaster.internal/ubuntu focal/main armhf libfdisk1 armhf 2.34-0.1ubuntu4 [163 kB] Get:39 http://ftpmaster.internal/ubuntu focal/main armhf libpcre2-8-0 armhf 10.34-7 [172 kB] Get:40 http://ftpmaster.internal/ubuntu focal/main armhf libselinux1 armhf 3.0-1 [60.1 kB] Get:41 http://ftpmaster.internal/ubuntu focal/main armhf libmount1 armhf 2.34-0.1ubuntu4 [135 kB] Get:42 http://ftpmaster.internal/ubuntu focal/main armhf libncurses6 armhf 6.1+20191019-1ubuntu1 [79.7 kB] Get:43 http://ftpmaster.internal/ubuntu focal/main armhf libtinfo6 armhf 6.1+20191019-1ubuntu1 [72.8 kB] Get:44 http://ftpmaster.internal/ubuntu focal/main armhf libncursesw6 armhf 6.1+20191019-1ubuntu1 [106 kB] Get:45 http://ftpmaster.internal/ubuntu focal/main armhf libsmartcols1 armhf 2.34-0.1ubuntu4 [89.1 kB] Get:46 http://ftpmaster.internal/ubuntu focal/main armhf fdisk armhf 2.34-0.1ubuntu4 [109 kB] Get:47 http://ftpmaster.internal/ubuntu focal/main armhf util-linux armhf 2.34-0.1ubuntu4 [959 kB] Get:48 http://ftpmaster.internal/ubuntu focal/main armhf libdebconfclient0 armhf 0.250ubuntu2 [5776 B] Get:49 http://ftpmaster.internal/ubuntu focal/main armhf base-passwd armhf 3.5.47 [46.4 kB] Get:50 http://ftpmaster.internal/ubuntu focal/main armhf libc-bin armhf 2.30-0ubuntu3 [496 kB] Get:51 http://ftpmaster.internal/ubuntu focal/main armhf ncurses-base all 6.1+20191019-1ubuntu1 [17.9 kB] Get:52 http://ftpmaster.internal/ubuntu focal/main armhf lsb-base all 11.1.0ubuntu2 [12.1 kB] Get:53 http://ftpmaster.internal/ubuntu focal/main armhf sysvinit-utils armhf 2.96-1ubuntu1 [19.2 kB] Get:54 http://ftpmaster.internal/ubuntu focal/main armhf liblz4-1 armhf 1.9.2-2 [51.7 kB] Get:55 http://ftpmaster.internal/ubuntu focal/main armhf systemd-sysv armhf 244-3ubuntu1 [9364 B] Get:56 http://ftpmaster.internal/ubuntu focal/main armhf libacl1 armhf 2.2.53-5ubuntu1 [15.8 kB] Get:57 http://ftpmaster.internal/ubuntu focal/main armhf libapparmor1 armhf 2.13.3-7ubuntu1 [29.4 kB] Get:58 http://ftpmaster.internal/ubuntu focal/main armhf libaudit-common all 1:2.8.5-2ubuntu5 [4076 B] Get:59 http://ftpmaster.internal/ubuntu focal/main armhf libcap-ng0 armhf 0.7.9-2.1 [9692 B] Get:60 http://ftpmaster.internal/ubuntu focal/main armhf libaudit1 armhf 1:2.8.5-2ubuntu5 [35.9 kB] Get:61 http://ftpmaster.internal/ubuntu focal/main armhf libcap2 armhf 1:2.27-1 [12.7 kB] Get:62 http://ftpmaster.internal/ubuntu focal/main armhf libudev1 armhf 244-3ubuntu1 [68.8 kB] Get:63 http://ftpmaster.internal/ubuntu focal/main armhf libdevmapper1.02.1 armhf 2:1.02.155-2ubuntu7 [118 kB] Get:64 http://ftpmaster.internal/ubuntu focal/main armhf libjson-c4 armhf 0.13.1+dfsg-6 [25.6 kB] Get:65 http://ftpmaster.internal/ubuntu focal/main armhf libcryptsetup12 armhf 2:2.2.2-1ubuntu1 [163 kB] Get:66 http://ftpmaster.internal/ubuntu focal/main armhf libnettle7 armhf 3.5.1+really3.5.1-2 [126 kB] Get:67 http://ftpmaster.internal/ubuntu focal/main armhf libhogweed5 armhf 3.5.1+really3.5.1-2 [127 kB] Get:68 http://ftpmaster.internal/ubuntu focal/main armhf libp11-kit0 armhf 0.23.18.1-2 [166 kB] Get:69 http://ftpmaster.internal/ubuntu focal/main armhf libtasn1-6 armhf 4.15.0-2 [33.0 kB] Get:70 http://ftpmaster.internal/ubuntu focal/main armhf libgnutls30 armhf 3.6.11.1-2 [732 kB] Get:71 http://ftpmaster.internal/ubuntu focal/main armhf libkmod2 armhf 26-3ubuntu1 [37.0 kB] Get:72 http://ftpmaster.internal/ubuntu focal/main armhf libpam0g armhf 1.3.1-5ubuntu4 [49.6 kB] Get:73 http://ftpmaster.internal/ubuntu focal/main armhf libseccomp2 armhf 2.4.2-2ubuntu1 [32.4 kB] Get:74 http://ftpmaster.internal/ubuntu focal/main armhf mount armhf 2.34-0.1ubuntu4 [108 kB] Get:75 http://ftpmaster.internal/ubuntu focal/main armhf systemd armhf 244-3ubuntu1 [3526 kB] Get:76 http://ftpmaster.internal/ubuntu focal/main armhf libsystemd0 armhf 244-3ubuntu1 [239 kB] Get:77 http://ftpmaster.internal/ubuntu focal/main armhf libzstd1 armhf 1.4.4+dfsg-1 [207 kB] Get:78 http://ftpmaster.internal/ubuntu focal/main armhf libapt-pkg5.90 armhf 1.9.5 [772 kB] Get:79 http://ftpmaster.internal/ubuntu focal/main armhf libgcrypt20 armhf 1.8.5-3ubuntu1 [364 kB] Get:80 http://ftpmaster.internal/ubuntu focal/main armhf gpgv armhf 2.2.17-3ubuntu1 [170 kB] Get:81 http://ftpmaster.internal/ubuntu focal/main armhf apt armhf 1.9.5 [1237 kB] Get:82 http://ftpmaster.internal/ubuntu focal/main armhf libpam-modules-bin armhf 1.3.1-5ubuntu4 [33.8 kB] Get:83 http://ftpmaster.internal/ubuntu focal/main armhf libpam-modules armhf 1.3.1-5ubuntu4 [232 kB] Get:84 http://ftpmaster.internal/ubuntu focal/main armhf libattr1 armhf 1:2.4.48-5 [11.5 kB] Get:85 http://ftpmaster.internal/ubuntu focal/main armhf libpam-runtime all 1.3.1-5ubuntu4 [37.3 kB] Get:86 http://ftpmaster.internal/ubuntu focal/main armhf libsepol1 armhf 3.0-1 [220 kB] Get:87 http://ftpmaster.internal/ubuntu focal/main armhf libsemanage-common all 3.0-1 [9880 B] Get:88 http://ftpmaster.internal/ubuntu focal/main armhf libsemanage1 armhf 3.0-1 [73.9 kB] Get:89 http://ftpmaster.internal/ubuntu focal/main armhf sensible-utils all 0.0.12+nmu1 [15.0 kB] Get:90 http://ftpmaster.internal/ubuntu focal/main armhf libsqlite3-0 armhf 3.30.1-1ubuntu1 [460 kB] Get:91 http://ftpmaster.internal/ubuntu focal/main armhf gpg armhf 2.2.17-3ubuntu1 [421 kB] Get:92 http://ftpmaster.internal/ubuntu focal/main armhf gpgconf armhf 2.2.17-3ubuntu1 [107 kB] Get:93 http://ftpmaster.internal/ubuntu focal/main armhf gpg-agent armhf 2.2.17-3ubuntu1 [195 kB] Get:94 http://ftpmaster.internal/ubuntu focal/main armhf liblockfile-bin armhf 1.16-1.1 [10.5 kB] Get:95 http://ftpmaster.internal/ubuntu focal/main armhf liblockfile1 armhf 1.16-1.1 [5620 B] debconf: delaying package configuration, since apt-utils is not installed Fetched 57.8 MB in 5s (12.8 MB/s) (Reading database ... 12487 files and directories currently installed.) Preparing to unpack .../0-libc6-dev_2.30-0ubuntu3_armhf.deb ... Unpacking libc6-dev:armhf (2.30-0ubuntu3) over (2.30-0ubuntu2) ... Preparing to unpack .../1-libc-dev-bin_2.30-0ubuntu3_armhf.deb ... Unpacking libc-dev-bin (2.30-0ubuntu3) over (2.30-0ubuntu2) ... Preparing to unpack .../2-linux-libc-dev_5.3.0-24.26_armhf.deb ... Unpacking linux-libc-dev:armhf (5.3.0-24.26) over (5.3.0-18.19) ... Selecting previously unselected package libisl22:armhf. Preparing to unpack .../3-libisl22_0.22-2_armhf.deb ... Unpacking libisl22:armhf (0.22-2) ... Preparing to unpack .../4-libcc1-0_9.2.1-21ubuntu1_armhf.deb ... Unpacking libcc1-0:armhf (9.2.1-21ubuntu1) over (9.2.1-9ubuntu2) ... Preparing to unpack .../5-binutils-arm-linux-gnueabihf_2.33.1-6ubuntu3_armhf.deb ... Unpacking binutils-arm-linux-gnueabihf (2.33.1-6ubuntu3) over (2.33-2ubuntu1) ... Preparing to unpack .../6-libbinutils_2.33.1-6ubuntu3_armhf.deb ... Unpacking libbinutils:armhf (2.33.1-6ubuntu3) over (2.33-2ubuntu1) ... Preparing to unpack .../7-binutils-common_2.33.1-6ubuntu3_armhf.deb ... Unpacking binutils-common:armhf (2.33.1-6ubuntu3) over (2.33-2ubuntu1) ... Preparing to unpack .../8-binutils_2.33.1-6ubuntu3_armhf.deb ... Unpacking binutils (2.33.1-6ubuntu3) over (2.33-2ubuntu1) ... Preparing to unpack .../9-gcc-9-base_9.2.1-21ubuntu1_armhf.deb ... Unpacking gcc-9-base:armhf (9.2.1-21ubuntu1) over (9.2.1-9ubuntu2) ... Setting up gcc-9-base:armhf (9.2.1-21ubuntu1) ... (Reading database ... 12493 files and directories currently installed.) Preparing to unpack .../libgcc1_1%3a9.2.1-21ubuntu1_armhf.deb ... Unpacking libgcc1:armhf (1:9.2.1-21ubuntu1) over (1:9.2.1-9ubuntu2) ... Setting up libgcc1:armhf (1:9.2.1-21ubuntu1) ... (Reading database ... 12493 files and directories currently installed.) Preparing to unpack .../0-libgomp1_9.2.1-21ubuntu1_armhf.deb ... Unpacking libgomp1:armhf (9.2.1-21ubuntu1) over (9.2.1-9ubuntu2) ... Preparing to unpack .../1-libatomic1_9.2.1-21ubuntu1_armhf.deb ... Unpacking libatomic1:armhf (9.2.1-21ubuntu1) over (9.2.1-9ubuntu2) ... Preparing to unpack .../2-libasan5_9.2.1-21ubuntu1_armhf.deb ... Unpacking libasan5:armhf (9.2.1-21ubuntu1) over (9.2.1-9ubuntu2) ... Preparing to unpack .../3-libubsan1_9.2.1-21ubuntu1_armhf.deb ... Unpacking libubsan1:armhf (9.2.1-21ubuntu1) over (9.2.1-9ubuntu2) ... Preparing to unpack .../4-g++-9_9.2.1-21ubuntu1_armhf.deb ... Unpacking g++-9 (9.2.1-21ubuntu1) over (9.2.1-9ubuntu2) ... Preparing to unpack .../5-libstdc++-9-dev_9.2.1-21ubuntu1_armhf.deb ... Unpacking libstdc++-9-dev:armhf (9.2.1-21ubuntu1) over (9.2.1-9ubuntu2) ... Preparing to unpack .../6-libgcc-9-dev_9.2.1-21ubuntu1_armhf.deb ... Unpacking libgcc-9-dev:armhf (9.2.1-21ubuntu1) over (9.2.1-9ubuntu2) ... Preparing to unpack .../7-gcc-9_9.2.1-21ubuntu1_armhf.deb ... Unpacking gcc-9 (9.2.1-21ubuntu1) over (9.2.1-9ubuntu2) ... Preparing to unpack .../8-cpp-9_9.2.1-21ubuntu1_armhf.deb ... Unpacking cpp-9 (9.2.1-21ubuntu1) over (9.2.1-9ubuntu2) ... Preparing to unpack .../9-libstdc++6_9.2.1-21ubuntu1_armhf.deb ... Unpacking libstdc++6:armhf (9.2.1-21ubuntu1) over (9.2.1-9ubuntu2) ... Setting up libstdc++6:armhf (9.2.1-21ubuntu1) ... (Reading database ... 12493 files and directories currently installed.) Preparing to unpack .../libc6_2.30-0ubuntu3_armhf.deb ... Unpacking libc6:armhf (2.30-0ubuntu3) over (2.30-0ubuntu2) ... Setting up libc6:armhf (2.30-0ubuntu3) ... (Reading database ... 12493 files and directories currently installed.) Preparing to unpack .../base-files_11ubuntu2_armhf.deb ... Unpacking base-files (11ubuntu2) over (10.2ubuntu7) ... Setting up base-files (11ubuntu2) ... Installing new version of config file /etc/debian_version ... Installing new version of config file /etc/issue ... Installing new version of config file /etc/issue.net ... Installing new version of config file /etc/lsb-release ... Installing new version of config file /etc/update-motd.d/50-motd-news ... Updating /root/.profile to current default. (Reading database ... 12493 files and directories currently installed.) Preparing to unpack .../debianutils_4.9.1_armhf.deb ... Unpacking debianutils (4.9.1) over (4.8.6.3) ... Setting up debianutils (4.9.1) ... (Reading database ... 12493 files and directories currently installed.) Preparing to unpack .../bash_5.0-5ubuntu1_armhf.deb ... Unpacking bash (5.0-5ubuntu1) over (5.0-4ubuntu1) ... Setting up bash (5.0-5ubuntu1) ... update-alternatives: using /usr/share/man/man7/bash-builtins.7.gz to provide /usr/share/man/man7/builtins.7.gz (builtins.7.gz) in auto mode (Reading database ... 12493 files and directories currently installed.) Preparing to unpack .../bsdutils_1%3a2.34-0.1ubuntu4_armhf.deb ... Unpacking bsdutils (1:2.34-0.1ubuntu4) over (1:2.34-0.1ubuntu2) ... Setting up bsdutils (1:2.34-0.1ubuntu4) ... (Reading database ... 12493 files and directories currently installed.) Preparing to unpack .../gzip_1.10-0ubuntu4_armhf.deb ... Unpacking gzip (1.10-0ubuntu4) over (1.10-0ubuntu3) ... Setting up gzip (1.10-0ubuntu4) ... (Reading database ... 12493 files and directories currently installed.) Preparing to unpack .../hostname_3.23_armhf.deb ... Unpacking hostname (3.23) over (3.22) ... Setting up hostname (3.23) ... (Reading database ... 12493 files and directories currently installed.) Preparing to unpack .../ncurses-bin_6.1+20191019-1ubuntu1_armhf.deb ... Unpacking ncurses-bin (6.1+20191019-1ubuntu1) over (6.1+20190803-1ubuntu1) ... Setting up ncurses-bin (6.1+20191019-1ubuntu1) ... (Reading database ... 12493 files and directories currently installed.) Preparing to unpack .../perl_5.30.0-9_armhf.deb ... Unpacking perl (5.30.0-9) over (5.28.1-6build1) ... Replacing files in old package perl-base (5.28.1-6build1) ... Selecting previously unselected package perl-modules-5.30. Preparing to unpack .../perl-modules-5.30_5.30.0-9_all.deb ... Unpacking perl-modules-5.30 (5.30.0-9) ... Selecting previously unselected package libperl5.30:armhf. Preparing to unpack .../libperl5.30_5.30.0-9_armhf.deb ... Unpacking libperl5.30:armhf (5.30.0-9) ... Preparing to unpack .../perl-base_5.30.0-9_armhf.deb ... Unpacking perl-base (5.30.0-9) over (5.28.1-6build1) ... Setting up perl-base (5.30.0-9) ... (Reading database ... 14394 files and directories currently installed.) Preparing to unpack .../bzip2_1.0.8-2_armhf.deb ... Unpacking bzip2 (1.0.8-2) over (1.0.6-9.2) ... Preparing to unpack .../libbz2-1.0_1.0.8-2_armhf.deb ... Unpacking libbz2-1.0:armhf (1.0.8-2) over (1.0.6-9.2) ... Setting up libbz2-1.0:armhf (1.0.8-2) ... (Reading database ... 14394 files and directories currently installed.) Preparing to unpack .../libblkid1_2.34-0.1ubuntu4_armhf.deb ... Unpacking libblkid1:armhf (2.34-0.1ubuntu4) over (2.34-0.1ubuntu2) ... Setting up libblkid1:armhf (2.34-0.1ubuntu4) ... (Reading database ... 14394 files and directories currently installed.) Preparing to unpack .../libuuid1_2.34-0.1ubuntu4_armhf.deb ... Unpacking libuuid1:armhf (2.34-0.1ubuntu4) over (2.34-0.1ubuntu2) ... Setting up libuuid1:armhf (2.34-0.1ubuntu4) ... (Reading database ... 14394 files and directories currently installed.) Preparing to unpack .../libfdisk1_2.34-0.1ubuntu4_armhf.deb ... Unpacking libfdisk1:armhf (2.34-0.1ubuntu4) over (2.34-0.1ubuntu2) ... Setting up libfdisk1:armhf (2.34-0.1ubuntu4) ... (Reading database ... 14394 files and directories currently installed.) Preparing to unpack .../libpcre2-8-0_10.34-7_armhf.deb ... Unpacking libpcre2-8-0:armhf (10.34-7) over (10.32-5) ... Setting up libpcre2-8-0:armhf (10.34-7) ... (Reading database ... 14394 files and directories currently installed.) Preparing to unpack .../libselinux1_3.0-1_armhf.deb ... Unpacking libselinux1:armhf (3.0-1) over (2.9-2) ... Setting up libselinux1:armhf (3.0-1) ... (Reading database ... 14394 files and directories currently installed.) Preparing to unpack .../libmount1_2.34-0.1ubuntu4_armhf.deb ... Unpacking libmount1:armhf (2.34-0.1ubuntu4) over (2.34-0.1ubuntu2) ... Setting up libmount1:armhf (2.34-0.1ubuntu4) ... (Reading database ... 14394 files and directories currently installed.) Preparing to unpack .../libncurses6_6.1+20191019-1ubuntu1_armhf.deb ... Unpacking libncurses6:armhf (6.1+20191019-1ubuntu1) over (6.1+20190803-1ubuntu1) ... Preparing to unpack .../libtinfo6_6.1+20191019-1ubuntu1_armhf.deb ... Unpacking libtinfo6:armhf (6.1+20191019-1ubuntu1) over (6.1+20190803-1ubuntu1) ... Setting up libtinfo6:armhf (6.1+20191019-1ubuntu1) ... (Reading database ... 14394 files and directories currently installed.) Preparing to unpack .../libncursesw6_6.1+20191019-1ubuntu1_armhf.deb ... Unpacking libncursesw6:armhf (6.1+20191019-1ubuntu1) over (6.1+20190803-1ubuntu1) ... Setting up libncursesw6:armhf (6.1+20191019-1ubuntu1) ... (Reading database ... 14394 files and directories currently installed.) Preparing to unpack .../libsmartcols1_2.34-0.1ubuntu4_armhf.deb ... Unpacking libsmartcols1:armhf (2.34-0.1ubuntu4) over (2.34-0.1ubuntu2) ... Setting up libsmartcols1:armhf (2.34-0.1ubuntu4) ... (Reading database ... 14394 files and directories currently installed.) Preparing to unpack .../fdisk_2.34-0.1ubuntu4_armhf.deb ... Unpacking fdisk (2.34-0.1ubuntu4) over (2.34-0.1ubuntu2) ... Setting up fdisk (2.34-0.1ubuntu4) ... (Reading database ... 14394 files and directories currently installed.) Preparing to unpack .../util-linux_2.34-0.1ubuntu4_armhf.deb ... Unpacking util-linux (2.34-0.1ubuntu4) over (2.34-0.1ubuntu2) ... Setting up util-linux (2.34-0.1ubuntu4) ... (Reading database ... 14394 files and directories currently installed.) Preparing to unpack .../libdebconfclient0_0.250ubuntu2_armhf.deb ... Unpacking libdebconfclient0:armhf (0.250ubuntu2) over (0.249ubuntu1) ... Setting up libdebconfclient0:armhf (0.250ubuntu2) ... (Reading database ... 14394 files and directories currently installed.) Preparing to unpack .../base-passwd_3.5.47_armhf.deb ... Unpacking base-passwd (3.5.47) over (3.5.46) ... Setting up base-passwd (3.5.47) ... (Reading database ... 14394 files and directories currently installed.) Preparing to unpack .../libc-bin_2.30-0ubuntu3_armhf.deb ... Unpacking libc-bin (2.30-0ubuntu3) over (2.30-0ubuntu2) ... Setting up libc-bin (2.30-0ubuntu3) ... (Reading database ... 14394 files and directories currently installed.) Preparing to unpack .../ncurses-base_6.1+20191019-1ubuntu1_all.deb ... Unpacking ncurses-base (6.1+20191019-1ubuntu1) over (6.1+20190803-1ubuntu1) ... Setting up ncurses-base (6.1+20191019-1ubuntu1) ... (Reading database ... 14394 files and directories currently installed.) Preparing to unpack .../lsb-base_11.1.0ubuntu2_all.deb ... Unpacking lsb-base (11.1.0ubuntu2) over (11.0.1ubuntu1) ... Setting up lsb-base (11.1.0ubuntu2) ... (Reading database ... 14393 files and directories currently installed.) Preparing to unpack .../sysvinit-utils_2.96-1ubuntu1_armhf.deb ... Unpacking sysvinit-utils (2.96-1ubuntu1) over (2.95-5ubuntu2) ... Setting up sysvinit-utils (2.96-1ubuntu1) ... (Reading database ... 14393 files and directories currently installed.) Preparing to unpack .../liblz4-1_1.9.2-2_armhf.deb ... Unpacking liblz4-1:armhf (1.9.2-2) over (1.9.1-1) ... Setting up liblz4-1:armhf (1.9.2-2) ... (Reading database ... 14393 files and directories currently installed.) Preparing to unpack .../systemd-sysv_244-3ubuntu1_armhf.deb ... Unpacking systemd-sysv (244-3ubuntu1) over (242-7ubuntu3) ... Preparing to unpack .../libacl1_2.2.53-5ubuntu1_armhf.deb ... Unpacking libacl1:armhf (2.2.53-5ubuntu1) over (2.2.53-4) ... Setting up libacl1:armhf (2.2.53-5ubuntu1) ... (Reading database ... 14393 files and directories currently installed.) Preparing to unpack .../libapparmor1_2.13.3-7ubuntu1_armhf.deb ... Unpacking libapparmor1:armhf (2.13.3-7ubuntu1) over (2.13.3-5ubuntu1) ... Preparing to unpack .../libaudit-common_1%3a2.8.5-2ubuntu5_all.deb ... Unpacking libaudit-common (1:2.8.5-2ubuntu5) over (1:2.8.5-2ubuntu1) ... Setting up libaudit-common (1:2.8.5-2ubuntu5) ... (Reading database ... 14393 files and directories currently installed.) Preparing to unpack .../libcap-ng0_0.7.9-2.1_armhf.deb ... Unpacking libcap-ng0:armhf (0.7.9-2.1) over (0.7.9-2) ... Setting up libcap-ng0:armhf (0.7.9-2.1) ... (Reading database ... 14393 files and directories currently installed.) Preparing to unpack .../libaudit1_1%3a2.8.5-2ubuntu5_armhf.deb ... Unpacking libaudit1:armhf (1:2.8.5-2ubuntu5) over (1:2.8.5-2ubuntu1) ... Setting up libaudit1:armhf (1:2.8.5-2ubuntu5) ... (Reading database ... 14393 files and directories currently installed.) Preparing to unpack .../libcap2_1%3a2.27-1_armhf.deb ... Unpacking libcap2:armhf (1:2.27-1) over (1:2.25-2) ... Preparing to unpack .../libudev1_244-3ubuntu1_armhf.deb ... Unpacking libudev1:armhf (244-3ubuntu1) over (242-7ubuntu3) ... Setting up libudev1:armhf (244-3ubuntu1) ... (Reading database ... 14393 files and directories currently installed.) Preparing to unpack .../libdevmapper1.02.1_2%3a1.02.155-2ubuntu7_armhf.deb ... Unpacking libdevmapper1.02.1:armhf (2:1.02.155-2ubuntu7) over (2:1.02.155-2ubuntu6) ... Preparing to unpack .../libjson-c4_0.13.1+dfsg-6_armhf.deb ... Unpacking libjson-c4:armhf (0.13.1+dfsg-6) over (0.13.1+dfsg-4) ... Preparing to unpack .../libcryptsetup12_2%3a2.2.2-1ubuntu1_armhf.deb ... Unpacking libcryptsetup12:armhf (2:2.2.2-1ubuntu1) over (2:2.2.0-3ubuntu1) ... Selecting previously unselected package libnettle7:armhf. Preparing to unpack .../libnettle7_3.5.1+really3.5.1-2_armhf.deb ... Unpacking libnettle7:armhf (3.5.1+really3.5.1-2) ... Setting up libnettle7:armhf (3.5.1+really3.5.1-2) ... Selecting previously unselected package libhogweed5:armhf. (Reading database ... 14400 files and directories currently installed.) Preparing to unpack .../libhogweed5_3.5.1+really3.5.1-2_armhf.deb ... Unpacking libhogweed5:armhf (3.5.1+really3.5.1-2) ... Setting up libhogweed5:armhf (3.5.1+really3.5.1-2) ... (Reading database ... 14403 files and directories currently installed.) Preparing to unpack .../libp11-kit0_0.23.18.1-2_armhf.deb ... Unpacking libp11-kit0:armhf (0.23.18.1-2) over (0.23.17-2) ... Setting up libp11-kit0:armhf (0.23.18.1-2) ... (Reading database ... 14403 files and directories currently installed.) Preparing to unpack .../libtasn1-6_4.15.0-2_armhf.deb ... Unpacking libtasn1-6:armhf (4.15.0-2) over (4.14-3) ... Setting up libtasn1-6:armhf (4.15.0-2) ... (Reading database ... 14403 files and directories currently installed.) Preparing to unpack .../libgnutls30_3.6.11.1-2_armhf.deb ... Unpacking libgnutls30:armhf (3.6.11.1-2) over (3.6.9-5ubuntu1) ... Setting up libgnutls30:armhf (3.6.11.1-2) ... (Reading database ... 14402 files and directories currently installed.) Preparing to unpack .../libkmod2_26-3ubuntu1_armhf.deb ... Unpacking libkmod2:armhf (26-3ubuntu1) over (26-1ubuntu1) ... Preparing to unpack .../libpam0g_1.3.1-5ubuntu4_armhf.deb ... Unpacking libpam0g:armhf (1.3.1-5ubuntu4) over (1.3.1-5ubuntu1) ... Setting up libpam0g:armhf (1.3.1-5ubuntu4) ... (Reading database ... 14402 files and directories currently installed.) Preparing to unpack .../libseccomp2_2.4.2-2ubuntu1_armhf.deb ... Unpacking libseccomp2:armhf (2.4.2-2ubuntu1) over (2.4.1-0ubuntu0.19.10.3) ... Setting up libseccomp2:armhf (2.4.2-2ubuntu1) ... (Reading database ... 14402 files and directories currently installed.) Preparing to unpack .../mount_2.34-0.1ubuntu4_armhf.deb ... Unpacking mount (2.34-0.1ubuntu4) over (2.34-0.1ubuntu2) ... Preparing to unpack .../systemd_244-3ubuntu1_armhf.deb ... Unpacking systemd (244-3ubuntu1) over (242-7ubuntu3) ... Preparing to unpack .../libsystemd0_244-3ubuntu1_armhf.deb ... Unpacking libsystemd0:armhf (244-3ubuntu1) over (242-7ubuntu3) ... Setting up libsystemd0:armhf (244-3ubuntu1) ... (Reading database ... 14395 files and directories currently installed.) Preparing to unpack .../libzstd1_1.4.4+dfsg-1_armhf.deb ... Unpacking libzstd1:armhf (1.4.4+dfsg-1) over (1.4.3+dfsg-1) ... Setting up libzstd1:armhf (1.4.4+dfsg-1) ... (Reading database ... 14395 files and directories currently installed.) Preparing to unpack .../libapt-pkg5.90_1.9.5_armhf.deb ... Unpacking libapt-pkg5.90:armhf (1.9.5) over (1.9.4) ... Setting up libapt-pkg5.90:armhf (1.9.5) ... (Reading database ... 14395 files and directories currently installed.) Preparing to unpack .../libgcrypt20_1.8.5-3ubuntu1_armhf.deb ... Unpacking libgcrypt20:armhf (1.8.5-3ubuntu1) over (1.8.4-5ubuntu2) ... Setting up libgcrypt20:armhf (1.8.5-3ubuntu1) ... (Reading database ... 14395 files and directories currently installed.) Preparing to unpack .../gpgv_2.2.17-3ubuntu1_armhf.deb ... Unpacking gpgv (2.2.17-3ubuntu1) over (2.2.12-1ubuntu3) ... Setting up gpgv (2.2.17-3ubuntu1) ... (Reading database ... 14395 files and directories currently installed.) Preparing to unpack .../archives/apt_1.9.5_armhf.deb ... Unpacking apt (1.9.5) over (1.9.4) ... Setting up apt (1.9.5) ... (Reading database ... 14395 files and directories currently installed.) Preparing to unpack .../libpam-modules-bin_1.3.1-5ubuntu4_armhf.deb ... Unpacking libpam-modules-bin (1.3.1-5ubuntu4) over (1.3.1-5ubuntu1) ... Setting up libpam-modules-bin (1.3.1-5ubuntu4) ... (Reading database ... 14395 files and directories currently installed.) Preparing to unpack .../libpam-modules_1.3.1-5ubuntu4_armhf.deb ... Unpacking libpam-modules:armhf (1.3.1-5ubuntu4) over (1.3.1-5ubuntu1) ... Setting up libpam-modules:armhf (1.3.1-5ubuntu4) ... (Reading database ... 14395 files and directories currently installed.) Preparing to unpack .../libattr1_1%3a2.4.48-5_armhf.deb ... Unpacking libattr1:armhf (1:2.4.48-5) over (1:2.4.48-4) ... Setting up libattr1:armhf (1:2.4.48-5) ... (Reading database ... 14395 files and directories currently installed.) Preparing to unpack .../libpam-runtime_1.3.1-5ubuntu4_all.deb ... Unpacking libpam-runtime (1.3.1-5ubuntu4) over (1.3.1-5ubuntu1) ... Setting up libpam-runtime (1.3.1-5ubuntu4) ... (Reading database ... 14395 files and directories currently installed.) Preparing to unpack .../libsepol1_3.0-1_armhf.deb ... Unpacking libsepol1:armhf (3.0-1) over (2.9-2) ... Setting up libsepol1:armhf (3.0-1) ... (Reading database ... 14395 files and directories currently installed.) Preparing to unpack .../libsemanage-common_3.0-1_all.deb ... Unpacking libsemanage-common (3.0-1) over (2.9-3) ... Setting up libsemanage-common (3.0-1) ... (Reading database ... 14395 files and directories currently installed.) Preparing to unpack .../libsemanage1_3.0-1_armhf.deb ... Unpacking libsemanage1:armhf (3.0-1) over (2.9-3) ... Setting up libsemanage1:armhf (3.0-1) ... (Reading database ... 14395 files and directories currently installed.) Preparing to unpack .../0-sensible-utils_0.0.12+nmu1_all.deb ... Unpacking sensible-utils (0.0.12+nmu1) over (0.0.12) ... Preparing to unpack .../1-libsqlite3-0_3.30.1-1ubuntu1_armhf.deb ... Unpacking libsqlite3-0:armhf (3.30.1-1ubuntu1) over (3.29.0-2) ... Preparing to unpack .../2-gpg_2.2.17-3ubuntu1_armhf.deb ... Unpacking gpg (2.2.17-3ubuntu1) over (2.2.12-1ubuntu3) ... Preparing to unpack .../3-gpgconf_2.2.17-3ubuntu1_armhf.deb ... Unpacking gpgconf (2.2.17-3ubuntu1) over (2.2.12-1ubuntu3) ... Preparing to unpack .../4-gpg-agent_2.2.17-3ubuntu1_armhf.deb ... Unpacking gpg-agent (2.2.17-3ubuntu1) over (2.2.12-1ubuntu3) ... Preparing to unpack .../5-liblockfile-bin_1.16-1.1_armhf.deb ... Unpacking liblockfile-bin (1.16-1.1) over (1.15-1) ... Preparing to unpack .../6-liblockfile1_1.16-1.1_armhf.deb ... Unpacking liblockfile1:armhf (1.16-1.1) over (1.15-1) ... Setting up libapparmor1:armhf (2.13.3-7ubuntu1) ... Setting up liblockfile-bin (1.16-1.1) ... Setting up perl-modules-5.30 (5.30.0-9) ... Setting up libsqlite3-0:armhf (3.30.1-1ubuntu1) ... Setting up binutils-common:armhf (2.33.1-6ubuntu3) ... Setting up linux-libc-dev:armhf (5.3.0-24.26) ... Setting up libgomp1:armhf (9.2.1-21ubuntu1) ... Setting up bzip2 (1.0.8-2) ... Setting up libcap2:armhf (1:2.27-1) ... Setting up libasan5:armhf (9.2.1-21ubuntu1) ... Setting up libncurses6:armhf (6.1+20191019-1ubuntu1) ... Setting up libatomic1:armhf (9.2.1-21ubuntu1) ... Setting up libubsan1:armhf (9.2.1-21ubuntu1) ... Setting up libdevmapper1.02.1:armhf (2:1.02.155-2ubuntu7) ... Setting up mount (2.34-0.1ubuntu4) ... Setting up sensible-utils (0.0.12+nmu1) ... Setting up gpgconf (2.2.17-3ubuntu1) ... Setting up libperl5.30:armhf (5.30.0-9) ... Setting up libisl22:armhf (0.22-2) ... Setting up liblockfile1:armhf (1.16-1.1) ... Setting up libjson-c4:armhf (0.13.1+dfsg-6) ... Setting up libbinutils:armhf (2.33.1-6ubuntu3) ... Setting up libc-dev-bin (2.30-0ubuntu3) ... Setting up binutils-arm-linux-gnueabihf (2.33.1-6ubuntu3) ... Setting up libcc1-0:armhf (9.2.1-21ubuntu1) ... Setting up gpg (2.2.17-3ubuntu1) ... Setting up libkmod2:armhf (26-3ubuntu1) ... Setting up gpg-agent (2.2.17-3ubuntu1) ... Installing new version of config file /etc/logcheck/ignore.d.server/gpg-agent ... Created symlink /etc/systemd/user/sockets.target.wants/gpg-agent-browser.socket -> /usr/lib/systemd/user/gpg-agent-browser.socket. Created symlink /etc/systemd/user/sockets.target.wants/gpg-agent-extra.socket -> /usr/lib/systemd/user/gpg-agent-extra.socket. Created symlink /etc/systemd/user/sockets.target.wants/gpg-agent-ssh.socket -> /usr/lib/systemd/user/gpg-agent-ssh.socket. Created symlink /etc/systemd/user/sockets.target.wants/gpg-agent.socket -> /usr/lib/systemd/user/gpg-agent.socket. Setting up binutils (2.33.1-6ubuntu3) ... Setting up libgcc-9-dev:armhf (9.2.1-21ubuntu1) ... Setting up perl (5.30.0-9) ... Setting up cpp-9 (9.2.1-21ubuntu1) ... Setting up libc6-dev:armhf (2.30-0ubuntu3) ... Setting up libcryptsetup12:armhf (2:2.2.2-1ubuntu1) ... Setting up gcc-9 (9.2.1-21ubuntu1) ... Setting up libstdc++-9-dev:armhf (9.2.1-21ubuntu1) ... Setting up systemd (244-3ubuntu1) ... Installing new version of config file /etc/dhcp/dhclient-enter-hooks.d/resolved ... Installing new version of config file /etc/systemd/networkd.conf ... Installing new version of config file /etc/systemd/system.conf ... Installing new version of config file /etc/systemd/user.conf ... Initializing machine ID from KVM UUID. Setting up g++-9 (9.2.1-21ubuntu1) ... Setting up systemd-sysv (244-3ubuntu1) ... Processing triggers for libc-bin (2.30-0ubuntu3) ... RUN: /usr/share/launchpad-buildd/bin/sbuild-package PACKAGEBUILD-18319570 armhf focal -c chroot:build-PACKAGEBUILD-18319570 --arch=armhf --dist=focal --nolog liblemon_1.3.1+dfsg-2.dsc Initiating build PACKAGEBUILD-18319570 with 4 jobs across 4 processor cores. Kernel reported to sbuild: 4.4.0-170-generic #199-Ubuntu SMP Thu Nov 14 01:46:18 UTC 2019 armv7l sbuild (Debian sbuild) 0.67.0 (26 Dec 2015) on bos02-arm64-045.buildd +==============================================================================+ | liblemon 1.3.1+dfsg-2 (armhf) 05 Jan 2020 13:49 | +==============================================================================+ Package: liblemon Version: 1.3.1+dfsg-2 Source Version: 1.3.1+dfsg-2 Distribution: focal Machine Architecture: arm64 Host Architecture: armhf Build Architecture: armhf I: NOTICE: Log filtering will replace 'build/liblemon-TxcRmz/liblemon-1.3.1+dfsg' with '<>' I: NOTICE: Log filtering will replace 'build/liblemon-TxcRmz' with '<>' I: NOTICE: Log filtering will replace 'home/buildd/build-PACKAGEBUILD-18319570/chroot-autobuild' with '<>' +------------------------------------------------------------------------------+ | Fetch source files | +------------------------------------------------------------------------------+ Local sources ------------- liblemon_1.3.1+dfsg-2.dsc exists in .; copying to chroot Check architectures ------------------- Check dependencies ------------------ Merged Build-Depends: build-essential, fakeroot Filtered Build-Depends: build-essential, fakeroot dpkg-deb: building package 'sbuild-build-depends-core-dummy' in '/<>/resolver-tK_Slo/apt_archive/sbuild-build-depends-core-dummy.deb'. Ign:1 copy:/<>/resolver-tK_Slo/apt_archive ./ InRelease Get:2 copy:/<>/resolver-tK_Slo/apt_archive ./ Release [2119 B] Ign:3 copy:/<>/resolver-tK_Slo/apt_archive ./ Release.gpg Get:4 copy:/<>/resolver-tK_Slo/apt_archive ./ Sources [214 B] Get:5 copy:/<>/resolver-tK_Slo/apt_archive ./ Packages [525 B] Fetched 2858 B in 0s (112 kB/s) Reading package lists... Reading package lists... +------------------------------------------------------------------------------+ | Install core build dependencies (apt-based resolver) | +------------------------------------------------------------------------------+ Installing build dependencies Reading package lists... Building dependency tree... Reading state information... The following packages were automatically installed and are no longer required: libhogweed4 libisl21 libnettle6 libperl5.28 perl-modules-5.28 Use 'apt autoremove' to remove them. The following NEW packages will be installed: sbuild-build-depends-core-dummy 0 upgraded, 1 newly installed, 0 to remove and 0 not upgraded. Need to get 852 B of archives. After this operation, 0 B of additional disk space will be used. Get:1 copy:/<>/resolver-tK_Slo/apt_archive ./ sbuild-build-depends-core-dummy 0.invalid.0 [852 B] debconf: delaying package configuration, since apt-utils is not installed Fetched 852 B in 0s (0 B/s) Selecting previously unselected package sbuild-build-depends-core-dummy. (Reading database ... 14395 files and directories currently installed.) Preparing to unpack .../sbuild-build-depends-core-dummy_0.invalid.0_armhf.deb ... Unpacking sbuild-build-depends-core-dummy (0.invalid.0) ... Setting up sbuild-build-depends-core-dummy (0.invalid.0) ... Merged Build-Depends: debhelper (>= 11~), cmake, d-shlibs, libglpk-dev, python, doxygen, graphviz, libjs-mathjax, ghostscript Filtered Build-Depends: debhelper (>= 11~), cmake, d-shlibs, libglpk-dev, python, doxygen, graphviz, libjs-mathjax, ghostscript dpkg-deb: building package 'sbuild-build-depends-liblemon-dummy' in '/<>/resolver-PqbVFU/apt_archive/sbuild-build-depends-liblemon-dummy.deb'. Ign:1 copy:/<>/resolver-PqbVFU/apt_archive ./ InRelease Get:2 copy:/<>/resolver-PqbVFU/apt_archive ./ Release [2119 B] Ign:3 copy:/<>/resolver-PqbVFU/apt_archive ./ Release.gpg Get:4 copy:/<>/resolver-PqbVFU/apt_archive ./ Sources [266 B] Get:5 copy:/<>/resolver-PqbVFU/apt_archive ./ Packages [586 B] Fetched 2971 B in 0s (123 kB/s) Reading package lists... Reading package lists... +------------------------------------------------------------------------------+ | Install liblemon build dependencies (apt-based resolver) | +------------------------------------------------------------------------------+ Installing build dependencies Reading package lists... Building dependency tree... Reading state information... The following packages were automatically installed and are no longer required: libhogweed4 libisl21 libnettle6 libperl5.28 perl-modules-5.28 Use 'apt autoremove' to remove them. The following additional packages will be installed: autoconf automake autopoint autotools-dev bsdmainutils cmake cmake-data d-shlibs debhelper dh-autoreconf dh-strip-nondeterminism doxygen dwz file fontconfig fontconfig-config fonts-dejavu-core fonts-mathjax gettext gettext-base ghostscript graphviz groff-base intltool-debian libamd2 libarchive-zip-perl libarchive13 libasn1-8-heimdal libavahi-client3 libavahi-common-data libavahi-common3 libblas-dev libblas3 libbrotli1 libbsd0 libbtf1 libcairo2 libcamd2 libccolamd2 libcdt5 libcgraph6 libcholmod3 libclang1-9 libcolamd2 libcroco3 libcups2 libcurl4 libcxsparse3 libdatrie1 libdbus-1-3 libdebhelper-perl libedit2 libelf1 libexpat1 libfile-stripnondeterminism-perl libfontconfig1 libfreetype6 libfribidi0 libgd3 libgfortran5 libglib2.0-0 libglpk-dev libglpk40 libgmp-dev libgmpxx4ldbl libgraphblas3 libgraphite2-3 libgs9 libgs9-common libgssapi-krb5-2 libgssapi3-heimdal libgts-0.7-5 libgvc6 libgvpr2 libharfbuzz0b libhcrypto4-heimdal libheimbase1-heimdal libheimntlm0-heimdal libhx509-5-heimdal libice6 libicu63 libidn11 libijs-0.35 libjbig0 libjbig2dec0 libjpeg-turbo8 libjpeg8 libjs-mathjax libjsoncpp1 libk5crypto3 libkeyutils1 libklu1 libkrb5-26-heimdal libkrb5-3 libkrb5support0 liblab-gamut1 liblapack-dev liblapack3 libldap-2.4-2 libldap-common libldl2 libllvm9 libltdl7 libmagic-mgc libmagic1 libmetis5 libmongoose2 libnghttp2-14 libpango-1.0-0 libpangocairo-1.0-0 libpangoft2-1.0-0 libpaper1 libpathplan4 libpipeline1 libpixman-1-0 libpsl5 libpython-stdlib libpython2-stdlib libpython2.7-minimal libpython2.7-stdlib librbio2 librhash0 libroken18-heimdal librtmp1 libsasl2-2 libsasl2-modules-db libsigsegv2 libsm6 libspqr2 libssh-4 libsub-override-perl libsuitesparse-dev libsuitesparseconfig5 libthai-data libthai0 libtiff5 libtool libuchardet0 libumfpack5 libuv1 libwebp6 libwind0-heimdal libx11-6 libx11-data libxapian30 libxau6 libxaw7 libxcb-render0 libxcb-shm0 libxcb1 libxdmcp6 libxext6 libxml2 libxmu6 libxpm4 libxrender1 libxt6 m4 man-db mime-support po-debconf poppler-data python python-minimal python2 python2-minimal python2.7 python2.7-minimal ucf x11-common zlib1g-dev Suggested packages: autoconf-archive gnu-standards autoconf-doc wamerican | wordlist whois vacation cmake-doc ninja-build dh-make doxygen-latex doxygen-doc doxygen-gui gettext-doc libasprintf-dev libgettextpo-dev ghostscript-x gsfonts graphviz-doc groff lrzip liblapack-doc cups-common libgd-tools libiodbc2-dev default-libmysqlclient-dev gmp-doc libgmp10-doc libmpfr-dev krb5-doc krb5-user fonts-mathjax-extras fonts-stix libjs-mathjax-doc libtool-doc gfortran | fortran95-compiler gcj-jdk xapian-tools m4-doc apparmor less www-browser libmail-box-perl poppler-utils fonts-japanese-mincho | fonts-ipafont-mincho fonts-japanese-gothic | fonts-ipafont-gothic fonts-arphic-ukai fonts-arphic-uming fonts-nanum python-doc python-tk python2-doc python2.7-doc binfmt-support Recommended packages: curl | wget | lynx gsfonts fonts-liberation dbus libarchive-cpio-perl libglib2.0-data shared-mime-info xdg-user-dirs fonts-droid-fallback libgts-bin krb5-locales libpaper-utils publicsuffix libsasl2-modules libltdl-dev libmail-sendmail-perl The following NEW packages will be installed: autoconf automake autopoint autotools-dev bsdmainutils cmake cmake-data d-shlibs debhelper dh-autoreconf dh-strip-nondeterminism doxygen dwz file fontconfig fontconfig-config fonts-dejavu-core fonts-mathjax gettext gettext-base ghostscript graphviz groff-base intltool-debian libamd2 libarchive-zip-perl libarchive13 libasn1-8-heimdal libavahi-client3 libavahi-common-data libavahi-common3 libblas-dev libblas3 libbrotli1 libbsd0 libbtf1 libcairo2 libcamd2 libccolamd2 libcdt5 libcgraph6 libcholmod3 libclang1-9 libcolamd2 libcroco3 libcups2 libcurl4 libcxsparse3 libdatrie1 libdbus-1-3 libdebhelper-perl libedit2 libelf1 libexpat1 libfile-stripnondeterminism-perl libfontconfig1 libfreetype6 libfribidi0 libgd3 libgfortran5 libglib2.0-0 libglpk-dev libglpk40 libgmp-dev libgmpxx4ldbl libgraphblas3 libgraphite2-3 libgs9 libgs9-common libgssapi-krb5-2 libgssapi3-heimdal libgts-0.7-5 libgvc6 libgvpr2 libharfbuzz0b libhcrypto4-heimdal libheimbase1-heimdal libheimntlm0-heimdal libhx509-5-heimdal libice6 libicu63 libidn11 libijs-0.35 libjbig0 libjbig2dec0 libjpeg-turbo8 libjpeg8 libjs-mathjax libjsoncpp1 libk5crypto3 libkeyutils1 libklu1 libkrb5-26-heimdal libkrb5-3 libkrb5support0 liblab-gamut1 liblapack-dev liblapack3 libldap-2.4-2 libldap-common libldl2 libllvm9 libltdl7 libmagic-mgc libmagic1 libmetis5 libmongoose2 libnghttp2-14 libpango-1.0-0 libpangocairo-1.0-0 libpangoft2-1.0-0 libpaper1 libpathplan4 libpipeline1 libpixman-1-0 libpsl5 libpython-stdlib libpython2-stdlib libpython2.7-minimal libpython2.7-stdlib librbio2 librhash0 libroken18-heimdal librtmp1 libsasl2-2 libsasl2-modules-db libsigsegv2 libsm6 libspqr2 libssh-4 libsub-override-perl libsuitesparse-dev libsuitesparseconfig5 libthai-data libthai0 libtiff5 libtool libuchardet0 libumfpack5 libuv1 libwebp6 libwind0-heimdal libx11-6 libx11-data libxapian30 libxau6 libxaw7 libxcb-render0 libxcb-shm0 libxcb1 libxdmcp6 libxext6 libxml2 libxmu6 libxpm4 libxrender1 libxt6 m4 man-db mime-support po-debconf poppler-data python python-minimal python2 python2-minimal python2.7 python2.7-minimal sbuild-build-depends-liblemon-dummy ucf x11-common zlib1g-dev 0 upgraded, 172 newly installed, 0 to remove and 0 not upgraded. Need to get 83.3 MB of archives. After this operation, 392 MB of additional disk space will be used. Get:1 copy:/<>/resolver-PqbVFU/apt_archive ./ sbuild-build-depends-liblemon-dummy 0.invalid.0 [912 B] Get:2 http://ftpmaster.internal/ubuntu focal/main armhf libbsd0 armhf 0.10.0-1 [49.8 kB] Get:3 http://ftpmaster.internal/ubuntu focal/main armhf bsdmainutils armhf 11.1.2ubuntu2 [176 kB] Get:4 http://ftpmaster.internal/ubuntu focal/main armhf libuchardet0 armhf 0.0.6-3 [62.1 kB] Get:5 http://ftpmaster.internal/ubuntu focal/main armhf groff-base armhf 1.22.4-4 [777 kB] Get:6 http://ftpmaster.internal/ubuntu focal/main armhf libpipeline1 armhf 1.5.1-3 [23.2 kB] Get:7 http://ftpmaster.internal/ubuntu focal/main armhf man-db armhf 2.9.0-2 [1079 kB] Get:8 http://ftpmaster.internal/ubuntu focal/main armhf poppler-data all 0.4.9-2 [1475 kB] Get:9 http://ftpmaster.internal/ubuntu focal/universe armhf libpython2.7-minimal armhf 2.7.17-1 [335 kB] Get:10 http://ftpmaster.internal/ubuntu focal/universe armhf python2.7-minimal armhf 2.7.17-1 [1088 kB] Get:11 http://ftpmaster.internal/ubuntu focal/universe armhf python2-minimal armhf 2.7.17-1 [27.8 kB] Get:12 http://ftpmaster.internal/ubuntu focal/universe armhf python-minimal armhf 2.7.17-1 [5996 B] Get:13 http://ftpmaster.internal/ubuntu focal/main armhf mime-support all 3.64ubuntu1 [30.6 kB] Get:14 http://ftpmaster.internal/ubuntu focal/main armhf libexpat1 armhf 2.2.9-1 [53.2 kB] Get:15 http://ftpmaster.internal/ubuntu focal/universe armhf libpython2.7-stdlib armhf 2.7.17-1 [1812 kB] Get:16 http://ftpmaster.internal/ubuntu focal/universe armhf python2.7 armhf 2.7.17-1 [248 kB] Get:17 http://ftpmaster.internal/ubuntu focal/universe armhf libpython2-stdlib armhf 2.7.17-1 [7400 B] Get:18 http://ftpmaster.internal/ubuntu focal/universe armhf libpython-stdlib armhf 2.7.17-1 [5836 B] Get:19 http://ftpmaster.internal/ubuntu focal/universe armhf python2 armhf 2.7.17-1 [26.5 kB] Get:20 http://ftpmaster.internal/ubuntu focal/universe armhf python armhf 2.7.17-1 [7836 B] Get:21 http://ftpmaster.internal/ubuntu focal/main armhf libmagic-mgc armhf 1:5.37-6 [209 kB] Get:22 http://ftpmaster.internal/ubuntu focal/main armhf libmagic1 armhf 1:5.37-6 [67.7 kB] Get:23 http://ftpmaster.internal/ubuntu focal/main armhf file armhf 1:5.37-6 [22.2 kB] Get:24 http://ftpmaster.internal/ubuntu focal/main armhf libdbus-1-3 armhf 1.12.16-2ubuntu2 [156 kB] Get:25 http://ftpmaster.internal/ubuntu focal/main armhf libelf1 armhf 0.176-1.1 [40.9 kB] Get:26 http://ftpmaster.internal/ubuntu focal/main armhf libfribidi0 armhf 1.0.7-1.1 [21.7 kB] Get:27 http://ftpmaster.internal/ubuntu focal/main armhf libglib2.0-0 armhf 2.63.3-1 [1118 kB] Get:28 http://ftpmaster.internal/ubuntu focal/main armhf libicu63 armhf 63.2-2 [8002 kB] Get:29 http://ftpmaster.internal/ubuntu focal/main armhf libxml2 armhf 2.9.4+dfsg1-8ubuntu1 [554 kB] Get:30 http://ftpmaster.internal/ubuntu focal/main armhf ucf all 3.0038+nmu1 [51.6 kB] Get:31 http://ftpmaster.internal/ubuntu focal/main armhf gettext-base armhf 0.19.8.1-10 [46.2 kB] Get:32 http://ftpmaster.internal/ubuntu focal/main armhf libedit2 armhf 3.1-20191211-1 [71.6 kB] Get:33 http://ftpmaster.internal/ubuntu focal/main armhf libkrb5support0 armhf 1.17-6 [28.5 kB] Get:34 http://ftpmaster.internal/ubuntu focal/main armhf libk5crypto3 armhf 1.17-6 [78.9 kB] Get:35 http://ftpmaster.internal/ubuntu focal/main armhf libkeyutils1 armhf 1.6-6ubuntu1 [9172 B] Get:36 http://ftpmaster.internal/ubuntu focal/main armhf libkrb5-3 armhf 1.17-6 [287 kB] Get:37 http://ftpmaster.internal/ubuntu focal/main armhf libgssapi-krb5-2 armhf 1.17-6 [101 kB] Get:38 http://ftpmaster.internal/ubuntu focal/main armhf libpsl5 armhf 0.20.2-2 [48.7 kB] Get:39 http://ftpmaster.internal/ubuntu focal/main armhf libxau6 armhf 1:1.0.9-0ubuntu1 [6612 B] Get:40 http://ftpmaster.internal/ubuntu focal/main armhf libxdmcp6 armhf 1:1.1.3-0ubuntu1 [9160 B] Get:41 http://ftpmaster.internal/ubuntu focal/main armhf libxcb1 armhf 1.13.1-2 [40.8 kB] Get:42 http://ftpmaster.internal/ubuntu focal/main armhf libx11-data all 2:1.6.8-1 [113 kB] Get:43 http://ftpmaster.internal/ubuntu focal/main armhf libx11-6 armhf 2:1.6.8-1 [517 kB] Get:44 http://ftpmaster.internal/ubuntu focal/main armhf libxext6 armhf 2:1.3.4-0ubuntu1 [24.2 kB] Get:45 http://ftpmaster.internal/ubuntu focal/main armhf libsigsegv2 armhf 2.12-2 [13.1 kB] Get:46 http://ftpmaster.internal/ubuntu focal/main armhf m4 armhf 1.4.18-4 [187 kB] Get:47 http://ftpmaster.internal/ubuntu focal/main armhf autoconf all 2.69-11ubuntu1 [321 kB] Get:48 http://ftpmaster.internal/ubuntu focal/main armhf autotools-dev all 20180224.1 [39.6 kB] Get:49 http://ftpmaster.internal/ubuntu focal/main armhf automake all 1:1.16.1-4ubuntu3 [522 kB] Get:50 http://ftpmaster.internal/ubuntu focal/main armhf autopoint all 0.19.8.1-10 [412 kB] Get:51 http://ftpmaster.internal/ubuntu focal/main armhf cmake-data all 3.15.4-1ubuntu2 [1562 kB] Get:52 http://ftpmaster.internal/ubuntu focal/main armhf libarchive13 armhf 3.4.0-1build1 [290 kB] Get:53 http://ftpmaster.internal/ubuntu focal/main armhf libbrotli1 armhf 1.0.7-5 [254 kB] Get:54 http://ftpmaster.internal/ubuntu focal/main armhf libroken18-heimdal armhf 7.7.0+dfsg-1 [34.7 kB] Get:55 http://ftpmaster.internal/ubuntu focal/main armhf libasn1-8-heimdal armhf 7.7.0+dfsg-1 [140 kB] Get:56 http://ftpmaster.internal/ubuntu focal/main armhf libheimbase1-heimdal armhf 7.7.0+dfsg-1 [24.4 kB] Get:57 http://ftpmaster.internal/ubuntu focal/main armhf libhcrypto4-heimdal armhf 7.7.0+dfsg-1 [78.5 kB] Get:58 http://ftpmaster.internal/ubuntu focal/main armhf libwind0-heimdal armhf 7.7.0+dfsg-1 [46.9 kB] Get:59 http://ftpmaster.internal/ubuntu focal/main armhf libhx509-5-heimdal armhf 7.7.0+dfsg-1 [88.7 kB] Get:60 http://ftpmaster.internal/ubuntu focal/main armhf libkrb5-26-heimdal armhf 7.7.0+dfsg-1 [170 kB] Get:61 http://ftpmaster.internal/ubuntu focal/main armhf libheimntlm0-heimdal armhf 7.7.0+dfsg-1 [13.2 kB] Get:62 http://ftpmaster.internal/ubuntu focal/main armhf libgssapi3-heimdal armhf 7.7.0+dfsg-1 [80.0 kB] Get:63 http://ftpmaster.internal/ubuntu focal/main armhf libsasl2-modules-db armhf 2.1.27+dfsg-2 [13.4 kB] Get:64 http://ftpmaster.internal/ubuntu focal/main armhf libsasl2-2 armhf 2.1.27+dfsg-2 [42.7 kB] Get:65 http://ftpmaster.internal/ubuntu focal/main armhf libldap-common all 2.4.48+dfsg-1ubuntu3 [17.3 kB] Get:66 http://ftpmaster.internal/ubuntu focal/main armhf libldap-2.4-2 armhf 2.4.48+dfsg-1ubuntu3 [133 kB] Get:67 http://ftpmaster.internal/ubuntu focal/main armhf libnghttp2-14 armhf 1.40.0-1 [68.0 kB] Get:68 http://ftpmaster.internal/ubuntu focal/main armhf librtmp1 armhf 2.4+20151223.gitfa8646d.1-2build1 [49.1 kB] Get:69 http://ftpmaster.internal/ubuntu focal/main armhf libssh-4 armhf 0.9.0-1ubuntu5 [173 kB] Get:70 http://ftpmaster.internal/ubuntu focal/main armhf libcurl4 armhf 7.66.0-1ubuntu1 [201 kB] Get:71 http://ftpmaster.internal/ubuntu focal/main armhf libjsoncpp1 armhf 1.7.4-3 [65.9 kB] Get:72 http://ftpmaster.internal/ubuntu focal/main armhf librhash0 armhf 1.3.9-1 [125 kB] Get:73 http://ftpmaster.internal/ubuntu focal/main armhf libuv1 armhf 1.33.1-2 [68.2 kB] Get:74 http://ftpmaster.internal/ubuntu focal/main armhf cmake armhf 3.15.4-1ubuntu2 [2931 kB] Get:75 http://ftpmaster.internal/ubuntu focal/universe armhf d-shlibs all 0.88 [10.5 kB] Get:76 http://ftpmaster.internal/ubuntu focal/main armhf libtool all 2.4.6-11 [194 kB] Get:77 http://ftpmaster.internal/ubuntu focal/main armhf dh-autoreconf all 19 [16.1 kB] Get:78 http://ftpmaster.internal/ubuntu focal/main armhf libdebhelper-perl all 12.7.1ubuntu1 [52.0 kB] Get:79 http://ftpmaster.internal/ubuntu focal/main armhf libarchive-zip-perl all 1.67-1 [90.4 kB] Get:80 http://ftpmaster.internal/ubuntu focal/main armhf libsub-override-perl all 0.09-2 [9532 B] Get:81 http://ftpmaster.internal/ubuntu focal/main armhf libfile-stripnondeterminism-perl all 1.6.3-1 [16.0 kB] Get:82 http://ftpmaster.internal/ubuntu focal/main armhf dh-strip-nondeterminism all 1.6.3-1 [5224 B] Get:83 http://ftpmaster.internal/ubuntu focal/main armhf dwz armhf 0.13-5 [153 kB] Get:84 http://ftpmaster.internal/ubuntu focal/main armhf libcroco3 armhf 0.6.13-1 [70.5 kB] Get:85 http://ftpmaster.internal/ubuntu focal/main armhf gettext armhf 0.19.8.1-10 [836 kB] Get:86 http://ftpmaster.internal/ubuntu focal/main armhf intltool-debian all 0.35.0+20060710.5 [24.9 kB] Get:87 http://ftpmaster.internal/ubuntu focal/main armhf po-debconf all 1.0.21 [233 kB] Get:88 http://ftpmaster.internal/ubuntu focal/main armhf debhelper all 12.7.1ubuntu1 [875 kB] Get:89 http://ftpmaster.internal/ubuntu focal/main armhf libllvm9 armhf 1:9.0.1-2 [12.9 MB] Get:90 http://ftpmaster.internal/ubuntu focal/universe armhf libclang1-9 armhf 1:9.0.1-2 [5495 kB] Get:91 http://ftpmaster.internal/ubuntu focal/universe armhf libxapian30 armhf 1.4.12-1 [547 kB] Get:92 http://ftpmaster.internal/ubuntu focal/universe armhf doxygen armhf 1.8.13-12ubuntu1 [3639 kB] Get:93 http://ftpmaster.internal/ubuntu focal/main armhf libfreetype6 armhf 2.10.1-2 [283 kB] Get:94 http://ftpmaster.internal/ubuntu focal/main armhf fonts-dejavu-core all 2.37-1 [1041 kB] Get:95 http://ftpmaster.internal/ubuntu focal/main armhf fontconfig-config all 2.13.1-2ubuntu2 [28.9 kB] Get:96 http://ftpmaster.internal/ubuntu focal/main armhf libfontconfig1 armhf 2.13.1-2ubuntu2 [95.8 kB] Get:97 http://ftpmaster.internal/ubuntu focal/main armhf fontconfig armhf 2.13.1-2ubuntu2 [169 kB] Get:98 http://ftpmaster.internal/ubuntu focal/universe armhf fonts-mathjax all 2.7.4+dfsg-1 [2208 kB] Get:99 http://ftpmaster.internal/ubuntu focal/main armhf libavahi-common-data armhf 0.7-4ubuntu6 [21.3 kB] Get:100 http://ftpmaster.internal/ubuntu focal/main armhf libavahi-common3 armhf 0.7-4ubuntu6 [18.3 kB] Get:101 http://ftpmaster.internal/ubuntu focal/main armhf libavahi-client3 armhf 0.7-4ubuntu6 [22.0 kB] Get:102 http://ftpmaster.internal/ubuntu focal/main armhf libcups2 armhf 2.3.0-7 [197 kB] Get:103 http://ftpmaster.internal/ubuntu focal/main armhf libidn11 armhf 1.33-2.2ubuntu2 [43.1 kB] Get:104 http://ftpmaster.internal/ubuntu focal/main armhf libijs-0.35 armhf 0.35-15 [14.0 kB] Get:105 http://ftpmaster.internal/ubuntu focal/main armhf libjbig2dec0 armhf 0.17-1 [51.8 kB] Get:106 http://ftpmaster.internal/ubuntu focal/main armhf libjpeg-turbo8 armhf 2.0.3-0ubuntu1 [90.4 kB] Get:107 http://ftpmaster.internal/ubuntu focal/main armhf libjpeg8 armhf 8c-2ubuntu8 [2202 B] Get:108 http://ftpmaster.internal/ubuntu focal/main armhf libpaper1 armhf 1.1.28 [12.1 kB] Get:109 http://ftpmaster.internal/ubuntu focal/main armhf libjbig0 armhf 2.1-3.1build1 [23.9 kB] Get:110 http://ftpmaster.internal/ubuntu focal/main armhf libwebp6 armhf 0.6.1-2 [152 kB] Get:111 http://ftpmaster.internal/ubuntu focal/main armhf libtiff5 armhf 4.1.0+git191117-1 [143 kB] Get:112 http://ftpmaster.internal/ubuntu focal/main armhf libgs9-common all 9.27~dfsg+0-0ubuntu4 [5093 kB] Get:113 http://ftpmaster.internal/ubuntu focal/main armhf libgs9 armhf 9.27~dfsg+0-0ubuntu4 [2070 kB] Get:114 http://ftpmaster.internal/ubuntu focal/main armhf ghostscript armhf 9.27~dfsg+0-0ubuntu4 [51.3 kB] Get:115 http://ftpmaster.internal/ubuntu focal/universe armhf libcdt5 armhf 2.42.2-3 [16.4 kB] Get:116 http://ftpmaster.internal/ubuntu focal/universe armhf libcgraph6 armhf 2.42.2-3 [34.4 kB] Get:117 http://ftpmaster.internal/ubuntu focal/main armhf libxpm4 armhf 1:3.5.12-1 [29.0 kB] Get:118 http://ftpmaster.internal/ubuntu focal/main armhf libgd3 armhf 2.2.5-5.2 [98.7 kB] Get:119 http://ftpmaster.internal/ubuntu focal/universe armhf libgts-0.7-5 armhf 0.7.6+darcs121130-4 [132 kB] Get:120 http://ftpmaster.internal/ubuntu focal/main armhf libpixman-1-0 armhf 0.38.4-0ubuntu1 [159 kB] Get:121 http://ftpmaster.internal/ubuntu focal/main armhf libxcb-render0 armhf 1.13.1-2 [13.9 kB] Get:122 http://ftpmaster.internal/ubuntu focal/main armhf libxcb-shm0 armhf 1.13.1-2 [5380 B] Get:123 http://ftpmaster.internal/ubuntu focal/main armhf libxrender1 armhf 1:0.9.10-1 [15.6 kB] Get:124 http://ftpmaster.internal/ubuntu focal/main armhf libcairo2 armhf 1.16.0-4ubuntu1 [503 kB] Get:125 http://ftpmaster.internal/ubuntu focal/main armhf libltdl7 armhf 2.4.6-11 [35.2 kB] Get:126 http://ftpmaster.internal/ubuntu focal/main armhf libgraphite2-3 armhf 1.3.13-11 [62.7 kB] Get:127 http://ftpmaster.internal/ubuntu focal/main armhf libharfbuzz0b armhf 2.6.4-1ubuntu1 [346 kB] Get:128 http://ftpmaster.internal/ubuntu focal/main armhf libthai-data all 0.1.28-3 [134 kB] Get:129 http://ftpmaster.internal/ubuntu focal/main armhf libdatrie1 armhf 0.2.12-3 [15.2 kB] Get:130 http://ftpmaster.internal/ubuntu focal/main armhf libthai0 armhf 0.1.28-3 [14.7 kB] Get:131 http://ftpmaster.internal/ubuntu focal/main armhf libpango-1.0-0 armhf 1.44.7-1 [143 kB] Get:132 http://ftpmaster.internal/ubuntu focal/main armhf libpangoft2-1.0-0 armhf 1.44.7-1 [28.6 kB] Get:133 http://ftpmaster.internal/ubuntu focal/main armhf libpangocairo-1.0-0 armhf 1.44.7-1 [20.7 kB] Get:134 http://ftpmaster.internal/ubuntu focal/universe armhf libpathplan4 armhf 2.42.2-3 [19.6 kB] Get:135 http://ftpmaster.internal/ubuntu focal/universe armhf libgvc6 armhf 2.42.2-3 [550 kB] Get:136 http://ftpmaster.internal/ubuntu focal/universe armhf libgvpr2 armhf 2.42.2-3 [143 kB] Get:137 http://ftpmaster.internal/ubuntu focal/universe armhf liblab-gamut1 armhf 2.42.2-3 [178 kB] Get:138 http://ftpmaster.internal/ubuntu focal/main armhf x11-common all 1:7.7+19ubuntu12 [22.4 kB] Get:139 http://ftpmaster.internal/ubuntu focal/main armhf libice6 armhf 2:1.0.10-0ubuntu1 [34.1 kB] Get:140 http://ftpmaster.internal/ubuntu focal/main armhf libsm6 armhf 2:1.2.3-1 [14.1 kB] Get:141 http://ftpmaster.internal/ubuntu focal/main armhf libxt6 armhf 1:1.1.5-1 [129 kB] Get:142 http://ftpmaster.internal/ubuntu focal/main armhf libxmu6 armhf 2:1.1.3-0ubuntu1 [38.3 kB] Get:143 http://ftpmaster.internal/ubuntu focal/main armhf libxaw7 armhf 2:1.0.13-1 [141 kB] Get:144 http://ftpmaster.internal/ubuntu focal/universe armhf graphviz armhf 2.42.2-3 [486 kB] Get:145 http://ftpmaster.internal/ubuntu focal/main armhf libsuitesparseconfig5 armhf 1:5.6.0+dfsg-2 [9340 B] Get:146 http://ftpmaster.internal/ubuntu focal/main armhf libamd2 armhf 1:5.6.0+dfsg-2 [13.7 kB] Get:147 http://ftpmaster.internal/ubuntu focal/main armhf libblas3 armhf 3.9.0-1 [102 kB] Get:148 http://ftpmaster.internal/ubuntu focal/main armhf libblas-dev armhf 3.9.0-1 [109 kB] Get:149 http://ftpmaster.internal/ubuntu focal/main armhf libbtf1 armhf 1:5.6.0+dfsg-2 [9784 B] Get:150 http://ftpmaster.internal/ubuntu focal/main armhf libcamd2 armhf 1:5.6.0+dfsg-2 [14.2 kB] Get:151 http://ftpmaster.internal/ubuntu focal/main armhf libccolamd2 armhf 1:5.6.0+dfsg-2 [14.9 kB] Get:152 http://ftpmaster.internal/ubuntu focal/main armhf libcolamd2 armhf 1:5.6.0+dfsg-2 [12.0 kB] Get:153 http://ftpmaster.internal/ubuntu focal/main armhf libgfortran5 armhf 9.2.1-21ubuntu1 [252 kB] Get:154 http://ftpmaster.internal/ubuntu focal/main armhf liblapack3 armhf 3.9.0-1 [1733 kB] Get:155 http://ftpmaster.internal/ubuntu focal/main armhf libmetis5 armhf 5.1.0.dfsg-5 [130 kB] Get:156 http://ftpmaster.internal/ubuntu focal/main armhf libcholmod3 armhf 1:5.6.0+dfsg-2 [206 kB] Get:157 http://ftpmaster.internal/ubuntu focal/main armhf libcxsparse3 armhf 1:5.6.0+dfsg-2 [36.5 kB] Get:158 http://ftpmaster.internal/ubuntu focal/universe armhf libglpk40 armhf 4.65-2 [308 kB] Get:159 http://ftpmaster.internal/ubuntu focal/main armhf libgmpxx4ldbl armhf 2:6.1.2+dfsg-4 [7972 B] Get:160 http://ftpmaster.internal/ubuntu focal/main armhf libgmp-dev armhf 2:6.1.2+dfsg-4 [266 kB] Get:161 http://ftpmaster.internal/ubuntu focal/main armhf zlib1g-dev armhf 1:1.2.11.dfsg-1ubuntu3 [166 kB] Get:162 http://ftpmaster.internal/ubuntu focal/main armhf libgraphblas3 armhf 1:5.6.0+dfsg-2 [1833 kB] Get:163 http://ftpmaster.internal/ubuntu focal/main armhf libklu1 armhf 1:5.6.0+dfsg-2 [35.8 kB] Get:164 http://ftpmaster.internal/ubuntu focal/main armhf libldl2 armhf 1:5.6.0+dfsg-2 [9556 B] Get:165 http://ftpmaster.internal/ubuntu focal/main armhf libmongoose2 armhf 1:5.6.0+dfsg-2 [27.4 kB] Get:166 http://ftpmaster.internal/ubuntu focal/main armhf libumfpack5 armhf 1:5.6.0+dfsg-2 [115 kB] Get:167 http://ftpmaster.internal/ubuntu focal/main armhf librbio2 armhf 1:5.6.0+dfsg-2 [16.4 kB] Get:168 http://ftpmaster.internal/ubuntu focal/main armhf libspqr2 armhf 1:5.6.0+dfsg-2 [53.6 kB] Get:169 http://ftpmaster.internal/ubuntu focal/main armhf liblapack-dev armhf 3.9.0-1 [1813 kB] Get:170 http://ftpmaster.internal/ubuntu focal/main armhf libsuitesparse-dev armhf 1:5.6.0+dfsg-2 [2379 kB] Get:171 http://ftpmaster.internal/ubuntu focal/universe armhf libglpk-dev armhf 4.65-2 [382 kB] Get:172 http://ftpmaster.internal/ubuntu focal/universe armhf libjs-mathjax all 2.7.4+dfsg-1 [5654 kB] debconf: delaying package configuration, since apt-utils is not installed Fetched 83.3 MB in 4s (19.1 MB/s) Selecting previously unselected package libbsd0:armhf. (Reading database ... 14395 files and directories currently installed.) Preparing to unpack .../00-libbsd0_0.10.0-1_armhf.deb ... Unpacking libbsd0:armhf (0.10.0-1) ... Selecting previously unselected package bsdmainutils. Preparing to unpack .../01-bsdmainutils_11.1.2ubuntu2_armhf.deb ... Unpacking bsdmainutils (11.1.2ubuntu2) ... Selecting previously unselected package libuchardet0:armhf. Preparing to unpack .../02-libuchardet0_0.0.6-3_armhf.deb ... Unpacking libuchardet0:armhf (0.0.6-3) ... Selecting previously unselected package groff-base. Preparing to unpack .../03-groff-base_1.22.4-4_armhf.deb ... Unpacking groff-base (1.22.4-4) ... Selecting previously unselected package libpipeline1:armhf. Preparing to unpack .../04-libpipeline1_1.5.1-3_armhf.deb ... Unpacking libpipeline1:armhf (1.5.1-3) ... Selecting previously unselected package man-db. Preparing to unpack .../05-man-db_2.9.0-2_armhf.deb ... Unpacking man-db (2.9.0-2) ... Selecting previously unselected package poppler-data. Preparing to unpack .../06-poppler-data_0.4.9-2_all.deb ... Unpacking poppler-data (0.4.9-2) ... Selecting previously unselected package libpython2.7-minimal:armhf. Preparing to unpack .../07-libpython2.7-minimal_2.7.17-1_armhf.deb ... Unpacking libpython2.7-minimal:armhf (2.7.17-1) ... Selecting previously unselected package python2.7-minimal. Preparing to unpack .../08-python2.7-minimal_2.7.17-1_armhf.deb ... Unpacking python2.7-minimal (2.7.17-1) ... Selecting previously unselected package python2-minimal. Preparing to unpack .../09-python2-minimal_2.7.17-1_armhf.deb ... Unpacking python2-minimal (2.7.17-1) ... Selecting previously unselected package python-minimal. Preparing to unpack .../10-python-minimal_2.7.17-1_armhf.deb ... Unpacking python-minimal (2.7.17-1) ... Selecting previously unselected package mime-support. Preparing to unpack .../11-mime-support_3.64ubuntu1_all.deb ... Unpacking mime-support (3.64ubuntu1) ... Selecting previously unselected package libexpat1:armhf. Preparing to unpack .../12-libexpat1_2.2.9-1_armhf.deb ... Unpacking libexpat1:armhf (2.2.9-1) ... Selecting previously unselected package libpython2.7-stdlib:armhf. Preparing to unpack .../13-libpython2.7-stdlib_2.7.17-1_armhf.deb ... Unpacking libpython2.7-stdlib:armhf (2.7.17-1) ... Selecting previously unselected package python2.7. Preparing to unpack .../14-python2.7_2.7.17-1_armhf.deb ... Unpacking python2.7 (2.7.17-1) ... Selecting previously unselected package libpython2-stdlib:armhf. Preparing to unpack .../15-libpython2-stdlib_2.7.17-1_armhf.deb ... Unpacking libpython2-stdlib:armhf (2.7.17-1) ... Selecting previously unselected package libpython-stdlib:armhf. Preparing to unpack .../16-libpython-stdlib_2.7.17-1_armhf.deb ... Unpacking libpython-stdlib:armhf (2.7.17-1) ... Setting up libpython2.7-minimal:armhf (2.7.17-1) ... Setting up python2.7-minimal (2.7.17-1) ... Setting up python2-minimal (2.7.17-1) ... Selecting previously unselected package python2. (Reading database ... 16293 files and directories currently installed.) Preparing to unpack .../python2_2.7.17-1_armhf.deb ... Unpacking python2 (2.7.17-1) ... Setting up python-minimal (2.7.17-1) ... Selecting previously unselected package python. (Reading database ... 16326 files and directories currently installed.) Preparing to unpack .../000-python_2.7.17-1_armhf.deb ... Unpacking python (2.7.17-1) ... Selecting previously unselected package libmagic-mgc. Preparing to unpack .../001-libmagic-mgc_1%3a5.37-6_armhf.deb ... Unpacking libmagic-mgc (1:5.37-6) ... Selecting previously unselected package libmagic1:armhf. Preparing to unpack .../002-libmagic1_1%3a5.37-6_armhf.deb ... Unpacking libmagic1:armhf (1:5.37-6) ... Selecting previously unselected package file. Preparing to unpack .../003-file_1%3a5.37-6_armhf.deb ... Unpacking file (1:5.37-6) ... Selecting previously unselected package libdbus-1-3:armhf. Preparing to unpack .../004-libdbus-1-3_1.12.16-2ubuntu2_armhf.deb ... Unpacking libdbus-1-3:armhf (1.12.16-2ubuntu2) ... Selecting previously unselected package libelf1:armhf. Preparing to unpack .../005-libelf1_0.176-1.1_armhf.deb ... Unpacking libelf1:armhf (0.176-1.1) ... Selecting previously unselected package libfribidi0:armhf. Preparing to unpack .../006-libfribidi0_1.0.7-1.1_armhf.deb ... Unpacking libfribidi0:armhf (1.0.7-1.1) ... Selecting previously unselected package libglib2.0-0:armhf. Preparing to unpack .../007-libglib2.0-0_2.63.3-1_armhf.deb ... Unpacking libglib2.0-0:armhf (2.63.3-1) ... Selecting previously unselected package libicu63:armhf. Preparing to unpack .../008-libicu63_63.2-2_armhf.deb ... Unpacking libicu63:armhf (63.2-2) ... Selecting previously unselected package libxml2:armhf. Preparing to unpack .../009-libxml2_2.9.4+dfsg1-8ubuntu1_armhf.deb ... Unpacking libxml2:armhf (2.9.4+dfsg1-8ubuntu1) ... Selecting previously unselected package ucf. Preparing to unpack .../010-ucf_3.0038+nmu1_all.deb ... Moving old data out of the way Unpacking ucf (3.0038+nmu1) ... Selecting previously unselected package gettext-base. Preparing to unpack .../011-gettext-base_0.19.8.1-10_armhf.deb ... Unpacking gettext-base (0.19.8.1-10) ... Selecting previously unselected package libedit2:armhf. Preparing to unpack .../012-libedit2_3.1-20191211-1_armhf.deb ... Unpacking libedit2:armhf (3.1-20191211-1) ... Selecting previously unselected package libkrb5support0:armhf. Preparing to unpack .../013-libkrb5support0_1.17-6_armhf.deb ... Unpacking libkrb5support0:armhf (1.17-6) ... Selecting previously unselected package libk5crypto3:armhf. Preparing to unpack .../014-libk5crypto3_1.17-6_armhf.deb ... Unpacking libk5crypto3:armhf (1.17-6) ... Selecting previously unselected package libkeyutils1:armhf. Preparing to unpack .../015-libkeyutils1_1.6-6ubuntu1_armhf.deb ... Unpacking libkeyutils1:armhf (1.6-6ubuntu1) ... Selecting previously unselected package libkrb5-3:armhf. Preparing to unpack .../016-libkrb5-3_1.17-6_armhf.deb ... Unpacking libkrb5-3:armhf (1.17-6) ... Selecting previously unselected package libgssapi-krb5-2:armhf. Preparing to unpack .../017-libgssapi-krb5-2_1.17-6_armhf.deb ... Unpacking libgssapi-krb5-2:armhf (1.17-6) ... Selecting previously unselected package libpsl5:armhf. Preparing to unpack .../018-libpsl5_0.20.2-2_armhf.deb ... Unpacking libpsl5:armhf (0.20.2-2) ... Selecting previously unselected package libxau6:armhf. Preparing to unpack .../019-libxau6_1%3a1.0.9-0ubuntu1_armhf.deb ... Unpacking libxau6:armhf (1:1.0.9-0ubuntu1) ... Selecting previously unselected package libxdmcp6:armhf. Preparing to unpack .../020-libxdmcp6_1%3a1.1.3-0ubuntu1_armhf.deb ... Unpacking libxdmcp6:armhf (1:1.1.3-0ubuntu1) ... Selecting previously unselected package libxcb1:armhf. Preparing to unpack .../021-libxcb1_1.13.1-2_armhf.deb ... Unpacking libxcb1:armhf (1.13.1-2) ... Selecting previously unselected package libx11-data. Preparing to unpack .../022-libx11-data_2%3a1.6.8-1_all.deb ... Unpacking libx11-data (2:1.6.8-1) ... Selecting previously unselected package libx11-6:armhf. Preparing to unpack .../023-libx11-6_2%3a1.6.8-1_armhf.deb ... Unpacking libx11-6:armhf (2:1.6.8-1) ... Selecting previously unselected package libxext6:armhf. Preparing to unpack .../024-libxext6_2%3a1.3.4-0ubuntu1_armhf.deb ... Unpacking libxext6:armhf (2:1.3.4-0ubuntu1) ... Selecting previously unselected package libsigsegv2:armhf. Preparing to unpack .../025-libsigsegv2_2.12-2_armhf.deb ... Unpacking libsigsegv2:armhf (2.12-2) ... Selecting previously unselected package m4. Preparing to unpack .../026-m4_1.4.18-4_armhf.deb ... Unpacking m4 (1.4.18-4) ... Selecting previously unselected package autoconf. Preparing to unpack .../027-autoconf_2.69-11ubuntu1_all.deb ... Unpacking autoconf (2.69-11ubuntu1) ... Selecting previously unselected package autotools-dev. Preparing to unpack .../028-autotools-dev_20180224.1_all.deb ... Unpacking autotools-dev (20180224.1) ... Selecting previously unselected package automake. Preparing to unpack .../029-automake_1%3a1.16.1-4ubuntu3_all.deb ... Unpacking automake (1:1.16.1-4ubuntu3) ... Selecting previously unselected package autopoint. Preparing to unpack .../030-autopoint_0.19.8.1-10_all.deb ... Unpacking autopoint (0.19.8.1-10) ... Selecting previously unselected package cmake-data. Preparing to unpack .../031-cmake-data_3.15.4-1ubuntu2_all.deb ... Unpacking cmake-data (3.15.4-1ubuntu2) ... Selecting previously unselected package libarchive13:armhf. Preparing to unpack .../032-libarchive13_3.4.0-1build1_armhf.deb ... Unpacking libarchive13:armhf (3.4.0-1build1) ... Selecting previously unselected package libbrotli1:armhf. Preparing to unpack .../033-libbrotli1_1.0.7-5_armhf.deb ... Unpacking libbrotli1:armhf (1.0.7-5) ... Selecting previously unselected package libroken18-heimdal:armhf. Preparing to unpack .../034-libroken18-heimdal_7.7.0+dfsg-1_armhf.deb ... Unpacking libroken18-heimdal:armhf (7.7.0+dfsg-1) ... Selecting previously unselected package libasn1-8-heimdal:armhf. Preparing to unpack .../035-libasn1-8-heimdal_7.7.0+dfsg-1_armhf.deb ... Unpacking libasn1-8-heimdal:armhf (7.7.0+dfsg-1) ... Selecting previously unselected package libheimbase1-heimdal:armhf. Preparing to unpack .../036-libheimbase1-heimdal_7.7.0+dfsg-1_armhf.deb ... Unpacking libheimbase1-heimdal:armhf (7.7.0+dfsg-1) ... Selecting previously unselected package libhcrypto4-heimdal:armhf. Preparing to unpack .../037-libhcrypto4-heimdal_7.7.0+dfsg-1_armhf.deb ... Unpacking libhcrypto4-heimdal:armhf (7.7.0+dfsg-1) ... Selecting previously unselected package libwind0-heimdal:armhf. Preparing to unpack .../038-libwind0-heimdal_7.7.0+dfsg-1_armhf.deb ... Unpacking libwind0-heimdal:armhf (7.7.0+dfsg-1) ... Selecting previously unselected package libhx509-5-heimdal:armhf. Preparing to unpack .../039-libhx509-5-heimdal_7.7.0+dfsg-1_armhf.deb ... Unpacking libhx509-5-heimdal:armhf (7.7.0+dfsg-1) ... Selecting previously unselected package libkrb5-26-heimdal:armhf. Preparing to unpack .../040-libkrb5-26-heimdal_7.7.0+dfsg-1_armhf.deb ... Unpacking libkrb5-26-heimdal:armhf (7.7.0+dfsg-1) ... Selecting previously unselected package libheimntlm0-heimdal:armhf. Preparing to unpack .../041-libheimntlm0-heimdal_7.7.0+dfsg-1_armhf.deb ... Unpacking libheimntlm0-heimdal:armhf (7.7.0+dfsg-1) ... Selecting previously unselected package libgssapi3-heimdal:armhf. Preparing to unpack .../042-libgssapi3-heimdal_7.7.0+dfsg-1_armhf.deb ... Unpacking libgssapi3-heimdal:armhf (7.7.0+dfsg-1) ... Selecting previously unselected package libsasl2-modules-db:armhf. Preparing to unpack .../043-libsasl2-modules-db_2.1.27+dfsg-2_armhf.deb ... Unpacking libsasl2-modules-db:armhf (2.1.27+dfsg-2) ... Selecting previously unselected package libsasl2-2:armhf. Preparing to unpack .../044-libsasl2-2_2.1.27+dfsg-2_armhf.deb ... Unpacking libsasl2-2:armhf (2.1.27+dfsg-2) ... Selecting previously unselected package libldap-common. Preparing to unpack .../045-libldap-common_2.4.48+dfsg-1ubuntu3_all.deb ... Unpacking libldap-common (2.4.48+dfsg-1ubuntu3) ... Selecting previously unselected package libldap-2.4-2:armhf. Preparing to unpack .../046-libldap-2.4-2_2.4.48+dfsg-1ubuntu3_armhf.deb ... Unpacking libldap-2.4-2:armhf (2.4.48+dfsg-1ubuntu3) ... Selecting previously unselected package libnghttp2-14:armhf. Preparing to unpack .../047-libnghttp2-14_1.40.0-1_armhf.deb ... Unpacking libnghttp2-14:armhf (1.40.0-1) ... Selecting previously unselected package librtmp1:armhf. Preparing to unpack .../048-librtmp1_2.4+20151223.gitfa8646d.1-2build1_armhf.deb ... Unpacking librtmp1:armhf (2.4+20151223.gitfa8646d.1-2build1) ... Selecting previously unselected package libssh-4:armhf. Preparing to unpack .../049-libssh-4_0.9.0-1ubuntu5_armhf.deb ... Unpacking libssh-4:armhf (0.9.0-1ubuntu5) ... Selecting previously unselected package libcurl4:armhf. Preparing to unpack .../050-libcurl4_7.66.0-1ubuntu1_armhf.deb ... Unpacking libcurl4:armhf (7.66.0-1ubuntu1) ... Selecting previously unselected package libjsoncpp1:armhf. Preparing to unpack .../051-libjsoncpp1_1.7.4-3_armhf.deb ... Unpacking libjsoncpp1:armhf (1.7.4-3) ... Selecting previously unselected package librhash0:armhf. Preparing to unpack .../052-librhash0_1.3.9-1_armhf.deb ... Unpacking librhash0:armhf (1.3.9-1) ... Selecting previously unselected package libuv1:armhf. Preparing to unpack .../053-libuv1_1.33.1-2_armhf.deb ... Unpacking libuv1:armhf (1.33.1-2) ... Selecting previously unselected package cmake. Preparing to unpack .../054-cmake_3.15.4-1ubuntu2_armhf.deb ... Unpacking cmake (3.15.4-1ubuntu2) ... Selecting previously unselected package d-shlibs. Preparing to unpack .../055-d-shlibs_0.88_all.deb ... Unpacking d-shlibs (0.88) ... Selecting previously unselected package libtool. Preparing to unpack .../056-libtool_2.4.6-11_all.deb ... Unpacking libtool (2.4.6-11) ... Selecting previously unselected package dh-autoreconf. Preparing to unpack .../057-dh-autoreconf_19_all.deb ... Unpacking dh-autoreconf (19) ... Selecting previously unselected package libdebhelper-perl. Preparing to unpack .../058-libdebhelper-perl_12.7.1ubuntu1_all.deb ... Unpacking libdebhelper-perl (12.7.1ubuntu1) ... Selecting previously unselected package libarchive-zip-perl. Preparing to unpack .../059-libarchive-zip-perl_1.67-1_all.deb ... Unpacking libarchive-zip-perl (1.67-1) ... Selecting previously unselected package libsub-override-perl. Preparing to unpack .../060-libsub-override-perl_0.09-2_all.deb ... Unpacking libsub-override-perl (0.09-2) ... Selecting previously unselected package libfile-stripnondeterminism-perl. Preparing to unpack .../061-libfile-stripnondeterminism-perl_1.6.3-1_all.deb ... Unpacking libfile-stripnondeterminism-perl (1.6.3-1) ... Selecting previously unselected package dh-strip-nondeterminism. Preparing to unpack .../062-dh-strip-nondeterminism_1.6.3-1_all.deb ... Unpacking dh-strip-nondeterminism (1.6.3-1) ... Selecting previously unselected package dwz. Preparing to unpack .../063-dwz_0.13-5_armhf.deb ... Unpacking dwz (0.13-5) ... Selecting previously unselected package libcroco3:armhf. Preparing to unpack .../064-libcroco3_0.6.13-1_armhf.deb ... Unpacking libcroco3:armhf (0.6.13-1) ... Selecting previously unselected package gettext. Preparing to unpack .../065-gettext_0.19.8.1-10_armhf.deb ... Unpacking gettext (0.19.8.1-10) ... Selecting previously unselected package intltool-debian. Preparing to unpack .../066-intltool-debian_0.35.0+20060710.5_all.deb ... Unpacking intltool-debian (0.35.0+20060710.5) ... Selecting previously unselected package po-debconf. Preparing to unpack .../067-po-debconf_1.0.21_all.deb ... Unpacking po-debconf (1.0.21) ... Selecting previously unselected package debhelper. Preparing to unpack .../068-debhelper_12.7.1ubuntu1_all.deb ... Unpacking debhelper (12.7.1ubuntu1) ... Selecting previously unselected package libllvm9:armhf. Preparing to unpack .../069-libllvm9_1%3a9.0.1-2_armhf.deb ... Unpacking libllvm9:armhf (1:9.0.1-2) ... Selecting previously unselected package libclang1-9. Preparing to unpack .../070-libclang1-9_1%3a9.0.1-2_armhf.deb ... Unpacking libclang1-9 (1:9.0.1-2) ... Selecting previously unselected package libxapian30:armhf. Preparing to unpack .../071-libxapian30_1.4.12-1_armhf.deb ... Unpacking libxapian30:armhf (1.4.12-1) ... Selecting previously unselected package doxygen. Preparing to unpack .../072-doxygen_1.8.13-12ubuntu1_armhf.deb ... Unpacking doxygen (1.8.13-12ubuntu1) ... Selecting previously unselected package libfreetype6:armhf. Preparing to unpack .../073-libfreetype6_2.10.1-2_armhf.deb ... Unpacking libfreetype6:armhf (2.10.1-2) ... Selecting previously unselected package fonts-dejavu-core. Preparing to unpack .../074-fonts-dejavu-core_2.37-1_all.deb ... Unpacking fonts-dejavu-core (2.37-1) ... Selecting previously unselected package fontconfig-config. Preparing to unpack .../075-fontconfig-config_2.13.1-2ubuntu2_all.deb ... Unpacking fontconfig-config (2.13.1-2ubuntu2) ... Selecting previously unselected package libfontconfig1:armhf. Preparing to unpack .../076-libfontconfig1_2.13.1-2ubuntu2_armhf.deb ... Unpacking libfontconfig1:armhf (2.13.1-2ubuntu2) ... Selecting previously unselected package fontconfig. Preparing to unpack .../077-fontconfig_2.13.1-2ubuntu2_armhf.deb ... Unpacking fontconfig (2.13.1-2ubuntu2) ... Selecting previously unselected package fonts-mathjax. Preparing to unpack .../078-fonts-mathjax_2.7.4+dfsg-1_all.deb ... Unpacking fonts-mathjax (2.7.4+dfsg-1) ... Selecting previously unselected package libavahi-common-data:armhf. Preparing to unpack .../079-libavahi-common-data_0.7-4ubuntu6_armhf.deb ... Unpacking libavahi-common-data:armhf (0.7-4ubuntu6) ... Selecting previously unselected package libavahi-common3:armhf. Preparing to unpack .../080-libavahi-common3_0.7-4ubuntu6_armhf.deb ... Unpacking libavahi-common3:armhf (0.7-4ubuntu6) ... Selecting previously unselected package libavahi-client3:armhf. Preparing to unpack .../081-libavahi-client3_0.7-4ubuntu6_armhf.deb ... Unpacking libavahi-client3:armhf (0.7-4ubuntu6) ... Selecting previously unselected package libcups2:armhf. Preparing to unpack .../082-libcups2_2.3.0-7_armhf.deb ... Unpacking libcups2:armhf (2.3.0-7) ... Selecting previously unselected package libidn11:armhf. Preparing to unpack .../083-libidn11_1.33-2.2ubuntu2_armhf.deb ... Unpacking libidn11:armhf (1.33-2.2ubuntu2) ... Selecting previously unselected package libijs-0.35:armhf. Preparing to unpack .../084-libijs-0.35_0.35-15_armhf.deb ... Unpacking libijs-0.35:armhf (0.35-15) ... Selecting previously unselected package libjbig2dec0:armhf. Preparing to unpack .../085-libjbig2dec0_0.17-1_armhf.deb ... Unpacking libjbig2dec0:armhf (0.17-1) ... Selecting previously unselected package libjpeg-turbo8:armhf. Preparing to unpack .../086-libjpeg-turbo8_2.0.3-0ubuntu1_armhf.deb ... Unpacking libjpeg-turbo8:armhf (2.0.3-0ubuntu1) ... Selecting previously unselected package libjpeg8:armhf. Preparing to unpack .../087-libjpeg8_8c-2ubuntu8_armhf.deb ... Unpacking libjpeg8:armhf (8c-2ubuntu8) ... Selecting previously unselected package libpaper1:armhf. Preparing to unpack .../088-libpaper1_1.1.28_armhf.deb ... Unpacking libpaper1:armhf (1.1.28) ... Selecting previously unselected package libjbig0:armhf. Preparing to unpack .../089-libjbig0_2.1-3.1build1_armhf.deb ... Unpacking libjbig0:armhf (2.1-3.1build1) ... Selecting previously unselected package libwebp6:armhf. Preparing to unpack .../090-libwebp6_0.6.1-2_armhf.deb ... Unpacking libwebp6:armhf (0.6.1-2) ... Selecting previously unselected package libtiff5:armhf. Preparing to unpack .../091-libtiff5_4.1.0+git191117-1_armhf.deb ... Unpacking libtiff5:armhf (4.1.0+git191117-1) ... Selecting previously unselected package libgs9-common. Preparing to unpack .../092-libgs9-common_9.27~dfsg+0-0ubuntu4_all.deb ... Unpacking libgs9-common (9.27~dfsg+0-0ubuntu4) ... Selecting previously unselected package libgs9:armhf. Preparing to unpack .../093-libgs9_9.27~dfsg+0-0ubuntu4_armhf.deb ... Unpacking libgs9:armhf (9.27~dfsg+0-0ubuntu4) ... Selecting previously unselected package ghostscript. Preparing to unpack .../094-ghostscript_9.27~dfsg+0-0ubuntu4_armhf.deb ... Unpacking ghostscript (9.27~dfsg+0-0ubuntu4) ... Selecting previously unselected package libcdt5:armhf. Preparing to unpack .../095-libcdt5_2.42.2-3_armhf.deb ... Unpacking libcdt5:armhf (2.42.2-3) ... Selecting previously unselected package libcgraph6:armhf. Preparing to unpack .../096-libcgraph6_2.42.2-3_armhf.deb ... Unpacking libcgraph6:armhf (2.42.2-3) ... Selecting previously unselected package libxpm4:armhf. Preparing to unpack .../097-libxpm4_1%3a3.5.12-1_armhf.deb ... Unpacking libxpm4:armhf (1:3.5.12-1) ... Selecting previously unselected package libgd3:armhf. Preparing to unpack .../098-libgd3_2.2.5-5.2_armhf.deb ... Unpacking libgd3:armhf (2.2.5-5.2) ... Selecting previously unselected package libgts-0.7-5:armhf. Preparing to unpack .../099-libgts-0.7-5_0.7.6+darcs121130-4_armhf.deb ... Unpacking libgts-0.7-5:armhf (0.7.6+darcs121130-4) ... Selecting previously unselected package libpixman-1-0:armhf. Preparing to unpack .../100-libpixman-1-0_0.38.4-0ubuntu1_armhf.deb ... Unpacking libpixman-1-0:armhf (0.38.4-0ubuntu1) ... Selecting previously unselected package libxcb-render0:armhf. Preparing to unpack .../101-libxcb-render0_1.13.1-2_armhf.deb ... Unpacking libxcb-render0:armhf (1.13.1-2) ... Selecting previously unselected package libxcb-shm0:armhf. Preparing to unpack .../102-libxcb-shm0_1.13.1-2_armhf.deb ... Unpacking libxcb-shm0:armhf (1.13.1-2) ... Selecting previously unselected package libxrender1:armhf. Preparing to unpack .../103-libxrender1_1%3a0.9.10-1_armhf.deb ... Unpacking libxrender1:armhf (1:0.9.10-1) ... Selecting previously unselected package libcairo2:armhf. Preparing to unpack .../104-libcairo2_1.16.0-4ubuntu1_armhf.deb ... Unpacking libcairo2:armhf (1.16.0-4ubuntu1) ... Selecting previously unselected package libltdl7:armhf. Preparing to unpack .../105-libltdl7_2.4.6-11_armhf.deb ... Unpacking libltdl7:armhf (2.4.6-11) ... Selecting previously unselected package libgraphite2-3:armhf. Preparing to unpack .../106-libgraphite2-3_1.3.13-11_armhf.deb ... Unpacking libgraphite2-3:armhf (1.3.13-11) ... Selecting previously unselected package libharfbuzz0b:armhf. Preparing to unpack .../107-libharfbuzz0b_2.6.4-1ubuntu1_armhf.deb ... Unpacking libharfbuzz0b:armhf (2.6.4-1ubuntu1) ... Selecting previously unselected package libthai-data. Preparing to unpack .../108-libthai-data_0.1.28-3_all.deb ... Unpacking libthai-data (0.1.28-3) ... Selecting previously unselected package libdatrie1:armhf. Preparing to unpack .../109-libdatrie1_0.2.12-3_armhf.deb ... Unpacking libdatrie1:armhf (0.2.12-3) ... Selecting previously unselected package libthai0:armhf. Preparing to unpack .../110-libthai0_0.1.28-3_armhf.deb ... Unpacking libthai0:armhf (0.1.28-3) ... Selecting previously unselected package libpango-1.0-0:armhf. Preparing to unpack .../111-libpango-1.0-0_1.44.7-1_armhf.deb ... Unpacking libpango-1.0-0:armhf (1.44.7-1) ... Selecting previously unselected package libpangoft2-1.0-0:armhf. Preparing to unpack .../112-libpangoft2-1.0-0_1.44.7-1_armhf.deb ... Unpacking libpangoft2-1.0-0:armhf (1.44.7-1) ... Selecting previously unselected package libpangocairo-1.0-0:armhf. Preparing to unpack .../113-libpangocairo-1.0-0_1.44.7-1_armhf.deb ... Unpacking libpangocairo-1.0-0:armhf (1.44.7-1) ... Selecting previously unselected package libpathplan4:armhf. Preparing to unpack .../114-libpathplan4_2.42.2-3_armhf.deb ... Unpacking libpathplan4:armhf (2.42.2-3) ... Selecting previously unselected package libgvc6. Preparing to unpack .../115-libgvc6_2.42.2-3_armhf.deb ... Unpacking libgvc6 (2.42.2-3) ... Selecting previously unselected package libgvpr2:armhf. Preparing to unpack .../116-libgvpr2_2.42.2-3_armhf.deb ... Unpacking libgvpr2:armhf (2.42.2-3) ... Selecting previously unselected package liblab-gamut1:armhf. Preparing to unpack .../117-liblab-gamut1_2.42.2-3_armhf.deb ... Unpacking liblab-gamut1:armhf (2.42.2-3) ... Selecting previously unselected package x11-common. Preparing to unpack .../118-x11-common_1%3a7.7+19ubuntu12_all.deb ... dpkg-query: no packages found matching nux-tools Unpacking x11-common (1:7.7+19ubuntu12) ... Selecting previously unselected package libice6:armhf. Preparing to unpack .../119-libice6_2%3a1.0.10-0ubuntu1_armhf.deb ... Unpacking libice6:armhf (2:1.0.10-0ubuntu1) ... Selecting previously unselected package libsm6:armhf. Preparing to unpack .../120-libsm6_2%3a1.2.3-1_armhf.deb ... Unpacking libsm6:armhf (2:1.2.3-1) ... Selecting previously unselected package libxt6:armhf. Preparing to unpack .../121-libxt6_1%3a1.1.5-1_armhf.deb ... Unpacking libxt6:armhf (1:1.1.5-1) ... Selecting previously unselected package libxmu6:armhf. Preparing to unpack .../122-libxmu6_2%3a1.1.3-0ubuntu1_armhf.deb ... Unpacking libxmu6:armhf (2:1.1.3-0ubuntu1) ... Selecting previously unselected package libxaw7:armhf. Preparing to unpack .../123-libxaw7_2%3a1.0.13-1_armhf.deb ... Unpacking libxaw7:armhf (2:1.0.13-1) ... Selecting previously unselected package graphviz. Preparing to unpack .../124-graphviz_2.42.2-3_armhf.deb ... Unpacking graphviz (2.42.2-3) ... Selecting previously unselected package libsuitesparseconfig5:armhf. Preparing to unpack .../125-libsuitesparseconfig5_1%3a5.6.0+dfsg-2_armhf.deb ... Unpacking libsuitesparseconfig5:armhf (1:5.6.0+dfsg-2) ... Selecting previously unselected package libamd2:armhf. Preparing to unpack .../126-libamd2_1%3a5.6.0+dfsg-2_armhf.deb ... Unpacking libamd2:armhf (1:5.6.0+dfsg-2) ... Selecting previously unselected package libblas3:armhf. Preparing to unpack .../127-libblas3_3.9.0-1_armhf.deb ... Unpacking libblas3:armhf (3.9.0-1) ... Selecting previously unselected package libblas-dev:armhf. Preparing to unpack .../128-libblas-dev_3.9.0-1_armhf.deb ... Unpacking libblas-dev:armhf (3.9.0-1) ... Selecting previously unselected package libbtf1:armhf. Preparing to unpack .../129-libbtf1_1%3a5.6.0+dfsg-2_armhf.deb ... Unpacking libbtf1:armhf (1:5.6.0+dfsg-2) ... Selecting previously unselected package libcamd2:armhf. Preparing to unpack .../130-libcamd2_1%3a5.6.0+dfsg-2_armhf.deb ... Unpacking libcamd2:armhf (1:5.6.0+dfsg-2) ... Selecting previously unselected package libccolamd2:armhf. Preparing to unpack .../131-libccolamd2_1%3a5.6.0+dfsg-2_armhf.deb ... Unpacking libccolamd2:armhf (1:5.6.0+dfsg-2) ... Selecting previously unselected package libcolamd2:armhf. Preparing to unpack .../132-libcolamd2_1%3a5.6.0+dfsg-2_armhf.deb ... Unpacking libcolamd2:armhf (1:5.6.0+dfsg-2) ... Selecting previously unselected package libgfortran5:armhf. Preparing to unpack .../133-libgfortran5_9.2.1-21ubuntu1_armhf.deb ... Unpacking libgfortran5:armhf (9.2.1-21ubuntu1) ... Selecting previously unselected package liblapack3:armhf. Preparing to unpack .../134-liblapack3_3.9.0-1_armhf.deb ... Unpacking liblapack3:armhf (3.9.0-1) ... Selecting previously unselected package libmetis5:armhf. Preparing to unpack .../135-libmetis5_5.1.0.dfsg-5_armhf.deb ... Unpacking libmetis5:armhf (5.1.0.dfsg-5) ... Selecting previously unselected package libcholmod3:armhf. Preparing to unpack .../136-libcholmod3_1%3a5.6.0+dfsg-2_armhf.deb ... Unpacking libcholmod3:armhf (1:5.6.0+dfsg-2) ... Selecting previously unselected package libcxsparse3:armhf. Preparing to unpack .../137-libcxsparse3_1%3a5.6.0+dfsg-2_armhf.deb ... Unpacking libcxsparse3:armhf (1:5.6.0+dfsg-2) ... Selecting previously unselected package libglpk40:armhf. Preparing to unpack .../138-libglpk40_4.65-2_armhf.deb ... Unpacking libglpk40:armhf (4.65-2) ... Selecting previously unselected package libgmpxx4ldbl:armhf. Preparing to unpack .../139-libgmpxx4ldbl_2%3a6.1.2+dfsg-4_armhf.deb ... Unpacking libgmpxx4ldbl:armhf (2:6.1.2+dfsg-4) ... Selecting previously unselected package libgmp-dev:armhf. Preparing to unpack .../140-libgmp-dev_2%3a6.1.2+dfsg-4_armhf.deb ... Unpacking libgmp-dev:armhf (2:6.1.2+dfsg-4) ... Selecting previously unselected package zlib1g-dev:armhf. Preparing to unpack .../141-zlib1g-dev_1%3a1.2.11.dfsg-1ubuntu3_armhf.deb ... Unpacking zlib1g-dev:armhf (1:1.2.11.dfsg-1ubuntu3) ... Selecting previously unselected package libgraphblas3:armhf. Preparing to unpack .../142-libgraphblas3_1%3a5.6.0+dfsg-2_armhf.deb ... Unpacking libgraphblas3:armhf (1:5.6.0+dfsg-2) ... Selecting previously unselected package libklu1:armhf. Preparing to unpack .../143-libklu1_1%3a5.6.0+dfsg-2_armhf.deb ... Unpacking libklu1:armhf (1:5.6.0+dfsg-2) ... Selecting previously unselected package libldl2:armhf. Preparing to unpack .../144-libldl2_1%3a5.6.0+dfsg-2_armhf.deb ... Unpacking libldl2:armhf (1:5.6.0+dfsg-2) ... Selecting previously unselected package libmongoose2:armhf. Preparing to unpack .../145-libmongoose2_1%3a5.6.0+dfsg-2_armhf.deb ... Unpacking libmongoose2:armhf (1:5.6.0+dfsg-2) ... Selecting previously unselected package libumfpack5:armhf. Preparing to unpack .../146-libumfpack5_1%3a5.6.0+dfsg-2_armhf.deb ... Unpacking libumfpack5:armhf (1:5.6.0+dfsg-2) ... Selecting previously unselected package librbio2:armhf. Preparing to unpack .../147-librbio2_1%3a5.6.0+dfsg-2_armhf.deb ... Unpacking librbio2:armhf (1:5.6.0+dfsg-2) ... Selecting previously unselected package libspqr2:armhf. Preparing to unpack .../148-libspqr2_1%3a5.6.0+dfsg-2_armhf.deb ... Unpacking libspqr2:armhf (1:5.6.0+dfsg-2) ... Selecting previously unselected package liblapack-dev:armhf. Preparing to unpack .../149-liblapack-dev_3.9.0-1_armhf.deb ... Unpacking liblapack-dev:armhf (3.9.0-1) ... Selecting previously unselected package libsuitesparse-dev:armhf. Preparing to unpack .../150-libsuitesparse-dev_1%3a5.6.0+dfsg-2_armhf.deb ... Unpacking libsuitesparse-dev:armhf (1:5.6.0+dfsg-2) ... Selecting previously unselected package libglpk-dev:armhf. Preparing to unpack .../151-libglpk-dev_4.65-2_armhf.deb ... Unpacking libglpk-dev:armhf (4.65-2) ... Selecting previously unselected package libjs-mathjax. Preparing to unpack .../152-libjs-mathjax_2.7.4+dfsg-1_all.deb ... Unpacking libjs-mathjax (2.7.4+dfsg-1) ... Selecting previously unselected package sbuild-build-depends-liblemon-dummy. Preparing to unpack .../153-sbuild-build-depends-liblemon-dummy_0.invalid.0_armhf.deb ... Unpacking sbuild-build-depends-liblemon-dummy (0.invalid.0) ... Setting up libgs9-common (9.27~dfsg+0-0ubuntu4) ... Setting up libexpat1:armhf (2.2.9-1) ... Setting up libpipeline1:armhf (1.5.1-3) ... Setting up libgraphite2-3:armhf (1.3.13-11) ... Setting up libpixman-1-0:armhf (0.38.4-0ubuntu1) ... Setting up libxapian30:armhf (1.4.12-1) ... Setting up libgraphblas3:armhf (1:5.6.0+dfsg-2) ... Setting up libxau6:armhf (1:1.0.9-0ubuntu1) ... Setting up libkeyutils1:armhf (1.6-6ubuntu1) ... Setting up libpsl5:armhf (0.20.2-2) ... Setting up fonts-mathjax (2.7.4+dfsg-1) ... Setting up mime-support (3.64ubuntu1) ... Setting up libjs-mathjax (2.7.4+dfsg-1) ... Setting up libdatrie1:armhf (0.2.12-3) ... Setting up libmagic-mgc (1:5.37-6) ... Setting up libarchive-zip-perl (1.67-1) ... Setting up libglib2.0-0:armhf (2.63.3-1) ... No schema files found: doing nothing. Setting up libijs-0.35:armhf (0.35-15) ... Setting up libdebhelper-perl (12.7.1ubuntu1) ... Setting up libbrotli1:armhf (1.0.7-5) ... Setting up liblab-gamut1:armhf (2.42.2-3) ... Setting up x11-common (1:7.7+19ubuntu12) ... update-rc.d: warning: start and stop actions are no longer supported; falling back to defaults Running in chroot, ignoring request. invoke-rc.d: policy-rc.d denied execution of start. Setting up libldl2:armhf (1:5.6.0+dfsg-2) ... Setting up libnghttp2-14:armhf (1.40.0-1) ... Setting up libmagic1:armhf (1:5.37-6) ... Setting up gettext-base (0.19.8.1-10) ... Setting up libmetis5:armhf (5.1.0.dfsg-5) ... Setting up file (1:5.37-6) ... Setting up libldap-common (2.4.48+dfsg-1ubuntu3) ... Setting up libjbig0:armhf (2.1-3.1build1) ... Setting up libbtf1:armhf (1:5.6.0+dfsg-2) ... Setting up libicu63:armhf (63.2-2) ... Setting up poppler-data (0.4.9-2) ... Setting up libkrb5support0:armhf (1.17-6) ... Setting up libsasl2-modules-db:armhf (2.1.27+dfsg-2) ... Setting up libpython2.7-stdlib:armhf (2.7.17-1) ... Setting up libgts-0.7-5:armhf (0.7.6+darcs121130-4) ... Setting up autotools-dev (20180224.1) ... Setting up libblas3:armhf (3.9.0-1) ... update-alternatives: using /usr/lib/arm-linux-gnueabihf/blas/libblas.so.3 to provide /usr/lib/arm-linux-gnueabihf/libblas.so.3 (libblas.so.3-arm-linux-gnueabihf) in auto mode Setting up libgmpxx4ldbl:armhf (2:6.1.2+dfsg-4) ... Setting up libuv1:armhf (1.33.1-2) ... Setting up libfreetype6:armhf (2.10.1-2) ... Setting up libx11-data (2:1.6.8-1) ... Setting up libjbig2dec0:armhf (0.17-1) ... Setting up librtmp1:armhf (2.4+20151223.gitfa8646d.1-2build1) ... Setting up libidn11:armhf (1.33-2.2ubuntu2) ... Setting up libpathplan4:armhf (2.42.2-3) ... Setting up libavahi-common-data:armhf (0.7-4ubuntu6) ... Setting up libdbus-1-3:armhf (1.12.16-2ubuntu2) ... Setting up libsigsegv2:armhf (2.12-2) ... Setting up libfribidi0:armhf (1.0.7-1.1) ... Setting up autopoint (0.19.8.1-10) ... Setting up libwebp6:armhf (0.6.1-2) ... Setting up fonts-dejavu-core (2.37-1) ... Setting up d-shlibs (0.88) ... Setting up ucf (3.0038+nmu1) ... Setting up libk5crypto3:armhf (1.17-6) ... Setting up libjpeg-turbo8:armhf (2.0.3-0ubuntu1) ... Setting up libltdl7:armhf (2.4.6-11) ... Setting up libsasl2-2:armhf (2.1.27+dfsg-2) ... Setting up libgfortran5:armhf (9.2.1-21ubuntu1) ... Setting up libroken18-heimdal:armhf (7.7.0+dfsg-1) ... Setting up zlib1g-dev:armhf (1:1.2.11.dfsg-1ubuntu3) ... Setting up librhash0:armhf (1.3.9-1) ... Setting up libuchardet0:armhf (0.0.6-3) ... Setting up libsub-override-perl (0.09-2) ... Setting up libharfbuzz0b:armhf (2.6.4-1ubuntu1) ... Setting up libthai-data (0.1.28-3) ... Setting up libcxsparse3:armhf (1:5.6.0+dfsg-2) ... Setting up cmake-data (3.15.4-1ubuntu2) ... Setting up libcdt5:armhf (2.42.2-3) ... Setting up libkrb5-3:armhf (1.17-6) ... Setting up libcgraph6:armhf (2.42.2-3) ... Setting up libbsd0:armhf (0.10.0-1) ... Setting up libelf1:armhf (0.176-1.1) ... Setting up libxml2:armhf (2.9.4+dfsg1-8ubuntu1) ... Setting up libsuitesparseconfig5:armhf (1:5.6.0+dfsg-2) ... Setting up libblas-dev:armhf (3.9.0-1) ... update-alternatives: using /usr/lib/arm-linux-gnueabihf/blas/libblas.so to provide /usr/lib/arm-linux-gnueabihf/libblas.so (libblas.so-arm-linux-gnueabihf) in auto mode Setting up librbio2:armhf (1:5.6.0+dfsg-2) ... Setting up libjsoncpp1:armhf (1.7.4-3) ... Setting up libheimbase1-heimdal:armhf (7.7.0+dfsg-1) ... Setting up libjpeg8:armhf (8c-2ubuntu8) ... Setting up libfile-stripnondeterminism-perl (1.6.3-1) ... Setting up libamd2:armhf (1:5.6.0+dfsg-2) ... Setting up libpaper1:armhf (1.1.28) ... Creating config file /etc/papersize with new version Setting up libice6:armhf (2:1.0.10-0ubuntu1) ... Setting up libxdmcp6:armhf (1:1.1.3-0ubuntu1) ... Setting up liblapack3:armhf (3.9.0-1) ... update-alternatives: using /usr/lib/arm-linux-gnueabihf/lapack/liblapack.so.3 to provide /usr/lib/arm-linux-gnueabihf/liblapack.so.3 (liblapack.so.3-arm-linux-gnueabihf) in auto mode Setting up libxcb1:armhf (1.13.1-2) ... Setting up libgmp-dev:armhf (2:6.1.2+dfsg-4) ... Setting up libcolamd2:armhf (1:5.6.0+dfsg-2) ... Setting up python2.7 (2.7.17-1) ... Setting up libtool (2.4.6-11) ... Setting up libpython2-stdlib:armhf (2.7.17-1) ... Setting up libarchive13:armhf (3.4.0-1build1) ... Setting up libxcb-render0:armhf (1.13.1-2) ... Setting up fontconfig-config (2.13.1-2ubuntu2) ... Setting up libasn1-8-heimdal:armhf (7.7.0+dfsg-1) ... Setting up libedit2:armhf (3.1-20191211-1) ... Setting up libavahi-common3:armhf (0.7-4ubuntu6) ... Setting up m4 (1.4.18-4) ... Setting up libxcb-shm0:armhf (1.13.1-2) ... Setting up libhcrypto4-heimdal:armhf (7.7.0+dfsg-1) ... Setting up python2 (2.7.17-1) ... Setting up libthai0:armhf (0.1.28-3) ... Setting up libcamd2:armhf (1:5.6.0+dfsg-2) ... Setting up libmongoose2:armhf (1:5.6.0+dfsg-2) ... Setting up libpython-stdlib:armhf (2.7.17-1) ... Setting up libwind0-heimdal:armhf (7.7.0+dfsg-1) ... Setting up libglpk40:armhf (4.65-2) ... Setting up bsdmainutils (11.1.2ubuntu2) ... update-alternatives: using /usr/bin/bsd-write to provide /usr/bin/write (write) in auto mode update-alternatives: using /usr/bin/bsd-from to provide /usr/bin/from (from) in auto mode Setting up liblapack-dev:armhf (3.9.0-1) ... update-alternatives: using /usr/lib/arm-linux-gnueabihf/lapack/liblapack.so to provide /usr/lib/arm-linux-gnueabihf/liblapack.so (liblapack.so-arm-linux-gnueabihf) in auto mode Setting up libgssapi-krb5-2:armhf (1.17-6) ... Setting up libcroco3:armhf (0.6.13-1) ... Setting up libssh-4:armhf (0.9.0-1ubuntu5) ... Setting up autoconf (2.69-11ubuntu1) ... Setting up dh-strip-nondeterminism (1.6.3-1) ... Setting up libgvpr2:armhf (2.42.2-3) ... Setting up dwz (0.13-5) ... Setting up groff-base (1.22.4-4) ... Setting up libklu1:armhf (1:5.6.0+dfsg-2) ... Setting up libccolamd2:armhf (1:5.6.0+dfsg-2) ... Setting up libx11-6:armhf (2:1.6.8-1) ... Setting up libtiff5:armhf (4.1.0+git191117-1) ... Setting up libfontconfig1:armhf (2.13.1-2ubuntu2) ... Setting up libsm6:armhf (2:1.2.3-1) ... Setting up python (2.7.17-1) ... Setting up libavahi-client3:armhf (0.7-4ubuntu6) ... Setting up libcholmod3:armhf (1:5.6.0+dfsg-2) ... Setting up libllvm9:armhf (1:9.0.1-2) ... Setting up automake (1:1.16.1-4ubuntu3) ... update-alternatives: using /usr/bin/automake-1.16 to provide /usr/bin/automake (automake) in auto mode Setting up libspqr2:armhf (1:5.6.0+dfsg-2) ... Setting up fontconfig (2.13.1-2ubuntu2) ... Regenerating fonts cache... done. Setting up gettext (0.19.8.1-10) ... Setting up libxpm4:armhf (1:3.5.12-1) ... Setting up libxrender1:armhf (1:0.9.10-1) ... Setting up libclang1-9 (1:9.0.1-2) ... Setting up libhx509-5-heimdal:armhf (7.7.0+dfsg-1) ... Setting up libpango-1.0-0:armhf (1.44.7-1) ... Setting up libxext6:armhf (2:1.3.4-0ubuntu1) ... Setting up man-db (2.9.0-2) ... Not building database; man-db/auto-update is not 'true'. Created symlink /etc/systemd/system/timers.target.wants/man-db.timer → /lib/systemd/system/man-db.timer. Setting up libcairo2:armhf (1.16.0-4ubuntu1) ... Setting up intltool-debian (0.35.0+20060710.5) ... Setting up doxygen (1.8.13-12ubuntu1) ... Setting up libumfpack5:armhf (1:5.6.0+dfsg-2) ... Setting up libgd3:armhf (2.2.5-5.2) ... Setting up libxt6:armhf (1:1.1.5-1) ... Setting up libcups2:armhf (2.3.0-7) ... Setting up libpangoft2-1.0-0:armhf (1.44.7-1) ... Setting up libpangocairo-1.0-0:armhf (1.44.7-1) ... Setting up libkrb5-26-heimdal:armhf (7.7.0+dfsg-1) ... Setting up libxmu6:armhf (2:1.1.3-0ubuntu1) ... Setting up libgs9:armhf (9.27~dfsg+0-0ubuntu4) ... Setting up libsuitesparse-dev:armhf (1:5.6.0+dfsg-2) ... Setting up po-debconf (1.0.21) ... Setting up libxaw7:armhf (2:1.0.13-1) ... Setting up ghostscript (9.27~dfsg+0-0ubuntu4) ... Setting up libheimntlm0-heimdal:armhf (7.7.0+dfsg-1) ... Setting up libgssapi3-heimdal:armhf (7.7.0+dfsg-1) ... Setting up libglpk-dev:armhf (4.65-2) ... Setting up libgvc6 (2.42.2-3) ... Setting up graphviz (2.42.2-3) ... Setting up libldap-2.4-2:armhf (2.4.48+dfsg-1ubuntu3) ... Setting up libcurl4:armhf (7.66.0-1ubuntu1) ... Setting up cmake (3.15.4-1ubuntu2) ... Setting up debhelper (12.7.1ubuntu1) ... Setting up dh-autoreconf (19) ... Setting up sbuild-build-depends-liblemon-dummy (0.invalid.0) ... Processing triggers for libc-bin (2.30-0ubuntu3) ... Processing triggers for systemd (244-3ubuntu1) ... +------------------------------------------------------------------------------+ | Build environment | +------------------------------------------------------------------------------+ Kernel: Linux 4.4.0-170-generic arm64 (armv7l) Toolchain package versions: binutils_2.33.1-6ubuntu3 dpkg-dev_1.19.7ubuntu2 g++-9_9.2.1-21ubuntu1 gcc-9_9.2.1-21ubuntu1 libc6-dev_2.30-0ubuntu3 libstdc++-9-dev_9.2.1-21ubuntu1 libstdc++6_9.2.1-21ubuntu1 linux-libc-dev_5.3.0-24.26 Package versions: adduser_3.118ubuntu1 advancecomp_2.1-2.1 apt_1.9.5 autoconf_2.69-11ubuntu1 automake_1:1.16.1-4ubuntu3 autopoint_0.19.8.1-10 autotools-dev_20180224.1 base-files_11ubuntu2 base-passwd_3.5.47 bash_5.0-5ubuntu1 binutils_2.33.1-6ubuntu3 binutils-arm-linux-gnueabihf_2.33.1-6ubuntu3 binutils-common_2.33.1-6ubuntu3 bsdmainutils_11.1.2ubuntu2 bsdutils_1:2.34-0.1ubuntu4 build-essential_12.8ubuntu1 bzip2_1.0.8-2 ca-certificates_20190110 cmake_3.15.4-1ubuntu2 cmake-data_3.15.4-1ubuntu2 coreutils_8.30-3ubuntu2 cpp_4:9.2.1-3.1ubuntu1 cpp-9_9.2.1-21ubuntu1 d-shlibs_0.88 dash_0.5.10.2-6 debconf_1.5.73 debhelper_12.7.1ubuntu1 debianutils_4.9.1 dh-autoreconf_19 dh-strip-nondeterminism_1.6.3-1 diffutils_1:3.7-3 doxygen_1.8.13-12ubuntu1 dpkg_1.19.7ubuntu2 dpkg-dev_1.19.7ubuntu2 dwz_0.13-5 e2fsprogs_1.45.3-4ubuntu2 fakeroot_1.24-1 fdisk_2.34-0.1ubuntu4 file_1:5.37-6 findutils_4.6.0+git+20190209-2ubuntu1 fontconfig_2.13.1-2ubuntu2 fontconfig-config_2.13.1-2ubuntu2 fonts-dejavu-core_2.37-1 fonts-mathjax_2.7.4+dfsg-1 g++_4:9.2.1-3.1ubuntu1 g++-9_9.2.1-21ubuntu1 gcc_4:9.2.1-3.1ubuntu1 gcc-9_9.2.1-21ubuntu1 gcc-9-base_9.2.1-21ubuntu1 gettext_0.19.8.1-10 gettext-base_0.19.8.1-10 ghostscript_9.27~dfsg+0-0ubuntu4 gpg_2.2.17-3ubuntu1 gpg-agent_2.2.17-3ubuntu1 gpgconf_2.2.17-3ubuntu1 gpgv_2.2.17-3ubuntu1 graphviz_2.42.2-3 grep_3.3-1build1 groff-base_1.22.4-4 gzip_1.10-0ubuntu4 hostname_3.23 init_1.57 init-system-helpers_1.57 intltool-debian_0.35.0+20060710.5 libacl1_2.2.53-5ubuntu1 libamd2_1:5.6.0+dfsg-2 libapparmor1_2.13.3-7ubuntu1 libapt-pkg5.90_1.9.5 libarchive-zip-perl_1.67-1 libarchive13_3.4.0-1build1 libargon2-1_0~20171227-0.2 libasan5_9.2.1-21ubuntu1 libasn1-8-heimdal_7.7.0+dfsg-1 libassuan0_2.5.3-7ubuntu1 libatomic1_9.2.1-21ubuntu1 libattr1_1:2.4.48-5 libaudit-common_1:2.8.5-2ubuntu5 libaudit1_1:2.8.5-2ubuntu5 libavahi-client3_0.7-4ubuntu6 libavahi-common-data_0.7-4ubuntu6 libavahi-common3_0.7-4ubuntu6 libbinutils_2.33.1-6ubuntu3 libblas-dev_3.9.0-1 libblas3_3.9.0-1 libblkid1_2.34-0.1ubuntu4 libbrotli1_1.0.7-5 libbsd0_0.10.0-1 libbtf1_1:5.6.0+dfsg-2 libbz2-1.0_1.0.8-2 libc-bin_2.30-0ubuntu3 libc-dev-bin_2.30-0ubuntu3 libc6_2.30-0ubuntu3 libc6-dev_2.30-0ubuntu3 libcairo2_1.16.0-4ubuntu1 libcamd2_1:5.6.0+dfsg-2 libcap-ng0_0.7.9-2.1 libcap2_1:2.27-1 libcc1-0_9.2.1-21ubuntu1 libccolamd2_1:5.6.0+dfsg-2 libcdt5_2.42.2-3 libcgraph6_2.42.2-3 libcholmod3_1:5.6.0+dfsg-2 libclang1-9_1:9.0.1-2 libcolamd2_1:5.6.0+dfsg-2 libcom-err2_1.45.3-4ubuntu2 libcroco3_0.6.13-1 libcryptsetup12_2:2.2.2-1ubuntu1 libcups2_2.3.0-7 libcurl4_7.66.0-1ubuntu1 libcxsparse3_1:5.6.0+dfsg-2 libdatrie1_0.2.12-3 libdb5.3_5.3.28+dfsg1-0.6ubuntu1 libdbus-1-3_1.12.16-2ubuntu2 libdebconfclient0_0.250ubuntu2 libdebhelper-perl_12.7.1ubuntu1 libdevmapper1.02.1_2:1.02.155-2ubuntu7 libdpkg-perl_1.19.7ubuntu2 libedit2_3.1-20191211-1 libelf1_0.176-1.1 libexpat1_2.2.9-1 libext2fs2_1.45.3-4ubuntu2 libfakeroot_1.24-1 libfdisk1_2.34-0.1ubuntu4 libffi6_3.2.1-9 libfile-stripnondeterminism-perl_1.6.3-1 libfontconfig1_2.13.1-2ubuntu2 libfreetype6_2.10.1-2 libfribidi0_1.0.7-1.1 libgcc-9-dev_9.2.1-21ubuntu1 libgcc1_1:9.2.1-21ubuntu1 libgcrypt20_1.8.5-3ubuntu1 libgd3_2.2.5-5.2 libgdbm-compat4_1.18.1-5 libgdbm6_1.18.1-5 libgfortran5_9.2.1-21ubuntu1 libglib2.0-0_2.63.3-1 libglpk-dev_4.65-2 libglpk40_4.65-2 libgmp-dev_2:6.1.2+dfsg-4 libgmp10_2:6.1.2+dfsg-4 libgmpxx4ldbl_2:6.1.2+dfsg-4 libgnutls30_3.6.11.1-2 libgomp1_9.2.1-21ubuntu1 libgpg-error0_1.36-7 libgraphblas3_1:5.6.0+dfsg-2 libgraphite2-3_1.3.13-11 libgs9_9.27~dfsg+0-0ubuntu4 libgs9-common_9.27~dfsg+0-0ubuntu4 libgssapi-krb5-2_1.17-6 libgssapi3-heimdal_7.7.0+dfsg-1 libgts-0.7-5_0.7.6+darcs121130-4 libgvc6_2.42.2-3 libgvpr2_2.42.2-3 libharfbuzz0b_2.6.4-1ubuntu1 libhcrypto4-heimdal_7.7.0+dfsg-1 libheimbase1-heimdal_7.7.0+dfsg-1 libheimntlm0-heimdal_7.7.0+dfsg-1 libhogweed4_3.4.1-1 libhogweed5_3.5.1+really3.5.1-2 libhx509-5-heimdal_7.7.0+dfsg-1 libice6_2:1.0.10-0ubuntu1 libicu63_63.2-2 libidn11_1.33-2.2ubuntu2 libidn2-0_2.2.0-2 libijs-0.35_0.35-15 libip4tc2_1.8.3-2ubuntu5 libisl21_0.21-2 libisl22_0.22-2 libjbig0_2.1-3.1build1 libjbig2dec0_0.17-1 libjpeg-turbo8_2.0.3-0ubuntu1 libjpeg8_8c-2ubuntu8 libjs-mathjax_2.7.4+dfsg-1 libjson-c4_0.13.1+dfsg-6 libjsoncpp1_1.7.4-3 libk5crypto3_1.17-6 libkeyutils1_1.6-6ubuntu1 libklu1_1:5.6.0+dfsg-2 libkmod2_26-3ubuntu1 libkrb5-26-heimdal_7.7.0+dfsg-1 libkrb5-3_1.17-6 libkrb5support0_1.17-6 liblab-gamut1_2.42.2-3 liblapack-dev_3.9.0-1 liblapack3_3.9.0-1 libldap-2.4-2_2.4.48+dfsg-1ubuntu3 libldap-common_2.4.48+dfsg-1ubuntu3 libldl2_1:5.6.0+dfsg-2 libllvm9_1:9.0.1-2 liblockfile-bin_1.16-1.1 liblockfile1_1.16-1.1 libltdl7_2.4.6-11 liblz4-1_1.9.2-2 liblzma5_5.2.4-1 libmagic-mgc_1:5.37-6 libmagic1_1:5.37-6 libmetis5_5.1.0.dfsg-5 libmongoose2_1:5.6.0+dfsg-2 libmount1_2.34-0.1ubuntu4 libmpc3_1.1.0-1 libmpfr6_4.0.2-1 libncurses6_6.1+20191019-1ubuntu1 libncursesw6_6.1+20191019-1ubuntu1 libnettle6_3.4.1-1 libnettle7_3.5.1+really3.5.1-2 libnghttp2-14_1.40.0-1 libnpth0_1.6-1 libp11-kit0_0.23.18.1-2 libpam-modules_1.3.1-5ubuntu4 libpam-modules-bin_1.3.1-5ubuntu4 libpam-runtime_1.3.1-5ubuntu4 libpam0g_1.3.1-5ubuntu4 libpango-1.0-0_1.44.7-1 libpangocairo-1.0-0_1.44.7-1 libpangoft2-1.0-0_1.44.7-1 libpaper1_1.1.28 libpathplan4_2.42.2-3 libpcre2-8-0_10.34-7 libpcre3_2:8.39-12 libperl5.28_5.28.1-6build1 libperl5.30_5.30.0-9 libpipeline1_1.5.1-3 libpixman-1-0_0.38.4-0ubuntu1 libpng16-16_1.6.37-1 libprocps7_2:3.3.15-2ubuntu3 libpsl5_0.20.2-2 libpython-stdlib_2.7.17-1 libpython2-stdlib_2.7.17-1 libpython2.7-minimal_2.7.17-1 libpython2.7-stdlib_2.7.17-1 librbio2_1:5.6.0+dfsg-2 libreadline8_8.0-3 librhash0_1.3.9-1 libroken18-heimdal_7.7.0+dfsg-1 librtmp1_2.4+20151223.gitfa8646d.1-2build1 libsasl2-2_2.1.27+dfsg-2 libsasl2-modules-db_2.1.27+dfsg-2 libseccomp2_2.4.2-2ubuntu1 libselinux1_3.0-1 libsemanage-common_3.0-1 libsemanage1_3.0-1 libsepol1_3.0-1 libsigsegv2_2.12-2 libsm6_2:1.2.3-1 libsmartcols1_2.34-0.1ubuntu4 libspqr2_1:5.6.0+dfsg-2 libsqlite3-0_3.30.1-1ubuntu1 libss2_1.45.3-4ubuntu2 libssh-4_0.9.0-1ubuntu5 libssl1.1_1.1.1c-1ubuntu4 libstdc++-9-dev_9.2.1-21ubuntu1 libstdc++6_9.2.1-21ubuntu1 libsub-override-perl_0.09-2 libsuitesparse-dev_1:5.6.0+dfsg-2 libsuitesparseconfig5_1:5.6.0+dfsg-2 libsystemd0_244-3ubuntu1 libtasn1-6_4.15.0-2 libthai-data_0.1.28-3 libthai0_0.1.28-3 libtiff5_4.1.0+git191117-1 libtinfo6_6.1+20191019-1ubuntu1 libtool_2.4.6-11 libubsan1_9.2.1-21ubuntu1 libuchardet0_0.0.6-3 libudev1_244-3ubuntu1 libumfpack5_1:5.6.0+dfsg-2 libunistring2_0.9.10-2 libuuid1_2.34-0.1ubuntu4 libuv1_1.33.1-2 libwebp6_0.6.1-2 libwind0-heimdal_7.7.0+dfsg-1 libx11-6_2:1.6.8-1 libx11-data_2:1.6.8-1 libxapian30_1.4.12-1 libxau6_1:1.0.9-0ubuntu1 libxaw7_2:1.0.13-1 libxcb-render0_1.13.1-2 libxcb-shm0_1.13.1-2 libxcb1_1.13.1-2 libxdmcp6_1:1.1.3-0ubuntu1 libxext6_2:1.3.4-0ubuntu1 libxml2_2.9.4+dfsg1-8ubuntu1 libxmu6_2:1.1.3-0ubuntu1 libxpm4_1:3.5.12-1 libxrender1_1:0.9.10-1 libxt6_1:1.1.5-1 libzstd1_1.4.4+dfsg-1 linux-libc-dev_5.3.0-24.26 lockfile-progs_0.1.18 login_1:4.5-1.1ubuntu4 logsave_1.45.3-4ubuntu2 lsb-base_11.1.0ubuntu2 m4_1.4.18-4 make_4.2.1-1.2 man-db_2.9.0-2 mawk_1.3.3-17ubuntu3 mime-support_3.64ubuntu1 mount_2.34-0.1ubuntu4 ncurses-base_6.1+20191019-1ubuntu1 ncurses-bin_6.1+20191019-1ubuntu1 openssl_1.1.1c-1ubuntu4 optipng_0.7.7-1 passwd_1:4.5-1.1ubuntu4 patch_2.7.6-6 perl_5.30.0-9 perl-base_5.30.0-9 perl-modules-5.28_5.28.1-6build1 perl-modules-5.30_5.30.0-9 pinentry-curses_1.1.0-3 pkgbinarymangler_144 po-debconf_1.0.21 policyrcd-script-zg2_0.1-3 poppler-data_0.4.9-2 procps_2:3.3.15-2ubuntu3 python_2.7.17-1 python-minimal_2.7.17-1 python2_2.7.17-1 python2-minimal_2.7.17-1 python2.7_2.7.17-1 python2.7-minimal_2.7.17-1 readline-common_8.0-3 sbuild-build-depends-core-dummy_0.invalid.0 sbuild-build-depends-liblemon-dummy_0.invalid.0 sed_4.7-1 sensible-utils_0.0.12+nmu1 systemd_244-3ubuntu1 systemd-sysv_244-3ubuntu1 sysvinit-utils_2.96-1ubuntu1 tar_1.30+dfsg-6 tzdata_2019c-3 ubuntu-keyring_2018.09.18.1 ucf_3.0038+nmu1 util-linux_2.34-0.1ubuntu4 x11-common_1:7.7+19ubuntu12 xz-utils_5.2.4-1 zlib1g_1:1.2.11.dfsg-1ubuntu3 zlib1g-dev_1:1.2.11.dfsg-1ubuntu3 +------------------------------------------------------------------------------+ | Build | +------------------------------------------------------------------------------+ Unpack source ------------- gpgv: Signature made Wed Aug 22 14:42:02 2018 UTC gpgv: using RSA key F1F007320A035541F0A663CA578A0494D1C646D1 gpgv: issuer "tille@debian.org" gpgv: Can't check signature: No public key dpkg-source: warning: failed to verify signature on ./liblemon_1.3.1+dfsg-2.dsc dpkg-source: info: extracting liblemon in liblemon-1.3.1+dfsg dpkg-source: info: unpacking liblemon_1.3.1+dfsg.orig.tar.xz dpkg-source: info: unpacking liblemon_1.3.1+dfsg-2.debian.tar.xz dpkg-source: info: using patch list from debian/patches/series dpkg-source: info: applying dynamic_lib.patch dpkg-source: info: applying fix_libname.patch dpkg-source: info: applying 0002-Threadsafe-CplexEnv-473.patch dpkg-source: info: applying 0003-Fix-wrong-iteration-in-ListGraph-snapshot-part-II.-5.patch dpkg-source: info: applying 0004-Add-missing-include-to-capacity_scaling.h-600.patch dpkg-source: info: applying 0005-Add-missing-break-statement-to-dimacs-solver-609.patch Check disc space ---------------- Sufficient free space for build User Environment ---------------- APT_CONFIG=/var/lib/sbuild/apt.conf DEB_BUILD_OPTIONS=noautodbgsym parallel=4 HOME=/sbuild-nonexistent LANG=C.UTF-8 LC_ALL=C.UTF-8 LOGNAME=buildd PATH=/usr/local/sbin:/usr/local/bin:/usr/sbin:/usr/bin:/sbin:/bin:/usr/games SCHROOT_ALIAS_NAME=build-PACKAGEBUILD-18319570 SCHROOT_CHROOT_NAME=build-PACKAGEBUILD-18319570 SCHROOT_COMMAND=env SCHROOT_GID=2501 SCHROOT_GROUP=buildd SCHROOT_SESSION_ID=build-PACKAGEBUILD-18319570 SCHROOT_UID=2001 SCHROOT_USER=buildd SHELL=/bin/sh TERM=unknown USER=buildd V=1 dpkg-buildpackage ----------------- dpkg-buildpackage: info: source package liblemon dpkg-buildpackage: info: source version 1.3.1+dfsg-2 dpkg-buildpackage: info: source distribution unstable dpkg-source --before-build . dpkg-buildpackage: info: host architecture armhf fakeroot debian/rules clean dh clean dh_clean debian/rules build-arch dh build-arch dh_update_autotools_config -a dh_autoreconf -a dh_auto_configure -a cd obj-arm-linux-gnueabihf && cmake -DCMAKE_INSTALL_PREFIX=/usr -DCMAKE_BUILD_TYPE=None -DCMAKE_INSTALL_SYSCONFDIR=/etc -DCMAKE_INSTALL_LOCALSTATEDIR=/var -DCMAKE_EXPORT_NO_PACKAGE_REGISTRY=ON -DCMAKE_FIND_PACKAGE_NO_PACKAGE_REGISTRY=ON -DCMAKE_INSTALL_RUNSTATEDIR=/run "-GUnix Makefiles" -DCMAKE_VERBOSE_MAKEFILE=ON -DCMAKE_INSTALL_LIBDIR=lib/arm-linux-gnueabihf .. CMake Deprecation Warning at CMakeLists.txt:3 (CMAKE_POLICY): The OLD behavior for policy CMP0048 will be removed from a future version of CMake. The cmake-policies(7) manual explains that the OLD behaviors of all policies are deprecated and that a policy should be set to OLD only under specific short-term circumstances. Projects should be ported to the NEW behavior and not rely on setting a policy to OLD. -- The C compiler identification is GNU 9.2.1 -- The CXX compiler identification is GNU 9.2.1 -- Check for working C compiler: /usr/bin/cc -- Check for working C compiler: /usr/bin/cc -- works -- Detecting C compiler ABI info -- Detecting C compiler ABI info - done -- Detecting C compile features -- Detecting C compile features - done -- Check for working CXX compiler: /usr/bin/c++ -- Check for working CXX compiler: /usr/bin/c++ -- works -- Detecting CXX compiler ABI info -- Detecting CXX compiler ABI info - done -- Detecting CXX compile features -- Detecting CXX compile features - done -- Found PythonInterp: /usr/bin/python (found version "2.7.17") -- Could NOT find Wget (missing: WGET_EXECUTABLE) -- Found Doxygen: /usr/bin/doxygen (found version "1.8.13") found components: doxygen dot -- Found Ghostscript: /usr/bin/gs -- Found GLPK: /usr/lib/arm-linux-gnueabihf/libglpk.so (Required is at least version "4.33") -- Could NOT find ILOG (missing: ILOG_CPLEX_LIBRARY ILOG_CPLEX_INCLUDE_DIR) -- Could NOT find COIN (missing: COIN_INCLUDE_DIR COIN_CBC_LIBRARY COIN_CBC_SOLVER_LIBRARY COIN_CGL_LIBRARY COIN_CLP_LIBRARY COIN_COIN_UTILS_LIBRARY COIN_OSI_LIBRARY COIN_OSI_CBC_LIBRARY COIN_OSI_CLP_LIBRARY) -- Could NOT find SOPLEX (missing: SOPLEX_LIBRARY SOPLEX_INCLUDE_DIR) -- Looking for sys/types.h -- Looking for sys/types.h - found -- Looking for stdint.h -- Looking for stdint.h - found -- Looking for stddef.h -- Looking for stddef.h - found -- Check size of long long -- Check size of long long - done -- Looking for pthread.h -- Looking for pthread.h - found -- Performing Test CMAKE_HAVE_LIBC_PTHREAD -- Performing Test CMAKE_HAVE_LIBC_PTHREAD - Failed -- Looking for pthread_create in pthreads -- Looking for pthread_create in pthreads - not found -- Looking for pthread_create in pthread -- Looking for pthread_create in pthread - found -- Found Threads: TRUE -- Configuring done -- Generating done CMake Warning: Manually-specified variables were not used by the project: CMAKE_EXPORT_NO_PACKAGE_REGISTRY CMAKE_INSTALL_LIBDIR CMAKE_INSTALL_LOCALSTATEDIR CMAKE_INSTALL_RUNSTATEDIR CMAKE_INSTALL_SYSCONFDIR -- Build files have been written to: /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf debian/rules override_dh_auto_build make[1]: Entering directory '/<>/liblemon-1.3.1+dfsg' dh_auto_build cd obj-arm-linux-gnueabihf && make -j4 "INSTALL=install --strip-program=true" make[2]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' /usr/bin/cmake -S/<>/liblemon-1.3.1+dfsg -B/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf --check-build-system CMakeFiles/Makefile.cmake 0 /usr/bin/cmake -E cmake_progress_start /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/CMakeFiles /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/CMakeFiles/progress.marks make -f CMakeFiles/Makefile2 all make[3]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' make -f lemon/CMakeFiles/lemon.dir/build.make lemon/CMakeFiles/lemon.dir/depend make -f lemon/CMakeFiles/lemon_static.dir/build.make lemon/CMakeFiles/lemon_static.dir/depend make[4]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<>/liblemon-1.3.1+dfsg /<>/liblemon-1.3.1+dfsg/lemon /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon/CMakeFiles/lemon_static.dir/DependInfo.cmake --color= make[4]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<>/liblemon-1.3.1+dfsg /<>/liblemon-1.3.1+dfsg/lemon /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon/CMakeFiles/lemon.dir/DependInfo.cmake --color= Scanning dependencies of target lemon Scanning dependencies of target lemon_static make[4]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' make[4]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' make -f lemon/CMakeFiles/lemon.dir/build.make lemon/CMakeFiles/lemon.dir/build make -f lemon/CMakeFiles/lemon_static.dir/build.make lemon/CMakeFiles/lemon_static.dir/build make[4]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' make[4]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 12%] Building CXX object lemon/CMakeFiles/lemon.dir/arg_parser.cc.o [ 12%] Building CXX object lemon/CMakeFiles/lemon.dir/base.cc.o [ 12%] Building CXX object lemon/CMakeFiles/lemon_static.dir/arg_parser.cc.o cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon && /usr/bin/c++ -Dlemon_EXPORTS -I/<>/liblemon-1.3.1+dfsg -I/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -fPIC -o CMakeFiles/lemon.dir/base.cc.o -c /<>/liblemon-1.3.1+dfsg/lemon/base.cc cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon && /usr/bin/c++ -I/<>/liblemon-1.3.1+dfsg -I/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -o CMakeFiles/lemon_static.dir/arg_parser.cc.o -c /<>/liblemon-1.3.1+dfsg/lemon/arg_parser.cc cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon && /usr/bin/c++ -Dlemon_EXPORTS -I/<>/liblemon-1.3.1+dfsg -I/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -fPIC -o CMakeFiles/lemon.dir/arg_parser.cc.o -c /<>/liblemon-1.3.1+dfsg/lemon/arg_parser.cc [ 16%] Building CXX object lemon/CMakeFiles/lemon_static.dir/base.cc.o cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon && /usr/bin/c++ -I/<>/liblemon-1.3.1+dfsg -I/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -o CMakeFiles/lemon_static.dir/base.cc.o -c /<>/liblemon-1.3.1+dfsg/lemon/base.cc [ 20%] Building CXX object lemon/CMakeFiles/lemon_static.dir/color.cc.o [ 20%] Building CXX object lemon/CMakeFiles/lemon.dir/color.cc.o cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon && /usr/bin/c++ -I/<>/liblemon-1.3.1+dfsg -I/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -o CMakeFiles/lemon_static.dir/color.cc.o -c /<>/liblemon-1.3.1+dfsg/lemon/color.cc cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon && /usr/bin/c++ -Dlemon_EXPORTS -I/<>/liblemon-1.3.1+dfsg -I/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -fPIC -o CMakeFiles/lemon.dir/color.cc.o -c /<>/liblemon-1.3.1+dfsg/lemon/color.cc [ 24%] Building CXX object lemon/CMakeFiles/lemon_static.dir/lp_base.cc.o cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon && /usr/bin/c++ -I/<>/liblemon-1.3.1+dfsg -I/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -o CMakeFiles/lemon_static.dir/lp_base.cc.o -c /<>/liblemon-1.3.1+dfsg/lemon/lp_base.cc [ 28%] Building CXX object lemon/CMakeFiles/lemon.dir/lp_base.cc.o cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon && /usr/bin/c++ -Dlemon_EXPORTS -I/<>/liblemon-1.3.1+dfsg -I/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -fPIC -o CMakeFiles/lemon.dir/lp_base.cc.o -c /<>/liblemon-1.3.1+dfsg/lemon/lp_base.cc [ 36%] Building CXX object lemon/CMakeFiles/lemon.dir/lp_skeleton.cc.o [ 36%] Building CXX object lemon/CMakeFiles/lemon_static.dir/lp_skeleton.cc.o cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon && /usr/bin/c++ -I/<>/liblemon-1.3.1+dfsg -I/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -o CMakeFiles/lemon_static.dir/lp_skeleton.cc.o -c /<>/liblemon-1.3.1+dfsg/lemon/lp_skeleton.cc cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon && /usr/bin/c++ -Dlemon_EXPORTS -I/<>/liblemon-1.3.1+dfsg -I/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -fPIC -o CMakeFiles/lemon.dir/lp_skeleton.cc.o -c /<>/liblemon-1.3.1+dfsg/lemon/lp_skeleton.cc [ 40%] Building CXX object lemon/CMakeFiles/lemon_static.dir/random.cc.o cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon && /usr/bin/c++ -I/<>/liblemon-1.3.1+dfsg -I/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -o CMakeFiles/lemon_static.dir/random.cc.o -c /<>/liblemon-1.3.1+dfsg/lemon/random.cc [ 40%] Building CXX object lemon/CMakeFiles/lemon.dir/random.cc.o cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon && /usr/bin/c++ -Dlemon_EXPORTS -I/<>/liblemon-1.3.1+dfsg -I/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -fPIC -o CMakeFiles/lemon.dir/random.cc.o -c /<>/liblemon-1.3.1+dfsg/lemon/random.cc [ 44%] Building CXX object lemon/CMakeFiles/lemon.dir/bits/windows.cc.o cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon && /usr/bin/c++ -Dlemon_EXPORTS -I/<>/liblemon-1.3.1+dfsg -I/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -fPIC -o CMakeFiles/lemon.dir/bits/windows.cc.o -c /<>/liblemon-1.3.1+dfsg/lemon/bits/windows.cc [ 48%] Building CXX object lemon/CMakeFiles/lemon_static.dir/bits/windows.cc.o cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon && /usr/bin/c++ -I/<>/liblemon-1.3.1+dfsg -I/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -o CMakeFiles/lemon_static.dir/bits/windows.cc.o -c /<>/liblemon-1.3.1+dfsg/lemon/bits/windows.cc [ 52%] Building CXX object lemon/CMakeFiles/lemon.dir/glpk.cc.o cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon && /usr/bin/c++ -Dlemon_EXPORTS -I/<>/liblemon-1.3.1+dfsg -I/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -fPIC -o CMakeFiles/lemon.dir/glpk.cc.o -c /<>/liblemon-1.3.1+dfsg/lemon/glpk.cc [ 56%] Building CXX object lemon/CMakeFiles/lemon_static.dir/glpk.cc.o cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon && /usr/bin/c++ -I/<>/liblemon-1.3.1+dfsg -I/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -o CMakeFiles/lemon_static.dir/glpk.cc.o -c /<>/liblemon-1.3.1+dfsg/lemon/glpk.cc In file included from /usr/include/c++/9/vector:72, from /<>/liblemon-1.3.1+dfsg/lemon/lp_base.h:23, from /<>/liblemon-1.3.1+dfsg/lemon/glpk.h:26, from /<>/liblemon-1.3.1+dfsg/lemon/glpk.cc:22: /usr/include/c++/9/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(std::vector<_Tp, _Alloc>::iterator, _Args&& ...) [with _Args = {const double&}; _Tp = double; _Alloc = std::allocator]’: /usr/include/c++/9/bits/vector.tcc:426:7: note: parameter passing for argument of type ‘std::vector::iterator’ {aka ‘__gnu_cxx::__normal_iterator >’} changed in GCC 7.1 426 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/9/vector:67, from /<>/liblemon-1.3.1+dfsg/lemon/lp_base.h:23, from /<>/liblemon-1.3.1+dfsg/lemon/glpk.h:26, from /<>/liblemon-1.3.1+dfsg/lemon/glpk.cc:22: /usr/include/c++/9/bits/stl_vector.h: In member function ‘virtual int lemon::GlpkBase::_addRow(lemon::LpBase::Value, lemon::LpBase::ExprIterator, lemon::LpBase::ExprIterator, lemon::LpBase::Value)’: /usr/include/c++/9/bits/stl_vector.h:1195:4: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator >’ changed in GCC 7.1 1195 | _M_realloc_insert(end(), __x); | ^~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/9/vector:72, from /<>/liblemon-1.3.1+dfsg/lemon/lp_base.h:23, from /<>/liblemon-1.3.1+dfsg/lemon/glpk.h:26, from /<>/liblemon-1.3.1+dfsg/lemon/glpk.cc:22: /usr/include/c++/9/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(std::vector<_Tp, _Alloc>::iterator, _Args&& ...) [with _Args = {const double&}; _Tp = double; _Alloc = std::allocator]’: /usr/include/c++/9/bits/vector.tcc:426:7: note: parameter passing for argument of type ‘std::vector::iterator’ {aka ‘__gnu_cxx::__normal_iterator >’} changed in GCC 7.1 426 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/9/vector:67, from /<>/liblemon-1.3.1+dfsg/lemon/lp_base.h:23, from /<>/liblemon-1.3.1+dfsg/lemon/glpk.h:26, from /<>/liblemon-1.3.1+dfsg/lemon/glpk.cc:22: /usr/include/c++/9/bits/stl_vector.h: In member function ‘virtual int lemon::GlpkBase::_addRow(lemon::LpBase::Value, lemon::LpBase::ExprIterator, lemon::LpBase::ExprIterator, lemon::LpBase::Value)’: /usr/include/c++/9/bits/stl_vector.h:1195:4: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator >’ changed in GCC 7.1 1195 | _M_realloc_insert(end(), __x); | ^~~~~~~~~~~~~~~~~ /usr/include/c++/9/bits/stl_vector.h: In member function ‘virtual void lemon::GlpkBase::_setColCoeffs(int, lemon::LpBase::ExprIterator, lemon::LpBase::ExprIterator)’: /usr/include/c++/9/bits/stl_vector.h:1195:4: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator >’ changed in GCC 7.1 1195 | _M_realloc_insert(end(), __x); | ^~~~~~~~~~~~~~~~~ /usr/include/c++/9/bits/stl_vector.h: In member function ‘virtual void lemon::GlpkBase::_setColCoeffs(int, lemon::LpBase::ExprIterator, lemon::LpBase::ExprIterator)’: /usr/include/c++/9/bits/stl_vector.h:1195:4: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator >’ changed in GCC 7.1 1195 | _M_realloc_insert(end(), __x); | ^~~~~~~~~~~~~~~~~ /usr/include/c++/9/bits/stl_vector.h: In member function ‘virtual void lemon::GlpkBase::_setRowCoeffs(int, lemon::LpBase::ExprIterator, lemon::LpBase::ExprIterator)’: /usr/include/c++/9/bits/stl_vector.h:1195:4: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator >’ changed in GCC 7.1 1195 | _M_realloc_insert(end(), __x); | ^~~~~~~~~~~~~~~~~ /usr/include/c++/9/bits/stl_vector.h: In member function ‘virtual void lemon::GlpkBase::_setRowCoeffs(int, lemon::LpBase::ExprIterator, lemon::LpBase::ExprIterator)’: /usr/include/c++/9/bits/stl_vector.h:1195:4: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator >’ changed in GCC 7.1 1195 | _M_realloc_insert(end(), __x); | ^~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/9/vector:72, from /<>/liblemon-1.3.1+dfsg/lemon/lp_base.h:23, from /<>/liblemon-1.3.1+dfsg/lemon/glpk.h:26, from /<>/liblemon-1.3.1+dfsg/lemon/glpk.cc:22: /usr/include/c++/9/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_fill_insert(std::vector<_Tp, _Alloc>::iterator, std::vector<_Tp, _Alloc>::size_type, const value_type&) [with _Tp = double; _Alloc = std::allocator]’: /usr/include/c++/9/bits/vector.tcc:509:5: note: parameter passing for argument of type ‘std::vector::iterator’ {aka ‘__gnu_cxx::__normal_iterator >’} changed in GCC 7.1 509 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/9/vector:72, from /<>/liblemon-1.3.1+dfsg/lemon/lp_base.h:23, from /<>/liblemon-1.3.1+dfsg/lemon/glpk.h:26, from /<>/liblemon-1.3.1+dfsg/lemon/glpk.cc:22: /usr/include/c++/9/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_fill_insert(std::vector<_Tp, _Alloc>::iterator, std::vector<_Tp, _Alloc>::size_type, const value_type&) [with _Tp = double; _Alloc = std::allocator]’: /usr/include/c++/9/bits/vector.tcc:509:5: note: parameter passing for argument of type ‘std::vector::iterator’ {aka ‘__gnu_cxx::__normal_iterator >’} changed in GCC 7.1 509 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/9/vector:67, from /<>/liblemon-1.3.1+dfsg/lemon/lp_base.h:23, from /<>/liblemon-1.3.1+dfsg/lemon/glpk.h:26, from /<>/liblemon-1.3.1+dfsg/lemon/glpk.cc:22: /usr/include/c++/9/bits/stl_vector.h: In member function ‘virtual lemon::LpBase::Value lemon::GlpkLp::_getDualRay(int) const’: /usr/include/c++/9/bits/stl_vector.h:957:4: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator >’ changed in GCC 7.1 957 | _M_fill_insert(end(), __new_size - size(), __x); | ^~~~~~~~~~~~~~ In file included from /usr/include/c++/9/vector:67, from /<>/liblemon-1.3.1+dfsg/lemon/lp_base.h:23, from /<>/liblemon-1.3.1+dfsg/lemon/glpk.h:26, from /<>/liblemon-1.3.1+dfsg/lemon/glpk.cc:22: /usr/include/c++/9/bits/stl_vector.h: In member function ‘virtual lemon::LpBase::Value lemon::GlpkLp::_getDualRay(int) const’: /usr/include/c++/9/bits/stl_vector.h:957:4: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator >’ changed in GCC 7.1 957 | _M_fill_insert(end(), __new_size - size(), __x); | ^~~~~~~~~~~~~~ /usr/include/c++/9/bits/stl_vector.h: In member function ‘virtual lemon::LpBase::Value lemon::GlpkLp::_getPrimalRay(int) const’: /usr/include/c++/9/bits/stl_vector.h:957:4: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator >’ changed in GCC 7.1 957 | _M_fill_insert(end(), __new_size - size(), __x); | ^~~~~~~~~~~~~~ /usr/include/c++/9/bits/stl_vector.h: In member function ‘virtual lemon::LpBase::Value lemon::GlpkLp::_getPrimalRay(int) const’: /usr/include/c++/9/bits/stl_vector.h:957:4: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator >’ changed in GCC 7.1 957 | _M_fill_insert(end(), __new_size - size(), __x); | ^~~~~~~~~~~~~~ [ 60%] Linking CXX shared library liblemon.so cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon && /usr/bin/cmake -E cmake_link_script CMakeFiles/lemon.dir/link.txt --verbose=1 /usr/bin/c++ -fPIC -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -Wl,-Bsymbolic-functions -Wl,-z,relro -Wl,-z,now -shared -Wl,-soname,liblemon.so.1.3.1 -o liblemon.so.1.3.1 CMakeFiles/lemon.dir/arg_parser.cc.o CMakeFiles/lemon.dir/base.cc.o CMakeFiles/lemon.dir/color.cc.o CMakeFiles/lemon.dir/lp_base.cc.o CMakeFiles/lemon.dir/lp_skeleton.cc.o CMakeFiles/lemon.dir/random.cc.o CMakeFiles/lemon.dir/bits/windows.cc.o CMakeFiles/lemon.dir/glpk.cc.o -lglpk [ 64%] Linking CXX static library liblemon_static.a cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon && /usr/bin/cmake -P CMakeFiles/lemon_static.dir/cmake_clean_target.cmake cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon && /usr/bin/cmake -E cmake_link_script CMakeFiles/lemon_static.dir/link.txt --verbose=1 /usr/bin/ar qc liblemon_static.a CMakeFiles/lemon_static.dir/arg_parser.cc.o CMakeFiles/lemon_static.dir/base.cc.o CMakeFiles/lemon_static.dir/color.cc.o CMakeFiles/lemon_static.dir/lp_base.cc.o CMakeFiles/lemon_static.dir/lp_skeleton.cc.o CMakeFiles/lemon_static.dir/random.cc.o CMakeFiles/lemon_static.dir/bits/windows.cc.o CMakeFiles/lemon_static.dir/glpk.cc.o /usr/bin/ranlib liblemon_static.a make[4]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 64%] Built target lemon_static cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon && /usr/bin/cmake -E cmake_symlink_library liblemon.so.1.3.1 liblemon.so.1.3.1 liblemon.so make[4]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 64%] Built target lemon make -f demo/CMakeFiles/graph_to_eps_demo.dir/build.make demo/CMakeFiles/graph_to_eps_demo.dir/depend make -f demo/CMakeFiles/lgf_demo.dir/build.make demo/CMakeFiles/lgf_demo.dir/depend make[4]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<>/liblemon-1.3.1+dfsg /<>/liblemon-1.3.1+dfsg/demo /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/demo /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/demo/CMakeFiles/graph_to_eps_demo.dir/DependInfo.cmake --color= make -f demo/CMakeFiles/arg_parser_demo.dir/build.make demo/CMakeFiles/arg_parser_demo.dir/depend make -f tools/CMakeFiles/lgf-gen.dir/build.make tools/CMakeFiles/lgf-gen.dir/depend make[4]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<>/liblemon-1.3.1+dfsg /<>/liblemon-1.3.1+dfsg/demo /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/demo /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/demo/CMakeFiles/lgf_demo.dir/DependInfo.cmake --color= make[4]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<>/liblemon-1.3.1+dfsg /<>/liblemon-1.3.1+dfsg/demo /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/demo /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/demo/CMakeFiles/arg_parser_demo.dir/DependInfo.cmake --color= make[4]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<>/liblemon-1.3.1+dfsg /<>/liblemon-1.3.1+dfsg/tools /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/tools /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/tools/CMakeFiles/lgf-gen.dir/DependInfo.cmake --color= Scanning dependencies of target graph_to_eps_demo Scanning dependencies of target arg_parser_demo make[4]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' Scanning dependencies of target lgf_demo make -f demo/CMakeFiles/graph_to_eps_demo.dir/build.make demo/CMakeFiles/graph_to_eps_demo.dir/build make[4]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' make -f demo/CMakeFiles/arg_parser_demo.dir/build.make demo/CMakeFiles/arg_parser_demo.dir/build make[4]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' make[4]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' make -f demo/CMakeFiles/lgf_demo.dir/build.make demo/CMakeFiles/lgf_demo.dir/build make[4]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' make[4]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 68%] Building CXX object demo/CMakeFiles/graph_to_eps_demo.dir/graph_to_eps_demo.cc.o [ 76%] Building CXX object demo/CMakeFiles/arg_parser_demo.dir/arg_parser_demo.cc.o [ 76%] Building CXX object demo/CMakeFiles/lgf_demo.dir/lgf_demo.cc.o cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/demo && /usr/bin/c++ -I/<>/liblemon-1.3.1+dfsg -I/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -o CMakeFiles/graph_to_eps_demo.dir/graph_to_eps_demo.cc.o -c /<>/liblemon-1.3.1+dfsg/demo/graph_to_eps_demo.cc Scanning dependencies of target lgf-gen cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/demo && /usr/bin/c++ -I/<>/liblemon-1.3.1+dfsg -I/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -o CMakeFiles/lgf_demo.dir/lgf_demo.cc.o -c /<>/liblemon-1.3.1+dfsg/demo/lgf_demo.cc cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/demo && /usr/bin/c++ -I/<>/liblemon-1.3.1+dfsg -I/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -o CMakeFiles/arg_parser_demo.dir/arg_parser_demo.cc.o -c /<>/liblemon-1.3.1+dfsg/demo/arg_parser_demo.cc make[4]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' make -f tools/CMakeFiles/lgf-gen.dir/build.make tools/CMakeFiles/lgf-gen.dir/build make[4]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 76%] Building CXX object tools/CMakeFiles/lgf-gen.dir/lgf-gen.cc.o cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/tools && /usr/bin/c++ -I/<>/liblemon-1.3.1+dfsg -I/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -o CMakeFiles/lgf-gen.dir/lgf-gen.cc.o -c /<>/liblemon-1.3.1+dfsg/tools/lgf-gen.cc [ 80%] Linking CXX executable arg_parser_demo cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/demo && /usr/bin/cmake -E cmake_link_script CMakeFiles/arg_parser_demo.dir/link.txt --verbose=1 /usr/bin/c++ -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -Wl,-Bsymbolic-functions -Wl,-z,relro -Wl,-z,now -rdynamic CMakeFiles/arg_parser_demo.dir/arg_parser_demo.cc.o -o arg_parser_demo -L/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[4]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 80%] Built target arg_parser_demo make -f tools/CMakeFiles/dimacs-to-lgf.dir/build.make tools/CMakeFiles/dimacs-to-lgf.dir/depend make[4]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<>/liblemon-1.3.1+dfsg /<>/liblemon-1.3.1+dfsg/tools /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/tools /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/tools/CMakeFiles/dimacs-to-lgf.dir/DependInfo.cmake --color= Scanning dependencies of target dimacs-to-lgf make[4]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' make -f tools/CMakeFiles/dimacs-to-lgf.dir/build.make tools/CMakeFiles/dimacs-to-lgf.dir/build make[4]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 84%] Building CXX object tools/CMakeFiles/dimacs-to-lgf.dir/dimacs-to-lgf.cc.o cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/tools && /usr/bin/c++ -I/<>/liblemon-1.3.1+dfsg -I/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -o CMakeFiles/dimacs-to-lgf.dir/dimacs-to-lgf.cc.o -c /<>/liblemon-1.3.1+dfsg/tools/dimacs-to-lgf.cc /<>/liblemon-1.3.1+dfsg/tools/dimacs-to-lgf.cc: In function ‘int main(int, const char**)’: /<>/liblemon-1.3.1+dfsg/tools/dimacs-to-lgf.cc:73:7: warning: this statement may fall through [-Wimplicit-fallthrough=] 73 | if (!output) { | ^~ /<>/liblemon-1.3.1+dfsg/tools/dimacs-to-lgf.cc:76:5: note: here 76 | case 1: | ^~~~ In file included from /usr/include/c++/9/vector:72, from /<>/liblemon-1.3.1+dfsg/lemon/core.h:22, from /<>/liblemon-1.3.1+dfsg/lemon/list_graph.h:26, from /<>/liblemon-1.3.1+dfsg/demo/graph_to_eps_demo.cc:33: /usr/include/c++/9/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(std::vector<_Tp, _Alloc>::iterator, _Args&& ...) [with _Args = {lemon::Color}; _Tp = lemon::Color; _Alloc = std::allocator]’: /usr/include/c++/9/bits/vector.tcc:426:7: note: parameter passing for argument of type ‘std::vector::iterator’ {aka ‘__gnu_cxx::__normal_iterator >’} changed in GCC 7.1 426 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/9/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {lemon::Color}; _Tp = lemon::Color; _Alloc = std::allocator]’: /usr/include/c++/9/bits/vector.tcc:121:4: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator >’ changed in GCC 7.1 121 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ^~~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/graph_to_eps.h:37, from /<>/liblemon-1.3.1+dfsg/demo/graph_to_eps_demo.cc:34: /<>/liblemon-1.3.1+dfsg/lemon/dim2.h: In member function ‘void lemon::GraphToEps::run() [with T = lemon::GraphToEps >::CoordsTraits::NodeMap > >]’: /<>/liblemon-1.3.1+dfsg/lemon/dim2.h:490:11: warning: ‘bb.lemon::dim2::Box::_top_right.lemon::dim2::Point::y’ may be used uninitialized in this function [-Wmaybe-uninitialized] 490 | if (_top_right.y < u.y) _top_right.y = u.y; | ^~ In file included from /<>/liblemon-1.3.1+dfsg/demo/graph_to_eps_demo.cc:34: /<>/liblemon-1.3.1+dfsg/lemon/graph_to_eps.h:721:23: note: ‘bb.lemon::dim2::Box::_top_right.lemon::dim2::Point::y’ was declared here 721 | dim2::Box bb; | ^~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/graph_to_eps.h:37, from /<>/liblemon-1.3.1+dfsg/demo/graph_to_eps_demo.cc:34: /<>/liblemon-1.3.1+dfsg/lemon/dim2.h:489:11: warning: ‘bb.lemon::dim2::Box::_top_right.lemon::dim2::Point::x’ may be used uninitialized in this function [-Wmaybe-uninitialized] 489 | if (_top_right.x < u.x) _top_right.x = u.x; | ^~ In file included from /<>/liblemon-1.3.1+dfsg/demo/graph_to_eps_demo.cc:34: /<>/liblemon-1.3.1+dfsg/lemon/graph_to_eps.h:721:23: note: ‘bb.lemon::dim2::Box::_top_right.lemon::dim2::Point::x’ was declared here 721 | dim2::Box bb; | ^~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/graph_to_eps.h:37, from /<>/liblemon-1.3.1+dfsg/demo/graph_to_eps_demo.cc:34: /<>/liblemon-1.3.1+dfsg/lemon/dim2.h:488:11: warning: ‘bb.lemon::dim2::Box::_bottom_left.lemon::dim2::Point::y’ may be used uninitialized in this function [-Wmaybe-uninitialized] 488 | if (_bottom_left.y > u.y) _bottom_left.y = u.y; | ^~ In file included from /<>/liblemon-1.3.1+dfsg/demo/graph_to_eps_demo.cc:34: /<>/liblemon-1.3.1+dfsg/lemon/graph_to_eps.h:721:23: note: ‘bb.lemon::dim2::Box::_bottom_left.lemon::dim2::Point::y’ was declared here 721 | dim2::Box bb; | ^~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/graph_to_eps.h:37, from /<>/liblemon-1.3.1+dfsg/demo/graph_to_eps_demo.cc:34: /<>/liblemon-1.3.1+dfsg/lemon/dim2.h:487:11: warning: ‘bb.lemon::dim2::Box::_bottom_left.lemon::dim2::Point::x’ may be used uninitialized in this function [-Wmaybe-uninitialized] 487 | if (_bottom_left.x > u.x) _bottom_left.x = u.x; | ^~ In file included from /<>/liblemon-1.3.1+dfsg/demo/graph_to_eps_demo.cc:34: /<>/liblemon-1.3.1+dfsg/lemon/graph_to_eps.h:721:23: note: ‘bb.lemon::dim2::Box::_bottom_left.lemon::dim2::Point::x’ was declared here 721 | dim2::Box bb; | ^~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/graph_to_eps.h:37, from /<>/liblemon-1.3.1+dfsg/demo/graph_to_eps_demo.cc:34: /<>/liblemon-1.3.1+dfsg/lemon/dim2.h:490:11: warning: ‘bb.lemon::dim2::Box::_top_right.lemon::dim2::Point::y’ may be used uninitialized in this function [-Wmaybe-uninitialized] 490 | if (_top_right.y < u.y) _top_right.y = u.y; | ^~ In file included from /<>/liblemon-1.3.1+dfsg/demo/graph_to_eps_demo.cc:34: /<>/liblemon-1.3.1+dfsg/lemon/graph_to_eps.h:710:25: note: ‘bb.lemon::dim2::Box::_top_right.lemon::dim2::Point::y’ was declared here 710 | dim2::Box bb; | ^~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/graph_to_eps.h:37, from /<>/liblemon-1.3.1+dfsg/demo/graph_to_eps_demo.cc:34: /<>/liblemon-1.3.1+dfsg/lemon/dim2.h:489:11: warning: ‘bb.lemon::dim2::Box::_top_right.lemon::dim2::Point::x’ may be used uninitialized in this function [-Wmaybe-uninitialized] 489 | if (_top_right.x < u.x) _top_right.x = u.x; | ^~ In file included from /<>/liblemon-1.3.1+dfsg/demo/graph_to_eps_demo.cc:34: /<>/liblemon-1.3.1+dfsg/lemon/graph_to_eps.h:710:25: note: ‘bb.lemon::dim2::Box::_top_right.lemon::dim2::Point::x’ was declared here 710 | dim2::Box bb; | ^~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/graph_to_eps.h:37, from /<>/liblemon-1.3.1+dfsg/demo/graph_to_eps_demo.cc:34: /<>/liblemon-1.3.1+dfsg/lemon/dim2.h:488:11: warning: ‘bb.lemon::dim2::Box::_bottom_left.lemon::dim2::Point::y’ may be used uninitialized in this function [-Wmaybe-uninitialized] 488 | if (_bottom_left.y > u.y) _bottom_left.y = u.y; | ^~ In file included from /<>/liblemon-1.3.1+dfsg/demo/graph_to_eps_demo.cc:34: /<>/liblemon-1.3.1+dfsg/lemon/graph_to_eps.h:710:25: note: ‘bb.lemon::dim2::Box::_bottom_left.lemon::dim2::Point::y’ was declared here 710 | dim2::Box bb; | ^~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/graph_to_eps.h:37, from /<>/liblemon-1.3.1+dfsg/demo/graph_to_eps_demo.cc:34: /<>/liblemon-1.3.1+dfsg/lemon/dim2.h:487:11: warning: ‘bb.lemon::dim2::Box::_bottom_left.lemon::dim2::Point::x’ may be used uninitialized in this function [-Wmaybe-uninitialized] 487 | if (_bottom_left.x > u.x) _bottom_left.x = u.x; | ^~ In file included from /<>/liblemon-1.3.1+dfsg/demo/graph_to_eps_demo.cc:34: /<>/liblemon-1.3.1+dfsg/lemon/graph_to_eps.h:710:25: note: ‘bb.lemon::dim2::Box::_bottom_left.lemon::dim2::Point::x’ was declared here 710 | dim2::Box bb; | ^~ In file included from /usr/include/c++/9/vector:72, from /<>/liblemon-1.3.1+dfsg/lemon/core.h:22, from /<>/liblemon-1.3.1+dfsg/lemon/list_graph.h:26, from /<>/liblemon-1.3.1+dfsg/tools/lgf-gen.cc:34: /usr/include/c++/9/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(std::vector<_Tp, _Alloc>::iterator, _Args&& ...) [with _Args = {const lemon::dim2::Point&}; _Tp = lemon::dim2::Point; _Alloc = std::allocator >]’: /usr/include/c++/9/bits/vector.tcc:426:7: note: parameter passing for argument of type ‘std::vector >::iterator’ {aka ‘__gnu_cxx::__normal_iterator*, std::vector > >’} changed in GCC 7.1 426 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/9/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(std::vector<_Tp, _Alloc>::iterator, _Args&& ...) [with _Args = {const Parc&}; _Tp = Parc; _Alloc = std::allocator]’: /usr/include/c++/9/bits/vector.tcc:426:7: note: parameter passing for argument of type ‘std::vector::iterator’ {aka ‘__gnu_cxx::__normal_iterator >’} changed in GCC 7.1 /usr/include/c++/9/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(std::vector<_Tp, _Alloc>::iterator, _Args&& ...) [with _Args = {const double&}; _Tp = double; _Alloc = std::allocator]’: /usr/include/c++/9/bits/vector.tcc:426:7: note: parameter passing for argument of type ‘std::vector::iterator’ {aka ‘__gnu_cxx::__normal_iterator >’} changed in GCC 7.1 /usr/include/c++/9/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(std::vector<_Tp, _Alloc>::iterator, _Args&& ...) [with _Args = {std::pair}; _Tp = std::pair; _Alloc = std::allocator >]’: /usr/include/c++/9/bits/vector.tcc:426:7: note: parameter passing for argument of type ‘std::vector >::iterator’ {aka ‘__gnu_cxx::__normal_iterator*, std::vector > >’} changed in GCC 7.1 In file included from /usr/include/c++/9/set:60, from /<>/liblemon-1.3.1+dfsg/tools/lgf-gen.cc:32: /usr/include/c++/9/bits/stl_tree.h: In member function ‘void std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_erase_aux(std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::const_iterator) [with _Key = double; _Val = std::pair; _KeyOfValue = std::_Select1st >; _Compare = std::less; _Alloc = std::allocator >]’: /usr/include/c++/9/bits/stl_tree.h:2504:5: note: parameter passing for argument of type ‘std::_Rb_tree, std::_Select1st >, std::less, std::allocator > >::const_iterator’ {aka ‘std::_Rb_tree_const_iterator >’} changed in GCC 7.1 2504 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/9/algorithm:62, from /<>/liblemon-1.3.1+dfsg/tools/lgf-gen.cc:31: /usr/include/c++/9/bits/stl_algo.h: In function ‘void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = __gnu_cxx::__normal_iterator*, std::vector > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’: /usr/include/c++/9/bits/stl_algo.h:78:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator*, std::vector > >’ changed in GCC 7.1 78 | __move_median_to_first(_Iterator __result,_Iterator __a, _Iterator __b, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/9/bits/stl_algo.h:78:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator*, std::vector > >’ changed in GCC 7.1 /usr/include/c++/9/bits/stl_algo.h:78:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator*, std::vector > >’ changed in GCC 7.1 /usr/include/c++/9/bits/stl_algo.h:78:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator*, std::vector > >’ changed in GCC 7.1 /usr/include/c++/9/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, std::vector > >; _Compare = __gnu_cxx::__ops::_Val_less_iter]’: /usr/include/c++/9/bits/stl_algo.h:1820:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator*, std::vector > >’ changed in GCC 7.1 1820 | __unguarded_linear_insert(_RandomAccessIterator __last, | ^~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/9/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, std::vector > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’: /usr/include/c++/9/bits/stl_algo.h:1839:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator*, std::vector > >’ changed in GCC 7.1 1839 | __insertion_sort(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/9/bits/stl_algo.h:1839:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator*, std::vector > >’ changed in GCC 7.1 /usr/include/c++/9/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Compare = __gnu_cxx::__ops::_Val_comp_iter]’: /usr/include/c++/9/bits/stl_algo.h:1820:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator >’ changed in GCC 7.1 1820 | __unguarded_linear_insert(_RandomAccessIterator __last, | ^~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/9/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter]’: /usr/include/c++/9/bits/stl_algo.h:1839:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator >’ changed in GCC 7.1 1839 | __insertion_sort(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/9/bits/stl_algo.h:1839:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator >’ changed in GCC 7.1 /usr/include/c++/9/bits/stl_algo.h: In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter]’: /usr/include/c++/9/bits/stl_algo.h:1879:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator >’ changed in GCC 7.1 1879 | __final_insertion_sort(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/9/bits/stl_algo.h:1879:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator >’ changed in GCC 7.1 /usr/include/c++/9/bits/stl_algo.h:1879:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator >’ changed in GCC 7.1 /usr/include/c++/9/bits/stl_algo.h:1884:25: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator >’ changed in GCC 7.1 1884 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/9/bits/stl_algo.h:1889:23: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator >’ changed in GCC 7.1 1889 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/9/vector:72, from /<>/liblemon-1.3.1+dfsg/lemon/core.h:22, from /<>/liblemon-1.3.1+dfsg/lemon/list_graph.h:26, from /<>/liblemon-1.3.1+dfsg/tools/lgf-gen.cc:34: /usr/include/c++/9/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(std::vector<_Tp, _Alloc>::iterator, _Args&& ...) [with _Args = {std::pair}; _Tp = std::pair; _Alloc = std::allocator >]’: /usr/include/c++/9/bits/vector.tcc:426:7: note: parameter passing for argument of type ‘std::vector, std::allocator > >::iterator’ {aka ‘__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >’} changed in GCC 7.1 426 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/graph_to_eps.h:37, from /<>/liblemon-1.3.1+dfsg/demo/graph_to_eps_demo.cc:34: /<>/liblemon-1.3.1+dfsg/lemon/dim2.h: In member function ‘void lemon::GraphToEps::run() [with T = lemon::GraphToEps >::CoordsTraits::NodeMap > > >::NodeSizesTraits::NodeMap > >::NodeShapesTraits::NodeMap > >::NodeColorsTraits::NodeMap > > >::ArcColorsTraits::ArcMap > > >::ArcWidthsTraits::ArcMap > >::NodeTextsTraits >]’: /<>/liblemon-1.3.1+dfsg/lemon/dim2.h:490:11: warning: ‘bb.lemon::dim2::Box::_top_right.lemon::dim2::Point::y’ may be used uninitialized in this function [-Wmaybe-uninitialized] 490 | if (_top_right.y < u.y) _top_right.y = u.y; | ^~ In file included from /<>/liblemon-1.3.1+dfsg/demo/graph_to_eps_demo.cc:34: /<>/liblemon-1.3.1+dfsg/lemon/graph_to_eps.h:710:25: note: ‘bb.lemon::dim2::Box::_top_right.lemon::dim2::Point::y’ was declared here 710 | dim2::Box bb; | ^~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/graph_to_eps.h:37, from /<>/liblemon-1.3.1+dfsg/demo/graph_to_eps_demo.cc:34: /<>/liblemon-1.3.1+dfsg/lemon/dim2.h:489:11: warning: ‘bb.lemon::dim2::Box::_top_right.lemon::dim2::Point::x’ may be used uninitialized in this function [-Wmaybe-uninitialized] 489 | if (_top_right.x < u.x) _top_right.x = u.x; | ^~ In file included from /<>/liblemon-1.3.1+dfsg/demo/graph_to_eps_demo.cc:34: /<>/liblemon-1.3.1+dfsg/lemon/graph_to_eps.h:710:25: note: ‘bb.lemon::dim2::Box::_top_right.lemon::dim2::Point::x’ was declared here 710 | dim2::Box bb; | ^~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/graph_to_eps.h:37, from /<>/liblemon-1.3.1+dfsg/demo/graph_to_eps_demo.cc:34: /<>/liblemon-1.3.1+dfsg/lemon/dim2.h:488:11: warning: ‘bb.lemon::dim2::Box::_bottom_left.lemon::dim2::Point::y’ may be used uninitialized in this function [-Wmaybe-uninitialized] 488 | if (_bottom_left.y > u.y) _bottom_left.y = u.y; | ^~ In file included from /<>/liblemon-1.3.1+dfsg/demo/graph_to_eps_demo.cc:34: /<>/liblemon-1.3.1+dfsg/lemon/graph_to_eps.h:710:25: note: ‘bb.lemon::dim2::Box::_bottom_left.lemon::dim2::Point::y’ was declared here 710 | dim2::Box bb; | ^~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/graph_to_eps.h:37, from /<>/liblemon-1.3.1+dfsg/demo/graph_to_eps_demo.cc:34: /<>/liblemon-1.3.1+dfsg/lemon/dim2.h:487:11: warning: ‘bb.lemon::dim2::Box::_bottom_left.lemon::dim2::Point::x’ may be used uninitialized in this function [-Wmaybe-uninitialized] 487 | if (_bottom_left.x > u.x) _bottom_left.x = u.x; | ^~ In file included from /<>/liblemon-1.3.1+dfsg/demo/graph_to_eps_demo.cc:34: /<>/liblemon-1.3.1+dfsg/lemon/graph_to_eps.h:710:25: note: ‘bb.lemon::dim2::Box::_bottom_left.lemon::dim2::Point::x’ was declared here 710 | dim2::Box bb; | ^~ In file included from /usr/include/c++/9/bits/stl_algo.h:61, from /usr/include/c++/9/algorithm:62, from /<>/liblemon-1.3.1+dfsg/tools/lgf-gen.cc:31: /usr/include/c++/9/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, std::vector > >; _Distance = int; _Tp = std::pair; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’: /usr/include/c++/9/bits/stl_heap.h:214:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator*, std::vector > >’ changed in GCC 7.1 214 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, | ^~~~~~~~~~~~~ In file included from /usr/include/c++/9/algorithm:62, from /<>/liblemon-1.3.1+dfsg/tools/lgf-gen.cc:31: /usr/include/c++/9/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, std::vector > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’: /usr/include/c++/9/bits/stl_algo.h:1939:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator*, std::vector > >’ changed in GCC 7.1 1939 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/9/bits/stl_algo.h:1939:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator*, std::vector > >’ changed in GCC 7.1 /usr/include/c++/9/bits/stl_algo.h:1920:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator*, std::vector > >’ changed in GCC 7.1 1920 | std::__move_median_to_first(__first, __first + 1, __mid, __last - 1, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1921 | __comp); | ~~~~~~~ /usr/include/c++/9/bits/stl_algo.h:1920:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator*, std::vector > >’ changed in GCC 7.1 /usr/include/c++/9/bits/stl_algo.h:1953:25: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator*, std::vector > >’ changed in GCC 7.1 1953 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/9/bits/stl_algo.h:61, from /usr/include/c++/9/algorithm:62, from /<>/liblemon-1.3.1+dfsg/tools/lgf-gen.cc:31: /usr/include/c++/9/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Distance = int; _Tp = Parc; _Compare = __gnu_cxx::__ops::_Iter_comp_iter]’: /usr/include/c++/9/bits/stl_heap.h:214:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator >’ changed in GCC 7.1 214 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, | ^~~~~~~~~~~~~ In file included from /usr/include/c++/9/algorithm:62, from /<>/liblemon-1.3.1+dfsg/tools/lgf-gen.cc:31: /usr/include/c++/9/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter]’: /usr/include/c++/9/bits/stl_algo.h:1939:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator >’ changed in GCC 7.1 1939 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/9/bits/stl_algo.h:1939:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator >’ changed in GCC 7.1 /usr/include/c++/9/bits/stl_algo.h:1939:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator >’ changed in GCC 7.1 /usr/include/c++/9/bits/stl_algo.h:1953:25: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator >’ changed in GCC 7.1 1953 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/9/bits/stl_algo.h: In function ‘void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter, std::allocator > > > >]’: /usr/include/c++/9/bits/stl_algo.h:78:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >’ changed in GCC 7.1 78 | __move_median_to_first(_Iterator __result,_Iterator __a, _Iterator __b, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/9/bits/stl_algo.h:78:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >’ changed in GCC 7.1 /usr/include/c++/9/bits/stl_algo.h:78:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >’ changed in GCC 7.1 /usr/include/c++/9/bits/stl_algo.h:78:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >’ changed in GCC 7.1 /usr/include/c++/9/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter, std::allocator > > > >]’: /usr/include/c++/9/bits/stl_algo.h:1820:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >’ changed in GCC 7.1 1820 | __unguarded_linear_insert(_RandomAccessIterator __last, | ^~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/9/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter, std::allocator > > > >]’: /usr/include/c++/9/bits/stl_algo.h:1839:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >’ changed in GCC 7.1 1839 | __insertion_sort(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/9/bits/stl_algo.h:1839:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >’ changed in GCC 7.1 [ 88%] Linking CXX executable dimacs-to-lgf cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/tools && /usr/bin/cmake -E cmake_link_script CMakeFiles/dimacs-to-lgf.dir/link.txt --verbose=1 /usr/bin/c++ -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -Wl,-Bsymbolic-functions -Wl,-z,relro -Wl,-z,now -rdynamic CMakeFiles/dimacs-to-lgf.dir/dimacs-to-lgf.cc.o -o dimacs-to-lgf -L/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon: ../lemon/liblemon.so.1.3.1 -lglpk make[4]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 88%] Built target dimacs-to-lgf make -f tools/CMakeFiles/dimacs-solver.dir/build.make tools/CMakeFiles/dimacs-solver.dir/depend make[4]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<>/liblemon-1.3.1+dfsg /<>/liblemon-1.3.1+dfsg/tools /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/tools /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/tools/CMakeFiles/dimacs-solver.dir/DependInfo.cmake --color= Scanning dependencies of target dimacs-solver make[4]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' make -f tools/CMakeFiles/dimacs-solver.dir/build.make tools/CMakeFiles/dimacs-solver.dir/build make[4]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 88%] Building CXX object tools/CMakeFiles/dimacs-solver.dir/dimacs-solver.cc.o cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/tools && /usr/bin/c++ -I/<>/liblemon-1.3.1+dfsg -I/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -o CMakeFiles/dimacs-solver.dir/dimacs-solver.cc.o -c /<>/liblemon-1.3.1+dfsg/tools/dimacs-solver.cc In file included from /usr/include/c++/9/vector:67, from /<>/liblemon-1.3.1+dfsg/lemon/core.h:22, from /<>/liblemon-1.3.1+dfsg/lemon/list_graph.h:26, from /<>/liblemon-1.3.1+dfsg/tools/lgf-gen.cc:34: /usr/include/c++/9/bits/stl_vector.h: In function ‘void delaunay()’: /usr/include/c++/9/bits/stl_vector.h:1195:4: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator*, std::vector > >’ changed in GCC 7.1 1195 | _M_realloc_insert(end(), __x); | ^~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/9/algorithm:62, from /<>/liblemon-1.3.1+dfsg/tools/lgf-gen.cc:31: /usr/include/c++/9/bits/stl_algo.h:1967:25: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator*, std::vector > >’ changed in GCC 7.1 1967 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1968 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1969 | __comp); | ~~~~~~~ /usr/include/c++/9/bits/stl_algo.h:1884:25: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator*, std::vector > >’ changed in GCC 7.1 1884 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/9/bits/stl_algo.h:1889:23: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator*, std::vector > >’ changed in GCC 7.1 1889 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/9/vector:72, from /<>/liblemon-1.3.1+dfsg/lemon/core.h:22, from /<>/liblemon-1.3.1+dfsg/lemon/list_graph.h:26, from /<>/liblemon-1.3.1+dfsg/tools/lgf-gen.cc:34: /usr/include/c++/9/bits/vector.tcc:121:4: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator*, std::vector > >’ changed in GCC 7.1 121 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ^~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/9/algorithm:62, from /<>/liblemon-1.3.1+dfsg/tools/lgf-gen.cc:31: /usr/include/c++/9/bits/stl_algo.h:1967:25: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator*, std::vector > >’ changed in GCC 7.1 1967 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1968 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1969 | __comp); | ~~~~~~~ /usr/include/c++/9/bits/stl_algo.h:1884:25: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator*, std::vector > >’ changed in GCC 7.1 1884 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/9/bits/stl_algo.h:1889:23: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator*, std::vector > >’ changed in GCC 7.1 1889 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/9/set:60, from /<>/liblemon-1.3.1+dfsg/tools/lgf-gen.cc:32: /usr/include/c++/9/bits/stl_tree.h:1220:2: note: parameter passing for argument of type ‘std::_Rb_tree, std::_Select1st >, std::less, std::allocator > >::const_iterator’ {aka ‘std::_Rb_tree_const_iterator >’} changed in GCC 7.1 1220 | _M_erase_aux(__position); | ^~~~~~~~~~~~ /usr/include/c++/9/bits/stl_tree.h:1220:2: note: parameter passing for argument of type ‘std::_Rb_tree, std::_Select1st >, std::less, std::allocator > >::const_iterator’ {aka ‘std::_Rb_tree_const_iterator >’} changed in GCC 7.1 1220 | _M_erase_aux(__position); | ^~~~~~~~~~~~ /usr/include/c++/9/bits/stl_tree.h:1220:2: note: parameter passing for argument of type ‘std::_Rb_tree, std::_Select1st >, std::less, std::allocator > >::const_iterator’ {aka ‘std::_Rb_tree_const_iterator >’} changed in GCC 7.1 1220 | _M_erase_aux(__position); | ^~~~~~~~~~~~ /usr/include/c++/9/bits/stl_tree.h:1220:2: note: parameter passing for argument of type ‘std::_Rb_tree, std::_Select1st >, std::less, std::allocator > >::const_iterator’ {aka ‘std::_Rb_tree_const_iterator >’} changed in GCC 7.1 1220 | _M_erase_aux(__position); | ^~~~~~~~~~~~ [ 92%] Linking CXX executable lgf_demo cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/demo && /usr/bin/cmake -E cmake_link_script CMakeFiles/lgf_demo.dir/link.txt --verbose=1 /usr/bin/c++ -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -Wl,-Bsymbolic-functions -Wl,-z,relro -Wl,-z,now -rdynamic CMakeFiles/lgf_demo.dir/lgf_demo.cc.o -o lgf_demo -L/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[4]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 92%] Built target lgf_demo In file included from /<>/liblemon-1.3.1+dfsg/lemon/graph_to_eps.h:37, from /<>/liblemon-1.3.1+dfsg/demo/graph_to_eps_demo.cc:34: /<>/liblemon-1.3.1+dfsg/lemon/dim2.h: In member function ‘void lemon::GraphToEps::run() [with T = lemon::GraphToEps >::NodeColorsTraits::NodeMap > > >::CoordsTraits::NodeMap > > >::NodeSizesTraits::NodeMap > >::NodeShapesTraits::NodeMap > >::ArcColorsTraits::ArcMap > > >::ArcWidthsTraits::ArcMap > >::NodeTextsTraits >]’: /<>/liblemon-1.3.1+dfsg/lemon/dim2.h:490:11: warning: ‘bb.lemon::dim2::Box::_top_right.lemon::dim2::Point::y’ may be used uninitialized in this function [-Wmaybe-uninitialized] 490 | if (_top_right.y < u.y) _top_right.y = u.y; | ^~ In file included from /<>/liblemon-1.3.1+dfsg/demo/graph_to_eps_demo.cc:34: /<>/liblemon-1.3.1+dfsg/lemon/graph_to_eps.h:710:25: note: ‘bb.lemon::dim2::Box::_top_right.lemon::dim2::Point::y’ was declared here 710 | dim2::Box bb; | ^~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/graph_to_eps.h:37, from /<>/liblemon-1.3.1+dfsg/demo/graph_to_eps_demo.cc:34: /<>/liblemon-1.3.1+dfsg/lemon/dim2.h:489:11: warning: ‘bb.lemon::dim2::Box::_top_right.lemon::dim2::Point::x’ may be used uninitialized in this function [-Wmaybe-uninitialized] 489 | if (_top_right.x < u.x) _top_right.x = u.x; | ^~ In file included from /<>/liblemon-1.3.1+dfsg/demo/graph_to_eps_demo.cc:34: /<>/liblemon-1.3.1+dfsg/lemon/graph_to_eps.h:710:25: note: ‘bb.lemon::dim2::Box::_top_right.lemon::dim2::Point::x’ was declared here 710 | dim2::Box bb; | ^~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/graph_to_eps.h:37, from /<>/liblemon-1.3.1+dfsg/demo/graph_to_eps_demo.cc:34: /<>/liblemon-1.3.1+dfsg/lemon/dim2.h:488:11: warning: ‘bb.lemon::dim2::Box::_bottom_left.lemon::dim2::Point::y’ may be used uninitialized in this function [-Wmaybe-uninitialized] 488 | if (_bottom_left.y > u.y) _bottom_left.y = u.y; | ^~ In file included from /<>/liblemon-1.3.1+dfsg/demo/graph_to_eps_demo.cc:34: /<>/liblemon-1.3.1+dfsg/lemon/graph_to_eps.h:710:25: note: ‘bb.lemon::dim2::Box::_bottom_left.lemon::dim2::Point::y’ was declared here 710 | dim2::Box bb; | ^~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/graph_to_eps.h:37, from /<>/liblemon-1.3.1+dfsg/demo/graph_to_eps_demo.cc:34: /<>/liblemon-1.3.1+dfsg/lemon/dim2.h:487:11: warning: ‘bb.lemon::dim2::Box::_bottom_left.lemon::dim2::Point::x’ may be used uninitialized in this function [-Wmaybe-uninitialized] 487 | if (_bottom_left.x > u.x) _bottom_left.x = u.x; | ^~ In file included from /<>/liblemon-1.3.1+dfsg/demo/graph_to_eps_demo.cc:34: /<>/liblemon-1.3.1+dfsg/lemon/graph_to_eps.h:710:25: note: ‘bb.lemon::dim2::Box::_bottom_left.lemon::dim2::Point::x’ was declared here 710 | dim2::Box bb; | ^~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/random.h:72, from /<>/liblemon-1.3.1+dfsg/tools/lgf-gen.cc:35: /<>/liblemon-1.3.1+dfsg/lemon/dim2.h: In member function ‘void lemon::GraphToEps::run() [with T = lemon::GraphToEps >::CoordsTraits::NodeMap > >]’: /<>/liblemon-1.3.1+dfsg/lemon/dim2.h:490:11: warning: ‘bb.lemon::dim2::Box::_top_right.lemon::dim2::Point::y’ may be used uninitialized in this function [-Wmaybe-uninitialized] 490 | if (_top_right.y < u.y) _top_right.y = u.y; | ^~ In file included from /<>/liblemon-1.3.1+dfsg/tools/lgf-gen.cc:40: /<>/liblemon-1.3.1+dfsg/lemon/graph_to_eps.h:710:25: note: ‘bb.lemon::dim2::Box::_top_right.lemon::dim2::Point::y’ was declared here 710 | dim2::Box bb; | ^~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/random.h:72, from /<>/liblemon-1.3.1+dfsg/tools/lgf-gen.cc:35: /<>/liblemon-1.3.1+dfsg/lemon/dim2.h:489:11: warning: ‘bb.lemon::dim2::Box::_top_right.lemon::dim2::Point::x’ may be used uninitialized in this function [-Wmaybe-uninitialized] 489 | if (_top_right.x < u.x) _top_right.x = u.x; | ^~ In file included from /<>/liblemon-1.3.1+dfsg/tools/lgf-gen.cc:40: /<>/liblemon-1.3.1+dfsg/lemon/graph_to_eps.h:710:25: note: ‘bb.lemon::dim2::Box::_top_right.lemon::dim2::Point::x’ was declared here 710 | dim2::Box bb; | ^~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/random.h:72, from /<>/liblemon-1.3.1+dfsg/tools/lgf-gen.cc:35: /<>/liblemon-1.3.1+dfsg/lemon/dim2.h:488:11: warning: ‘bb.lemon::dim2::Box::_bottom_left.lemon::dim2::Point::y’ may be used uninitialized in this function [-Wmaybe-uninitialized] 488 | if (_bottom_left.y > u.y) _bottom_left.y = u.y; | ^~ In file included from /<>/liblemon-1.3.1+dfsg/tools/lgf-gen.cc:40: /<>/liblemon-1.3.1+dfsg/lemon/graph_to_eps.h:710:25: note: ‘bb.lemon::dim2::Box::_bottom_left.lemon::dim2::Point::y’ was declared here 710 | dim2::Box bb; | ^~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/random.h:72, from /<>/liblemon-1.3.1+dfsg/tools/lgf-gen.cc:35: /<>/liblemon-1.3.1+dfsg/lemon/dim2.h:487:11: warning: ‘bb.lemon::dim2::Box::_bottom_left.lemon::dim2::Point::x’ may be used uninitialized in this function [-Wmaybe-uninitialized] 487 | if (_bottom_left.x > u.x) _bottom_left.x = u.x; | ^~ In file included from /<>/liblemon-1.3.1+dfsg/tools/lgf-gen.cc:40: /<>/liblemon-1.3.1+dfsg/lemon/graph_to_eps.h:710:25: note: ‘bb.lemon::dim2::Box::_bottom_left.lemon::dim2::Point::x’ was declared here 710 | dim2::Box bb; | ^~ In file included from /usr/include/c++/9/bits/stl_algo.h:61, from /usr/include/c++/9/algorithm:62, from /<>/liblemon-1.3.1+dfsg/tools/lgf-gen.cc:31: /usr/include/c++/9/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; _Distance = int; _Tp = std::pair; _Compare = __gnu_cxx::__ops::_Iter_comp_iter, std::allocator > > > >]’: /usr/include/c++/9/bits/stl_heap.h:214:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >’ changed in GCC 7.1 214 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, | ^~~~~~~~~~~~~ In file included from /usr/include/c++/9/algorithm:62, from /<>/liblemon-1.3.1+dfsg/tools/lgf-gen.cc:31: /usr/include/c++/9/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter, std::allocator > > > >]’: /usr/include/c++/9/bits/stl_algo.h:1939:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >’ changed in GCC 7.1 1939 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/9/bits/stl_algo.h:1939:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >’ changed in GCC 7.1 /usr/include/c++/9/bits/stl_algo.h:1939:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >’ changed in GCC 7.1 /usr/include/c++/9/bits/stl_algo.h:1920:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >’ changed in GCC 7.1 1920 | std::__move_median_to_first(__first, __first + 1, __mid, __last - 1, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1921 | __comp); | ~~~~~~~ /usr/include/c++/9/bits/stl_algo.h:1920:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >’ changed in GCC 7.1 /usr/include/c++/9/bits/stl_algo.h:1953:25: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >’ changed in GCC 7.1 1953 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/9/vector:72, from /<>/liblemon-1.3.1+dfsg/lemon/core.h:22, from /<>/liblemon-1.3.1+dfsg/lemon/list_graph.h:26, from /<>/liblemon-1.3.1+dfsg/tools/lgf-gen.cc:34: /usr/include/c++/9/bits/vector.tcc: In function ‘void minTree()’: /usr/include/c++/9/bits/vector.tcc:121:4: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >’ changed in GCC 7.1 121 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ^~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/9/algorithm:62, from /<>/liblemon-1.3.1+dfsg/tools/lgf-gen.cc:31: /usr/include/c++/9/bits/stl_algo.h:1967:25: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >’ changed in GCC 7.1 1967 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1968 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1969 | __comp); | ~~~~~~~ /usr/include/c++/9/bits/stl_algo.h:1884:25: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >’ changed in GCC 7.1 1884 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/9/bits/stl_algo.h:1889:23: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >’ changed in GCC 7.1 1889 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/graph_to_eps.h:37, from /<>/liblemon-1.3.1+dfsg/demo/graph_to_eps_demo.cc:34: /<>/liblemon-1.3.1+dfsg/lemon/dim2.h: In member function ‘void lemon::GraphToEps::run() [with T = lemon::GraphToEps >::NodeShapesTraits::NodeMap > >::CoordsTraits::NodeMap > > >::NodeSizesTraits::NodeMap > >::NodeColorsTraits::NodeMap > > >::ArcColorsTraits::ArcMap > > >::ArcWidthsTraits::ArcMap > >::NodeTextsTraits >]’: /<>/liblemon-1.3.1+dfsg/lemon/dim2.h:490:11: warning: ‘bb.lemon::dim2::Box::_top_right.lemon::dim2::Point::y’ may be used uninitialized in this function [-Wmaybe-uninitialized] 490 | if (_top_right.y < u.y) _top_right.y = u.y; | ^~ In file included from /<>/liblemon-1.3.1+dfsg/demo/graph_to_eps_demo.cc:34: /<>/liblemon-1.3.1+dfsg/lemon/graph_to_eps.h:710:25: note: ‘bb.lemon::dim2::Box::_top_right.lemon::dim2::Point::y’ was declared here 710 | dim2::Box bb; | ^~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/graph_to_eps.h:37, from /<>/liblemon-1.3.1+dfsg/demo/graph_to_eps_demo.cc:34: /<>/liblemon-1.3.1+dfsg/lemon/dim2.h:489:11: warning: ‘bb.lemon::dim2::Box::_top_right.lemon::dim2::Point::x’ may be used uninitialized in this function [-Wmaybe-uninitialized] 489 | if (_top_right.x < u.x) _top_right.x = u.x; | ^~ In file included from /<>/liblemon-1.3.1+dfsg/demo/graph_to_eps_demo.cc:34: /<>/liblemon-1.3.1+dfsg/lemon/graph_to_eps.h:710:25: note: ‘bb.lemon::dim2::Box::_top_right.lemon::dim2::Point::x’ was declared here 710 | dim2::Box bb; | ^~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/graph_to_eps.h:37, from /<>/liblemon-1.3.1+dfsg/demo/graph_to_eps_demo.cc:34: /<>/liblemon-1.3.1+dfsg/lemon/dim2.h:488:11: warning: ‘bb.lemon::dim2::Box::_bottom_left.lemon::dim2::Point::y’ may be used uninitialized in this function [-Wmaybe-uninitialized] 488 | if (_bottom_left.y > u.y) _bottom_left.y = u.y; | ^~ In file included from /<>/liblemon-1.3.1+dfsg/demo/graph_to_eps_demo.cc:34: /<>/liblemon-1.3.1+dfsg/lemon/graph_to_eps.h:710:25: note: ‘bb.lemon::dim2::Box::_bottom_left.lemon::dim2::Point::y’ was declared here 710 | dim2::Box bb; | ^~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/graph_to_eps.h:37, from /<>/liblemon-1.3.1+dfsg/demo/graph_to_eps_demo.cc:34: /<>/liblemon-1.3.1+dfsg/lemon/dim2.h:487:11: warning: ‘bb.lemon::dim2::Box::_bottom_left.lemon::dim2::Point::x’ may be used uninitialized in this function [-Wmaybe-uninitialized] 487 | if (_bottom_left.x > u.x) _bottom_left.x = u.x; | ^~ In file included from /<>/liblemon-1.3.1+dfsg/demo/graph_to_eps_demo.cc:34: /<>/liblemon-1.3.1+dfsg/lemon/graph_to_eps.h:710:25: note: ‘bb.lemon::dim2::Box::_bottom_left.lemon::dim2::Point::x’ was declared here 710 | dim2::Box bb; | ^~ In file included from /usr/include/c++/9/vector:67, from /<>/liblemon-1.3.1+dfsg/lemon/core.h:22, from /<>/liblemon-1.3.1+dfsg/lemon/list_graph.h:26, from /<>/liblemon-1.3.1+dfsg/tools/lgf-gen.cc:34: /usr/include/c++/9/bits/stl_vector.h: In function ‘void tsp2()’: /usr/include/c++/9/bits/stl_vector.h:1195:4: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator >’ changed in GCC 7.1 1195 | _M_realloc_insert(end(), __x); | ^~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/9/algorithm:62, from /<>/liblemon-1.3.1+dfsg/tools/lgf-gen.cc:31: /usr/include/c++/9/bits/stl_algo.h:1967:25: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator >’ changed in GCC 7.1 1967 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1968 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1969 | __comp); | ~~~~~~~ /usr/include/c++/9/bits/stl_algo.h:1970:31: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator >’ changed in GCC 7.1 1970 | std::__final_insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/graph_to_eps.h:37, from /<>/liblemon-1.3.1+dfsg/demo/graph_to_eps_demo.cc:34: /<>/liblemon-1.3.1+dfsg/lemon/dim2.h: In member function ‘void lemon::GraphToEps::run() [with T = lemon::GraphToEps >::NodeSizesTraits::NodeMap > >::CoordsTraits::NodeMap > > >::NodeShapesTraits::NodeMap > >::NodeColorsTraits::NodeMap > > >::ArcColorsTraits::ArcMap > > >::ArcWidthsTraits::ArcMap > >::NodeTextsTraits >]’: /<>/liblemon-1.3.1+dfsg/lemon/dim2.h:490:11: warning: ‘bb.lemon::dim2::Box::_top_right.lemon::dim2::Point::y’ may be used uninitialized in this function [-Wmaybe-uninitialized] 490 | if (_top_right.y < u.y) _top_right.y = u.y; | ^~ In file included from /<>/liblemon-1.3.1+dfsg/demo/graph_to_eps_demo.cc:34: /<>/liblemon-1.3.1+dfsg/lemon/graph_to_eps.h:710:25: note: ‘bb.lemon::dim2::Box::_top_right.lemon::dim2::Point::y’ was declared here 710 | dim2::Box bb; | ^~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/graph_to_eps.h:37, from /<>/liblemon-1.3.1+dfsg/demo/graph_to_eps_demo.cc:34: /<>/liblemon-1.3.1+dfsg/lemon/dim2.h:489:11: warning: ‘bb.lemon::dim2::Box::_top_right.lemon::dim2::Point::x’ may be used uninitialized in this function [-Wmaybe-uninitialized] 489 | if (_top_right.x < u.x) _top_right.x = u.x; | ^~ In file included from /<>/liblemon-1.3.1+dfsg/demo/graph_to_eps_demo.cc:34: /<>/liblemon-1.3.1+dfsg/lemon/graph_to_eps.h:710:25: note: ‘bb.lemon::dim2::Box::_top_right.lemon::dim2::Point::x’ was declared here 710 | dim2::Box bb; | ^~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/graph_to_eps.h:37, from /<>/liblemon-1.3.1+dfsg/demo/graph_to_eps_demo.cc:34: /<>/liblemon-1.3.1+dfsg/lemon/dim2.h:488:11: warning: ‘bb.lemon::dim2::Box::_bottom_left.lemon::dim2::Point::y’ may be used uninitialized in this function [-Wmaybe-uninitialized] 488 | if (_bottom_left.y > u.y) _bottom_left.y = u.y; | ^~ In file included from /<>/liblemon-1.3.1+dfsg/demo/graph_to_eps_demo.cc:34: /<>/liblemon-1.3.1+dfsg/lemon/graph_to_eps.h:710:25: note: ‘bb.lemon::dim2::Box::_bottom_left.lemon::dim2::Point::y’ was declared here 710 | dim2::Box bb; | ^~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/graph_to_eps.h:37, from /<>/liblemon-1.3.1+dfsg/demo/graph_to_eps_demo.cc:34: /<>/liblemon-1.3.1+dfsg/lemon/dim2.h:487:11: warning: ‘bb.lemon::dim2::Box::_bottom_left.lemon::dim2::Point::x’ may be used uninitialized in this function [-Wmaybe-uninitialized] 487 | if (_bottom_left.x > u.x) _bottom_left.x = u.x; | ^~ In file included from /<>/liblemon-1.3.1+dfsg/demo/graph_to_eps_demo.cc:34: /<>/liblemon-1.3.1+dfsg/lemon/graph_to_eps.h:710:25: note: ‘bb.lemon::dim2::Box::_bottom_left.lemon::dim2::Point::x’ was declared here 710 | dim2::Box bb; | ^~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/graph_to_eps.h:37, from /<>/liblemon-1.3.1+dfsg/demo/graph_to_eps_demo.cc:34: /<>/liblemon-1.3.1+dfsg/lemon/dim2.h: In member function ‘void lemon::GraphToEps::run() [with T = lemon::GraphToEps >::CoordsTraits::NodeMap > > >::NodeTextsTraits::NodeMap > >::NodeColorsTraits::NodeMap > >]’: /<>/liblemon-1.3.1+dfsg/lemon/dim2.h:490:11: warning: ‘bb.lemon::dim2::Box::_top_right.lemon::dim2::Point::y’ may be used uninitialized in this function [-Wmaybe-uninitialized] 490 | if (_top_right.y < u.y) _top_right.y = u.y; | ^~ In file included from /<>/liblemon-1.3.1+dfsg/demo/graph_to_eps_demo.cc:34: /<>/liblemon-1.3.1+dfsg/lemon/graph_to_eps.h:721:23: note: ‘bb.lemon::dim2::Box::_top_right.lemon::dim2::Point::y’ was declared here 721 | dim2::Box bb; | ^~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/graph_to_eps.h:37, from /<>/liblemon-1.3.1+dfsg/demo/graph_to_eps_demo.cc:34: /<>/liblemon-1.3.1+dfsg/lemon/dim2.h:489:11: warning: ‘bb.lemon::dim2::Box::_top_right.lemon::dim2::Point::x’ may be used uninitialized in this function [-Wmaybe-uninitialized] 489 | if (_top_right.x < u.x) _top_right.x = u.x; | ^~ In file included from /<>/liblemon-1.3.1+dfsg/demo/graph_to_eps_demo.cc:34: /<>/liblemon-1.3.1+dfsg/lemon/graph_to_eps.h:721:23: note: ‘bb.lemon::dim2::Box::_top_right.lemon::dim2::Point::x’ was declared here 721 | dim2::Box bb; | ^~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/graph_to_eps.h:37, from /<>/liblemon-1.3.1+dfsg/demo/graph_to_eps_demo.cc:34: /<>/liblemon-1.3.1+dfsg/lemon/dim2.h:488:11: warning: ‘bb.lemon::dim2::Box::_bottom_left.lemon::dim2::Point::y’ may be used uninitialized in this function [-Wmaybe-uninitialized] 488 | if (_bottom_left.y > u.y) _bottom_left.y = u.y; | ^~ In file included from /<>/liblemon-1.3.1+dfsg/demo/graph_to_eps_demo.cc:34: /<>/liblemon-1.3.1+dfsg/lemon/graph_to_eps.h:721:23: note: ‘bb.lemon::dim2::Box::_bottom_left.lemon::dim2::Point::y’ was declared here 721 | dim2::Box bb; | ^~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/graph_to_eps.h:37, from /<>/liblemon-1.3.1+dfsg/demo/graph_to_eps_demo.cc:34: /<>/liblemon-1.3.1+dfsg/lemon/dim2.h:487:11: warning: ‘bb.lemon::dim2::Box::_bottom_left.lemon::dim2::Point::x’ may be used uninitialized in this function [-Wmaybe-uninitialized] 487 | if (_bottom_left.x > u.x) _bottom_left.x = u.x; | ^~ In file included from /<>/liblemon-1.3.1+dfsg/demo/graph_to_eps_demo.cc:34: /<>/liblemon-1.3.1+dfsg/lemon/graph_to_eps.h:721:23: note: ‘bb.lemon::dim2::Box::_bottom_left.lemon::dim2::Point::x’ was declared here 721 | dim2::Box bb; | ^~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/graph_to_eps.h:37, from /<>/liblemon-1.3.1+dfsg/demo/graph_to_eps_demo.cc:34: /<>/liblemon-1.3.1+dfsg/lemon/dim2.h:490:11: warning: ‘bb.lemon::dim2::Box::_top_right.lemon::dim2::Point::y’ may be used uninitialized in this function [-Wmaybe-uninitialized] 490 | if (_top_right.y < u.y) _top_right.y = u.y; | ^~ In file included from /<>/liblemon-1.3.1+dfsg/demo/graph_to_eps_demo.cc:34: /<>/liblemon-1.3.1+dfsg/lemon/graph_to_eps.h:710:25: note: ‘bb.lemon::dim2::Box::_top_right.lemon::dim2::Point::y’ was declared here 710 | dim2::Box bb; | ^~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/graph_to_eps.h:37, from /<>/liblemon-1.3.1+dfsg/demo/graph_to_eps_demo.cc:34: /<>/liblemon-1.3.1+dfsg/lemon/dim2.h:489:11: warning: ‘bb.lemon::dim2::Box::_top_right.lemon::dim2::Point::x’ may be used uninitialized in this function [-Wmaybe-uninitialized] 489 | if (_top_right.x < u.x) _top_right.x = u.x; | ^~ In file included from /<>/liblemon-1.3.1+dfsg/demo/graph_to_eps_demo.cc:34: /<>/liblemon-1.3.1+dfsg/lemon/graph_to_eps.h:710:25: note: ‘bb.lemon::dim2::Box::_top_right.lemon::dim2::Point::x’ was declared here 710 | dim2::Box bb; | ^~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/graph_to_eps.h:37, from /<>/liblemon-1.3.1+dfsg/demo/graph_to_eps_demo.cc:34: /<>/liblemon-1.3.1+dfsg/lemon/dim2.h:488:11: warning: ‘bb.lemon::dim2::Box::_bottom_left.lemon::dim2::Point::y’ may be used uninitialized in this function [-Wmaybe-uninitialized] 488 | if (_bottom_left.y > u.y) _bottom_left.y = u.y; | ^~ In file included from /<>/liblemon-1.3.1+dfsg/demo/graph_to_eps_demo.cc:34: /<>/liblemon-1.3.1+dfsg/lemon/graph_to_eps.h:710:25: note: ‘bb.lemon::dim2::Box::_bottom_left.lemon::dim2::Point::y’ was declared here 710 | dim2::Box bb; | ^~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/graph_to_eps.h:37, from /<>/liblemon-1.3.1+dfsg/demo/graph_to_eps_demo.cc:34: /<>/liblemon-1.3.1+dfsg/lemon/dim2.h:487:11: warning: ‘bb.lemon::dim2::Box::_bottom_left.lemon::dim2::Point::x’ may be used uninitialized in this function [-Wmaybe-uninitialized] 487 | if (_bottom_left.x > u.x) _bottom_left.x = u.x; | ^~ In file included from /<>/liblemon-1.3.1+dfsg/demo/graph_to_eps_demo.cc:34: /<>/liblemon-1.3.1+dfsg/lemon/graph_to_eps.h:710:25: note: ‘bb.lemon::dim2::Box::_bottom_left.lemon::dim2::Point::x’ was declared here 710 | dim2::Box bb; | ^~ In file included from /usr/include/c++/9/vector:67, from /<>/liblemon-1.3.1+dfsg/lemon/core.h:22, from /<>/liblemon-1.3.1+dfsg/lemon/list_graph.h:26, from /<>/liblemon-1.3.1+dfsg/tools/lgf-gen.cc:34: /usr/include/c++/9/bits/stl_vector.h: In function ‘void sparseTriangle(int)’: /usr/include/c++/9/bits/stl_vector.h:1195:4: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator >’ changed in GCC 7.1 1195 | _M_realloc_insert(end(), __x); | ^~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/9/algorithm:62, from /<>/liblemon-1.3.1+dfsg/tools/lgf-gen.cc:31: /usr/include/c++/9/bits/stl_algo.h:1967:25: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator >’ changed in GCC 7.1 1967 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1968 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1969 | __comp); | ~~~~~~~ /usr/include/c++/9/bits/stl_algo.h:1970:31: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator >’ changed in GCC 7.1 1970 | std::__final_insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/9/vector:67, from /<>/liblemon-1.3.1+dfsg/lemon/core.h:22, from /<>/liblemon-1.3.1+dfsg/lemon/list_graph.h:26, from /<>/liblemon-1.3.1+dfsg/tools/lgf-gen.cc:34: /usr/include/c++/9/bits/stl_vector.h: In function ‘int main(int, const char**)’: /usr/include/c++/9/bits/stl_vector.h:1195:4: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator >’ changed in GCC 7.1 1195 | _M_realloc_insert(end(), __x); | ^~~~~~~~~~~~~~~~~ /usr/include/c++/9/bits/stl_vector.h:1195:4: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator >’ changed in GCC 7.1 1195 | _M_realloc_insert(end(), __x); | ^~~~~~~~~~~~~~~~~ [ 96%] Linking CXX executable lgf-gen cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/tools && /usr/bin/cmake -E cmake_link_script CMakeFiles/lgf-gen.dir/link.txt --verbose=1 /usr/bin/c++ -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -Wl,-Bsymbolic-functions -Wl,-z,relro -Wl,-z,now -rdynamic CMakeFiles/lgf-gen.dir/lgf-gen.cc.o -o lgf-gen -L/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon: ../lemon/liblemon.so.1.3.1 -lglpk [ 96%] Linking CXX executable graph_to_eps_demo cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/demo && /usr/bin/cmake -E cmake_link_script CMakeFiles/graph_to_eps_demo.dir/link.txt --verbose=1 /usr/bin/c++ -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -Wl,-Bsymbolic-functions -Wl,-z,relro -Wl,-z,now -rdynamic CMakeFiles/graph_to_eps_demo.dir/graph_to_eps_demo.cc.o -o graph_to_eps_demo -L/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[4]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 96%] Built target lgf-gen make[4]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 96%] Built target graph_to_eps_demo [100%] Linking CXX executable dimacs-solver cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/tools && /usr/bin/cmake -E cmake_link_script CMakeFiles/dimacs-solver.dir/link.txt --verbose=1 /usr/bin/c++ -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -Wl,-Bsymbolic-functions -Wl,-z,relro -Wl,-z,now -rdynamic CMakeFiles/dimacs-solver.dir/dimacs-solver.cc.o -o dimacs-solver -L/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon: ../lemon/liblemon.so.1.3.1 -lglpk make[4]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [100%] Built target dimacs-solver make[3]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' /usr/bin/cmake -E cmake_progress_start /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/CMakeFiles 0 make[2]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd obj-*/doc && make html make[2]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/doc' cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && make -f CMakeFiles/Makefile2 doc/CMakeFiles/html.dir/rule make[3]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' /usr/bin/cmake -S/<>/liblemon-1.3.1+dfsg -B/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf --check-build-system CMakeFiles/Makefile.cmake 0 /usr/bin/cmake -E cmake_progress_start /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/CMakeFiles 0 make -f CMakeFiles/Makefile2 doc/CMakeFiles/html.dir/all make[4]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' make -f doc/CMakeFiles/html.dir/build.make doc/CMakeFiles/html.dir/depend make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<>/liblemon-1.3.1+dfsg /<>/liblemon-1.3.1+dfsg/doc /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/doc /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/doc/CMakeFiles/html.dir/DependInfo.cmake --color= Scanning dependencies of target html make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' make -f doc/CMakeFiles/html.dir/build.make doc/CMakeFiles/html.dir/build make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/doc && /usr/bin/cmake -E remove_directory gen-images cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/doc && /usr/bin/cmake -E make_directory gen-images cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/doc && /usr/bin/gs -dNOPAUSE -dBATCH -q -dEPSCrop -dTextAlphaBits=4 -dGraphicsAlphaBits=4 -sDEVICE=pngalpha -r20 -sOutputFile=gen-images/grid_graph.png /<>/liblemon-1.3.1+dfsg/doc/images/grid_graph.eps cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/doc && /usr/bin/gs -dNOPAUSE -dBATCH -q -dEPSCrop -dTextAlphaBits=4 -dGraphicsAlphaBits=4 -sDEVICE=pngalpha -r32 -sOutputFile=gen-images/adaptors2.png /<>/liblemon-1.3.1+dfsg/doc/images/adaptors2.eps cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/doc && /usr/bin/gs -dNOPAUSE -dBATCH -q -dEPSCrop -dTextAlphaBits=4 -dGraphicsAlphaBits=4 -sDEVICE=pngalpha -r32 -sOutputFile=gen-images/connected_components.png /<>/liblemon-1.3.1+dfsg/doc/images/connected_components.eps cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/doc && /usr/bin/gs -dNOPAUSE -dBATCH -q -dEPSCrop -dTextAlphaBits=4 -dGraphicsAlphaBits=4 -sDEVICE=pngalpha -r32 -sOutputFile=gen-images/strongly_connected_components.png /<>/liblemon-1.3.1+dfsg/doc/images/strongly_connected_components.eps cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/doc && /usr/bin/gs -dNOPAUSE -dBATCH -q -dEPSCrop -dTextAlphaBits=4 -dGraphicsAlphaBits=4 -sDEVICE=pngalpha -r32 -sOutputFile=gen-images/node_biconnected_components.png /<>/liblemon-1.3.1+dfsg/doc/images/node_biconnected_components.eps cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/doc && /usr/bin/gs -dNOPAUSE -dBATCH -q -dEPSCrop -dTextAlphaBits=4 -dGraphicsAlphaBits=4 -sDEVICE=pngalpha -r32 -sOutputFile=gen-images/edge_biconnected_components.png /<>/liblemon-1.3.1+dfsg/doc/images/edge_biconnected_components.eps cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/doc && /usr/bin/gs -dNOPAUSE -dBATCH -q -dEPSCrop -dTextAlphaBits=4 -dGraphicsAlphaBits=4 -sDEVICE=pngalpha -r32 -sOutputFile=gen-images/bipartite_partitions.png /<>/liblemon-1.3.1+dfsg/doc/images/bipartite_partitions.eps cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/doc && /usr/bin/gs -dNOPAUSE -dBATCH -q -dEPSCrop -dTextAlphaBits=4 -dGraphicsAlphaBits=4 -sDEVICE=pngalpha -r24 -sOutputFile=gen-images/matching.png /<>/liblemon-1.3.1+dfsg/doc/images/matching.eps cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/doc && /usr/bin/gs -dNOPAUSE -dBATCH -q -dEPSCrop -dTextAlphaBits=4 -dGraphicsAlphaBits=4 -sDEVICE=pngalpha -r24 -sOutputFile=gen-images/bipartite_matching.png /<>/liblemon-1.3.1+dfsg/doc/images/bipartite_matching.eps cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/doc && /usr/bin/gs -dNOPAUSE -dBATCH -q -dEPSCrop -dTextAlphaBits=4 -dGraphicsAlphaBits=4 -sDEVICE=pngalpha -r40 -sOutputFile=gen-images/planar.png /<>/liblemon-1.3.1+dfsg/doc/images/planar.eps cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/doc && /usr/bin/gs -dNOPAUSE -dBATCH -q -dEPSCrop -dTextAlphaBits=4 -dGraphicsAlphaBits=4 -sDEVICE=pngalpha -r24 -sOutputFile=gen-images/tsp.png /<>/liblemon-1.3.1+dfsg/doc/images/tsp.eps cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/doc && /usr/bin/gs -dNOPAUSE -dBATCH -q -dEPSCrop -dTextAlphaBits=4 -dGraphicsAlphaBits=4 -sDEVICE=pngalpha -r8 -sOutputFile=gen-images/nodeshape_0.png /<>/liblemon-1.3.1+dfsg/doc/images/nodeshape_0.eps cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/doc && /usr/bin/gs -dNOPAUSE -dBATCH -q -dEPSCrop -dTextAlphaBits=4 -dGraphicsAlphaBits=4 -sDEVICE=pngalpha -r8 -sOutputFile=gen-images/nodeshape_1.png /<>/liblemon-1.3.1+dfsg/doc/images/nodeshape_1.eps cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/doc && /usr/bin/gs -dNOPAUSE -dBATCH -q -dEPSCrop -dTextAlphaBits=4 -dGraphicsAlphaBits=4 -sDEVICE=pngalpha -r8 -sOutputFile=gen-images/nodeshape_2.png /<>/liblemon-1.3.1+dfsg/doc/images/nodeshape_2.eps cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/doc && /usr/bin/gs -dNOPAUSE -dBATCH -q -dEPSCrop -dTextAlphaBits=4 -dGraphicsAlphaBits=4 -sDEVICE=pngalpha -r8 -sOutputFile=gen-images/nodeshape_3.png /<>/liblemon-1.3.1+dfsg/doc/images/nodeshape_3.eps cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/doc && /usr/bin/gs -dNOPAUSE -dBATCH -q -dEPSCrop -dTextAlphaBits=4 -dGraphicsAlphaBits=4 -sDEVICE=pngalpha -r8 -sOutputFile=gen-images/nodeshape_4.png /<>/liblemon-1.3.1+dfsg/doc/images/nodeshape_4.eps cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/doc && /usr/bin/cmake -E remove_directory html cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/doc && /usr/bin/doxygen Doxyfile warning: Tag `SYMBOL_CACHE_SIZE' at line 42 of file `Doxyfile' has become obsolete. To avoid this warning please remove this line from your configuration file or upgrade it using "doxygen -u" warning: Tag `SHOW_DIRECTORIES' at line 75 of file `Doxyfile' has become obsolete. To avoid this warning please remove this line from your configuration file or upgrade it using "doxygen -u" warning: Tag `HTML_ALIGN_MEMBERS' at line 153 of file `Doxyfile' has become obsolete. To avoid this warning please remove this line from your configuration file or upgrade it using "doxygen -u" warning: Tag `USE_INLINE_TREES' at line 180 of file `Doxyfile' has become obsolete. To avoid this warning please remove this line from your configuration file or upgrade it using "doxygen -u" warning: Tag `XML_SCHEMA' at line 227 of file `Doxyfile' has become obsolete. To avoid this warning please remove this line from your configuration file or upgrade it using "doxygen -u" warning: Tag `XML_DTD' at line 228 of file `Doxyfile' has become obsolete. To avoid this warning please remove this line from your configuration file or upgrade it using "doxygen -u" warning: doxygen no longer ships with the FreeSans font. You may want to clear or change DOT_FONTNAME. Otherwise you run the risk that the wrong font is being used for dot generated graphs. Parsing layout file /<>/liblemon-1.3.1+dfsg/doc/DoxygenLayout.xml... Searching for include files... Searching for example files... Searching for files in directory /<>/liblemon-1.3.1+dfsg/demo Searching for files in directory /<>/liblemon-1.3.1+dfsg/doc Searching for images... Searching for files in directory /<>/liblemon-1.3.1+dfsg/doc/images Searching for files in directory /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/doc/gen-images Searching for dot files... Searching for msc files... Searching for dia files... Searching for files to exclude Searching INPUT for files to process... Searching for files in directory /<>/liblemon-1.3.1+dfsg/doc Searching for files in directory /<>/liblemon-1.3.1+dfsg/lemon Searching for files in directory /<>/liblemon-1.3.1+dfsg/lemon/bits Searching for files in directory /<>/liblemon-1.3.1+dfsg/lemon/concepts Searching for files in directory /<>/liblemon-1.3.1+dfsg/demo Searching for files in directory /<>/liblemon-1.3.1+dfsg/contrib Searching for files in directory /<>/liblemon-1.3.1+dfsg/tools Reading and parsing tag files Parsing files Preprocessing /<>/liblemon-1.3.1+dfsg/doc/coding_style.dox... Parsing file /<>/liblemon-1.3.1+dfsg/doc/coding_style.dox... Preprocessing /<>/liblemon-1.3.1+dfsg/doc/dirs.dox... Parsing file /<>/liblemon-1.3.1+dfsg/doc/dirs.dox... Preprocessing /<>/liblemon-1.3.1+dfsg/doc/groups.dox... Parsing file /<>/liblemon-1.3.1+dfsg/doc/groups.dox... Preprocessing /<>/liblemon-1.3.1+dfsg/doc/lgf.dox... Parsing file /<>/liblemon-1.3.1+dfsg/doc/lgf.dox... Preprocessing /<>/liblemon-1.3.1+dfsg/doc/license.dox... Parsing file /<>/liblemon-1.3.1+dfsg/doc/license.dox... Preprocessing /<>/liblemon-1.3.1+dfsg/doc/migration.dox... Parsing file /<>/liblemon-1.3.1+dfsg/doc/migration.dox... Preprocessing /<>/liblemon-1.3.1+dfsg/doc/min_cost_flow.dox... Parsing file /<>/liblemon-1.3.1+dfsg/doc/min_cost_flow.dox... Preprocessing /<>/liblemon-1.3.1+dfsg/doc/named-param.dox... Parsing file /<>/liblemon-1.3.1+dfsg/doc/named-param.dox... Preprocessing /<>/liblemon-1.3.1+dfsg/doc/namespaces.dox... Parsing file /<>/liblemon-1.3.1+dfsg/doc/namespaces.dox... Preprocessing /<>/liblemon-1.3.1+dfsg/doc/template.h... Parsing file /<>/liblemon-1.3.1+dfsg/doc/template.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/adaptors.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/adaptors.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/arg_parser.cc... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/arg_parser.cc... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/arg_parser.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/arg_parser.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/assert.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/assert.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/base.cc... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/base.cc... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/bellman_ford.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/bellman_ford.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/bfs.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/bfs.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/bin_heap.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/bin_heap.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/binomial_heap.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/binomial_heap.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/bucket_heap.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/bucket_heap.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/capacity_scaling.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/capacity_scaling.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/cbc.cc... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/cbc.cc... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/cbc.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/cbc.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/christofides_tsp.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/christofides_tsp.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/circulation.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/circulation.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/clp.cc... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/clp.cc... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/clp.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/clp.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/color.cc... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/color.cc... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/color.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/color.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/core.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/core.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/cost_scaling.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/cost_scaling.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/counter.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/counter.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/cplex.cc... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/cplex.cc... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/cplex.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/cplex.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/dfs.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/dfs.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/dheap.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/dheap.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/dijkstra.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/dijkstra.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/dim2.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/dim2.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/dimacs.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/dimacs.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/edge_set.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/edge_set.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/edmonds_karp.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/edmonds_karp.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/elevator.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/elevator.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/error.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/error.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/euler.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/euler.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/fib_heap.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/fib_heap.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/full_graph.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/full_graph.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/glpk.cc... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/glpk.cc... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/glpk.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/glpk.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/gomory_hu.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/gomory_hu.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/graph_to_eps.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/graph_to_eps.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/greedy_tsp.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/greedy_tsp.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/grid_graph.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/grid_graph.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/grosso_locatelli_pullan_mc.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/grosso_locatelli_pullan_mc.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/hartmann_orlin_mmc.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/hartmann_orlin_mmc.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/hypercube_graph.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/hypercube_graph.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/insertion_tsp.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/insertion_tsp.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/karp_mmc.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/karp_mmc.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/kruskal.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/kruskal.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/lgf_reader.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/lgf_reader.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/lgf_writer.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/lgf_writer.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/list_graph.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/list_graph.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/lp.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/lp.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/lp_base.cc... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/lp_base.cc... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/lp_base.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/lp_base.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/lp_skeleton.cc... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/lp_skeleton.cc... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/lp_skeleton.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/lp_skeleton.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/maps.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/maps.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/matching.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/matching.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/math.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/math.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/max_cardinality_search.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/max_cardinality_search.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/min_cost_arborescence.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/min_cost_arborescence.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/nagamochi_ibaraki.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/nagamochi_ibaraki.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/nauty_reader.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/nauty_reader.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/nearest_neighbor_tsp.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/nearest_neighbor_tsp.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/network_simplex.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/network_simplex.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/opt2_tsp.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/opt2_tsp.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/pairing_heap.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/pairing_heap.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/path.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/path.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/planarity.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/planarity.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/preflow.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/preflow.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/quad_heap.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/quad_heap.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/radix_heap.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/radix_heap.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/radix_sort.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/radix_sort.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/random.cc... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/random.cc... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/random.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/random.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/smart_graph.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/smart_graph.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/soplex.cc... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/soplex.cc... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/soplex.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/soplex.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/static_graph.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/static_graph.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/suurballe.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/suurballe.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/time_measure.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/time_measure.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/tolerance.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/tolerance.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/unionfind.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/unionfind.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/bits/alteration_notifier.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/bits/alteration_notifier.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/bits/array_map.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/bits/array_map.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/bits/bezier.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/bits/bezier.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/bits/default_map.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/bits/default_map.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/bits/edge_set_extender.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/bits/edge_set_extender.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/bits/enable_if.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/bits/enable_if.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/bits/graph_adaptor_extender.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/bits/graph_adaptor_extender.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/bits/lock.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/bits/lock.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/bits/map_extender.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/bits/map_extender.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/bits/path_dump.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/bits/path_dump.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/bits/solver_bits.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/bits/solver_bits.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/bits/traits.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/bits/traits.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/bits/variant.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/bits/variant.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/bits/vector_map.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/bits/vector_map.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/bits/windows.cc... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/bits/windows.cc... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/bits/windows.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/bits/windows.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/concepts/heap.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/concepts/heap.h... Preprocessing /<>/liblemon-1.3error opening bib6047.bbl: No such file or directory bibtex command failed: No such file or directory .1+dfsg/lemon/concepts/maps.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/concepts/maps.h... Preprocessing /<>/liblemon-1.3.1+dfsg/lemon/concepts/path.h... Parsing file /<>/liblemon-1.3.1+dfsg/lemon/concepts/path.h... Preprocessing /<>/liblemon-1.3.1+dfsg/demo/arg_parser_demo.cc... Parsing file /<>/liblemon-1.3.1+dfsg/demo/arg_parser_demo.cc... Preprocessing /<>/liblemon-1.3.1+dfsg/demo/graph_to_eps_demo.cc... Parsing file /<>/liblemon-1.3.1+dfsg/demo/graph_to_eps_demo.cc... Preprocessing /<>/liblemon-1.3.1+dfsg/demo/lgf_demo.cc... Parsing file /<>/liblemon-1.3.1+dfsg/demo/lgf_demo.cc... Preprocessing /<>/liblemon-1.3.1+dfsg/tools/dimacs-solver.cc... Parsing file /<>/liblemon-1.3.1+dfsg/tools/dimacs-solver.cc... Preprocessing /<>/liblemon-1.3.1+dfsg/tools/dimacs-to-lgf.cc... Parsing file /<>/liblemon-1.3.1+dfsg/tools/dimacs-to-lgf.cc... Preprocessing /<>/liblemon-1.3.1+dfsg/tools/lgf-gen.cc... Parsing file /<>/liblemon-1.3.1+dfsg/tools/lgf-gen.cc... Preprocessing /<>/liblemon-1.3.1+dfsg/test/test_tools.h... Parsing file /<>/liblemon-1.3.1+dfsg/test/test_tools.h... Preprocessing /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/doc/mainpage.dox... Parsing file /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/doc/mainpage.dox... Building group list... Building directory list... Building namespace list... Building file list... Building class list... Associating documentation with classes... Computing nesting relations for classes... Building example list... Searching for enumerations... Searching for documented typedefs... Searching for members imported via using declarations... Searching for included using directives... Searching for documented variables... Building interface member list... Building member list... Searching for friends... Searching for documented defines... Computing class inheritance relations... Computing class usage relations... Flushing cached template relations that have become invalid... Computing class relations... Add enum values to enums... Searching for member function documentation... Creating members for template instances... Building page list... Search for main page... Computing page relations... Determining the scope of groups... Sorting lists... Freeing entry tree Determining which enums are documented Computing member relations... Building full member lists recursively... Adding members to member groups. Computing member references... Generating disk names... Adding source references... Adding xrefitems... Sorting member lists... Generating citations page... Counting data structures... Resolving user defined references... Finding anchors and sections in the documentation... Transferring function references... Combining using relations... Adding members to index pages... Generating style sheet... Generating search indices... Generating example documentation... Generating file sources... Generating file documentation... Generating docs for file demo/arg_parser_demo.cc... Generating docs for file demo/graph_to_eps_demo.cc... Generating docs for file demo/lgf_demo.cc... Generating docs for file lemon/adaptors.h... Generating docs for file lemon/arg_parser.h... Generating docs for file lemon/assert.h... Generating docs for file lemon/base.cc... Generating docs for file lemon/bellman_ford.h... Generating docs for file lemon/bfs.h... Generating docs for file lemon/bin_heap.h... Generating docs for file lemon/binomial_heap.h... Generating docs for file lemon/bits/windows.cc... Generating docs for file lemon/bucket_heap.h... Generating docs for file lemon/capacity_scaling.h... Generating docs for file lemon/cbc.cc... Generating docs for file lemon/cbc.h... Generating docs for file lemon/christofides_tsp.h... Generating docs for file lemon/circulation.h... Generating docs for file lemon/clp.h... Generating docs for file lemon/color.cc... Generating docs for file lemon/color.h... Generating docs for file lemon/concept_check.h... Generating docs for file lemon/concepts/bpgraph.h... Generating docs for file lemon/concepts/digraph.h... Generating docs for file lemon/concepts/graph.h... Generating docs for file lemon/concepts/graph_components.h... Generating docs for file lemon/concepts/heap.h... Generating docs for file lemon/connectivity.h... Generating docs for file lemon/core.h... Generating docs for file lemon/cost_scaling.h... Generating docs for file lemon/counter.h... Generating docs for file lemon/cplex.cc... Generating docs for file lemon/cplex.h... Generating docs for file lemon/cycle_canceling.h... Generating docs for file lemon/dfs.h... Generating docs for file lemon/dheap.h... Generating docs for file lemon/dijkstra.h... Generating docs for file lemon/dim2.h... Generating docs for file lemon/dimacs.h... Generating docs for file lemon/edge_set.h... Generating docs for file lemon/edmonds_karp.h... Generating docs for file lemon/elevator.h... Generating docs for file lemon/error.h... Generating docs for file lemon/euler.h... Generating docs for file lemon/fib_heap.h... Generating docs for file lemon/fractional_matching.h... Generating docs for file lemon/full_graph.h... Generating docs for file lemon/glpk.cc... Generating docs for file lemon/glpk.h... Generating docs for file lemon/gomory_hu.h... Generating docs for file lemon/graph_to_eps.h... Generating docs for file lemon/greedy_tsp.h... Generating docs for file lemon/grid_graph.h... Generating docs for file lemon/grosso_locatelli_pullan_mc.h... Generating docs for file lemon/hao_orlin.h... Generating docs for file lemon/hartmann_orlin_mmc.h... Generating docs for file lemon/howard_mmc.h... Generating docs for file lemon/hypercube_graph.h... Generating docs for file lemon/insertion_tsp.h... Generating docs for file lemon/karp_mmc.h... Generating docs for file lemon/kruskal.h... Generating docs for file lemon/lgf_reader.h... Generating docs for file lemon/lgf_writer.h... Generating docs for file lemon/list_graph.h... Generating docs for file lemon/lp.h... Generating docs for file lemon/lp_base.cc... Generating docs for file lemon/lp_base.h... Generating docs for file lemon/lp_skeleton.cc... Generating docs for file lemon/lp_skeleton.h... Generating docs for file lemon/maps.h... Generating docs for file lemon/concepts/maps.h... Generating docs for file lemon/matching.h... Generating docs for file lemon/math.h... Generating docs for file lemon/max_cardinality_search.h... Generating docs for file lemon/min_cost_arborescence.h... Generating docs for file lemon/nagamochi_ibaraki.h... Generating docs for file lemon/nauty_reader.h... Generating docs for file lemon/nearest_neighbor_tsp.h... Generating docs for file lemon/network_simplex.h... Generating docs for file lemon/opt2_tsp.h... Generating docs for file lemon/pairing_heap.h... Generating docs for file lemon/path.h... Generating docs for file lemon/concepts/path.h... Generating docs for file lemon/planarity.h... Generating docs for file lemon/preflow.h... Generating docs for file lemon/quad_heap.h... Generating docs for file lemon/radix_heap.h... Generating docs for file lemon/radix_sort.h... Generating docs for file lemon/random.cc... Generating docs for file lemon/random.h... Generating docs for file lemon/smart_graph.h... Generating docs for file lemon/soplex.cc... Generating docs for file lemon/soplex.h... Generating docs for file lemon/static_graph.h... Generating docs for file lemon/suurballe.h... Generating docs for file lemon/time_measure.h... Generating docs for file lemon/tolerance.h... Generating docs for file lemon/unionfind.h... Generating docs for file test/test_tools.h... Generating docs for file tools/dimacs-solver.cc... Generating docs for file tools/dimacs-to-lgf.cc... Generating docs for file tools/lgf-gen.cc... Generating page documentation... Generating docs for page coding_style... Generating docs for page lgf-format... Generating docs for page license... Generating docs for page migration... Generating docs for page min_cost_flow... Generating docs for page named-param... Generating docs for page citelist... Generating group documentation... Generating class documentation... Generating namespace index... Generating docs for namespace lemon Generating docs for compound lemon::AbsMap... Generating docs for compound lemon::AddMap... Generating docs for compound lemon::AllArcLookUp... Generating docs for compound lemon::AndMap... Generating docs for compound lemon::ArcLookUp... Generating docs for compound lemon::ArgParser... Generating docs for nested compound lemon::ArgParser::RefType... Generating docs for compound lemon::ArgParserException... Generating docs for compound lemon::BackwardMap... Generating docs for compound lemon::BellmanFord... Generating docs for nested compound lemon::BellmanFord::ActiveIt... Generating docs for nested compound lemon::BellmanFord::SetDistMap... Generating docs for nested compound lemon::BellmanFord::SetOperationTraits... Generating docs for nested compound lemon::BellmanFord::SetPredMap... Generating docs for compound lemon::BellmanFordDefaultOperationTraits... Generating docs for compound lemon::BellmanFordDefaultTraits... Generating docs for compound lemon::BellmanFordWizard... Generating docs for compound lemon::BellmanFordWizardBase... Generating docs for compound lemon::BellmanFordWizardDefaultTraits... Generating docs for compound lemon::Bfs... Generating docs for nested compound lemon::Bfs::SetDistMap... Generating docs for nested compound lemon::Bfs::SetPredMap... Generating docs for nested compound lemon::Bfs::SetProcessedMap... Generating docs for nested compound lemon::Bfs::SetReachedMap... Generating docs for nested compound lemon::Bfs::SetStandardProcessedMap... Generating docs for compound lemon::BfsDefaultTraits... Generating docs for compound lemon::BfsVisit... Generating docs for nested compound lemon::BfsVisit::SetReachedMap... Generating docs for compound lemon::BfsVisitDefaultTraits... Generating docs for compound lemon::BfsVisitor... Generating docs for compound lemon::BfsWizard... Generating docs for compound lemon::BfsWizardBase... Generating docs for compound lemon::BfsWizardDefaultTraits... Generating docs for compound lemon::BinHeap... Generating docs for compound lemon::BinomialHeap... Generating docs for compound lemon::BpGraphCopy... Generating docs for compound lemon::BpGraphReader... Generating docs for compound lemon::BpGraphWriter... Generating docs for compound lemon::BucketHeap... Generating docs for compound lemon::CapacityScaling... Generating docs for nested compound lemon::CapacityScaling::SetHeap... Generating docs for compound lemon::CapacityScalingDefaultTraits... Generating docs for compound lemon::CbcMip... Generating docs for compound lemon::ChristofidesTsp... Generating docs for compound lemon::Circulation... Generating docs for nested compound lemon::Circulation::SetElevator... Generating docs for nested compound lemon::Circulation::SetFlowMap... Generating docs for nested compound lemon::Circulation::SetStandardElevator... Generating docs for compound lemon::CirculationDefaultTraits... Generating docs for compound lemon::ClpLp... Generating docs for compound lemon::Color... Generating docs for compound lemon::CombineMap... Generating docs for compound lemon::ComposeMap... Generating docs for compound lemon::ConArcIt... Generating docs for compound lemon::ConEdgeIt... Generating docs for compound lemon::ConstMap... Generating docs for compound lemon::ConstMap< K, Const< V, v > >... Generating docs for compound lemon::ConvertMap... Generating docs for compound lemon::CostScaling... Generating docs for nested compound lemon::CostScaling::SetLargeCost... Generating docs for compound lemon::CostScalingDefaultTraits... Generating docs for compound lemon::Counter... Generating docs for compound lemon::CplexBase... Generating docs for compound lemon::CplexEnv... Generating docs for nested compound lemon::CplexEnv::LicenseError... Generating docs for compound lemon::CplexLp... Generating docs for compound lemon::CplexMip... Generating docs for compound lemon::CrossRefMap... Generating docs for nested compound lemon::CrossRefMap::InverseMap... Generating docs for nested compound lemon::CrossRefMap::ValueIt... Generating docs for compound lemon::CycleCanceling... Generating docs for compound lemon::DefaultGraphToEpsTraits... Generating docs for compound lemon::Dfs... Generating docs for nested compound lemon::Dfs::SetDistMap... Generating docs for nested compound lemon::Dfs::SetPredMap... Generating docs for nested compound lemon::Dfs::SetProcessedMap... Generating docs for nested compound lemon::Dfs::SetReachedMap... Generating docs for nested compound lemon::Dfs::SetStandardProcessedMap... Generating docs for compound lemon::DfsDefaultTraits... Generating docs for compound lemon::DfsVisit... Generating docs for nested compound lemon::DfsVisit::SetReachedMap... Generating docs for compound lemon::DfsVisitDefaultTraits... Generating docs for compound lemon::DfsVisitor... Generating docs for compound lemon::DfsWizard... Generating docs for compound lemon::DfsWizardBase... Generating docs for compound lemon::DfsWizardDefaultTraits... Generating docs for compound lemon::DHeap... Generating docs for compound lemon::DiEulerIt... Generating docs for compound lemon::DigraphCopy... Generating docs for compound lemon::DigraphReader... Generating docs for compound lemon::DigraphWriter... Generating docs for compound lemon::Dijkstra... Generating docs for nested compound lemon::Dijkstra::SetDistMap... Generating docs for nested compound lemon::Dijkstra::SetHeap... Generating docs for nested compound lemon::Dijkstra::SetOperationTraits... Generating docs for nested compound lemon::Dijkstra::SetPredMap... Generating docs for nested compound lemon::Dijkstra::SetProcessedMap... Generating docs for nested compound lemon::Dijkstra::SetStandardHeap... Generating docs for nested compound lemon::Dijkstra::SetStandardProcessedMap... Generating docs for compound lemon::DijkstraDefaultOperationTraits... Generating docs for compound lemon::DijkstraDefaultTraits... Generating docs for compound lemon::DijkstraWizard... Generating docs for compound lemon::DijkstraWizardBase... Generating docs for compound lemon::DijkstraWizardDefaultTraits... Generating docs for compound lemon::DimacsDescriptor... Generating docs for compound lemon::DivMap... Generating docs for compound lemon::DynArcLookUp... Generating docs for compound lemon::EdmondsKarp... Generating docs for nested compound lemon::EdmondsKarp::SetFlowMap... Generating docs for compound lemon::EdmondsKarpDefaultTraits... Generating docs for compound lemon::Elevator... Generating docs for compound lemon::EqualMap... Generating docs for compound lemon::EulerIt... Generating docs for compound lemon::Exception... Generating docs for compound lemon::ExtendFindEnum... Generating docs for nested compound lemon::ExtendFindEnum::ClassIt... Generating docs for nested compound lemon::ExtendFindEnum::ItemIt... Generating docs for compound lemon::FalseMap... Generating docs for compound lemon::FibHeap... Generating docs for compound lemon::FilterArcs... Generating docs for compound lemon::FilterEdges... Generating docs for compound lemon::FilterNodes... Generating docs for compound lemon::ForkMap... Generating docs for compound lemon::FormatError... Generating docs for compound lemon::ForwardMap... Generating docs for compound lemon::FullBpGraph... Generating docs for compound lemon::FullDigraph... Generating docs for compound lemon::FullGraph... Generating docs for compound lemon::FunctorToMap... Generating docs for compound lemon::GlpkBase... Generating docs for compound lemon::GlpkLp... Generating docs for compound lemon::GlpkMip... Generating docs for compound lemon::GomoryHu... Generating docs for nested compound lemon::GomoryHu::MinCutEdgeIt... Generating docs for nested compound lemon::GomoryHu::MinCutNodeIt... Generating docs for compound lemon::GraphCopy... Generating docs for compound lemon::GraphReader... Generating docs for compound lemon::GraphToEps... Generating docs for compound lemon::GraphWriter... Generating docs for compound lemon::GreedyTsp... Generating docs for compound lemon::GridGraph... Generating docs for nested compound lemon::GridGraph::ColMap... Generating docs for nested compound lemon::GridGraph::IndexMap... Generating docs for nested compound lemon::GridGraph::RowMap... Generating docs for compound lemon::GrossoLocatelliPullanMc... Generating docs for nested compound lemon::GrossoLocatelliPullanMc::CliqueNodeIt... Generating docs for compound lemon::HaoOrlin... Generating docs for compound lemon::HartmannOrlinMmc... Generating docs for nested compound lemon::HartmannOrlinMmc::SetLargeCost... Generating docs for nested compound lemon::HartmannOrlinMmc::SetPath... Generating docs for compound lemon::HartmannOrlinMmcDefaultTraits... Generating docs for compound lemon::HeapUnionFind... Generating docs for nested compound lemon::HeapUnionFind::ClassIt... Generating docs for nested compound lemon::HeapUnionFind::ItemIt... Generating docs for compound lemon::HowardMmc... Generating docs for nested compound lemon::HowardMmc::SetLargeCost... Generating docs for nested compound lemon::HowardMmc::SetPath... Generating docs for compound lemon::HowardMmcDefaultTraits... Generating docs for compound lemon::HypercubeGraph... Generating docs for nested compound lemon::HypercubeGraph::HyperMap... Generating docs for compound lemon::IdentityMap... Generating docs for compound lemon::IdMap... Generating docs for nested compound lemon::IdMap::InverseMap... Generating docs for compound lemon::InDegMap... Generating docs for compound lemon::InsertionTsp... Generating docs for compound lemon::Invalid... Generating docs for compound lemon::IoError... Generating docs for compound lemon::IterableBoolMap... Generating docs for nested compound lemon::IterableBoolMap::FalseIt... Generating docs for nested compound lemon::IterableBoolMap::ItemIt... Generating docs for nested compound lemon::IterableBoolMap::Reference... Generating docs for nested compound lemon::IterableBoolMap::TrueIt... Generating docs for compound lemon::IterableIntMap... Generating docs for nested compound lemon::IterableIntMap::ItemIt... Generating docs for nested compound lemon::IterableIntMap::Reference... Generating docs for compound lemon::IterableValueMap... Generating docs for nested compound lemon::IterableValueMap::ItemIt... Generating docs for nested compound lemon::IterableValueMap::ValueIt... Generating docs for compound lemon::KarpMmc... Generating docs for nested compound lemon::KarpMmc::SetLargeCost... Generating docs for nested compound lemon::KarpMmc::SetPath... Generating docs for compound lemon::KarpMmcDefaultTraits... Generating docs for compound lemon::LessMap... Generating docs for compound lemon::LgfContents... Generating docs for compound lemon::LinkedElevator... Generating docs for compound lemon::ListArcSet... Generating docs for compound lemon::ListBpGraph... Generating docs for nested compound lemon::ListBpGraph::Snapshot... Generating docs for compound lemon::ListDigraph... Generating docs for nested compound lemon::ListDigraph::Snapshot... Generating docs for compound lemon::ListEdgeSet... Generating docs for compound lemon::ListGraph... Generating docs for nested compound lemon::ListGraph::Snapshot... Generating docs for compound lemon::ListPath... Generating docs for nested compound lemon::ListPath::ArcIt... Generating docs for compound lemon::LoggerBoolMap... Generating docs for compound lemon::LpBase... Generating docs for nested compound lemon::LpBase::Col... Generating docs for nested compound lemon::LpBase::ColIt... Generating docs for nested compound lemon::LpBase::Constr... Generating docs for nested compound lemon::LpBase::DualExpr... Generating docs for nested compound lemon::LpBase::DualExpr::CoeffIt... Generating docs for nested compound lemon::LpBase::DualExpr::ConstCoeffIt... Generating docs for nested compound lemon::LpBase::Expr... Generating docs for nested compound lemon::LpBase::Expr::CoeffIt... Generating docs for nested compound lemon::LpBase::Expr::ConstCoeffIt... Generating docs for nested compound lemon::LpBase::Row... Generating docs for nested compound lemon::LpBase::RowIt... Generating docs for nested compound lemon::LpBase::UnsupportedFormatError... Generating docs for compound lemon::LpSkeleton... Generating docs for compound lemon::LpSolver... Generating docs for compound lemon::MapBase... Generating docs for compound lemon::MapToFunctor... Generating docs for compound lemon::MaxCardinalitySearch... Generating docs for nested compound lemon::MaxCardinalitySearch::SetCapacityMap... Generating docs for nested compound lemon::MaxCardinalitySearch::SetCardinalityMap... Generating docs for nested compound lemon::MaxCardinalitySearch::SetHeap... Generating docs for nested compound lemon::MaxCardinalitySearch::SetProcessedMap... Generating docs for nested compound lemon::MaxCardinalitySearch::SetStandardHeap... Generating docs for compound lemon::MaxCardinalitySearchDefaultTraits... Generating docs for compound lemon::MaxFractionalMatching... Generating docs for nested compound lemon::MaxFractionalMatching::SetElevator... Generating docs for nested compound lemon::MaxFractionalMatching::SetMatchingMap... Generating docs for nested compound lemon::MaxFractionalMatching::SetStandardElevator... Generating docs for compound lemon::MaxFractionalMatchingDefaultTraits... Generating docs for compound lemon::MaxMatching... Generating docs for compound lemon::MaxWeightedFractionalMatching... Generating docs for compound lemon::MaxWeightedMatching... Generating docs for nested compound lemon::MaxWeightedMatching::BlossomIt... Generating docs for compound lemon::MaxWeightedPerfectFractionalMatching... Generating docs for compound lemon::MaxWeightedPerfectMatching... Generating docs for nested compound lemon::MaxWeightedPerfectMatching::BlossomIt... Generating docs for compound lemon::MinCostArborescence... Generating docs for nested compound lemon::MinCostArborescence::DualIt... Generating docs for nested compound lemon::MinCostArborescence::SetArborescenceMap... Generating docs for nested compound lemon::MinCostArborescence::SetPredMap... Generating docs for compound lemon::MinCostArborescenceDefaultTraits... Generating docs for compound lemon::MipSkeleton... Generating docs for compound lemon::MipSolver... Generating docs for compound lemon::MulMap... Generating docs for compound lemon::NagamochiIbaraki... Generating docs for nested compound lemon::NagamochiIbaraki::SetHeap... Generating docs for nested compound lemon::NagamochiIbaraki::SetStandardHeap... Generating docs for nested compound lemon::NagamochiIbaraki::SetUnitCapacity... Generating docs for compound lemon::NagamochiIbarakiDefaultTraits... Generating docs for compound lemon::NearestNeighborTsp... Generating docs for compound lemon::NegMap... Generating docs for compound lemon::NegWriteMap... Generating docs for compound lemon::NetworkSimplex... Generating docs for compound lemon::NoCounter... Generating docs for compound lemon::NoTimeReport... Generating docs for compound lemon::NotMap... Generating docs for compound lemon::NotWriteMap... Generating docs for compound lemon::NullMap... Generating docs for compound lemon::Opt2Tsp... Generating docs for compound lemon::Orienter... Generating docs for compound lemon::OrMap... Generating docs for compound lemon::OutDegMap... Generating docs for compound lemon::PairingHeap... Generating docs for compound lemon::Palette... Generating docs for compound lemon::Path... Generating docs for nested compound lemon::Path::ArcIt... Generating docs for compound lemon::PathNodeIt... Generating docs for compound lemon::PlanarColoring... Generating docs for compound lemon::PlanarDrawing... Generating docs for compound lemon::PlanarEmbedding... Generating docs for compound lemon::PotentialDifferenceMap... Generating docs for compound lemon::Preflow... Generating docs for nested compound lemon::Preflow::SetElevator... Generating docs for nested compound lemon::Preflow::SetFlowMap... Generating docs for nested compound lemon::Preflow::SetStandardElevator... Generating docs for compound lemon::PreflowDefaultTraits... Generating docs for compound lemon::QuadHeap... Generating docs for compound lemon::RadixHeap... Generating docs for nested compound lemon::RadixHeap::PriorityUnderflowError... Generating docs for compound lemon::Random... Generating docs for compound lemon::RangeIdMap... Generating docs for nested compound lemon::RangeIdMap::InverseMap... Generating docs for compound lemon::RangeMap... Generating docs for compound lemon::ResidualDigraph... Generating docs for nested compound lemon::ResidualDigraph::ResidualCapacity... Generating docs for compound lemon::ReverseDigraph... Generating docs for compound lemon::ScaleMap... Generating docs for compound lemon::ScaleWriteMap... Generating docs for compound lemon::SectionReader... Generating docs for compound lemon::SectionWriter... Generating docs for compound lemon::ShiftMap... Generating docs for compound lemon::ShiftWriteMap... Generating docs for compound lemon::SimpleBucketHeap... Generating docs for compound lemon::SimplePath... Generating docs for nested compound lemon::SimplePath::ArcIt... Generating docs for compound lemon::SkeletonSolverBase... Generating docs for compound lemon::SmartArcSet... Generating docs for compound lemon::SmartBpGraph... Generating docs for nested compound lemon::SmartBpGraph::Snapshot... Generating docs for compound lemon::SmartDigraph... Generating docs for nested compound lemon::SmartDigraph::Snapshot... Generating docs for compound lemon::SmartEdgeSet... Generating docs for compound lemon::SmartGraph... Generating docs for nested compound lemon::SmartGraph::Snapshot... Generating docs for compound lemon::SoplexLp... Generating docs for compound lemon::SourceMap... Generating docs for compound lemon::SparseMap... Generating docs for compound lemon::SplitNodes... Generating docs for nested compound lemon::SplitNodes::CombinedArcMap... Generating docs for nested compound lemon::SplitNodes::CombinedNodeMap... Generating docs for compound lemon::StaticDigraph... Generating docs for compound lemon::StaticPath... Generating docs for nested compound lemon::StaticPath::ArcIt... Generating docs for compound lemon::SubDigraph... Generating docs for compound lemon::SubGraph... Generating docs for compound lemon::SubMap... Generating docs for compound lemon::Suurballe... Generating docs for nested compound lemon::Suurballe::SetFlowMap... Generating docs for nested compound lemon::Suurballe::SetHeap... Generating docs for nested compound lemon::Suurballe::SetPath... Generating docs for nested compound lemon::Suurballe::SetPotentialMap... Generating docs for compound lemon::SuurballeDefaultTraits... Generating docs for compound lemon::TargetMap... Generating docs for compound lemon::Timer... Generating docs for compound lemon::TimeReport... Generating docs for compound lemon::TimeStamp... Generating docs for compound lemon::Tolerance... Generating docs for compound lemon::Tolerance< double >... Generating docs for compound lemon::Tolerance< float >... Generating docs for compound lemon::Tolerance< long double >... Generating docs for compound lemon::TrueMap... Generating docs for compound lemon::Undirector... Generating docs for nested compound lemon::Undirector::CombinedArcMap... Generating docs for compound lemon::UnionFind... Generating docs for compound lemon::UnionFindEnum... Generating docs for nested compound lemon::UnionFindEnum::ClassIt... Generating docs for nested compound lemon::UnionFindEnum::ItemIt... Generating docs for namespace lemon::concepts Generating docs for compound lemon::concepts::AlterableBpGraphComponent... Generating docs for compound lemon::concepts::AlterableDigraphComponent... Generating docs for compound lemon::concepts::AlterableGraphComponent... Generating docs for compound lemon::concepts::BaseBpGraphComponent... Generating docs for nested compound lemon::concepts::BaseBpGraphComponent::BlueNode... Generating docs for nested compound lemon::concepts::BaseBpGraphComponent::RedNode... Generating docs for compound lemon::concepts::BaseDigraphComponent... Generating docs for compound lemon::concepts::BaseGraphComponent... Generating docs for nested compound lemon::concepts::BaseGraphComponent::Edge... Generating docs for compound lemon::concepts::BpGraph... Generating docs for nested compound lemon::concepts::BpGraph::Arc... Generating docs for nested compound lemon::concepts::BpGraph::ArcIt... Generating docs for nested compound lemon::concepts::BpGraph::ArcMap... Generating docs for nested compound lemon::concepts::BpGraph::BlueNode... Generating docs for nested compound lemon::concepts::BpGraph::BlueNodeIt... Generating docs for nested compound lemon::concepts::BpGraph::BlueNodeMap... Generating docs for nested compound lemon::concepts::BpGraph::Edge... Generating docs for nested compound lemon::concepts::BpGraph::EdgeIt... Generating docs for nested compound lemon::concepts::BpGraph::EdgeMap... Generating docs for nested compound lemon::concepts::BpGraph::InArcIt... Generating docs for nested compound lemon::concepts::BpGraph::IncEdgeIt... Generating docs for nested compound lemon::concepts::BpGraph::Node... Generating docs for nested compound lemon::concepts::BpGraph::NodeIt... Generating docs for nested compound lemon::concepts::BpGraph::NodeMap... Generating docs for nested compound lemon::concepts::BpGraph::OutArcIt... Generating docs for nested compound lemon::concepts::BpGraph::RedNode... Generating docs for nested compound lemon::concepts::BpGraph::RedNodeIt... Generating docs for nested compound lemon::concepts::BpGraph::RedNodeMap... Generating docs for compound lemon::concepts::ClearableBpGraphComponent... Generating docs for compound lemon::concepts::ClearableDigraphComponent... Generating docs for compound lemon::concepts::ClearableGraphComponent... Generating docs for compound lemon::concepts::Digraph... Generating docs for nested compound lemon::concepts::Digraph::Arc... Generating docs for nested compound lemon::concepts::Digraph::ArcIt... Generating docs for nested compound lemon::concepts::Digraph::ArcMap... Generating docs for nested compound lemon::concepts::Digraph::InArcIt... Generating docs for nested compound lemon::concepts::Digraph::Node... Generating docs for nested compound lemon::concepts::Digraph::NodeIt... Generating docs for nested compound lemon::concepts::Digraph::NodeMap... Generating docs for nested compound lemon::concepts::Digraph::OutArcIt... Generating docs for compound lemon::concepts::ErasableBpGraphComponent... Generating docs for compound lemon::concepts::ErasableDigraphComponent... Generating docs for compound lemon::concepts::ErasableGraphComponent... Generating docs for compound lemon::concepts::ExtendableBpGraphComponent... Generating docs for compound lemon::concepts::ExtendableDigraphComponent... Generating docs for compound lemon::concepts::ExtendableGraphComponent... Generating docs for compound lemon::concepts::Graph... Generating docs for nested compound lemon::concepts::Graph::Arc... Generating docs for nested compound lemon::concepts::Graph::ArcIt... Generating docs for nested compound lemon::concepts::Graph::ArcMap... Generating docs for nested compound lemon::concepts::Graph::Edge... Generating docs for nested compound lemon::concepts::Graph::EdgeIt... Generating docs for nested compound lemon::concepts::Graph::EdgeMap... Generating docs for nested compound lemon::concepts::Graph::InArcIt... Generating docs for nested compound lemon::concepts::Graph::IncEdgeIt... Generating docs for nested compound lemon::concepts::Graph::Node... Generating docs for nested compound lemon::concepts::Graph::NodeIt... Generating docs for nested compound lemon::concepts::Graph::NodeMap... Generating docs for nested compound lemon::concepts::Graph::OutArcIt... Generating docs for compound lemon::concepts::GraphIncIt... Generating docs for compound lemon::concepts::GraphItem... Generating docs for compound lemon::concepts::GraphItemIt... Generating docs for compound lemon::concepts::GraphMap... Generating docs for compound lemon::concepts::Heap... Generating docs for compound lemon::concepts::IDableBpGraphComponent... Generating docs for compound lemon::concepts::IDableDigraphComponent... Gensh: 1: latex: not found sh: 1: dvips: not found erating docs for compound lemon::concepts::IDableGraphComponent... Generating docs for compound lemon::concepts::IterableBpGraphComponent... Generating docs for compound lemon::concepts::IterableDigraphComponent... Generating docs for compound lemon::concepts::IterableGraphComponent... Generating docs for compound lemon::concepts::MappableBpGraphComponent... Generating docs for nested compound lemon::concepts::MappableBpGraphComponent::BlueNodeMap... Generating docs for nested compound lemon::concepts::MappableBpGraphComponent::RedNodeMap... Generating docs for compound lemon::concepts::MappableDigraphComponent... Generating docs for nested compound lemon::concepts::MappableDigraphComponent::ArcMap... Generating docs for nested compound lemon::concepts::MappableDigraphComponent::NodeMap... Generating docs for compound lemon::concepts::MappableGraphComponent... Generating docs for nested compound lemon::concepts::MappableGraphComponent::EdgeMap... Generating docs for compound lemon::concepts::Path... Generating docs for nested compound lemon::concepts::Path::ArcIt... Generating docs for compound lemon::concepts::PathDumper... Generating docs for nested compound lemon::concepts::PathDumper::ArcIt... Generating docs for nested compound lemon::concepts::PathDumper::RevArcIt... Generating docs for compound lemon::concepts::ReadMap... Generating docs for compound lemon::concepts::ReadWriteMap... Generating docs for compound lemon::concepts::ReferenceMap... Generating docs for compound lemon::concepts::WriteMap... Generating docs for namespace lemon::dim2 Generating docs for compound lemon::dim2::Box... Generating docs for compound lemon::dim2::ConstXMap... Generating docs for compound lemon::dim2::ConstYMap... Generating docs for compound lemon::dim2::NormSquareMap... Generating docs for compound lemon::dim2::Point... Generating docs for compound lemon::dim2::XMap... Generating docs for compound lemon::dim2::YMap... Generating graph info page... Generating directory documentation... Generating bitmaps for formulas in HTML... Generating image form_0.png for formula Generating index page... Generating module index... Generating annotated compound index... Generating alphabetical compound index... Generating hierarchical class index... Generating member index... Generating namespace index... Generating namespace member index... Generating file index... Generating file member index... Generating example index... Generating page index... finalizing index lists... writing tag file... Running dot... Generating dot graphs using 5 parallel threads... Running dot for graph 1/200 Running dot for graph 2/200 Running dot for graph 3/200 Running dot for graph 4/200 Running dot for graph 5/200 Running dot for graph 6/200 Running dot for graph 7/200 Running dot for graph 8/200 Running dot for graph 9/200 Running dot for graph 10/200 Running dot for graph 11/200 Running dot for graph 12/200 Running dot for graph 13/200 Running dot for graph 14/200 Running dot for graph 15/200 Running dot for graph 16/200 Running dot for graph 17/200 Running dot for graph 18/200 Running dot for graph 19/200 Running dot for graph 20/200 Running dot for graph 21/200 Running dot for graph 22/200 Running dot for graph 23/200 Running dot for graph 24/200 Running dot for graph 25/200 Running dot for graph 26/200 Running dot for graph 27/200 Running dot for graph 28/200 Running dot for graph 29/200 Running dot for graph 30/200 Running dot for graph 31/200 Running dot for graph 32/200 Running dot for graph 33/200 Running dot for graph 34/200 Running dot for graph 35/200 Running dot for graph 36/200 Running dot for graph 37/200 Running dot for graph 38/200 Running dot for graph 39/200 Running dot for graph 40/200 Running dot for graph 41/200 Running dot for graph 42/200 Running dot for graph 43/200 Running dot for graph 44/200 Running dot for graph 45/200 Running dot for graph 46/200 Running dot for graph 47/200 Running dot for graph 48/200 Running dot for graph 49/200 Running dot for graph 50/200 Running dot for graph 51/200 Running dot for graph 52/200 Running dot for graph 53/200 Running dot for graph 54/200 Running dot for graph 55/200 Running dot for graph 56/200 Running dot for graph 57/200 Running dot for graph 58/200 Running dot for graph 59/200 Running dot for graph 60/200 Running dot for graph 61/200 Running dot for graph 62/200 Running dot for graph 63/200 Running dot for graph 64/200 Running dot for graph 65/200 Running dot for graph 66/200 Running dot for graph 67/200 Running dot for graph 68/200 Running dot for graph 69/200 Running dot for graph 70/200 Running dot for graph 71/200 Running dot for graph 72/200 Running dot for graph 73/200 Running dot for graph 74/200 Running dot for graph 75/200 Running dot for graph 76/200 Running dot for graph 77/200 Running dot for graph 78/200 Running dot for graph 79/200 Running dot for graph 80/200 Running dot for graph 81/200 Running dot for graph 82/200 Running dot for graph 83/200 Running dot for graph 84/200 Running dot for graph 85/200 Running dot for graph 86/200 Running dot for graph 87/200 Running dot for graph 88/200 Running dot for graph 89/200 Running dot for graph 90/200 Running dot for graph 91/200 Running dot for graph 92/200 Running dot for graph 93/200 Running dot for graph 94/200 Running dot for graph 95/200 Running dot for graph 96/200 Running dot for graph 97/200 Running dot for graph 98/200 Running dot for graph 99/200 Running dot for graph 100/200 Running dot for graph 101/200 Running dot for graph 102/200 Running dot for graph 103/200 Running dot for graph 104/200 Running dot for graph 105/200 Running dot for graph 106/200 Running dot for graph 107/200 Running dot for graph 108/200 Running dot for graph 109/200 Running dot for graph 110/200 Running dot for graph 111/200 Running dot for graph 112/200 Running dot for graph 113/200 Running dot for graph 114/200 Running dot for graph 115/200 Running dot for graph 116/200 Running dot for graph 117/200 Running dot for graph 118/200 Running dot for graph 119/200 Running dot for graph 120/200 Running dot for graph 121/200 Running dot for graph 122/200 Running dot for graph 123/200 Running dot for graph 124/200 Running dot for graph 125/200 Running dot for graph 126/200 Running dot for graph 127/200 Running dot for graph 128/200 Running dot for graph 129/200 Running dot for graph 130/200 Running dot for graph 131/200 Running dot for graph 132/200 Running dot for graph 133/200 Running dot for graph 134/200 Running dot for graph 135/200 Running dot for graph 136/200 Running dot for graph 137/200 Running dot for graph 138/200 Running dot for graph 139/200 Running dot for graph 140/200 Running dot for graph 141/200 Running dot for graph 142/200 Running dot for graph 143/200 Running dot for graph 144/200 Running dot for graph 145/200 Running dot for graph 146/200 Running dot for graph 147/200 Running dot for graph 148/200 Running dot for graph 149/200 Running dot for graph 150/200 Running dot for graph 151/200 Running dot for graph 152/200 Running dot for graph 153/200 Running dot for graph 154/200 Running dot for graph 155/200 Running dot for graph 156/200 Running dot for graph 157/200 Running dot for graph 158/200 Running dot for graph 159/200 Running dot for graph 160/200 Running dot for graph 161/200 Running dot for graph 162/200 Running dot for graph 163/200 Running dot for graph 164/200 Running dot for graph 165/200 Running dot for graph 166/200 Running dot for graph 167/200 Running dot for graph 168/200 Running dot for graph 169/200 Running dot for graph 170/200 Running dot for graph 171/200 Running dot for graph 172/200 Running dot for graph 173/200 Running dot for graph 174/200 Running dot for graph 175/200 Running dot for graph 176/200 Running dot for graph 177/200 Running dot for graph 178/200 Running dot for graph 179/200 Running dot for graph 180/200 Running dot for graph 181/200 Running dot for graph 182/200 Running dot for graph 183/200 Running dot for graph 184/200 Running dot for graph 185/200 Running dot for graph 186/200 Running dot for graph 187/200 Running dot for graph 188/200 Running dot for graph 189/200 Running dot for graph 190/200 Running dot for graph 191/200 Running dot for graph 192/200 Running dot for graph 193/200 Running dot for graph 194/200 Running dot for graph 195/200 Running dot for graph 196/200 Running dot for graph 197/200 Running dot for graph 198/200 Running dot for graph 199/200 Running dot for graph 200/200 Patching output file 1/199 Patching output file 2/199 Patching output file 3/199 Patching output file 4/199 Patching output file 5/199 Patching output file 6/199 Patching output file 7/199 Patching output file 8/199 Patching output file 9/199 Patching output file 10/199 Patching output file 11/199 Patching output file 12/199 Patching output file 13/199 Patching output file 14/199 Patching output file 15/199 Patching output file 16/199 Patching output file 17/199 Patching output file 18/199 Patching output file 19/199 Patching output file 20/199 Patching output file 21/199 Patching output file 22/199 Patching output file 23/199 Patching output file 24/199 Patching output file 25/199 Patching output file 26/199 Patching output file 27/199 Patching output file 28/199 Patching output file 29/199 Patching output file 30/199 Patching output file 31/199 Patching output file 32/199 Patching output file 33/199 Patching output file 34/199 Patching output file 35/199 Patching output file 36/199 Patching output file 37/199 Patching output file 38/199 Patching output file 39/199 Patching output file 40/199 Patching output file 41/199 Patching output file 42/199 Patching output file 43/199 Patching output file 44/199 Patching output file 45/199 Patching output file 46/199 Patching output file 47/199 Patching output file 48/199 Patching output file 49/199 Patching output file 50/199 Patching output file 51/199 Patching output file 52/199 Patching output file 53/199 Patching output file 54/199 Patching output file 55/199 Patching output file 56/199 Patching output file 57/199 Patching output file 58/199 Patching output file 59/199 Patching output file 60/199 Patching output file 61/199 Patching output file 62/199 Patching output file 63/199 Patching output file 64/199 Patching output file 65/199 Patching output file 66/199 Patching output file 67/199 Patching output file 68/199 Patching output file 69/199 Patching output file 70/199 Patching output file 71/199 Patching output file 72/199 Patching output file 73/199 Patching output file 74/199 Patching output file 75/199 Patching output file 76/199 Patching output file 77/199 Patching output file 78/199 Patching output file 79/199 Patching output file 80/199 Patching output file 81/199 Patching output file 82/199 Patching output file 83/199 Patching output file 84/199 Patching output file 85/199 Patching output file 86/199 Patching output file 87/199 Patching output file 88/199 Patching output file 89/199 Patching output file 90/199 Patching output file 91/199 Patching output file 92/199 Patching output file 93/199 Patching output file 94/199 Patching output file 95/199 Patching output file 96/199 Patching output file 97/199 Patching output file 98/199 Patching output file 99/199 Patching output file 100/199 Patching output file 101/199 Patching output file 102/199 Patching output file 103/199 Patching output file 104/199 Patching output file 105/199 Patching output file 106/199 Patching output file 107/199 Patching output file 108/199 Patching output file 109/199 Patching output file 110/199 Patching output file 111/199 Patching output file 112/199 Patching output file 113/199 Patching output file 114/199 Patching output file 115/199 Patching output file 116/199 Patching output file 117/199 Patching output file 118/199 Patching output file 119/199 Patching output file 120/199 Patching output file 121/199 Patching output file 122/199 Patching output file 123/199 Patching output file 124/199 Patching output file 125/199 Patching output file 126/199 Patching output file 127/199 Patching output file 128/199 Patching output file 129/199 Patching output file 130/199 Patching output file 131/199 Patching output file 132/199 Patching output file 133/199 Patching output file 134/199 Patching output file 135/199 Patching output file 136/199 Patching output file 137/199 Patching output file 138/199 Patching output file 139/199 Patching output file 140/199 Patching output file 141/199 Patching output file 142/199 Patching output file 143/199 Patching output file 144/199 Patching output file 145/199 Patching output file 146/199 Patching output file 147/199 Patching output file 148/199 Patching output file 149/199 Patching output file 150/199 Patching output file 151/199 Patching output file 152/199 Patching output file 153/199 Patching output file 154/199 Patching output file 155/199 Patching output file 156/199 Patching output file 157/199 Patching output file 158/199 Patching output file 159/199 Patching output file 160/199 Patching output file 161/199 Patching output file 162/199 Patching output file 163/199 Patching output file 164/199 Patching output file 165/199 Patching output file 166/199 Patching output file 167/199 Patching output file 168/199 Patching output file 169/199 Patching output file 170/199 Patching output file 171/199 Patching output file 172/199 Patching output file 173/199 Patching output file 174/199 Patching output file 175/199 Patching output file 176/199 Patching output file 177/199 Patching output file 178/199 Patching output file 179/199 Patching output file 180/199 Patching output file 181/199 Patching output file 182/199 Patching output file 183/199 Patching output file 184/199 Patching output file 185/199 Patching output file 186/199 Patching output file 187/199 Patching output file 188/199 Patching output file 189/199 Patching output file 190/199 Patching output file 191/199 Patching output file 192/199 Patching output file 193/199 Patching output file 194/199 Patching output file 195/199 Patching output file 196/199 Patching output file 197/199 Patching output file 198/199 Patching output file 199/199 lookup cache used 10529/65536 hits=128371 misses=13880 finished... make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' Built target html make[4]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' /usr/bin/cmake -E cmake_progress_start /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/CMakeFiles 0 make[3]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' make[2]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/doc' make[1]: Leaving directory '/<>/liblemon-1.3.1+dfsg' debian/rules override_dh_auto_test make[1]: Entering directory '/<>/liblemon-1.3.1+dfsg' cd obj-* && make check make[2]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' /usr/bin/cmake -S/<>/liblemon-1.3.1+dfsg -B/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf --check-build-system CMakeFiles/Makefile.cmake 0 make -f CMakeFiles/Makefile2 check make[3]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' /usr/bin/cmake -S/<>/liblemon-1.3.1+dfsg -B/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf --check-build-system CMakeFiles/Makefile.cmake 0 /usr/bin/cmake -E cmake_progress_start /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/CMakeFiles 83 make -f CMakeFiles/Makefile2 CMakeFiles/check.dir/all make[4]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' make -f lemon/CMakeFiles/lemon.dir/build.make lemon/CMakeFiles/lemon.dir/depend make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<>/liblemon-1.3.1+dfsg /<>/liblemon-1.3.1+dfsg/lemon /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon/CMakeFiles/lemon.dir/DependInfo.cmake --color= make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' make -f lemon/CMakeFiles/lemon.dir/build.make lemon/CMakeFiles/lemon.dir/build make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' make[5]: Nothing to be done for 'lemon/CMakeFiles/lemon.dir/build'. make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 9%] Built target lemon make -f test/CMakeFiles/hao_orlin_test.dir/build.make test/CMakeFiles/hao_orlin_test.dir/depend make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<>/liblemon-1.3.1+dfsg /<>/liblemon-1.3.1+dfsg/test /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test/CMakeFiles/hao_orlin_test.dir/DependInfo.cmake --color= Scanning dependencies of target hao_orlin_test make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' make -f test/CMakeFiles/hao_orlin_test.dir/build.make test/CMakeFiles/hao_orlin_test.dir/build make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 10%] Building CXX object test/CMakeFiles/hao_orlin_test.dir/hao_orlin_test.cc.o cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -I/<>/liblemon-1.3.1+dfsg -I/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -o CMakeFiles/hao_orlin_test.dir/hao_orlin_test.cc.o -c /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h: In instantiation of ‘void lemon::HaoOrlin::init(const Node&) [with GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap; TOL = lemon::Tolerance; lemon::HaoOrlin::Node = lemon::concepts::Digraph::Node]’: /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:76:17: required from here /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h:871:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 871 | _source = source; | ~~~~~~~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h: In instantiation of ‘void lemon::HaoOrlin::findMinCutOut() [with GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap; TOL = lemon::Tolerance]’: /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h:920:7: required from ‘void lemon::HaoOrlin::calculateOut() [with GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap; TOL = lemon::Tolerance]’ /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:77:24: required from here /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h:267:26: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 267 | queue[qlast++] = t; | ~~~~~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h:275:54: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 275 | _first[bucket_num] = _last[bucket_num] = INVALID; | ~~~~~~~~~~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h:275:34: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 275 | _first[bucket_num] = _last[bucket_num] = INVALID; | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h:286:32: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 286 | queue[qlast++] = u; | ~~~~~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h:403:37: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 403 | _first[(*_bucket)[n]] = (*_next)[n]; | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h:404:37: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 404 | (*_prev)[(*_next)[n]] = INVALID; | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h:411:54: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 411 | _first[bucket_num] = _last[bucket_num] = n; | ~~~~~~~~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h:411:34: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 411 | _first[bucket_num] = _last[bucket_num] = n; | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h:412:27: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 412 | (*_next)[n] = INVALID; | ~~~~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h:413:27: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 413 | (*_prev)[n] = INVALID; | ~~~~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h:422:33: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 422 | _first[*_highest] = (*_next)[n]; | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h:423:37: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 423 | (*_prev)[(*_next)[n]] = INVALID; | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h:432:56: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 432 | _first[bucket_num] = _last[bucket_num] = INVALID; | ~~~~~~~~~~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h:432:36: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 432 | _first[bucket_num] = _last[bucket_num] = INVALID; | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h:438:27: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 438 | (*_next)[n] = _first[*_highest]; | ~~~~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h:440:45: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 440 | (*_prev)[_first[*_highest]] = n; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h:442:34: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 442 | _last[*_highest] = n; | ~~~~~~~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h:444:33: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 444 | _first[*_highest] = n; | ~~~~~~~~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h:469:17: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 469 | n = (*_next)[n]; | ~~^~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h:478:41: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 478 | _last[(*_bucket)[target]] = (*_prev)[target]; | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h:479:26: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 479 | new_target = (*_prev)[target]; | ~~~~~~~~~~~^~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h:481:42: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 481 | (*_prev)[(*_next)[target]] = (*_prev)[target]; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h:482:26: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 482 | new_target = (*_next)[target]; | ~~~~~~~~~~~^~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h:485:42: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 485 | _first[(*_bucket)[target]] = (*_next)[target]; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h:487:42: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 487 | (*_next)[(*_prev)[target]] = (*_next)[target]; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h:500:24: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 500 | new_target = _last[_sets.back().back()]; | ~~~~~~~~~~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h:528:18: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 528 | target = new_target; | ~~~~~~~^~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h: In instantiation of ‘void lemon::HaoOrlin::findMinCutIn() [with GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap; TOL = lemon::Tolerance]’: /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h:934:7: required from ‘void lemon::HaoOrlin::calculateIn() [with GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap; TOL = lemon::Tolerance]’ /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:78:23: required from here /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h:568:26: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 568 | queue[qlast++] = t; | ~~~~~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h:576:54: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 576 | _first[bucket_num] = _last[bucket_num] = INVALID; | ~~~~~~~~~~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h:576:34: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 576 | _first[bucket_num] = _last[bucket_num] = INVALID; | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h:587:32: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 587 | queue[qlast++] = u; | ~~~~~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h:704:37: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 704 | _first[(*_bucket)[n]] = (*_next)[n]; | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h:705:37: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 705 | (*_prev)[(*_next)[n]] = INVALID; | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h:712:54: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 712 | _first[bucket_num] = _last[bucket_num] = n; | ~~~~~~~~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h:712:34: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 712 | _first[bucket_num] = _last[bucket_num] = n; | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h:713:27: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 713 | (*_next)[n] = INVALID; | ~~~~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h:714:27: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 714 | (*_prev)[n] = INVALID; | ~~~~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h:723:33: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 723 | _first[*_highest] = (*_next)[n]; | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h:724:37: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 724 | (*_prev)[(*_next)[n]] = INVALID; | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h:732:56: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 732 | _first[bucket_num] = _last[bucket_num] = INVALID; | ~~~~~~~~~~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h:732:36: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 732 | _first[bucket_num] = _last[bucket_num] = INVALID; | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h:738:27: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 738 | (*_next)[n] = _first[*_highest]; | ~~~~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h:740:45: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 740 | (*_prev)[_first[*_highest]] = n; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h:742:34: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 742 | _last[*_highest] = n; | ~~~~~~~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h:744:33: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 744 | _first[*_highest] = n; | ~~~~~~~~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h:769:17: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 769 | n = (*_next)[n]; | ~~^~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h:778:41: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 778 | _last[(*_bucket)[target]] = (*_prev)[target]; | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h:779:26: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 779 | new_target = (*_prev)[target]; | ~~~~~~~~~~~^~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h:781:42: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 781 | (*_prev)[(*_next)[target]] = (*_prev)[target]; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h:782:26: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 782 | new_target = (*_next)[target]; | ~~~~~~~~~~~^~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h:785:42: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 785 | _first[(*_bucket)[target]] = (*_next)[target]; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h:787:42: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 787 | (*_next)[(*_prev)[target]] = (*_next)[target]; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h:800:24: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 800 | new_target = _last[_sets.back().back()]; | ~~~~~~~~~~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h:828:18: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 828 | target = new_target; | ~~~~~~~^~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h: In instantiation of ‘void lemon::HaoOrlin::addItem(const Node&, int) [with GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap; TOL = lemon::Tolerance; lemon::HaoOrlin::Node = lemon::concepts::Digraph::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h:280:13: required from ‘void lemon::HaoOrlin::findMinCutOut() [with GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap; TOL = lemon::Tolerance]’ /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h:920:7: required from ‘void lemon::HaoOrlin::calculateOut() [with GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap; TOL = lemon::Tolerance]’ /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:77:24: required from here /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h:230:21: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 230 | (*_prev)[i] = _last[bucket]; | ~~~~~~~~~~~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h:231:33: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 231 | (*_next)[_last[bucket]] = i; | ~~~~~~~~~~~~~~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h:232:21: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 232 | (*_next)[i] = INVALID; | ~~~~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h:233:23: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 233 | _last[bucket] = i; | ~~~~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h:235:21: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 235 | (*_prev)[i] = INVALID; | ~~~~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h:236:24: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 236 | _first[bucket] = i; | ~~~~~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h:237:21: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 237 | (*_next)[i] = INVALID; | ~~~~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h:238:23: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 238 | _last[bucket] = i; | ~~~~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h: In instantiation of ‘void lemon::HaoOrlin::activate(const Node&) [with GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap; TOL = lemon::Tolerance; lemon::HaoOrlin::Node = lemon::concepts::Digraph::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h:307:15: required from ‘void lemon::HaoOrlin::findMinCutOut() [with GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap; TOL = lemon::Tolerance]’ /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h:920:7: required from ‘void lemon::HaoOrlin::calculateOut() [with GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap; TOL = lemon::Tolerance]’ /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:77:24: required from here /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h:194:29: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 194 | (*_next)[(*_prev)[i]] = (*_next)[i]; | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h:196:31: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 196 | (*_prev)[(*_next)[i]] = (*_prev)[i]; | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h:198:23: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 198 | _last[bucket] = (*_prev)[i]; | ~~~~~~~~~~~~~~^~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h:201:19: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 201 | (*_next)[i] = _first[bucket]; | ~~~~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h:202:32: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 202 | (*_prev)[_first[bucket]] = i; | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h:203:19: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 203 | (*_prev)[i] = INVALID; | ~~~~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h:204:22: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 204 | _first[bucket] = i; | ~~~~~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h: In instantiation of ‘void lemon::HaoOrlin::deactivate(const Node&) [with GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap; TOL = lemon::Tolerance; lemon::HaoOrlin::Node = lemon::concepts::Digraph::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h:313:11: required from ‘void lemon::HaoOrlin::findMinCutOut() [with GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap; TOL = lemon::Tolerance]’ /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h:920:7: required from ‘void lemon::HaoOrlin::calculateOut() [with GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap; TOL = lemon::Tolerance]’ /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:77:24: required from here /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h:214:29: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 214 | (*_prev)[(*_next)[i]] = (*_prev)[i]; | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h:216:31: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 216 | (*_next)[(*_prev)[i]] = (*_next)[i]; | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h:218:24: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 218 | _first[bucket] = (*_next)[i]; | ~~~~~~~~~~~~~~~^~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h:221:19: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 221 | (*_prev)[i] = _last[bucket]; | ~~~~~~~~~~~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h:222:31: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 222 | (*_next)[_last[bucket]] = i; | ~~~~~~~~~~~~~~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h:223:19: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 223 | (*_next)[i] = INVALID; | ~~~~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/hao_orlin.h:224:21: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 224 | _last[bucket] = i; | ~~~~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ [ 12%] Linking CXX executable hao_orlin_test cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/cmake -E cmake_link_script CMakeFiles/hao_orlin_test.dir/link.txt --verbose=1 /usr/bin/c++ -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -Wl,-Bsymbolic-functions -Wl,-z,relro -Wl,-z,now -rdynamic CMakeFiles/hao_orlin_test.dir/hao_orlin_test.cc.o -o hao_orlin_test -L/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 12%] Built target hao_orlin_test make -f test/CMakeFiles/gomory_hu_test.dir/build.make test/CMakeFiles/gomory_hu_test.dir/depend make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<>/liblemon-1.3.1+dfsg /<>/liblemon-1.3.1+dfsg/test /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test/CMakeFiles/gomory_hu_test.dir/DependInfo.cmake --color= Scanning dependencies of target gomory_hu_test make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' make -f test/CMakeFiles/gomory_hu_test.dir/build.make test/CMakeFiles/gomory_hu_test.dir/build make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 13%] Building CXX object test/CMakeFiles/gomory_hu_test.dir/gomory_hu_test.cc.o cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -I/<>/liblemon-1.3.1+dfsg -I/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -o CMakeFiles/gomory_hu_test.dir/gomory_hu_test.cc.o -c /<>/liblemon-1.3.1+dfsg/test/gomory_hu_test.cc /<>/liblemon-1.3.1+dfsg/test/gomory_hu_test.cc: In function ‘void checkGomoryHuCompile()’: /<>/liblemon-1.3.1+dfsg/test/gomory_hu_test.cc:79:31: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 79 | n = const_gh_test.predNode(n); | ^ In file included from /<>/liblemon-1.3.1+dfsg/test/gomory_hu_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/gomory_hu_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/gomory_hu.h: In instantiation of ‘lemon::GomoryHu::Value lemon::GomoryHu::minCutValue(const Node&, const Node&) const [with GR = lemon::concepts::Graph; CAP = lemon::concepts::ReadMap; lemon::GomoryHu::Value = int; lemon::GomoryHu::Node = lemon::concepts::Graph::Node]’: /<>/liblemon-1.3.1+dfsg/test/gomory_hu_test.cc:82:37: required from here /<>/liblemon-1.3.1+dfsg/lemon/gomory_hu.h:270:14: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 270 | tn = (*_pred)[tn]; | ~~~^~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/gomory_hu_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/gomory_hu_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/gomory_hu.h:273:14: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 273 | sn = (*_pred)[sn]; | ~~~^~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/gomory_hu_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/gomory_hu_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/gomory_hu.h: In instantiation of ‘lemon::GomoryHu::Value lemon::GomoryHu::minCutMap(const Node&, const Node&, CutMap&) const [with CutMap = lemon::concepts::ReadWriteMap; GR = lemon::concepts::Graph; CAP = lemon::concepts::ReadMap; lemon::GomoryHu::Value = int; lemon::GomoryHu::Node = lemon::concepts::Graph::Node]’: /<>/liblemon-1.3.1+dfsg/test/gomory_hu_test.cc:83:40: required from here /<>/liblemon-1.3.1+dfsg/lemon/gomory_hu.h:309:16: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 309 | rn = tn; | ~~~^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/gomory_hu_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/gomory_hu_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/gomory_hu.h:313:14: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 313 | tn = (*_pred)[tn]; | ~~~^~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/gomory_hu_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/gomory_hu_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/gomory_hu.h:316:16: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 316 | rn = sn; | ~~~^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/gomory_hu_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/gomory_hu_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/gomory_hu.h:320:14: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 320 | sn = (*_pred)[sn]; | ~~~^~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/gomory_hu_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/gomory_hu_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/gomory_hu.h:336:14: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 336 | nn = (*_pred)[nn]; | ~~~^~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/gomory_hu_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/gomory_hu_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/gomory_hu.h: In instantiation of ‘void lemon::GomoryHu::init() [with GR = lemon::concepts::Graph; CAP = lemon::concepts::ReadMap]’: /<>/liblemon-1.3.1+dfsg/lemon/gomory_hu.h:207:7: required from ‘void lemon::GomoryHu::run() [with GR = lemon::concepts::Graph; CAP = lemon::concepts::ReadMap]’ /<>/liblemon-1.3.1+dfsg/test/gomory_hu_test.cc:77:15: required from here /<>/liblemon-1.3.1+dfsg/lemon/gomory_hu.h:142:13: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 142 | _root = NodeIt(_graph); | ~~~~~~^~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/gomory_hu_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/gomory_hu_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/gomory_hu.h:144:21: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 144 | (*_pred)[n] = _root; | ~~~~~~~~~~~~^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/gomory_hu_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/gomory_hu_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/gomory_hu.h:147:23: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 147 | (*_pred)[_root] = INVALID; | ~~~~~~~~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/gomory_hu_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/gomory_hu_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/gomory_hu.h: In instantiation of ‘void lemon::GomoryHu::start() [with GR = lemon::concepts::Graph; CAP = lemon::concepts::ReadMap]’: /<>/liblemon-1.3.1+dfsg/lemon/gomory_hu.h:208:7: required from ‘void lemon::GomoryHu::run() [with GR = lemon::concepts::Graph; CAP = lemon::concepts::ReadMap]’ /<>/liblemon-1.3.1+dfsg/test/gomory_hu_test.cc:77:15: required from here /<>/liblemon-1.3.1+dfsg/lemon/gomory_hu.h:169:26: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 169 | (*_pred)[nn] = n; | ~~~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/gomory_hu_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/gomory_hu_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/gomory_hu.h:173:23: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 173 | (*_pred)[n] = (*_pred)[pn]; | ~~~~~~~~~~~~^~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/gomory_hu_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/gomory_hu_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/gomory_hu.h:174:24: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 174 | (*_pred)[pn] = n; | ~~~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/gomory_hu_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/gomory_hu_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/gomory_hu.h:188:14: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 188 | nn = (*_pred)[nn]; | ~~~^~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/gomory_hu_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/gomory_hu.h:25, from /<>/liblemon-1.3.1+dfsg/test/gomory_hu_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/preflow.h: In instantiation of ‘lemon::Preflow& lemon::Preflow::source(const Node&) [with GR = lemon::concepts::Graph; CAP = lemon::concepts::ReadMap; TR = lemon::PreflowDefaultTraits >; lemon::Preflow::Node = lemon::concepts::Graph::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/gomory_hu.h:160:9: required from ‘void lemon::GomoryHu::start() [with GR = lemon::concepts::Graph; CAP = lemon::concepts::ReadMap]’ /<>/liblemon-1.3.1+dfsg/lemon/gomory_hu.h:208:7: required from ‘void lemon::GomoryHu::run() [with GR = lemon::concepts::Graph; CAP = lemon::concepts::ReadMap]’ /<>/liblemon-1.3.1+dfsg/test/gomory_hu_test.cc:77:15: required from here /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:350:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 350 | _source = node; | ~~~~~~~~^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/gomory_hu_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/gomory_hu.h:25, from /<>/liblemon-1.3.1+dfsg/test/gomory_hu_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/preflow.h: In instantiation of ‘lemon::Preflow& lemon::Preflow::target(const Node&) [with GR = lemon::concepts::Graph; CAP = lemon::concepts::ReadMap; TR = lemon::PreflowDefaultTraits >; lemon::Preflow::Node = lemon::concepts::Graph::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/gomory_hu.h:161:9: required from ‘void lemon::GomoryHu::start() [with GR = lemon::concepts::Graph; CAP = lemon::concepts::ReadMap]’ /<>/liblemon-1.3.1+dfsg/lemon/gomory_hu.h:208:7: required from ‘void lemon::GomoryHu::run() [with GR = lemon::concepts::Graph; CAP = lemon::concepts::ReadMap]’ /<>/liblemon-1.3.1+dfsg/test/gomory_hu_test.cc:77:15: required from here /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:359:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 359 | _target = node; | ~~~~~~~~^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/gomory_hu_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/gomory_hu.h:25, from /<>/liblemon-1.3.1+dfsg/test/gomory_hu_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/preflow.h: In instantiation of ‘void lemon::Preflow::startFirstPhase() [with GR = lemon::concepts::Graph; CAP = lemon::concepts::ReadMap; TR = lemon::PreflowDefaultTraits >]’: /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:898:7: required from ‘void lemon::Preflow::runMinCut() [with GR = lemon::concepts::Graph; CAP = lemon::concepts::ReadMap; TR = lemon::PreflowDefaultTraits >]’ /<>/liblemon-1.3.1+dfsg/lemon/gomory_hu.h:163:9: required from ‘void lemon::GomoryHu::start() [with GR = lemon::concepts::Graph; CAP = lemon::concepts::ReadMap]’ /<>/liblemon-1.3.1+dfsg/lemon/gomory_hu.h:208:7: required from ‘void lemon::GomoryHu::run() [with GR = lemon::concepts::Graph; CAP = lemon::concepts::ReadMap]’ /<>/liblemon-1.3.1+dfsg/test/gomory_hu_test.cc:77:15: required from here /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:584:13: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 584 | n = _level->highestActive(); In file included from /<>/liblemon-1.3.1+dfsg/test/gomory_hu_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/gomory_hu.h:25, from /<>/liblemon-1.3.1+dfsg/test/gomory_hu_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:662:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 662 | n = _level->highestActive(); In file included from /<>/liblemon-1.3.1+dfsg/test/gomory_hu_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/gomory_hu.h:25, from /<>/liblemon-1.3.1+dfsg/test/gomory_hu_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:666:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 666 | n = _level->activeOn(level); In file included from /<>/liblemon-1.3.1+dfsg/test/gomory_hu_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:23, from /<>/liblemon-1.3.1+dfsg/lemon/gomory_hu.h:25, from /<>/liblemon-1.3.1+dfsg/test/gomory_hu_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h: In instantiation of ‘void lemon::Elevator::initStart() [with GR = lemon::concepts::Graph; Item = lemon::concepts::Graph::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:434:7: required from ‘void lemon::Preflow::init() [with GR = lemon::concepts::Graph; CAP = lemon::concepts::ReadMap; TR = lemon::PreflowDefaultTraits >]’ /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:897:7: required from ‘void lemon::Preflow::runMinCut() [with GR = lemon::concepts::Graph; CAP = lemon::concepts::ReadMap; TR = lemon::PreflowDefaultTraits >]’ /<>/liblemon-1.3.1+dfsg/lemon/gomory_hu.h:163:9: required from ‘void lemon::GomoryHu::start() [with GR = lemon::concepts::Graph; CAP = lemon::concepts::ReadMap]’ /<>/liblemon-1.3.1+dfsg/lemon/gomory_hu.h:208:7: required from ‘void lemon::GomoryHu::run() [with GR = lemon::concepts::Graph; CAP = lemon::concepts::ReadMap]’ /<>/liblemon-1.3.1+dfsg/test/gomory_hu_test.cc:77:15: required from here /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:435:13: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 435 | *n=i; | ~~^~ In file included from /<>/liblemon-1.3.1+dfsg/test/gomory_hu_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:23, from /<>/liblemon-1.3.1+dfsg/lemon/gomory_hu.h:25, from /<>/liblemon-1.3.1+dfsg/test/gomory_hu_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h: In instantiation of ‘void lemon::Elevator::swap(lemon::Elevator::Vit, lemon::Elevator::Vit) [with GR = lemon::concepts::Graph; Item = lemon::concepts::Graph::Node; lemon::Elevator::Vit = lemon::concepts::Graph::Node*]’: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:445:7: required from ‘void lemon::Elevator::initAddItem(Item) [with GR = lemon::concepts::Graph; Item = lemon::concepts::Graph::Node]’ /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:435:7: required from ‘void lemon::Preflow::init() [with GR = lemon::concepts::Graph; CAP = lemon::concepts::ReadMap; TR = lemon::PreflowDefaultTraits >]’ /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:897:7: required from ‘void lemon::Preflow::runMinCut() [with GR = lemon::concepts::Graph; CAP = lemon::concepts::ReadMap; TR = lemon::PreflowDefaultTraits >]’ /<>/liblemon-1.3.1+dfsg/lemon/gomory_hu.h:163:9: required from ‘void lemon::GomoryHu::start() [with GR = lemon::concepts::Graph; CAP = lemon::concepts::ReadMap]’ /<>/liblemon-1.3.1+dfsg/lemon/gomory_hu.h:208:7: required from ‘void lemon::GomoryHu::run() [with GR = lemon::concepts::Graph; CAP = lemon::concepts::ReadMap]’ /<>/liblemon-1.3.1+dfsg/test/gomory_hu_test.cc:77:15: required from here /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:94:29: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 94 | _where[ti] = _where[*i=*j]; | ~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/gomory_hu_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:23, from /<>/liblemon-1.3.1+dfsg/lemon/gomory_hu.h:25, from /<>/liblemon-1.3.1+dfsg/test/gomory_hu_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:96:9: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 96 | *j=ti; | ~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/gomory_hu_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:23, from /<>/liblemon-1.3.1+dfsg/lemon/gomory_hu.h:25, from /<>/liblemon-1.3.1+dfsg/test/gomory_hu_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h: In instantiation of ‘void lemon::Elevator::copy(lemon::Elevator::Vit, lemon::Elevator::Vit) [with GR = lemon::concepts::Graph; Item = lemon::concepts::Graph::Node; lemon::Elevator::Vit = lemon::concepts::Graph::Node*]’: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:245:7: required from ‘void lemon::Elevator::liftHighestActive(int) [with GR = lemon::concepts::Graph; Item = lemon::concepts::Graph::Node]’ /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:644:15: required from ‘void lemon::Preflow::startFirstPhase() [with GR = lemon::concepts::Graph; CAP = lemon::concepts::ReadMap; TR = lemon::PreflowDefaultTraits >]’ /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:898:7: required from ‘void lemon::Preflow::runMinCut() [with GR = lemon::concepts::Graph; CAP = lemon::concepts::ReadMap; TR = lemon::PreflowDefaultTraits >]’ /<>/liblemon-1.3.1+dfsg/lemon/gomory_hu.h:163:9: required from ‘void lemon::GomoryHu::start() [with GR = lemon::concepts::Graph; CAP = lemon::concepts::ReadMap]’ /<>/liblemon-1.3.1+dfsg/lemon/gomory_hu.h:208:7: required from ‘void lemon::GomoryHu::run() [with GR = lemon::concepts::Graph; CAP = lemon::concepts::ReadMap]’ /<>/liblemon-1.3.1+dfsg/test/gomory_hu_test.cc:77:15: required from here /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:86:13: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 86 | *p=i; | ~~^~ In file included from /<>/liblemon-1.3.1+dfsg/test/gomory_hu_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:23, from /<>/liblemon-1.3.1+dfsg/lemon/gomory_hu.h:25, from /<>/liblemon-1.3.1+dfsg/test/gomory_hu_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h: In instantiation of ‘void lemon::Elevator::copy(Item, lemon::Elevator::Vit) [with GR = lemon::concepts::Graph; Item = lemon::concepts::Graph::Node; lemon::Elevator::Vit = lemon::concepts::Graph::Node*]’: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:251:7: required from ‘void lemon::Elevator::liftHighestActive(int) [with GR = lemon::concepts::Graph; Item = lemon::concepts::Graph::Node]’ /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:644:15: required from ‘void lemon::Preflow::startFirstPhase() [with GR = lemon::concepts::Graph; CAP = lemon::concepts::ReadMap; TR = lemon::PreflowDefaultTraits >]’ /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:898:7: required from ‘void lemon::Preflow::runMinCut() [with GR = lemon::concepts::Graph; CAP = lemon::concepts::ReadMap; TR = lemon::PreflowDefaultTraits >]’ /<>/liblemon-1.3.1+dfsg/lemon/gomory_hu.h:163:9: required from ‘void lemon::GomoryHu::start() [with GR = lemon::concepts::Graph; CAP = lemon::concepts::ReadMap]’ /<>/liblemon-1.3.1+dfsg/lemon/gomory_hu.h:208:7: required from ‘void lemon::GomoryHu::run() [with GR = lemon::concepts::Graph; CAP = lemon::concepts::ReadMap]’ /<>/liblemon-1.3.1+dfsg/test/gomory_hu_test.cc:77:15: required from here /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:79:16: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 79 | _where[*p=i] = p; | ~~^~ In file included from /<>/liblemon-1.3.1+dfsg/test/gomory_hu_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ [ 13%] Linking CXX executable gomory_hu_test cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/cmake -E cmake_link_script CMakeFiles/gomory_hu_test.dir/link.txt --verbose=1 /usr/bin/c++ -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -Wl,-Bsymbolic-functions -Wl,-z,relro -Wl,-z,now -rdynamic CMakeFiles/gomory_hu_test.dir/gomory_hu_test.cc.o -o gomory_hu_test -L/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 13%] Built target gomory_hu_test make -f test/CMakeFiles/fractional_matching_test.dir/build.make test/CMakeFiles/fractional_matching_test.dir/depend make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<>/liblemon-1.3.1+dfsg /<>/liblemon-1.3.1+dfsg/test /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test/CMakeFiles/fractional_matching_test.dir/DependInfo.cmake --color= Scanning dependencies of target fractional_matching_test make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' make -f test/CMakeFiles/fractional_matching_test.dir/build.make test/CMakeFiles/fractional_matching_test.dir/build make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 14%] Building CXX object test/CMakeFiles/fractional_matching_test.dir/fractional_matching_test.cc.o cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -I/<>/liblemon-1.3.1+dfsg -I/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -o CMakeFiles/fractional_matching_test.dir/fractional_matching_test.cc.o -c /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc: In function ‘void checkMaxFractionalMatchingCompile()’: /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:151:13: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Edge& lemon::concepts::Graph::Edge::operator=(const lemon::concepts::Graph::Edge&)’ is deprecated [-Wdeprecated-copy] 151 | e = mmap[n]; | ^ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:200:9: note: because ‘lemon::concepts::Graph::Edge’ has user-provided ‘lemon::concepts::Graph::Edge::Edge(const lemon::concepts::Graph::Edge&)’ 200 | Edge(const Edge&) { } | ^~~~ /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc: In function ‘void checkMaxWeightedFractionalMatchingCompile()’: /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:182:13: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Edge& lemon::concepts::Graph::Edge::operator=(const lemon::concepts::Graph::Edge&)’ is deprecated [-Wdeprecated-copy] 182 | e = mmap[n]; | ^ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:200:9: note: because ‘lemon::concepts::Graph::Edge’ has user-provided ‘lemon::concepts::Graph::Edge::Edge(const lemon::concepts::Graph::Edge&)’ 200 | Edge(const Edge&) { } | ^~~~ /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc: In function ‘void checkMaxWeightedPerfectFractionalMatchingCompile()’: /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:213:13: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Edge& lemon::concepts::Graph::Edge::operator=(const lemon::concepts::Graph::Edge&)’ is deprecated [-Wdeprecated-copy] 213 | e = mmap[n]; | ^ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:200:9: note: because ‘lemon::concepts::Graph::Edge’ has user-provided ‘lemon::concepts::Graph::Edge::Edge(const lemon::concepts::Graph::Edge&)’ 200 | Edge(const Edge&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h: In instantiation of ‘void lemon::MaxFractionalMatching::start(bool) [with GR = lemon::concepts::Graph; TR = lemon::MaxFractionalMatchingDefaultTraits]’: /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:137:18: required from here /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:427:17: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 427 | while ((n = _level->highestActive()) != INVALID) { | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h: In instantiation of ‘bool lemon::MaxFractionalMatching::startPerfect(bool) [with GR = lemon::concepts::Graph; TR = lemon::MaxFractionalMatchingDefaultTraits]’: /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:139:25: required from here /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:487:17: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 487 | while ((n = _level->highestActive()) != INVALID) { | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:32, from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h: In instantiation of ‘void lemon::LinkedElevator::initStart() [with GR = lemon::concepts::Graph; Item = lemon::concepts::Graph::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:389:7: required from ‘void lemon::MaxFractionalMatching::init() [with GR = lemon::concepts::Graph; TR = lemon::MaxFractionalMatchingDefaultTraits]’ /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:136:17: required from here /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:935:30: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 935 | _first[i] = _last[i] = INVALID; | ~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:32, from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:935:19: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 935 | _first[i] = _last[i] = INVALID; | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/bits/map_extender.h:27, from /<>/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:24, from /<>/liblemon-1.3.1+dfsg/lemon/smart_graph.h:30, from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/concepts/maps.h: In instantiation of ‘void lemon::concepts::ReferenceMap::set(const Key&, const Value&) [with K = lemon::concepts::Graph::Node; T = lemon::concepts::Graph::Arc; R = lemon::concepts::Graph::Arc&; CR = const lemon::concepts::Graph::Arc&; lemon::concepts::ReferenceMap::Key = lemon::concepts::Graph::Node; lemon::concepts::ReferenceMap::Value = lemon::concepts::Graph::Arc]’: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:392:9: required from ‘void lemon::MaxFractionalMatching::init() [with GR = lemon::concepts::Graph; TR = lemon::MaxFractionalMatchingDefaultTraits]’ /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:136:17: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/maps.h:186:60: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 186 | void set(const Key &k,const Value &t) { operator[](k)=t; } In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:32, from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h: In instantiation of ‘void lemon::LinkedElevator::initAddItem(Item) [with GR = lemon::concepts::Graph; Item = lemon::concepts::Graph::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:393:9: required from ‘void lemon::MaxFractionalMatching::init() [with GR = lemon::concepts::Graph; TR = lemon::MaxFractionalMatchingDefaultTraits]’ /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:136:17: required from here /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:949:29: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 949 | _first[_init_level] = i; | ~~~~~~~~~~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:32, from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:950:28: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 950 | _last[_init_level] = i; | ~~~~~~~~~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:32, from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:951:18: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 951 | _prev[i] = INVALID; | ~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:32, from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:952:18: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 952 | _next[i] = INVALID; | ~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:32, from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:954:18: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 954 | _prev[i] = _last[_init_level]; | ~~~~~~~~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:32, from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:955:18: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 955 | _next[i] = INVALID; | ~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:32, from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:956:35: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 956 | _next[_last[_init_level]] = i; | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:32, from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:957:28: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 957 | _last[_init_level] = i; | ~~~~~~~~~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:32, from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h: In instantiation of ‘void lemon::LinkedElevator::activate(Item) [with GR = lemon::concepts::Graph; Item = lemon::concepts::Graph::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:410:11: required from ‘void lemon::MaxFractionalMatching::init() [with GR = lemon::concepts::Graph; TR = lemon::MaxFractionalMatchingDefaultTraits]’ /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:136:17: required from here /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:563:23: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 563 | _next[_prev[i]] = _next[i]; | ~~~~~~~~~~~~~~~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:32, from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:565:25: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 565 | _prev[_next[i]] = _prev[i]; | ~~~~~~~~~~~~~~~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:32, from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:567:22: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 567 | _last[level] = _prev[i]; | ~~~~~~~~~~~~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:32, from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:570:16: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 570 | _next[i] = _first[level]; | ~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:32, from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:571:28: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 571 | _prev[_first[level]] = i; | ~~~~~~~~~~~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:32, from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:572:16: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 572 | _prev[i] = INVALID; | ~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:32, from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:573:21: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 573 | _first[level] = i; | ~~~~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:32, from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h: In instantiation of ‘void lemon::LinkedElevator::deactivate(Item) [with GR = lemon::concepts::Graph; Item = lemon::concepts::Graph::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:441:13: required from ‘void lemon::MaxFractionalMatching::start(bool) [with GR = lemon::concepts::Graph; TR = lemon::MaxFractionalMatchingDefaultTraits]’ /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:137:18: required from here /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:589:23: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 589 | _prev[_next[i]] = _prev[i]; | ~~~~~~~~~~~~~~~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:32, from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:591:25: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 591 | _next[_prev[i]] = _next[i]; | ~~~~~~~~~~~~~~~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:32, from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:593:27: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 593 | _first[_level[i]] = _next[i]; | ~~~~~~~~~~~~~~~~~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:32, from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:596:16: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 596 | _prev[i] = _last[level]; | ~~~~~~~~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:32, from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:597:27: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 597 | _next[_last[level]] = i; | ~~~~~~~~~~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:32, from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:598:16: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 598 | _next[i] = INVALID; | ~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:32, from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:599:20: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 599 | _last[level] = i; | ~~~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:32, from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h: In instantiation of ‘void lemon::LinkedElevator::liftHighestActive(int) [with GR = lemon::concepts::Graph; Item = lemon::concepts::Graph::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:449:11: required from ‘void lemon::MaxFractionalMatching::start(bool) [with GR = lemon::concepts::Graph; TR = lemon::MaxFractionalMatchingDefaultTraits]’ /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:137:18: required from here /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:717:25: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 717 | _prev[_next[i]] = INVALID; | ~~~~~~~~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:32, from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:718:33: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 718 | _first[_highest_active] = _next[i]; | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:32, from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:720:33: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 720 | _first[_highest_active] = INVALID; | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:32, from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:721:32: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 721 | _last[_highest_active] = INVALID; | ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:32, from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:725:58: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 725 | _first[_highest_active] = _last[_highest_active] = i; | ~~~~~~~~~~~~~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:32, from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:725:33: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 725 | _first[_highest_active] = _last[_highest_active] = i; | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:32, from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:726:18: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 726 | _prev[i] = INVALID; | ~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:32, from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:727:18: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 727 | _next[i] = INVALID; | ~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:32, from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:729:40: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 729 | _prev[_first[_highest_active]] = i; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:32, from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:730:18: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 730 | _next[i] = _first[_highest_active]; | ~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:32, from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:731:33: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 731 | _first[_highest_active] = i; | ~~~~~~~~~~~~~~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:32, from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h: In instantiation of ‘void lemon::LinkedElevator::liftHighestActiveToTop() [with GR = lemon::concepts::Graph; Item = lemon::concepts::Graph::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:451:11: required from ‘void lemon::MaxFractionalMatching::start(bool) [with GR = lemon::concepts::Graph; TR = lemon::MaxFractionalMatchingDefaultTraits]’ /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:137:18: required from here /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:743:25: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 743 | _prev[_next[i]] = INVALID; | ~~~~~~~~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:32, from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:744:33: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 744 | _first[_highest_active] = _next[i]; | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:32, from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:746:33: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 746 | _first[_highest_active] = INVALID; | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:32, from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:747:32: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 747 | _last[_highest_active] = INVALID; | ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:32, from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h: In instantiation of ‘void lemon::LinkedElevator::liftToTop(int) [with GR = lemon::concepts::Graph; Item = lemon::concepts::Graph::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:454:11: required from ‘void lemon::MaxFractionalMatching::start(bool) [with GR = lemon::concepts::Graph; TR = lemon::MaxFractionalMatchingDefaultTraits]’ /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:137:18: required from here /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:903:13: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 903 | n = _next[n]; | ~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:32, from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:905:19: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 905 | _first[i] = INVALID; | ~~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:32, from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:906:18: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 906 | _last[i] = INVALID; | ~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h: In instantiation of ‘void lemon::MaxFractionalMatching::postprocessing() [with GR = lemon::concepts::Graph; TR = lemon::MaxFractionalMatchingDefaultTraits]’: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:468:9: required from ‘void lemon::MaxFractionalMatching::start(bool) [with GR = lemon::concepts::Graph; TR = lemon::MaxFractionalMatchingDefaultTraits]’ /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:137:18: required from here /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:196:13: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 196 | u = _graph.target((*_matching)[v]); In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:210:13: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 210 | u = _graph.target((*_matching)[u]); In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:216:13: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 216 | u = _graph.target((*_matching)[v]); In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:219:18: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 219 | prev = _graph.oppositeArc((*_matching)[u]); In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:220:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 220 | v = _graph.target((*_matching)[u]); In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:221:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 221 | u = _graph.target((*_matching)[v]); In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:28, from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/unionfind.h: In instantiation of ‘int lemon::ExtendFindEnum::insert(const Item&) [with IM = lemon::concepts::Graph::NodeMap; lemon::ExtendFindEnum::Item = lemon::concepts::Graph::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1185:9: required from ‘void lemon::MaxWeightedFractionalMatching::init() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:172:17: required from here /<>/liblemon-1.3.1+dfsg/lemon/unionfind.h:708:23: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 708 | items[idx].item = item; | ~~~~~~~~~~~~~~~~^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h: In instantiation of ‘void lemon::MaxWeightedFractionalMatching::extractCycle(const Arc&) [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap; lemon::MaxWeightedFractionalMatching::Arc = lemon::concepts::Graph::Arc]’: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1245:17: required from ‘void lemon::MaxWeightedFractionalMatching::start() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:173:18: required from here /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1114:14: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 1114 | prev = (*_matching)[odd]; | ~~~~~^~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1115:13: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1115 | odd = _graph.target((*_matching)[even]); In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h: In instantiation of ‘void lemon::MaxWeightedFractionalMatching::cycleOnEdge(const Edge&, int) [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap; lemon::MaxWeightedFractionalMatching::Edge = lemon::concepts::Graph::Edge]’: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1263:15: required from ‘void lemon::MaxWeightedFractionalMatching::start() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:173:18: required from here /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1031:17: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1031 | nca = right; | ~~~~^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1037:16: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1037 | left = _graph.target((*_matching)[left]); In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1039:16: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1039 | left = _graph.target((*_pred)[left]); In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1045:17: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1045 | nca = left; | ~~~~^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1051:17: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1051 | right = _graph.target((*_matching)[right]); In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1053:17: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1053 | right = _graph.target((*_pred)[right]); In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1062:17: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1062 | nca = right; | ~~~~^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1064:19: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1064 | nca = _graph.target((*_matching)[nca]); In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1066:19: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1066 | nca = _graph.target((*_pred)[nca]); In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1070:17: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1070 | nca = left; | ~~~~^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1072:19: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1072 | nca = _graph.target((*_matching)[nca]); In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1074:19: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1074 | nca = _graph.target((*_pred)[nca]); In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1084:12: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 1084 | prev = _graph.direct(edge, true); In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1090:14: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 1090 | prev = _graph.oppositeArc((*_pred)[left_path[i + 1]]); In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h: In instantiation of ‘void lemon::MaxWeightedPerfectFractionalMatching::extractCycle(const Arc&) [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap; lemon::MaxWeightedPerfectFractionalMatching::Arc = lemon::concepts::Graph::Arc]’: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1980:17: required from ‘bool lemon::MaxWeightedPerfectFractionalMatching::start() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:205:18: required from here /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1859:14: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 1859 | prev = (*_matching)[odd]; | ~~~~~^~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1860:13: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1860 | odd = _graph.target((*_matching)[even]); In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h: In instantiation of ‘void lemon::MaxWeightedPerfectFractionalMatching::cycleOnEdge(const Edge&, int) [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap; lemon::MaxWeightedPerfectFractionalMatching::Edge = lemon::concepts::Graph::Edge]’: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1998:15: required from ‘bool lemon::MaxWeightedPerfectFractionalMatching::start() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:205:18: required from here /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1776:17: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1776 | nca = right; | ~~~~^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1782:16: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1782 | left = _graph.target((*_matching)[left]); In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1784:16: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1784 | left = _graph.target((*_pred)[left]); In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1790:17: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1790 | nca = left; | ~~~~^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1796:17: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1796 | right = _graph.target((*_matching)[right]); In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1798:17: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1798 | right = _graph.target((*_pred)[right]); In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1807:17: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1807 | nca = right; | ~~~~^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1809:19: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1809 | nca = _graph.target((*_matching)[nca]); In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1811:19: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1811 | nca = _graph.target((*_pred)[nca]); In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1815:17: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1815 | nca = left; | ~~~~^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1817:19: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1817 | nca = _graph.target((*_matching)[nca]); In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1819:19: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1819 | nca = _graph.target((*_pred)[nca]); In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1829:12: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 1829 | prev = _graph.direct(edge, true); In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1835:14: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 1835 | prev = _graph.oppositeArc((*_pred)[left_path[i + 1]]); In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h: In instantiation of ‘void lemon::MaxWeightedFractionalMatching::alternatePath(lemon::MaxWeightedFractionalMatching::Node, int) [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap; lemon::MaxWeightedFractionalMatching::Node = lemon::concepts::Graph::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:961:7: required from ‘void lemon::MaxWeightedFractionalMatching::unmatchNode(const Node&) [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap; lemon::MaxWeightedFractionalMatching::Node = lemon::concepts::Graph::Node]’ /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1230:13: required from ‘void lemon::MaxWeightedFractionalMatching::start() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:173:18: required from here /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:931:13: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 931 | odd = _graph.target(prev); In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:932:14: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 932 | even = _graph.target((*_pred)[odd]); In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:937:14: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 937 | prev = (*_matching)[even]; | ~~~~~^~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:28, from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/unionfind.h: In instantiation of ‘void lemon::ExtendFindEnum::insert(const Item&, int) [with IM = lemon::concepts::Graph::NodeMap; lemon::ExtendFindEnum::Item = lemon::concepts::Graph::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1003:7: required from ‘void lemon::MaxWeightedFractionalMatching::extendOnArc(const Arc&) [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap; lemon::MaxWeightedFractionalMatching::Arc = lemon::concepts::Graph::Arc]’ /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1248:17: required from ‘void lemon::MaxWeightedFractionalMatching::start() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:173:18: required from here /<>/liblemon-1.3.1+dfsg/lemon/unionfind.h:726:23: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 726 | items[idx].item = item; | ~~~~~~~~~~~~~~~~^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h: In instantiation of ‘void lemon::MaxWeightedFractionalMatching::evenToMatched(lemon::MaxWeightedFractionalMatching::Node, int) [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap; lemon::MaxWeightedFractionalMatching::Node = lemon::concepts::Graph::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1088:9: required from ‘void lemon::MaxWeightedFractionalMatching::cycleOnEdge(const Edge&, int) [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap; lemon::MaxWeightedFractionalMatching::Edge = lemon::concepts::Graph::Edge]’ /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1263:15: required from ‘void lemon::MaxWeightedFractionalMatching::start() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:173:18: required from here /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:864:17: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 864 | min = _graph.oppositeArc(a); In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:879:22: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 879 | mina = aa; | ~~~~~^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h: In instantiation of ‘void lemon::MaxWeightedFractionalMatching::oddToMatched(lemon::MaxWeightedFractionalMatching::Node) [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap; lemon::MaxWeightedFractionalMatching::Node = lemon::concepts::Graph::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1092:9: required from ‘void lemon::MaxWeightedFractionalMatching::cycleOnEdge(const Edge&, int) [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap; lemon::MaxWeightedFractionalMatching::Edge = lemon::concepts::Graph::Edge]’ /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1263:15: required from ‘void lemon::MaxWeightedFractionalMatching::start() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:173:18: required from here /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:911:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 911 | min = _graph.oppositeArc(a); In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h: In instantiation of ‘void lemon::MaxWeightedPerfectFractionalMatching::alternatePath(lemon::MaxWeightedPerfectFractionalMatching::Node, int) [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap; lemon::MaxWeightedPerfectFractionalMatching::Node = lemon::concepts::Graph::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1738:7: required from ‘void lemon::MaxWeightedPerfectFractionalMatching::augmentOnArc(const Arc&) [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap; lemon::MaxWeightedPerfectFractionalMatching::Arc = lemon::concepts::Graph::Arc]’ /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1974:15: required from ‘bool lemon::MaxWeightedPerfectFractionalMatching::start() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:205:18: required from here /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1687:13: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1687 | odd = _graph.target(prev); In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1688:14: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1688 | even = _graph.target((*_pred)[odd]); In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1693:14: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 1693 | prev = (*_matching)[even]; | ~~~~~^~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h: In instantiation of ‘void lemon::MaxWeightedPerfectFractionalMatching::evenToMatched(lemon::MaxWeightedPerfectFractionalMatching::Node, int) [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap; lemon::MaxWeightedPerfectFractionalMatching::Node = lemon::concepts::Graph::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1833:9: required from ‘void lemon::MaxWeightedPerfectFractionalMatching::cycleOnEdge(const Edge&, int) [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap; lemon::MaxWeightedPerfectFractionalMatching::Edge = lemon::concepts::Graph::Edge]’ /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1998:15: required from ‘bool lemon::MaxWeightedPerfectFractionalMatching::start() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:205:18: required from here /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1620:17: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 1620 | min = _graph.oppositeArc(a); In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1635:22: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 1635 | mina = aa; | ~~~~~^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h: In instantiation of ‘void lemon::MaxWeightedPerfectFractionalMatching::oddToMatched(lemon::MaxWeightedPerfectFractionalMatching::Node) [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap; lemon::MaxWeightedPerfectFractionalMatching::Node = lemon::concepts::Graph::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1837:9: required from ‘void lemon::MaxWeightedPerfectFractionalMatching::cycleOnEdge(const Edge&, int) [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap; lemon::MaxWeightedPerfectFractionalMatching::Edge = lemon::concepts::Graph::Edge]’ /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1998:15: required from ‘bool lemon::MaxWeightedPerfectFractionalMatching::start() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:205:18: required from here /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1667:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 1667 | min = _graph.oppositeArc(a); In file included from /<>/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ [ 15%] Linking CXX executable fractional_matching_test cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/cmake -E cmake_link_script CMakeFiles/fractional_matching_test.dir/link.txt --verbose=1 /usr/bin/c++ -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -Wl,-Bsymbolic-functions -Wl,-z,relro -Wl,-z,now -rdynamic CMakeFiles/fractional_matching_test.dir/fractional_matching_test.cc.o -o fractional_matching_test -L/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 15%] Built target fractional_matching_test make -f test/CMakeFiles/circulation_test.dir/build.make test/CMakeFiles/circulation_test.dir/depend make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<>/liblemon-1.3.1+dfsg /<>/liblemon-1.3.1+dfsg/test /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test/CMakeFiles/circulation_test.dir/DependInfo.cmake --color= Scanning dependencies of target circulation_test make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' make -f test/CMakeFiles/circulation_test.dir/build.make test/CMakeFiles/circulation_test.dir/build make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 16%] Building CXX object test/CMakeFiles/circulation_test.dir/circulation_test.cc.o cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -I/<>/liblemon-1.3.1+dfsg -I/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -o CMakeFiles/circulation_test.dir/circulation_test.cc.o -c /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc In file included from /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/circulation.h: In instantiation of ‘bool lemon::Circulation::start() [with GR = lemon::concepts::Digraph; LM = lemon::concepts::ReadMap; UM = lemon::concepts::ReadMap; SM = lemon::concepts::ReadMap; TR = lemon::Circulation, lemon::concepts::ReadMap, lemon::concepts::ReadMap, lemon::Circulation, lemon::concepts::ReadMap, lemon::concepts::ReadMap, lemon::Circulation, lemon::concepts::ReadMap, lemon::concepts::ReadMap >::SetFlowMapTraits > >::SetElevatorTraits > >::SetStandardElevatorTraits >]’: /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc:99:19: required from here /<>/liblemon-1.3.1+dfsg/lemon/circulation.h:576:17: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 576 | while((act=_level->highestActive())!=INVALID) { | ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/circulation.h:23, from /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h: In instantiation of ‘void lemon::LinkedElevator::initStart() [with GR = lemon::concepts::Digraph; Item = lemon::concepts::Digraph::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/circulation.h:514:7: required from ‘void lemon::Circulation::init() [with GR = lemon::concepts::Digraph; LM = lemon::concepts::ReadMap; UM = lemon::concepts::ReadMap; SM = lemon::concepts::ReadMap; TR = lemon::Circulation, lemon::concepts::ReadMap, lemon::concepts::ReadMap, lemon::Circulation, lemon::concepts::ReadMap, lemon::concepts::ReadMap, lemon::Circulation, lemon::concepts::ReadMap, lemon::concepts::ReadMap >::SetFlowMapTraits > >::SetElevatorTraits > >::SetStandardElevatorTraits >]’ /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc:97:18: required from here /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:935:30: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 935 | _first[i] = _last[i] = INVALID; | ~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/circulation.h:23, from /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:935:19: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 935 | _first[i] = _last[i] = INVALID; | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/circulation.h:23, from /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h: In instantiation of ‘void lemon::LinkedElevator::initAddItem(Item) [with GR = lemon::concepts::Digraph; Item = lemon::concepts::Digraph::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/circulation.h:516:9: required from ‘void lemon::Circulation::init() [with GR = lemon::concepts::Digraph; LM = lemon::concepts::ReadMap; UM = lemon::concepts::ReadMap; SM = lemon::concepts::ReadMap; TR = lemon::Circulation, lemon::concepts::ReadMap, lemon::concepts::ReadMap, lemon::Circulation, lemon::concepts::ReadMap, lemon::concepts::ReadMap, lemon::Circulation, lemon::concepts::ReadMap, lemon::concepts::ReadMap >::SetFlowMapTraits > >::SetElevatorTraits > >::SetStandardElevatorTraits >]’ /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc:97:18: required from here /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:949:29: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 949 | _first[_init_level] = i; | ~~~~~~~~~~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/circulation.h:23, from /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:950:28: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 950 | _last[_init_level] = i; | ~~~~~~~~~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/circulation.h:23, from /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:951:18: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 951 | _prev[i] = INVALID; | ~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/circulation.h:23, from /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:952:18: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 952 | _next[i] = INVALID; | ~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/circulation.h:23, from /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:954:18: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 954 | _prev[i] = _last[_init_level]; | ~~~~~~~~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/circulation.h:23, from /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:955:18: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 955 | _next[i] = INVALID; | ~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/circulation.h:23, from /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:956:35: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 956 | _next[_last[_init_level]] = i; | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/circulation.h:23, from /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:957:28: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 957 | _last[_init_level] = i; | ~~~~~~~~~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/circulation.h:23, from /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h: In instantiation of ‘void lemon::LinkedElevator::activate(Item) [with GR = lemon::concepts::Digraph; Item = lemon::concepts::Digraph::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/circulation.h:520:11: required from ‘void lemon::Circulation::init() [with GR = lemon::concepts::Digraph; LM = lemon::concepts::ReadMap; UM = lemon::concepts::ReadMap; SM = lemon::concepts::ReadMap; TR = lemon::Circulation, lemon::concepts::ReadMap, lemon::concepts::ReadMap, lemon::Circulation, lemon::concepts::ReadMap, lemon::concepts::ReadMap, lemon::Circulation, lemon::concepts::ReadMap, lemon::concepts::ReadMap >::SetFlowMapTraits > >::SetElevatorTraits > >::SetStandardElevatorTraits >]’ /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc:97:18: required from here /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:563:23: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 563 | _next[_prev[i]] = _next[i]; | ~~~~~~~~~~~~~~~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/circulation.h:23, from /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:565:25: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 565 | _prev[_next[i]] = _prev[i]; | ~~~~~~~~~~~~~~~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/circulation.h:23, from /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:567:22: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 567 | _last[level] = _prev[i]; | ~~~~~~~~~~~~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/circulation.h:23, from /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:570:16: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 570 | _next[i] = _first[level]; | ~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/circulation.h:23, from /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:571:28: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 571 | _prev[_first[level]] = i; | ~~~~~~~~~~~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/circulation.h:23, from /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:572:16: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 572 | _prev[i] = INVALID; | ~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/circulation.h:23, from /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:573:21: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 573 | _first[level] = i; | ~~~~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/circulation.h:23, from /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h: In instantiation of ‘void lemon::LinkedElevator::deactivate(Item) [with GR = lemon::concepts::Digraph; Item = lemon::concepts::Digraph::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/circulation.h:592:15: required from ‘bool lemon::Circulation::start() [with GR = lemon::concepts::Digraph; LM = lemon::concepts::ReadMap; UM = lemon::concepts::ReadMap; SM = lemon::concepts::ReadMap; TR = lemon::Circulation, lemon::concepts::ReadMap, lemon::concepts::ReadMap, lemon::Circulation, lemon::concepts::ReadMap, lemon::concepts::ReadMap, lemon::Circulation, lemon::concepts::ReadMap, lemon::concepts::ReadMap >::SetFlowMapTraits > >::SetElevatorTraits > >::SetStandardElevatorTraits >]’ /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc:99:19: required from here /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:589:23: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 589 | _prev[_next[i]] = _prev[i]; | ~~~~~~~~~~~~~~~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/circulation.h:23, from /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:591:25: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 591 | _next[_prev[i]] = _next[i]; | ~~~~~~~~~~~~~~~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/circulation.h:23, from /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:593:27: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 593 | _first[_level[i]] = _next[i]; | ~~~~~~~~~~~~~~~~~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/circulation.h:23, from /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:596:16: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 596 | _prev[i] = _last[level]; | ~~~~~~~~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/circulation.h:23, from /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:597:27: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 597 | _next[_last[level]] = i; | ~~~~~~~~~~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/circulation.h:23, from /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:598:16: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 598 | _next[i] = INVALID; | ~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/circulation.h:23, from /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:599:20: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 599 | _last[level] = i; | ~~~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/circulation.h:23, from /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h: In instantiation of ‘void lemon::LinkedElevator::liftHighestActiveToTop() [with GR = lemon::concepts::Digraph; Item = lemon::concepts::Digraph::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/circulation.h:633:11: required from ‘bool lemon::Circulation::start() [with GR = lemon::concepts::Digraph; LM = lemon::concepts::ReadMap; UM = lemon::concepts::ReadMap; SM = lemon::concepts::ReadMap; TR = lemon::Circulation, lemon::concepts::ReadMap, lemon::concepts::ReadMap, lemon::Circulation, lemon::concepts::ReadMap, lemon::concepts::ReadMap, lemon::Circulation, lemon::concepts::ReadMap, lemon::concepts::ReadMap >::SetFlowMapTraits > >::SetElevatorTraits > >::SetStandardElevatorTraits >]’ /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc:99:19: required from here /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:743:25: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 743 | _prev[_next[i]] = INVALID; | ~~~~~~~~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/circulation.h:23, from /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:744:33: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 744 | _first[_highest_active] = _next[i]; | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/circulation.h:23, from /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:746:33: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 746 | _first[_highest_active] = INVALID; | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/circulation.h:23, from /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:747:32: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 747 | _last[_highest_active] = INVALID; | ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/circulation.h:23, from /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h: In instantiation of ‘void lemon::LinkedElevator::liftHighestActive(int) [with GR = lemon::concepts::Digraph; Item = lemon::concepts::Digraph::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/circulation.h:638:11: required from ‘bool lemon::Circulation::start() [with GR = lemon::concepts::Digraph; LM = lemon::concepts::ReadMap; UM = lemon::concepts::ReadMap; SM = lemon::concepts::ReadMap; TR = lemon::Circulation, lemon::concepts::ReadMap, lemon::concepts::ReadMap, lemon::Circulation, lemon::concepts::ReadMap, lemon::concepts::ReadMap, lemon::Circulation, lemon::concepts::ReadMap, lemon::concepts::ReadMap >::SetFlowMapTraits > >::SetElevatorTraits > >::SetStandardElevatorTraits >]’ /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc:99:19: required from here /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:717:25: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 717 | _prev[_next[i]] = INVALID; | ~~~~~~~~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/circulation.h:23, from /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:718:33: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 718 | _first[_highest_active] = _next[i]; | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/circulation.h:23, from /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:720:33: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 720 | _first[_highest_active] = INVALID; | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/circulation.h:23, from /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:721:32: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 721 | _last[_highest_active] = INVALID; | ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/circulation.h:23, from /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:725:58: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 725 | _first[_highest_active] = _last[_highest_active] = i; | ~~~~~~~~~~~~~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/circulation.h:23, from /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:725:33: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 725 | _first[_highest_active] = _last[_highest_active] = i; | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/circulation.h:23, from /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:726:18: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 726 | _prev[i] = INVALID; | ~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/circulation.h:23, from /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:727:18: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 727 | _next[i] = INVALID; | ~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/circulation.h:23, from /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:729:40: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 729 | _prev[_first[_highest_active]] = i; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/circulation.h:23, from /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:730:18: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 730 | _next[i] = _first[_highest_active]; | ~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/circulation.h:23, from /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:731:33: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 731 | _first[_highest_active] = i; | ~~~~~~~~~~~~~~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/circulation.h:23, from /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h: In instantiation of ‘int lemon::LinkedElevator::onLevel(int) const [with GR = lemon::concepts::Digraph; Item = lemon::concepts::Digraph::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/circulation.h:639:39: required from ‘bool lemon::Circulation::start() [with GR = lemon::concepts::Digraph; LM = lemon::concepts::ReadMap; UM = lemon::concepts::ReadMap; SM = lemon::concepts::ReadMap; TR = lemon::Circulation, lemon::concepts::ReadMap, lemon::concepts::ReadMap, lemon::Circulation, lemon::concepts::ReadMap, lemon::concepts::ReadMap, lemon::Circulation, lemon::concepts::ReadMap, lemon::concepts::ReadMap >::SetFlowMapTraits > >::SetElevatorTraits > >::SetStandardElevatorTraits >]’ /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc:99:19: required from here /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:620:11: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 620 | n = _next[n]; | ~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/circulation_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ [ 16%] Linking CXX executable circulation_test cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/cmake -E cmake_link_script CMakeFiles/circulation_test.dir/link.txt --verbose=1 /usr/bin/c++ -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -Wl,-Bsymbolic-functions -Wl,-z,relro -Wl,-z,now -rdynamic CMakeFiles/circulation_test.dir/circulation_test.cc.o -o circulation_test -L/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 16%] Built target circulation_test make -f test/CMakeFiles/heap_test.dir/build.make test/CMakeFiles/heap_test.dir/depend make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<>/liblemon-1.3.1+dfsg /<>/liblemon-1.3.1+dfsg/test /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test/CMakeFiles/heap_test.dir/DependInfo.cmake --color= Scanning dependencies of target heap_test make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' make -f test/CMakeFiles/heap_test.dir/build.make test/CMakeFiles/heap_test.dir/build make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 18%] Building CXX object test/CMakeFiles/heap_test.dir/heap_test.cc.o cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -I/<>/liblemon-1.3.1+dfsg -I/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -o CMakeFiles/heap_test.dir/heap_test.cc.o -c /<>/liblemon-1.3.1+dfsg/test/heap_test.cc [ 19%] Linking CXX executable heap_test cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/cmake -E cmake_link_script CMakeFiles/heap_test.dir/link.txt --verbose=1 /usr/bin/c++ -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -Wl,-Bsymbolic-functions -Wl,-z,relro -Wl,-z,now -rdynamic CMakeFiles/heap_test.dir/heap_test.cc.o -o heap_test -L/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 19%] Built target heap_test make -f test/CMakeFiles/dijkstra_test.dir/build.make test/CMakeFiles/dijkstra_test.dir/depend make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<>/liblemon-1.3.1+dfsg /<>/liblemon-1.3.1+dfsg/test /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test/CMakeFiles/dijkstra_test.dir/DependInfo.cmake --color= Scanning dependencies of target dijkstra_test make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' make -f test/CMakeFiles/dijkstra_test.dir/build.make test/CMakeFiles/dijkstra_test.dir/build make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 20%] Building CXX object test/CMakeFiles/dijkstra_test.dir/dijkstra_test.cc.o cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -I/<>/liblemon-1.3.1+dfsg -I/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -o CMakeFiles/dijkstra_test.dir/dijkstra_test.cc.o -c /<>/liblemon-1.3.1+dfsg/test/dijkstra_test.cc /<>/liblemon-1.3.1+dfsg/test/dijkstra_test.cc: In function ‘void checkDijkstraCompile()’: /<>/liblemon-1.3.1+dfsg/test/dijkstra_test.cc:86:39: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 86 | n = dijkstra_test.processNextNode(); | ^ In file included from /<>/liblemon-1.3.1+dfsg/test/dijkstra_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ /<>/liblemon-1.3.1+dfsg/test/dijkstra_test.cc:87:38: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 87 | n = const_dijkstra_test.nextNode(); | ^ In file included from /<>/liblemon-1.3.1+dfsg/test/dijkstra_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ /<>/liblemon-1.3.1+dfsg/test/dijkstra_test.cc:96:39: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 96 | e = const_dijkstra_test.predArc(t); | ^ In file included from /<>/liblemon-1.3.1+dfsg/test/dijkstra_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ /<>/liblemon-1.3.1+dfsg/test/dijkstra_test.cc:97:40: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 97 | s = const_dijkstra_test.predNode(t); | ^ In file included from /<>/liblemon-1.3.1+dfsg/test/dijkstra_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ /<>/liblemon-1.3.1+dfsg/test/dijkstra_test.cc:100:38: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::NodeMap& lemon::concepts::Digraph::NodeMap::operator=(const lemon::concepts::Digraph::NodeMap&)’ is deprecated [-Wdeprecated-copy] 100 | d = const_dijkstra_test.distMap(); | ^ In file included from /<>/liblemon-1.3.1+dfsg/test/dijkstra_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:439:9: note: because ‘lemon::concepts::Digraph::NodeMap’ has user-provided ‘lemon::concepts::Digraph::NodeMap::NodeMap(const lemon::concepts::Digraph::NodeMap&) [with T = int]’ 439 | NodeMap(const NodeMap& nm) : | ^~~~~~~ /<>/liblemon-1.3.1+dfsg/test/dijkstra_test.cc:101:38: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::NodeMap& lemon::concepts::Digraph::NodeMap::operator=(const lemon::concepts::Digraph::NodeMap&)’ is deprecated [-Wdeprecated-copy] 101 | p = const_dijkstra_test.predMap(); | ^ In file included from /<>/liblemon-1.3.1+dfsg/test/dijkstra_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:439:9: note: because ‘lemon::concepts::Digraph::NodeMap’ has user-provided ‘lemon::concepts::Digraph::NodeMap::NodeMap(const lemon::concepts::Digraph::NodeMap&) [with T = lemon::concepts::Digraph::Arc]’ 439 | NodeMap(const NodeMap& nm) : | ^~~~~~~ /<>/liblemon-1.3.1+dfsg/test/dijkstra_test.cc:137:39: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 137 | n = dijkstra_test.processNextNode(); | ^ In file included from /<>/liblemon-1.3.1+dfsg/test/dijkstra_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ /<>/liblemon-1.3.1+dfsg/test/dijkstra_test.cc:138:32: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 138 | n = dijkstra_test.nextNode(); | ^ In file included from /<>/liblemon-1.3.1+dfsg/test/dijkstra_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ /<>/liblemon-1.3.1+dfsg/test/dijkstra_test.cc:147:33: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 147 | e = dijkstra_test.predArc(t); | ^ In file included from /<>/liblemon-1.3.1+dfsg/test/dijkstra_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ /<>/liblemon-1.3.1+dfsg/test/dijkstra_test.cc:148:34: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 148 | s = dijkstra_test.predNode(t); | ^ In file included from /<>/liblemon-1.3.1+dfsg/test/dijkstra_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:27, from /<>/liblemon-1.3.1+dfsg/test/dijkstra_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/maps.h: In instantiation of ‘void lemon::concepts::ReferenceMap::set(const Key&, const Value&) [with K = lemon::concepts::Digraph::Node; T = lemon::concepts::Digraph::Arc; R = lemon::concepts::Digraph::Arc&; CR = const lemon::concepts::Digraph::Arc&; lemon::concepts::ReferenceMap::Key = lemon::concepts::Digraph::Node; lemon::concepts::ReferenceMap::Value = lemon::concepts::Digraph::Arc]’: /<>/liblemon-1.3.1+dfsg/lemon/dijkstra.h:612:9: required from ‘void lemon::Dijkstra::init() [with GR = lemon::concepts::Digraph; LEN = lemon::concepts::ReadMap; TR = lemon::DijkstraDefaultTraits >]’ /<>/liblemon-1.3.1+dfsg/test/dijkstra_test.cc:83:24: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/maps.h:186:60: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 186 | void set(const Key &k,const Value &t) { operator[](k)=t; } In file included from /<>/liblemon-1.3.1+dfsg/test/dijkstra_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/dijkstra.h:29, from /<>/liblemon-1.3.1+dfsg/test/dijkstra_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/bits/path_dump.h: In instantiation of ‘int lemon::PredMapPath<_Digraph, _PredMap>::length() const [with _Digraph = lemon::concepts::Digraph; _PredMap = lemon::concepts::Digraph::NodeMap]’: /<>/liblemon-1.3.1+dfsg/lemon/path.h:228:11: required from ‘void lemon::Path::buildRev(const CPath&) [with CPath = lemon::PredMapPath >; GR = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:1017:9: required from ‘static void lemon::_path_bits::PathCopySelectorBackward::copy(const From&, To&) [with From = lemon::PredMapPath >; To = lemon::Path]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:1033:49: required from ‘static void lemon::_path_bits::PathCopySelector::copy(const From&, To&) [with From = lemon::PredMapPath >; To = lemon::Path]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:1046:49: required from ‘void lemon::pathCopy(const From&, To&) [with From = lemon::PredMapPath >; To = lemon::Path]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:94:15: required from ‘lemon::Path& lemon::Path::operator=(const CPath&) [with CPath = lemon::PredMapPath >; GR = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/test/dijkstra_test.cc:102:36: required from here /<>/liblemon-1.3.1+dfsg/lemon/bits/path_dump.h:44:19: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 44 | while ((arc = predMap[node]) != INVALID) { | ~~~~~^~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/dijkstra_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/dijkstra.h:29, from /<>/liblemon-1.3.1+dfsg/test/dijkstra_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/bits/path_dump.h:45:14: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 45 | node = digraph.source(arc); In file included from /<>/liblemon-1.3.1+dfsg/test/dijkstra_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/dijkstra.h:29, from /<>/liblemon-1.3.1+dfsg/test/dijkstra_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/bits/path_dump.h: In instantiation of ‘lemon::PredMapPath<_Digraph, _PredMap>::RevArcIt::RevArcIt(const lemon::PredMapPath<_Digraph, _PredMap>&) [with _Digraph = lemon::concepts::Digraph; _PredMap = lemon::concepts::Digraph::NodeMap]’: /<>/liblemon-1.3.1+dfsg/lemon/path.h:230:37: required from ‘void lemon::Path::buildRev(const CPath&) [with CPath = lemon::PredMapPath >; GR = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:1017:9: required from ‘static void lemon::_path_bits::PathCopySelectorBackward::copy(const From&, To&) [with From = lemon::PredMapPath >; To = lemon::Path]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:1033:49: required from ‘static void lemon::_path_bits::PathCopySelector::copy(const From&, To&) [with From = lemon::PredMapPath >; To = lemon::Path]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:1046:49: required from ‘void lemon::pathCopy(const From&, To&) [with From = lemon::PredMapPath >; To = lemon::Path]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:94:15: required from ‘lemon::Path& lemon::Path::operator=(const CPath&) [with CPath = lemon::PredMapPath >; GR = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/test/dijkstra_test.cc:102:36: required from here /<>/liblemon-1.3.1+dfsg/lemon/bits/path_dump.h:61:56: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 61 | if (path->predMap[current] == INVALID) current = INVALID; | ~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/dijkstra_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/dijkstra.h:29, from /<>/liblemon-1.3.1+dfsg/test/dijkstra_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/bits/path_dump.h: In instantiation of ‘lemon::PredMapPath<_Digraph, _PredMap>::RevArcIt& lemon::PredMapPath<_Digraph, _PredMap>::RevArcIt::operator++() [with _Digraph = lemon::concepts::Digraph; _PredMap = lemon::concepts::Digraph::NodeMap]’: /<>/liblemon-1.3.1+dfsg/lemon/path.h:230:62: required from ‘void lemon::Path::buildRev(const CPath&) [with CPath = lemon::PredMapPath >; GR = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:1017:9: required from ‘static void lemon::_path_bits::PathCopySelectorBackward::copy(const From&, To&) [with From = lemon::PredMapPath >; To = lemon::Path]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:1033:49: required from ‘static void lemon::_path_bits::PathCopySelector::copy(const From&, To&) [with From = lemon::PredMapPath >; To = lemon::Path]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:1046:49: required from ‘void lemon::pathCopy(const From&, To&) [with From = lemon::PredMapPath >; To = lemon::Path]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:94:15: required from ‘lemon::Path& lemon::Path::operator=(const CPath&) [with CPath = lemon::PredMapPath >; GR = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/test/dijkstra_test.cc:102:36: required from here /<>/liblemon-1.3.1+dfsg/lemon/bits/path_dump.h:69:17: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 69 | current = path->digraph.source(path->predMap[current]); In file included from /<>/liblemon-1.3.1+dfsg/test/dijkstra_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/dijkstra.h:29, from /<>/liblemon-1.3.1+dfsg/test/dijkstra_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/bits/path_dump.h:70:56: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 70 | if (path->predMap[current] == INVALID) current = INVALID; | ~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/dijkstra_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/dijkstra.h:29, from /<>/liblemon-1.3.1+dfsg/test/dijkstra_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/bits/path_dump.h: In instantiation of ‘int lemon::PredMapPath<_Digraph, _PredMap>::length() const [with _Digraph = lemon::concepts::Digraph; _PredMap = lemon::concepts::ReadWriteMap]’: /<>/liblemon-1.3.1+dfsg/lemon/path.h:228:11: required from ‘void lemon::Path::buildRev(const CPath&) [with CPath = lemon::PredMapPath >; GR = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:1017:9: required from ‘static void lemon::_path_bits::PathCopySelectorBackward::copy(const From&, To&) [with From = lemon::PredMapPath >; To = lemon::Path]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:1033:49: required from ‘static void lemon::_path_bits::PathCopySelector::copy(const From&, To&) [with From = lemon::PredMapPath >; To = lemon::Path]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:1046:49: required from ‘void lemon::pathCopy(const From&, To&) [with From = lemon::PredMapPath >; To = lemon::Path]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:94:15: required from ‘lemon::Path& lemon::Path::operator=(const CPath&) [with CPath = lemon::PredMapPath >; GR = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/test/dijkstra_test.cc:151:30: required from here /<>/liblemon-1.3.1+dfsg/lemon/bits/path_dump.h:44:19: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 44 | while ((arc = predMap[node]) != INVALID) { | ~~~~~^~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/dijkstra_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/dijkstra.h:29, from /<>/liblemon-1.3.1+dfsg/test/dijkstra_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/bits/path_dump.h:45:14: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 45 | node = digraph.source(arc); In file included from /<>/liblemon-1.3.1+dfsg/test/dijkstra_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/dijkstra.h:29, from /<>/liblemon-1.3.1+dfsg/test/dijkstra_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/bits/path_dump.h: In instantiation of ‘lemon::PredMapPath<_Digraph, _PredMap>::RevArcIt::RevArcIt(const lemon::PredMapPath<_Digraph, _PredMap>&) [with _Digraph = lemon::concepts::Digraph; _PredMap = lemon::concepts::ReadWriteMap]’: /<>/liblemon-1.3.1+dfsg/lemon/path.h:230:37: required from ‘void lemon::Path::buildRev(const CPath&) [with CPath = lemon::PredMapPath >; GR = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:1017:9: required from ‘static void lemon::_path_bits::PathCopySelectorBackward::copy(const From&, To&) [with From = lemon::PredMapPath >; To = lemon::Path]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:1033:49: required from ‘static void lemon::_path_bits::PathCopySelector::copy(const From&, To&) [with From = lemon::PredMapPath >; To = lemon::Path]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:1046:49: required from ‘void lemon::pathCopy(const From&, To&) [with From = lemon::PredMapPath >; To = lemon::Path]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:94:15: required from ‘lemon::Path& lemon::Path::operator=(const CPath&) [with CPath = lemon::PredMapPath >; GR = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/test/dijkstra_test.cc:151:30: required from here /<>/liblemon-1.3.1+dfsg/lemon/bits/path_dump.h:61:56: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 61 | if (path->predMap[current] == INVALID) current = INVALID; | ~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/dijkstra_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/dijkstra.h:29, from /<>/liblemon-1.3.1+dfsg/test/dijkstra_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/bits/path_dump.h: In instantiation of ‘lemon::PredMapPath<_Digraph, _PredMap>::RevArcIt& lemon::PredMapPath<_Digraph, _PredMap>::RevArcIt::operator++() [with _Digraph = lemon::concepts::Digraph; _PredMap = lemon::concepts::ReadWriteMap]’: /<>/liblemon-1.3.1+dfsg/lemon/path.h:230:62: required from ‘void lemon::Path::buildRev(const CPath&) [with CPath = lemon::PredMapPath >; GR = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:1017:9: required from ‘static void lemon::_path_bits::PathCopySelectorBackward::copy(const From&, To&) [with From = lemon::PredMapPath >; To = lemon::Path]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:1033:49: required from ‘static void lemon::_path_bits::PathCopySelector::copy(const From&, To&) [with From = lemon::PredMapPath >; To = lemon::Path]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:1046:49: required from ‘void lemon::pathCopy(const From&, To&) [with From = lemon::PredMapPath >; To = lemon::Path]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:94:15: required from ‘lemon::Path& lemon::Path::operator=(const CPath&) [with CPath = lemon::PredMapPath >; GR = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/test/dijkstra_test.cc:151:30: required from here /<>/liblemon-1.3.1+dfsg/lemon/bits/path_dump.h:69:17: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 69 | current = path->digraph.source(path->predMap[current]); In file included from /<>/liblemon-1.3.1+dfsg/test/dijkstra_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/dijkstra.h:29, from /<>/liblemon-1.3.1+dfsg/test/dijkstra_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/bits/path_dump.h:70:56: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 70 | if (path->predMap[current] == INVALID) current = INVALID; | ~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/dijkstra_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ [ 21%] Linking CXX executable dijkstra_test cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/cmake -E cmake_link_script CMakeFiles/dijkstra_test.dir/link.txt --verbose=1 /usr/bin/c++ -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -Wl,-Bsymbolic-functions -Wl,-z,relro -Wl,-z,now -rdynamic CMakeFiles/dijkstra_test.dir/dijkstra_test.cc.o -o dijkstra_test -L/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 21%] Built target dijkstra_test make -f test/CMakeFiles/error_test.dir/build.make test/CMakeFiles/error_test.dir/depend make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<>/liblemon-1.3.1+dfsg /<>/liblemon-1.3.1+dfsg/test /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test/CMakeFiles/error_test.dir/DependInfo.cmake --color= Scanning dependencies of target error_test make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' make -f test/CMakeFiles/error_test.dir/build.make test/CMakeFiles/error_test.dir/build make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 21%] Building CXX object test/CMakeFiles/error_test.dir/error_test.cc.o cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -I/<>/liblemon-1.3.1+dfsg -I/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -o CMakeFiles/error_test.dir/error_test.cc.o -c /<>/liblemon-1.3.1+dfsg/test/error_test.cc [ 22%] Linking CXX executable error_test cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/cmake -E cmake_link_script CMakeFiles/error_test.dir/link.txt --verbose=1 /usr/bin/c++ -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -Wl,-Bsymbolic-functions -Wl,-z,relro -Wl,-z,now -rdynamic CMakeFiles/error_test.dir/error_test.cc.o -o error_test -L/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 22%] Built target error_test make -f test/CMakeFiles/lgf_test.dir/build.make test/CMakeFiles/lgf_test.dir/depend make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<>/liblemon-1.3.1+dfsg /<>/liblemon-1.3.1+dfsg/test /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test/CMakeFiles/lgf_test.dir/DependInfo.cmake --color= Scanning dependencies of target lgf_test make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' make -f test/CMakeFiles/lgf_test.dir/build.make test/CMakeFiles/lgf_test.dir/build make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 22%] Building CXX object test/CMakeFiles/lgf_test.dir/lgf_test.cc.o cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -I/<>/liblemon-1.3.1+dfsg -I/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -o CMakeFiles/lgf_test.dir/lgf_test.cc.o -c /<>/liblemon-1.3.1+dfsg/test/lgf_test.cc [ 24%] Linking CXX executable lgf_test cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/cmake -E cmake_link_script CMakeFiles/lgf_test.dir/link.txt --verbose=1 /usr/bin/c++ -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -Wl,-Bsymbolic-functions -Wl,-z,relro -Wl,-z,now -rdynamic CMakeFiles/lgf_test.dir/lgf_test.cc.o -o lgf_test -L/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 24%] Built target lgf_test make -f test/CMakeFiles/bellman_ford_test.dir/build.make test/CMakeFiles/bellman_ford_test.dir/depend make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<>/liblemon-1.3.1+dfsg /<>/liblemon-1.3.1+dfsg/test /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test/CMakeFiles/bellman_ford_test.dir/DependInfo.cmake --color= Scanning dependencies of target bellman_ford_test make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' make -f test/CMakeFiles/bellman_ford_test.dir/build.make test/CMakeFiles/bellman_ford_test.dir/build make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 24%] Building CXX object test/CMakeFiles/bellman_ford_test.dir/bellman_ford_test.cc.o cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -I/<>/liblemon-1.3.1+dfsg -I/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -o CMakeFiles/bellman_ford_test.dir/bellman_ford_test.cc.o -c /<>/liblemon-1.3.1+dfsg/test/bellman_ford_test.cc /<>/liblemon-1.3.1+dfsg/test/bellman_ford_test.cc: In function ‘void checkBellmanFordCompile()’: /<>/liblemon-1.3.1+dfsg/test/bellman_ford_test.cc:95:33: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 95 | e = const_bf_test.predArc(t); | ^ In file included from /<>/liblemon-1.3.1+dfsg/test/bellman_ford_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ /<>/liblemon-1.3.1+dfsg/test/bellman_ford_test.cc:96:34: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 96 | s = const_bf_test.predNode(t); | ^ In file included from /<>/liblemon-1.3.1+dfsg/test/bellman_ford_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ /<>/liblemon-1.3.1+dfsg/test/bellman_ford_test.cc:98:32: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::NodeMap& lemon::concepts::Digraph::NodeMap::operator=(const lemon::concepts::Digraph::NodeMap&)’ is deprecated [-Wdeprecated-copy] 98 | d = const_bf_test.distMap(); | ^ In file included from /<>/liblemon-1.3.1+dfsg/test/bellman_ford_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:439:9: note: because ‘lemon::concepts::Digraph::NodeMap’ has user-provided ‘lemon::concepts::Digraph::NodeMap::NodeMap(const lemon::concepts::Digraph::NodeMap&) [with T = int]’ 439 | NodeMap(const NodeMap& nm) : | ^~~~~~~ /<>/liblemon-1.3.1+dfsg/test/bellman_ford_test.cc:99:32: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::NodeMap& lemon::concepts::Digraph::NodeMap::operator=(const lemon::concepts::Digraph::NodeMap&)’ is deprecated [-Wdeprecated-copy] 99 | p = const_bf_test.predMap(); | ^ In file included from /<>/liblemon-1.3.1+dfsg/test/bellman_ford_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:439:9: note: because ‘lemon::concepts::Digraph::NodeMap’ has user-provided ‘lemon::concepts::Digraph::NodeMap::NodeMap(const lemon::concepts::Digraph::NodeMap&) [with T = lemon::concepts::Digraph::Arc]’ 439 | NodeMap(const NodeMap& nm) : | ^~~~~~~ /<>/liblemon-1.3.1+dfsg/test/bellman_ford_test.cc:134:27: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 134 | e = bf_test.predArc(t); | ^ In file included from /<>/liblemon-1.3.1+dfsg/test/bellman_ford_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ /<>/liblemon-1.3.1+dfsg/test/bellman_ford_test.cc:135:28: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 135 | s = bf_test.predNode(t); | ^ In file included from /<>/liblemon-1.3.1+dfsg/test/bellman_ford_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bellman_ford_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/bellman_ford.h: In instantiation of ‘lemon::Path lemon::BellmanFord::negativeCycle() const [with GR = lemon::concepts::Digraph; LEN = lemon::concepts::ReadMap; TR = lemon::BellmanFordDefaultTraits >; typename TR::Digraph = lemon::concepts::Digraph]’: /<>/liblemon-1.3.1+dfsg/test/bellman_ford_test.cc:101:38: required from here /<>/liblemon-1.3.1+dfsg/lemon/bellman_ford.h:797:16: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 797 | v = _gr->source((*_pred)[v])) { In file included from /<>/liblemon-1.3.1+dfsg/test/bellman_ford_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bellman_ford_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/bellman_ford.h:801:20: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 801 | u = _gr->source((*_pred)[u])) { In file included from /<>/liblemon-1.3.1+dfsg/test/bellman_ford_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bellman_ford_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/bellman_ford.h: In instantiation of ‘lemon::Path lemon::BellmanFord::negativeCycle() const [with GR = lemon::concepts::Digraph; LEN = lemon::concepts::ReadMap; TR = lemon::BellmanFord, lemon::BellmanFord, lemon::BellmanFord >::SetPredMapTraits > >::SetDistMapTraits > >::SetOperationTraitsTraits >; typename TR::Digraph = lemon::concepts::Digraph]’: /<>/liblemon-1.3.1+dfsg/test/bellman_ford_test.cc:138:32: required from here /<>/liblemon-1.3.1+dfsg/lemon/bellman_ford.h:797:16: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 797 | v = _gr->source((*_pred)[v])) { In file included from /<>/liblemon-1.3.1+dfsg/test/bellman_ford_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bellman_ford_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/bellman_ford.h:801:20: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 801 | u = _gr->source((*_pred)[u])) { In file included from /<>/liblemon-1.3.1+dfsg/test/bellman_ford_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:27, from /<>/liblemon-1.3.1+dfsg/test/bellman_ford_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/maps.h: In instantiation of ‘void lemon::concepts::ReferenceMap::set(const Key&, const Value&) [with K = lemon::concepts::Digraph::Node; T = lemon::concepts::Digraph::Arc; R = lemon::concepts::Digraph::Arc&; CR = const lemon::concepts::Digraph::Arc&; lemon::concepts::ReferenceMap::Key = lemon::concepts::Digraph::Node; lemon::concepts::ReferenceMap::Value = lemon::concepts::Digraph::Arc]’: /<>/liblemon-1.3.1+dfsg/lemon/bellman_ford.h:406:9: required from ‘void lemon::BellmanFord::init(lemon::BellmanFord::Value) [with GR = lemon::concepts::Digraph; LEN = lemon::concepts::ReadMap; TR = lemon::BellmanFordDefaultTraits >; lemon::BellmanFord::Value = int]’ /<>/liblemon-1.3.1+dfsg/test/bellman_ford_test.cc:84:18: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/maps.h:186:60: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 186 | void set(const Key &k,const Value &t) { operator[](k)=t; } In file included from /<>/liblemon-1.3.1+dfsg/test/bellman_ford_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/bellman_ford.h:27, from /<>/liblemon-1.3.1+dfsg/test/bellman_ford_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/bits/path_dump.h: In instantiation of ‘int lemon::PredMapPath<_Digraph, _PredMap>::length() const [with _Digraph = lemon::concepts::Digraph; _PredMap = lemon::concepts::Digraph::NodeMap]’: /<>/liblemon-1.3.1+dfsg/lemon/path.h:228:11: required from ‘void lemon::Path::buildRev(const CPath&) [with CPath = lemon::PredMapPath >; GR = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:1017:9: required from ‘static void lemon::_path_bits::PathCopySelectorBackward::copy(const From&, To&) [with From = lemon::PredMapPath >; To = lemon::Path]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:1033:49: required from ‘static void lemon::_path_bits::PathCopySelector::copy(const From&, To&) [with From = lemon::PredMapPath >; To = lemon::Path]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:1046:49: required from ‘void lemon::pathCopy(const From&, To&) [with From = lemon::PredMapPath >; To = lemon::Path]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:94:15: required from ‘lemon::Path& lemon::Path::operator=(const CPath&) [with CPath = lemon::PredMapPath >; GR = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/bellman_ford.h:1010:62: required from ‘bool lemon::BellmanFordWizard::run(lemon::BellmanFordWizard::Node, lemon::BellmanFordWizard::Node) [with TR = lemon::BellmanFordWizardBase >; lemon::BellmanFordWizard::Node = lemon::concepts::Digraph::Node]’ /<>/liblemon-1.3.1+dfsg/test/bellman_ford_test.cc:155:51: required from here /<>/liblemon-1.3.1+dfsg/lemon/bits/path_dump.h:44:19: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 44 | while ((arc = predMap[node]) != INVALID) { | ~~~~~^~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bellman_ford_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/bellman_ford.h:27, from /<>/liblemon-1.3.1+dfsg/test/bellman_ford_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/bits/path_dump.h:45:14: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 45 | node = digraph.source(arc); In file included from /<>/liblemon-1.3.1+dfsg/test/bellman_ford_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/bellman_ford.h:27, from /<>/liblemon-1.3.1+dfsg/test/bellman_ford_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/bits/path_dump.h: In instantiation of ‘lemon::PredMapPath<_Digraph, _PredMap>::RevArcIt::RevArcIt(const lemon::PredMapPath<_Digraph, _PredMap>&) [with _Digraph = lemon::concepts::Digraph; _PredMap = lemon::concepts::Digraph::NodeMap]’: /<>/liblemon-1.3.1+dfsg/lemon/path.h:230:37: required from ‘void lemon::Path::buildRev(const CPath&) [with CPath = lemon::PredMapPath >; GR = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:1017:9: required from ‘static void lemon::_path_bits::PathCopySelectorBackward::copy(const From&, To&) [with From = lemon::PredMapPath >; To = lemon::Path]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:1033:49: required from ‘static void lemon::_path_bits::PathCopySelector::copy(const From&, To&) [with From = lemon::PredMapPath >; To = lemon::Path]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:1046:49: required from ‘void lemon::pathCopy(const From&, To&) [with From = lemon::PredMapPath >; To = lemon::Path]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:94:15: required from ‘lemon::Path& lemon::Path::operator=(const CPath&) [with CPath = lemon::PredMapPath >; GR = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/bellman_ford.h:1010:62: required from ‘bool lemon::BellmanFordWizard::run(lemon::BellmanFordWizard::Node, lemon::BellmanFordWizard::Node) [with TR = lemon::BellmanFordWizardBase >; lemon::BellmanFordWizard::Node = lemon::concepts::Digraph::Node]’ /<>/liblemon-1.3.1+dfsg/test/bellman_ford_test.cc:155:51: required from here /<>/liblemon-1.3.1+dfsg/lemon/bits/path_dump.h:61:56: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 61 | if (path->predMap[current] == INVALID) current = INVALID; | ~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bellman_ford_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/bellman_ford.h:27, from /<>/liblemon-1.3.1+dfsg/test/bellman_ford_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/bits/path_dump.h: In instantiation of ‘lemon::PredMapPath<_Digraph, _PredMap>::RevArcIt& lemon::PredMapPath<_Digraph, _PredMap>::RevArcIt::operator++() [with _Digraph = lemon::concepts::Digraph; _PredMap = lemon::concepts::Digraph::NodeMap]’: /<>/liblemon-1.3.1+dfsg/lemon/path.h:230:62: required from ‘void lemon::Path::buildRev(const CPath&) [with CPath = lemon::PredMapPath >; GR = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:1017:9: required from ‘static void lemon::_path_bits::PathCopySelectorBackward::copy(const From&, To&) [with From = lemon::PredMapPath >; To = lemon::Path]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:1033:49: required from ‘static void lemon::_path_bits::PathCopySelector::copy(const From&, To&) [with From = lemon::PredMapPath >; To = lemon::Path]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:1046:49: required from ‘void lemon::pathCopy(const From&, To&) [with From = lemon::PredMapPath >; To = lemon::Path]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:94:15: required from ‘lemon::Path& lemon::Path::operator=(const CPath&) [with CPath = lemon::PredMapPath >; GR = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/bellman_ford.h:1010:62: required from ‘bool lemon::BellmanFordWizard::run(lemon::BellmanFordWizard::Node, lemon::BellmanFordWizard::Node) [with TR = lemon::BellmanFordWizardBase >; lemon::BellmanFordWizard::Node = lemon::concepts::Digraph::Node]’ /<>/liblemon-1.3.1+dfsg/test/bellman_ford_test.cc:155:51: required from here /<>/liblemon-1.3.1+dfsg/lemon/bits/path_dump.h:69:17: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 69 | current = path->digraph.source(path->predMap[current]); In file included from /<>/liblemon-1.3.1+dfsg/test/bellman_ford_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/bellman_ford.h:27, from /<>/liblemon-1.3.1+dfsg/test/bellman_ford_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/bits/path_dump.h:70:56: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 70 | if (path->predMap[current] == INVALID) current = INVALID; | ~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bellman_ford_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ [ 25%] Linking CXX executable bellman_ford_test cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/cmake -E cmake_link_script CMakeFiles/bellman_ford_test.dir/link.txt --verbose=1 /usr/bin/c++ -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -Wl,-Bsymbolic-functions -Wl,-z,relro -Wl,-z,now -rdynamic CMakeFiles/bellman_ford_test.dir/bellman_ford_test.cc.o -o bellman_ford_test -L/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 25%] Built target bellman_ford_test make -f test/CMakeFiles/bpgraph_test.dir/build.make test/CMakeFiles/bpgraph_test.dir/depend make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<>/liblemon-1.3.1+dfsg /<>/liblemon-1.3.1+dfsg/test /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test/CMakeFiles/bpgraph_test.dir/DependInfo.cmake --color= Scanning dependencies of target bpgraph_test make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' make -f test/CMakeFiles/bpgraph_test.dir/build.make test/CMakeFiles/bpgraph_test.dir/build make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 26%] Building CXX object test/CMakeFiles/bpgraph_test.dir/bpgraph_test.cc.o cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -I/<>/liblemon-1.3.1+dfsg -I/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -o CMakeFiles/bpgraph_test.dir/bpgraph_test.cc.o -c /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::BaseBpGraphComponent::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::BaseBpGraphComponent]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseBpGraphComponent; Type = lemon::concepts::BaseBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:324:63: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:453:16: warning: implicitly-declared ‘lemon::concepts::BaseBpGraphComponent::RedNode& lemon::concepts::BaseBpGraphComponent::RedNode::operator=(const lemon::concepts::BaseBpGraphComponent::RedNode&)’ is deprecated [-Wdeprecated-copy] 453 | rn = bpgraph.redNode(e); /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:337:9: note: because ‘lemon::concepts::BaseBpGraphComponent::RedNode’ has user-provided ‘lemon::concepts::BaseBpGraphComponent::RedNode::RedNode(const lemon::concepts::BaseBpGraphComponent::RedNode&)’ 337 | RedNode(const RedNode &) : Parent() {} | ^~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:454:16: warning: implicitly-declared ‘lemon::concepts::BaseBpGraphComponent::BlueNode& lemon::concepts::BaseBpGraphComponent::BlueNode::operator=(const lemon::concepts::BaseBpGraphComponent::BlueNode&)’ is deprecated [-Wdeprecated-copy] 454 | bn = bpgraph.blueNode(e); /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:366:9: note: because ‘lemon::concepts::BaseBpGraphComponent::BlueNode’ has user-provided ‘lemon::concepts::BaseBpGraphComponent::BlueNode::BlueNode(const lemon::concepts::BaseBpGraphComponent::BlueNode&)’ 366 | BlueNode(const BlueNode &) : Parent() {} | ^~~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:455:16: warning: implicitly-declared ‘lemon::concepts::BaseBpGraphComponent::RedNode& lemon::concepts::BaseBpGraphComponent::RedNode::operator=(const lemon::concepts::BaseBpGraphComponent::RedNode&)’ is deprecated [-Wdeprecated-copy] 455 | rn = bpgraph.asRedNodeUnsafe(rnan); /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:337:9: note: because ‘lemon::concepts::BaseBpGraphComponent::RedNode’ has user-provided ‘lemon::concepts::BaseBpGraphComponent::RedNode::RedNode(const lemon::concepts::BaseBpGraphComponent::RedNode&)’ 337 | RedNode(const RedNode &) : Parent() {} | ^~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:456:16: warning: implicitly-declared ‘lemon::concepts::BaseBpGraphComponent::BlueNode& lemon::concepts::BaseBpGraphComponent::BlueNode::operator=(const lemon::concepts::BaseBpGraphComponent::BlueNode&)’ is deprecated [-Wdeprecated-copy] 456 | bn = bpgraph.asBlueNodeUnsafe(bnan); /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:366:9: note: because ‘lemon::concepts::BaseBpGraphComponent::BlueNode’ has user-provided ‘lemon::concepts::BaseBpGraphComponent::BlueNode::BlueNode(const lemon::concepts::BaseBpGraphComponent::BlueNode&)’ 366 | BlueNode(const BlueNode &) : Parent() {} | ^~~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:457:16: warning: implicitly-declared ‘lemon::concepts::BaseBpGraphComponent::RedNode& lemon::concepts::BaseBpGraphComponent::RedNode::operator=(const lemon::concepts::BaseBpGraphComponent::RedNode&)’ is deprecated [-Wdeprecated-copy] 457 | rn = bpgraph.asRedNode(rnan); /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:337:9: note: because ‘lemon::concepts::BaseBpGraphComponent::RedNode’ has user-provided ‘lemon::concepts::BaseBpGraphComponent::RedNode::RedNode(const lemon::concepts::BaseBpGraphComponent::RedNode&)’ 337 | RedNode(const RedNode &) : Parent() {} | ^~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:458:16: warning: implicitly-declared ‘lemon::concepts::BaseBpGraphComponent::BlueNode& lemon::concepts::BaseBpGraphComponent::BlueNode::operator=(const lemon::concepts::BaseBpGraphComponent::BlueNode&)’ is deprecated [-Wdeprecated-copy] 458 | bn = bpgraph.asBlueNode(bnan); /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:366:9: note: because ‘lemon::concepts::BaseBpGraphComponent::BlueNode’ has user-provided ‘lemon::concepts::BaseBpGraphComponent::BlueNode::BlueNode(const lemon::concepts::BaseBpGraphComponent::BlueNode&)’ 366 | BlueNode(const BlueNode &) : Parent() {} | ^~~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::ExtendableBpGraphComponent::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::ExtendableBpGraphComponent<>; BAS = lemon::concepts::BaseBpGraphComponent]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::ExtendableBpGraphComponent<>; Type = lemon::concepts::ExtendableBpGraphComponent<>]’ /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:339:38: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1983:20: warning: implicitly-declared ‘lemon::concepts::BaseBpGraphComponent::RedNode& lemon::concepts::BaseBpGraphComponent::RedNode::operator=(const lemon::concepts::BaseBpGraphComponent::RedNode&)’ is deprecated [-Wdeprecated-copy] 1983 | red_node = bpgraph.addRedNode(); /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:337:9: note: because ‘lemon::concepts::BaseBpGraphComponent::RedNode’ has user-provided ‘lemon::concepts::BaseBpGraphComponent::RedNode::RedNode(const lemon::concepts::BaseBpGraphComponent::RedNode&)’ 337 | RedNode(const RedNode &) : Parent() {} | ^~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1984:21: warning: implicitly-declared ‘lemon::concepts::BaseBpGraphComponent::BlueNode& lemon::concepts::BaseBpGraphComponent::BlueNode::operator=(const lemon::concepts::BaseBpGraphComponent::BlueNode&)’ is deprecated [-Wdeprecated-copy] 1984 | blue_node = bpgraph.addBlueNode(); /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:366:9: note: because ‘lemon::concepts::BaseBpGraphComponent::BlueNode’ has user-provided ‘lemon::concepts::BaseBpGraphComponent::BlueNode::BlueNode(const lemon::concepts::BaseBpGraphComponent::BlueNode&)’ 366 | BlueNode(const BlueNode &) : Parent() {} | ^~~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1986:16: warning: implicitly-declared ‘lemon::concepts::BaseGraphComponent::Edge& lemon::concepts::BaseGraphComponent::Edge::operator=(const lemon::concepts::BaseGraphComponent::Edge&)’ is deprecated [-Wdeprecated-copy] 1986 | edge = bpgraph.addEdge(red_node, blue_node); /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:219:9: note: because ‘lemon::concepts::BaseGraphComponent::Edge’ has user-provided ‘lemon::concepts::BaseGraphComponent::Edge::Edge(const lemon::concepts::BaseGraphComponent::Edge&)’ 219 | Edge(const Edge &) : Parent() {} | ^~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1987:16: warning: implicitly-declared ‘lemon::concepts::BaseGraphComponent::Edge& lemon::concepts::BaseGraphComponent::Edge::operator=(const lemon::concepts::BaseGraphComponent::Edge&)’ is deprecated [-Wdeprecated-copy] 1987 | edge = bpgraph.addEdge(blue_node, red_node); /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:219:9: note: because ‘lemon::concepts::BaseGraphComponent::Edge’ has user-provided ‘lemon::concepts::BaseGraphComponent::Edge::Edge(const lemon::concepts::BaseGraphComponent::Edge&)’ 219 | Edge(const Edge &) : Parent() {} | ^~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::ExtendableBpGraphComponent::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::SmartBpGraph; BAS = lemon::concepts::BaseBpGraphComponent]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::ExtendableBpGraphComponent<>; Type = lemon::SmartBpGraph]’ /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:354:62: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1983:20: warning: implicitly-declared ‘constexpr lemon::SmartBpGraphBase::RedNode& lemon::SmartBpGraphBase::RedNode::operator=(const lemon::SmartBpGraphBase::RedNode&)’ is deprecated [-Wdeprecated-copy] 1983 | red_node = bpgraph.addRedNode(); In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:21: /<>/liblemon-1.3.1+dfsg/lemon/smart_graph.h:865:7: note: because ‘lemon::SmartBpGraphBase::RedNode’ has user-provided ‘lemon::SmartBpGraphBase::RedNode::RedNode(const lemon::SmartBpGraphBase::RedNode&)’ 865 | RedNode(const RedNode& node) : Node(node) {} | ^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1984:21: warning: implicitly-declared ‘constexpr lemon::SmartBpGraphBase::BlueNode& lemon::SmartBpGraphBase::BlueNode::operator=(const lemon::SmartBpGraphBase::BlueNode&)’ is deprecated [-Wdeprecated-copy] 1984 | blue_node = bpgraph.addBlueNode(); In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:21: /<>/liblemon-1.3.1+dfsg/lemon/smart_graph.h:877:7: note: because ‘lemon::SmartBpGraphBase::BlueNode’ has user-provided ‘lemon::SmartBpGraphBase::BlueNode::BlueNode(const lemon::SmartBpGraphBase::BlueNode&)’ 877 | BlueNode(const BlueNode& node) : Node(node) {} | ^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::BaseGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::BaseBpGraphComponent]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseGraphComponent; Type = lemon::concepts::BaseBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:440:53: required from ‘void lemon::concepts::BaseBpGraphComponent::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::BaseBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseBpGraphComponent; Type = lemon::concepts::BaseBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:324:63: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:290:16: warning: implicitly-declared ‘lemon::concepts::BaseGraphComponent::Edge& lemon::concepts::BaseGraphComponent::Edge::operator=(const lemon::concepts::BaseGraphComponent::Edge&)’ is deprecated [-Wdeprecated-copy] 290 | ue = e; | ~~~^~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:219:9: note: because ‘lemon::concepts::BaseGraphComponent::Edge’ has user-provided ‘lemon::concepts::BaseGraphComponent::Edge::Edge(const lemon::concepts::BaseGraphComponent::Edge&)’ 219 | Edge(const Edge &) : Parent() {} | ^~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItem::Constraints<_GraphItem>::constraints() [with _GraphItem = lemon::concepts::BaseBpGraphComponent::RedNode; char sel = 'n']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItem<'n'>; Type = lemon::concepts::BaseBpGraphComponent::RedNode]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:441:48: required from ‘void lemon::concepts::BaseBpGraphComponent::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::BaseBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseBpGraphComponent; Type = lemon::concepts::BaseBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:324:63: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:104:13: warning: implicitly-declared ‘lemon::concepts::BaseBpGraphComponent::RedNode& lemon::concepts::BaseBpGraphComponent::RedNode::operator=(const lemon::concepts::BaseBpGraphComponent::RedNode&)’ is deprecated [-Wdeprecated-copy] 104 | i1=INVALID; | ~~^~~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:337:9: note: because ‘lemon::concepts::BaseBpGraphComponent::RedNode’ has user-provided ‘lemon::concepts::BaseBpGraphComponent::RedNode::RedNode(const lemon::concepts::BaseBpGraphComponent::RedNode&)’ 337 | RedNode(const RedNode &) : Parent() {} | ^~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:19: warning: implicitly-declared ‘lemon::concepts::BaseBpGraphComponent::RedNode& lemon::concepts::BaseBpGraphComponent::RedNode::operator=(const lemon::concepts::BaseBpGraphComponent::RedNode&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:337:9: note: because ‘lemon::concepts::BaseBpGraphComponent::RedNode’ has user-provided ‘lemon::concepts::BaseBpGraphComponent::RedNode::RedNode(const lemon::concepts::BaseBpGraphComponent::RedNode&)’ 337 | RedNode(const RedNode &) : Parent() {} | ^~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:14: warning: implicitly-declared ‘lemon::concepts::BaseBpGraphComponent::RedNode& lemon::concepts::BaseBpGraphComponent::RedNode::operator=(const lemon::concepts::BaseBpGraphComponent::RedNode&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:337:9: note: because ‘lemon::concepts::BaseBpGraphComponent::RedNode’ has user-provided ‘lemon::concepts::BaseBpGraphComponent::RedNode::RedNode(const lemon::concepts::BaseBpGraphComponent::RedNode&)’ 337 | RedNode(const RedNode &) : Parent() {} | ^~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItem::Constraints<_GraphItem>::constraints() [with _GraphItem = lemon::concepts::BaseBpGraphComponent::BlueNode; char sel = 'n']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItem<'n'>; Type = lemon::concepts::BaseBpGraphComponent::BlueNode]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:442:49: required from ‘void lemon::concepts::BaseBpGraphComponent::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::BaseBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseBpGraphComponent; Type = lemon::concepts::BaseBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:324:63: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:104:13: warning: implicitly-declared ‘lemon::concepts::BaseBpGraphComponent::BlueNode& lemon::concepts::BaseBpGraphComponent::BlueNode::operator=(const lemon::concepts::BaseBpGraphComponent::BlueNode&)’ is deprecated [-Wdeprecated-copy] 104 | i1=INVALID; | ~~^~~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:366:9: note: because ‘lemon::concepts::BaseBpGraphComponent::BlueNode’ has user-provided ‘lemon::concepts::BaseBpGraphComponent::BlueNode::BlueNode(const lemon::concepts::BaseBpGraphComponent::BlueNode&)’ 366 | BlueNode(const BlueNode &) : Parent() {} | ^~~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:19: warning: implicitly-declared ‘lemon::concepts::BaseBpGraphComponent::BlueNode& lemon::concepts::BaseBpGraphComponent::BlueNode::operator=(const lemon::concepts::BaseBpGraphComponent::BlueNode&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:366:9: note: because ‘lemon::concepts::BaseBpGraphComponent::BlueNode’ has user-provided ‘lemon::concepts::BaseBpGraphComponent::BlueNode::BlueNode(const lemon::concepts::BaseBpGraphComponent::BlueNode&)’ 366 | BlueNode(const BlueNode &) : Parent() {} | ^~~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:14: warning: implicitly-declared ‘lemon::concepts::BaseBpGraphComponent::BlueNode& lemon::concepts::BaseBpGraphComponent::BlueNode::operator=(const lemon::concepts::BaseBpGraphComponent::BlueNode&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:366:9: note: because ‘lemon::concepts::BaseBpGraphComponent::BlueNode’ has user-provided ‘lemon::concepts::BaseBpGraphComponent::BlueNode::BlueNode(const lemon::concepts::BaseBpGraphComponent::BlueNode&)’ 366 | BlueNode(const BlueNode &) : Parent() {} | ^~~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::IDableGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::IDableBpGraphComponent<>; BAS = lemon::concepts::BaseBpGraphComponent]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IDableGraphComponent; Type = lemon::concepts::IDableBpGraphComponent<>]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:648:61: required from ‘void lemon::concepts::IDableBpGraphComponent::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::IDableBpGraphComponent<>; BAS = lemon::concepts::BaseBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IDableBpGraphComponent<>; Type = lemon::concepts::IDableBpGraphComponent<>]’ /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:327:34: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:590:16: warning: implicitly-declared ‘lemon::concepts::BaseGraphComponent::Edge& lemon::concepts::BaseGraphComponent::Edge::operator=(const lemon::concepts::BaseGraphComponent::Edge&)’ is deprecated [-Wdeprecated-copy] 590 | edge = graph.edgeFromId(ueid); /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:219:9: note: because ‘lemon::concepts::BaseGraphComponent::Edge’ has user-provided ‘lemon::concepts::BaseGraphComponent::Edge::Edge(const lemon::concepts::BaseGraphComponent::Edge&)’ 219 | Edge(const Edge &) : Parent() {} | ^~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItemIt::Constraints<_GraphItemIt>::constraints() [with _GraphItemIt = lemon::concepts::GraphItemIt, lemon::concepts::BaseBpGraphComponent::RedNode>; GR = lemon::concepts::IterableBpGraphComponent<>; Item = lemon::concepts::BaseBpGraphComponent::RedNode]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItemIt, lemon::concepts::BaseBpGraphComponent::RedNode>; Type = lemon::concepts::GraphItemIt, lemon::concepts::BaseBpGraphComponent::RedNode>]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1219:42: required from ‘void lemon::concepts::IterableBpGraphComponent::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::IterableBpGraphComponent<>; BAS = lemon::concepts::BaseBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableBpGraphComponent<>; Type = lemon::concepts::IterableBpGraphComponent<>]’ /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:330:36: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:737:14: warning: implicitly-declared ‘lemon::concepts::BaseBpGraphComponent::RedNode& lemon::concepts::BaseBpGraphComponent::RedNode::operator=(const lemon::concepts::BaseBpGraphComponent::RedNode&)’ is deprecated [-Wdeprecated-copy] 737 | bi = it2; | ~~~^~~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:337:9: note: because ‘lemon::concepts::BaseBpGraphComponent::RedNode’ has user-provided ‘lemon::concepts::BaseBpGraphComponent::RedNode::RedNode(const lemon::concepts::BaseBpGraphComponent::RedNode&)’ 337 | RedNode(const RedNode &) : Parent() {} | ^~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItemIt::Constraints<_GraphItemIt>::constraints() [with _GraphItemIt = lemon::concepts::GraphItemIt, lemon::concepts::BaseBpGraphComponent::BlueNode>; GR = lemon::concepts::IterableBpGraphComponent<>; Item = lemon::concepts::BaseBpGraphComponent::BlueNode]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItemIt, lemon::concepts::BaseBpGraphComponent::BlueNode>; Type = lemon::concepts::GraphItemIt, lemon::concepts::BaseBpGraphComponent::BlueNode>]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1221:43: required from ‘void lemon::concepts::IterableBpGraphComponent::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::IterableBpGraphComponent<>; BAS = lemon::concepts::BaseBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableBpGraphComponent<>; Type = lemon::concepts::IterableBpGraphComponent<>]’ /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:330:36: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:737:14: warning: implicitly-declared ‘lemon::concepts::BaseBpGraphComponent::BlueNode& lemon::concepts::BaseBpGraphComponent::BlueNode::operator=(const lemon::concepts::BaseBpGraphComponent::BlueNode&)’ is deprecated [-Wdeprecated-copy] 737 | bi = it2; | ~~~^~~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:366:9: note: because ‘lemon::concepts::BaseBpGraphComponent::BlueNode’ has user-provided ‘lemon::concepts::BaseBpGraphComponent::BlueNode::BlueNode(const lemon::concepts::BaseBpGraphComponent::BlueNode&)’ 366 | BlueNode(const BlueNode &) : Parent() {} | ^~~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::BaseBpGraphComponent::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::ExtendableBpGraphComponent<>]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseBpGraphComponent; Type = lemon::concepts::ExtendableBpGraphComponent<>]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1980:39: required from ‘void lemon::concepts::ExtendableBpGraphComponent::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::ExtendableBpGraphComponent<>; BAS = lemon::concepts::BaseBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::ExtendableBpGraphComponent<>; Type = lemon::concepts::ExtendableBpGraphComponent<>]’ /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:339:38: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:453:16: warning: implicitly-declared ‘lemon::concepts::BaseBpGraphComponent::RedNode& lemon::concepts::BaseBpGraphComponent::RedNode::operator=(const lemon::concepts::BaseBpGraphComponent::RedNode&)’ is deprecated [-Wdeprecated-copy] 453 | rn = bpgraph.redNode(e); /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:337:9: note: because ‘lemon::concepts::BaseBpGraphComponent::RedNode’ has user-provided ‘lemon::concepts::BaseBpGraphComponent::RedNode::RedNode(const lemon::concepts::BaseBpGraphComponent::RedNode&)’ 337 | RedNode(const RedNode &) : Parent() {} | ^~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:454:16: warning: implicitly-declared ‘lemon::concepts::BaseBpGraphComponent::BlueNode& lemon::concepts::BaseBpGraphComponent::BlueNode::operator=(const lemon::concepts::BaseBpGraphComponent::BlueNode&)’ is deprecated [-Wdeprecated-copy] 454 | bn = bpgraph.blueNode(e); /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:366:9: note: because ‘lemon::concepts::BaseBpGraphComponent::BlueNode’ has user-provided ‘lemon::concepts::BaseBpGraphComponent::BlueNode::BlueNode(const lemon::concepts::BaseBpGraphComponent::BlueNode&)’ 366 | BlueNode(const BlueNode &) : Parent() {} | ^~~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:455:16: warning: implicitly-declared ‘lemon::concepts::BaseBpGraphComponent::RedNode& lemon::concepts::BaseBpGraphComponent::RedNode::operator=(const lemon::concepts::BaseBpGraphComponent::RedNode&)’ is deprecated [-Wdeprecated-copy] 455 | rn = bpgraph.asRedNodeUnsafe(rnan); /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:337:9: note: because ‘lemon::concepts::BaseBpGraphComponent::RedNode’ has user-provided ‘lemon::concepts::BaseBpGraphComponent::RedNode::RedNode(const lemon::concepts::BaseBpGraphComponent::RedNode&)’ 337 | RedNode(const RedNode &) : Parent() {} | ^~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:456:16: warning: implicitly-declared ‘lemon::concepts::BaseBpGraphComponent::BlueNode& lemon::concepts::BaseBpGraphComponent::BlueNode::operator=(const lemon::concepts::BaseBpGraphComponent::BlueNode&)’ is deprecated [-Wdeprecated-copy] 456 | bn = bpgraph.asBlueNodeUnsafe(bnan); /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:366:9: note: because ‘lemon::concepts::BaseBpGraphComponent::BlueNode’ has user-provided ‘lemon::concepts::BaseBpGraphComponent::BlueNode::BlueNode(const lemon::concepts::BaseBpGraphComponent::BlueNode&)’ 366 | BlueNode(const BlueNode &) : Parent() {} | ^~~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:457:16: warning: implicitly-declared ‘lemon::concepts::BaseBpGraphComponent::RedNode& lemon::concepts::BaseBpGraphComponent::RedNode::operator=(const lemon::concepts::BaseBpGraphComponent::RedNode&)’ is deprecated [-Wdeprecated-copy] 457 | rn = bpgraph.asRedNode(rnan); /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:337:9: note: because ‘lemon::concepts::BaseBpGraphComponent::RedNode’ has user-provided ‘lemon::concepts::BaseBpGraphComponent::RedNode::RedNode(const lemon::concepts::BaseBpGraphComponent::RedNode&)’ 337 | RedNode(const RedNode &) : Parent() {} | ^~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:458:16: warning: implicitly-declared ‘lemon::concepts::BaseBpGraphComponent::BlueNode& lemon::concepts::BaseBpGraphComponent::BlueNode::operator=(const lemon::concepts::BaseBpGraphComponent::BlueNode&)’ is deprecated [-Wdeprecated-copy] 458 | bn = bpgraph.asBlueNode(bnan); /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:366:9: note: because ‘lemon::concepts::BaseBpGraphComponent::BlueNode’ has user-provided ‘lemon::concepts::BaseBpGraphComponent::BlueNode::BlueNode(const lemon::concepts::BaseBpGraphComponent::BlueNode&)’ 366 | BlueNode(const BlueNode &) : Parent() {} | ^~~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::BaseBpGraphComponent::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::ErasableBpGraphComponent<>]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseBpGraphComponent; Type = lemon::concepts::ErasableBpGraphComponent<>]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:2062:37: required from ‘void lemon::concepts::ErasableGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::ErasableBpGraphComponent<>; BAS = lemon::concepts::BaseBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::ErasableBpGraphComponent<>; Type = lemon::concepts::ErasableBpGraphComponent<>]’ /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:342:36: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:453:16: warning: implicitly-declared ‘lemon::concepts::BaseBpGraphComponent::RedNode& lemon::concepts::BaseBpGraphComponent::RedNode::operator=(const lemon::concepts::BaseBpGraphComponent::RedNode&)’ is deprecated [-Wdeprecated-copy] 453 | rn = bpgraph.redNode(e); /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:337:9: note: because ‘lemon::concepts::BaseBpGraphComponent::RedNode’ has user-provided ‘lemon::concepts::BaseBpGraphComponent::RedNode::RedNode(const lemon::concepts::BaseBpGraphComponent::RedNode&)’ 337 | RedNode(const RedNode &) : Parent() {} | ^~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:454:16: warning: implicitly-declared ‘lemon::concepts::BaseBpGraphComponent::BlueNode& lemon::concepts::BaseBpGraphComponent::BlueNode::operator=(const lemon::concepts::BaseBpGraphComponent::BlueNode&)’ is deprecated [-Wdeprecated-copy] 454 | bn = bpgraph.blueNode(e); /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:366:9: note: because ‘lemon::concepts::BaseBpGraphComponent::BlueNode’ has user-provided ‘lemon::concepts::BaseBpGraphComponent::BlueNode::BlueNode(const lemon::concepts::BaseBpGraphComponent::BlueNode&)’ 366 | BlueNode(const BlueNode &) : Parent() {} | ^~~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:455:16: warning: implicitly-declared ‘lemon::concepts::BaseBpGraphComponent::RedNode& lemon::concepts::BaseBpGraphComponent::RedNode::operator=(const lemon::concepts::BaseBpGraphComponent::RedNode&)’ is deprecated [-Wdeprecated-copy] 455 | rn = bpgraph.asRedNodeUnsafe(rnan); /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:337:9: note: because ‘lemon::concepts::BaseBpGraphComponent::RedNode’ has user-provided ‘lemon::concepts::BaseBpGraphComponent::RedNode::RedNode(const lemon::concepts::BaseBpGraphComponent::RedNode&)’ 337 | RedNode(const RedNode &) : Parent() {} | ^~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:456:16: warning: implicitly-declared ‘lemon::concepts::BaseBpGraphComponent::BlueNode& lemon::concepts::BaseBpGraphComponent::BlueNode::operator=(const lemon::concepts::BaseBpGraphComponent::BlueNode&)’ is deprecated [-Wdeprecated-copy] 456 | bn = bpgraph.asBlueNodeUnsafe(bnan); /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:366:9: note: because ‘lemon::concepts::BaseBpGraphComponent::BlueNode’ has user-provided ‘lemon::concepts::BaseBpGraphComponent::BlueNode::BlueNode(const lemon::concepts::BaseBpGraphComponent::BlueNode&)’ 366 | BlueNode(const BlueNode &) : Parent() {} | ^~~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:457:16: warning: implicitly-declared ‘lemon::concepts::BaseBpGraphComponent::RedNode& lemon::concepts::BaseBpGraphComponent::RedNode::operator=(const lemon::concepts::BaseBpGraphComponent::RedNode&)’ is deprecated [-Wdeprecated-copy] 457 | rn = bpgraph.asRedNode(rnan); /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:337:9: note: because ‘lemon::concepts::BaseBpGraphComponent::RedNode’ has user-provided ‘lemon::concepts::BaseBpGraphComponent::RedNode::RedNode(const lemon::concepts::BaseBpGraphComponent::RedNode&)’ 337 | RedNode(const RedNode &) : Parent() {} | ^~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:458:16: warning: implicitly-declared ‘lemon::concepts::BaseBpGraphComponent::BlueNode& lemon::concepts::BaseBpGraphComponent::BlueNode::operator=(const lemon::concepts::BaseBpGraphComponent::BlueNode&)’ is deprecated [-Wdeprecated-copy] 458 | bn = bpgraph.asBlueNode(bnan); /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:366:9: note: because ‘lemon::concepts::BaseBpGraphComponent::BlueNode’ has user-provided ‘lemon::concepts::BaseBpGraphComponent::BlueNode::BlueNode(const lemon::concepts::BaseBpGraphComponent::BlueNode&)’ 366 | BlueNode(const BlueNode &) : Parent() {} | ^~~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::BaseBpGraphComponent::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::ClearableBpGraphComponent<>]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseBpGraphComponent; Type = lemon::concepts::ClearableBpGraphComponent<>]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:2103:39: required from ‘void lemon::concepts::ClearableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::ClearableBpGraphComponent<>; BAS = lemon::concepts::BaseBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::ClearableBpGraphComponent<>; Type = lemon::concepts::ClearableBpGraphComponent<>]’ /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:345:37: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:453:16: warning: implicitly-declared ‘lemon::concepts::BaseBpGraphComponent::RedNode& lemon::concepts::BaseBpGraphComponent::RedNode::operator=(const lemon::concepts::BaseBpGraphComponent::RedNode&)’ is deprecated [-Wdeprecated-copy] 453 | rn = bpgraph.redNode(e); /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:337:9: note: because ‘lemon::concepts::BaseBpGraphComponent::RedNode’ has user-provided ‘lemon::concepts::BaseBpGraphComponent::RedNode::RedNode(const lemon::concepts::BaseBpGraphComponent::RedNode&)’ 337 | RedNode(const RedNode &) : Parent() {} | ^~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:454:16: warning: implicitly-declared ‘lemon::concepts::BaseBpGraphComponent::BlueNode& lemon::concepts::BaseBpGraphComponent::BlueNode::operator=(const lemon::concepts::BaseBpGraphComponent::BlueNode&)’ is deprecated [-Wdeprecated-copy] 454 | bn = bpgraph.blueNode(e); /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:366:9: note: because ‘lemon::concepts::BaseBpGraphComponent::BlueNode’ has user-provided ‘lemon::concepts::BaseBpGraphComponent::BlueNode::BlueNode(const lemon::concepts::BaseBpGraphComponent::BlueNode&)’ 366 | BlueNode(const BlueNode &) : Parent() {} | ^~~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:455:16: warning: implicitly-declared ‘lemon::concepts::BaseBpGraphComponent::RedNode& lemon::concepts::BaseBpGraphComponent::RedNode::operator=(const lemon::concepts::BaseBpGraphComponent::RedNode&)’ is deprecated [-Wdeprecated-copy] 455 | rn = bpgraph.asRedNodeUnsafe(rnan); /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:337:9: note: because ‘lemon::concepts::BaseBpGraphComponent::RedNode’ has user-provided ‘lemon::concepts::BaseBpGraphComponent::RedNode::RedNode(const lemon::concepts::BaseBpGraphComponent::RedNode&)’ 337 | RedNode(const RedNode &) : Parent() {} | ^~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:456:16: warning: implicitly-declared ‘lemon::concepts::BaseBpGraphComponent::BlueNode& lemon::concepts::BaseBpGraphComponent::BlueNode::operator=(const lemon::concepts::BaseBpGraphComponent::BlueNode&)’ is deprecated [-Wdeprecated-copy] 456 | bn = bpgraph.asBlueNodeUnsafe(bnan); /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:366:9: note: because ‘lemon::concepts::BaseBpGraphComponent::BlueNode’ has user-provided ‘lemon::concepts::BaseBpGraphComponent::BlueNode::BlueNode(const lemon::concepts::BaseBpGraphComponent::BlueNode&)’ 366 | BlueNode(const BlueNode &) : Parent() {} | ^~~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:457:16: warning: implicitly-declared ‘lemon::concepts::BaseBpGraphComponent::RedNode& lemon::concepts::BaseBpGraphComponent::RedNode::operator=(const lemon::concepts::BaseBpGraphComponent::RedNode&)’ is deprecated [-Wdeprecated-copy] 457 | rn = bpgraph.asRedNode(rnan); /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:337:9: note: because ‘lemon::concepts::BaseBpGraphComponent::RedNode’ has user-provided ‘lemon::concepts::BaseBpGraphComponent::RedNode::RedNode(const lemon::concepts::BaseBpGraphComponent::RedNode&)’ 337 | RedNode(const RedNode &) : Parent() {} | ^~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:458:16: warning: implicitly-declared ‘lemon::concepts::BaseBpGraphComponent::BlueNode& lemon::concepts::BaseBpGraphComponent::BlueNode::operator=(const lemon::concepts::BaseBpGraphComponent::BlueNode&)’ is deprecated [-Wdeprecated-copy] 458 | bn = bpgraph.asBlueNode(bnan); /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:366:9: note: because ‘lemon::concepts::BaseBpGraphComponent::BlueNode’ has user-provided ‘lemon::concepts::BaseBpGraphComponent::BlueNode::BlueNode(const lemon::concepts::BaseBpGraphComponent::BlueNode&)’ 366 | BlueNode(const BlueNode &) : Parent() {} | ^~~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::BaseBpGraphComponent::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::BpGraph]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseBpGraphComponent; Type = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:1016:55: required from ‘void lemon::concepts::BpGraph::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BpGraph; Type = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:349:36: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:453:16: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::RedNode& lemon::concepts::BpGraph::RedNode::operator=(const lemon::concepts::BpGraph::RedNode&)’ is deprecated [-Wdeprecated-copy] 453 | rn = bpgraph.redNode(e); In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:144:9: note: because ‘lemon::concepts::BpGraph::RedNode’ has user-provided ‘lemon::concepts::BpGraph::RedNode::RedNode(const lemon::concepts::BpGraph::RedNode&)’ 144 | RedNode(const RedNode&) : Node() { } | ^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:454:16: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::BlueNode& lemon::concepts::BpGraph::BlueNode::operator=(const lemon::concepts::BpGraph::BlueNode&)’ is deprecated [-Wdeprecated-copy] 454 | bn = bpgraph.blueNode(e); In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:171:9: note: because ‘lemon::concepts::BpGraph::BlueNode’ has user-provided ‘lemon::concepts::BpGraph::BlueNode::BlueNode(const lemon::concepts::BpGraph::BlueNode&)’ 171 | BlueNode(const BlueNode&) : Node() { } | ^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:455:16: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::RedNode& lemon::concepts::BpGraph::RedNode::operator=(const lemon::concepts::BpGraph::RedNode&)’ is deprecated [-Wdeprecated-copy] 455 | rn = bpgraph.asRedNodeUnsafe(rnan); In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:144:9: note: because ‘lemon::concepts::BpGraph::RedNode’ has user-provided ‘lemon::concepts::BpGraph::RedNode::RedNode(const lemon::concepts::BpGraph::RedNode&)’ 144 | RedNode(const RedNode&) : Node() { } | ^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:456:16: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::BlueNode& lemon::concepts::BpGraph::BlueNode::operator=(const lemon::concepts::BpGraph::BlueNode&)’ is deprecated [-Wdeprecated-copy] 456 | bn = bpgraph.asBlueNodeUnsafe(bnan); In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:171:9: note: because ‘lemon::concepts::BpGraph::BlueNode’ has user-provided ‘lemon::concepts::BpGraph::BlueNode::BlueNode(const lemon::concepts::BpGraph::BlueNode&)’ 171 | BlueNode(const BlueNode&) : Node() { } | ^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:457:16: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::RedNode& lemon::concepts::BpGraph::RedNode::operator=(const lemon::concepts::BpGraph::RedNode&)’ is deprecated [-Wdeprecated-copy] 457 | rn = bpgraph.asRedNode(rnan); In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:144:9: note: because ‘lemon::concepts::BpGraph::RedNode’ has user-provided ‘lemon::concepts::BpGraph::RedNode::RedNode(const lemon::concepts::BpGraph::RedNode&)’ 144 | RedNode(const RedNode&) : Node() { } | ^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:458:16: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::BlueNode& lemon::concepts::BpGraph::BlueNode::operator=(const lemon::concepts::BpGraph::BlueNode&)’ is deprecated [-Wdeprecated-copy] 458 | bn = bpgraph.asBlueNode(bnan); In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:171:9: note: because ‘lemon::concepts::BpGraph::BlueNode’ has user-provided ‘lemon::concepts::BpGraph::BlueNode::BlueNode(const lemon::concepts::BpGraph::BlueNode&)’ 171 | BlueNode(const BlueNode&) : Node() { } | ^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::BaseBpGraphComponent::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::SmartBpGraph]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseBpGraphComponent; Type = lemon::SmartBpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:1016:55: required from ‘void lemon::concepts::BpGraph::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::SmartBpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BpGraph; Type = lemon::SmartBpGraph]’ /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:352:41: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:453:16: warning: implicitly-declared ‘constexpr lemon::SmartBpGraphBase::RedNode& lemon::SmartBpGraphBase::RedNode::operator=(const lemon::SmartBpGraphBase::RedNode&)’ is deprecated [-Wdeprecated-copy] 453 | rn = bpgraph.redNode(e); In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:21: /<>/liblemon-1.3.1+dfsg/lemon/smart_graph.h:865:7: note: because ‘lemon::SmartBpGraphBase::RedNode’ has user-provided ‘lemon::SmartBpGraphBase::RedNode::RedNode(const lemon::SmartBpGraphBase::RedNode&)’ 865 | RedNode(const RedNode& node) : Node(node) {} | ^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:454:16: warning: implicitly-declared ‘constexpr lemon::SmartBpGraphBase::BlueNode& lemon::SmartBpGraphBase::BlueNode::operator=(const lemon::SmartBpGraphBase::BlueNode&)’ is deprecated [-Wdeprecated-copy] 454 | bn = bpgraph.blueNode(e); In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:21: /<>/liblemon-1.3.1+dfsg/lemon/smart_graph.h:877:7: note: because ‘lemon::SmartBpGraphBase::BlueNode’ has user-provided ‘lemon::SmartBpGraphBase::BlueNode::BlueNode(const lemon::SmartBpGraphBase::BlueNode&)’ 877 | BlueNode(const BlueNode& node) : Node(node) {} | ^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:455:16: warning: implicitly-declared ‘constexpr lemon::SmartBpGraphBase::RedNode& lemon::SmartBpGraphBase::RedNode::operator=(const lemon::SmartBpGraphBase::RedNode&)’ is deprecated [-Wdeprecated-copy] 455 | rn = bpgraph.asRedNodeUnsafe(rnan); In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:21: /<>/liblemon-1.3.1+dfsg/lemon/smart_graph.h:865:7: note: because ‘lemon::SmartBpGraphBase::RedNode’ has user-provided ‘lemon::SmartBpGraphBase::RedNode::RedNode(const lemon::SmartBpGraphBase::RedNode&)’ 865 | RedNode(const RedNode& node) : Node(node) {} | ^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:456:16: warning: implicitly-declared ‘constexpr lemon::SmartBpGraphBase::BlueNode& lemon::SmartBpGraphBase::BlueNode::operator=(const lemon::SmartBpGraphBase::BlueNode&)’ is deprecated [-Wdeprecated-copy] 456 | bn = bpgraph.asBlueNodeUnsafe(bnan); In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:21: /<>/liblemon-1.3.1+dfsg/lemon/smart_graph.h:877:7: note: because ‘lemon::SmartBpGraphBase::BlueNode’ has user-provided ‘lemon::SmartBpGraphBase::BlueNode::BlueNode(const lemon::SmartBpGraphBase::BlueNode&)’ 877 | BlueNode(const BlueNode& node) : Node(node) {} | ^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:457:16: warning: implicitly-declared ‘constexpr lemon::SmartBpGraphBase::RedNode& lemon::SmartBpGraphBase::RedNode::operator=(const lemon::SmartBpGraphBase::RedNode&)’ is deprecated [-Wdeprecated-copy] 457 | rn = bpgraph.asRedNode(rnan); In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:21: /<>/liblemon-1.3.1+dfsg/lemon/smart_graph.h:865:7: note: because ‘lemon::SmartBpGraphBase::RedNode’ has user-provided ‘lemon::SmartBpGraphBase::RedNode::RedNode(const lemon::SmartBpGraphBase::RedNode&)’ 865 | RedNode(const RedNode& node) : Node(node) {} | ^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:458:16: warning: implicitly-declared ‘constexpr lemon::SmartBpGraphBase::BlueNode& lemon::SmartBpGraphBase::BlueNode::operator=(const lemon::SmartBpGraphBase::BlueNode&)’ is deprecated [-Wdeprecated-copy] 458 | bn = bpgraph.asBlueNode(bnan); In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:21: /<>/liblemon-1.3.1+dfsg/lemon/smart_graph.h:877:7: note: because ‘lemon::SmartBpGraphBase::BlueNode’ has user-provided ‘lemon::SmartBpGraphBase::BlueNode::BlueNode(const lemon::SmartBpGraphBase::BlueNode&)’ 877 | BlueNode(const BlueNode& node) : Node(node) {} | ^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItem::Constraints<_GraphItem>::constraints() [with _GraphItem = lemon::concepts::BaseGraphComponent::Edge; char sel = 'e']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItem<'e'>; Type = lemon::concepts::BaseGraphComponent::Edge]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:279:45: required from ‘void lemon::concepts::BaseGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::BaseBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseGraphComponent; Type = lemon::concepts::BaseBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:440:53: required from ‘void lemon::concepts::BaseBpGraphComponent::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::BaseBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseBpGraphComponent; Type = lemon::concepts::BaseBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:324:63: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:104:13: warning: implicitly-declared ‘lemon::concepts::BaseGraphComponent::Edge& lemon::concepts::BaseGraphComponent::Edge::operator=(const lemon::concepts::BaseGraphComponent::Edge&)’ is deprecated [-Wdeprecated-copy] 104 | i1=INVALID; | ~~^~~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:219:9: note: because ‘lemon::concepts::BaseGraphComponent::Edge’ has user-provided ‘lemon::concepts::BaseGraphComponent::Edge::Edge(const lemon::concepts::BaseGraphComponent::Edge&)’ 219 | Edge(const Edge &) : Parent() {} | ^~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:19: warning: implicitly-declared ‘lemon::concepts::BaseGraphComponent::Edge& lemon::concepts::BaseGraphComponent::Edge::operator=(const lemon::concepts::BaseGraphComponent::Edge&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:219:9: note: because ‘lemon::concepts::BaseGraphComponent::Edge’ has user-provided ‘lemon::concepts::BaseGraphComponent::Edge::Edge(const lemon::concepts::BaseGraphComponent::Edge&)’ 219 | Edge(const Edge &) : Parent() {} | ^~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:14: warning: implicitly-declared ‘lemon::concepts::BaseGraphComponent::Edge& lemon::concepts::BaseGraphComponent::Edge::operator=(const lemon::concepts::BaseGraphComponent::Edge&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:219:9: note: because ‘lemon::concepts::BaseGraphComponent::Edge’ has user-provided ‘lemon::concepts::BaseGraphComponent::Edge::Edge(const lemon::concepts::BaseGraphComponent::Edge&)’ 219 | Edge(const Edge &) : Parent() {} | ^~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItemIt::Constraints<_GraphItemIt>::constraints() [with _GraphItemIt = lemon::concepts::GraphItemIt, lemon::concepts::BaseGraphComponent::Edge>; GR = lemon::concepts::IterableBpGraphComponent<>; Item = lemon::concepts::BaseGraphComponent::Edge]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItemIt, lemon::concepts::BaseGraphComponent::Edge>; Type = lemon::concepts::GraphItemIt, lemon::concepts::BaseGraphComponent::Edge>]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1121:40: required from ‘void lemon::concepts::IterableGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::IterableBpGraphComponent<>; BAS = lemon::concepts::BaseBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableGraphComponent; Type = lemon::concepts::IterableBpGraphComponent<>]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1209:63: required from ‘void lemon::concepts::IterableBpGraphComponent::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::IterableBpGraphComponent<>; BAS = lemon::concepts::BaseBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableBpGraphComponent<>; Type = lemon::concepts::IterableBpGraphComponent<>]’ /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:330:36: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:737:14: warning: implicitly-declared ‘lemon::concepts::BaseGraphComponent::Edge& lemon::concepts::BaseGraphComponent::Edge::operator=(const lemon::concepts::BaseGraphComponent::Edge&)’ is deprecated [-Wdeprecated-copy] 737 | bi = it2; | ~~~^~~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:219:9: note: because ‘lemon::concepts::BaseGraphComponent::Edge’ has user-provided ‘lemon::concepts::BaseGraphComponent::Edge::Edge(const lemon::concepts::BaseGraphComponent::Edge&)’ 219 | Edge(const Edge &) : Parent() {} | ^~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphIncIt::Constraints<_GraphIncIt>::constraints() [with _GraphIncIt = lemon::concepts::GraphIncIt, lemon::concepts::BaseGraphComponent::Edge, lemon::concepts::GraphItem<'n'>, 'e'>; GR = lemon::concepts::IterableBpGraphComponent<>; Item = lemon::concepts::BaseGraphComponent::Edge; Base = lemon::concepts::GraphItem<'n'>; char sel = 'e']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphIncIt, lemon::concepts::BaseGraphComponent::Edge, lemon::concepts::GraphItem<'n'>, 'e'>; Type = lemon::concepts::GraphIncIt, lemon::concepts::BaseGraphComponent::Edge, lemon::concepts::GraphItem<'n'>, 'e'>]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1123:71: required from ‘void lemon::concepts::IterableGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::IterableBpGraphComponent<>; BAS = lemon::concepts::BaseBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableGraphComponent; Type = lemon::concepts::IterableBpGraphComponent<>]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1209:63: required from ‘void lemon::concepts::IterableBpGraphComponent::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::IterableBpGraphComponent<>; BAS = lemon::concepts::BaseBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableBpGraphComponent<>; Type = lemon::concepts::IterableBpGraphComponent<>]’ /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:330:36: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:827:13: warning: implicitly-declared ‘lemon::concepts::BaseGraphComponent::Edge& lemon::concepts::BaseGraphComponent::Edge::operator=(const lemon::concepts::BaseGraphComponent::Edge&)’ is deprecated [-Wdeprecated-copy] 827 | e = it2; | ~~^~~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:219:9: note: because ‘lemon::concepts::BaseGraphComponent::Edge’ has user-provided ‘lemon::concepts::BaseGraphComponent::Edge::Edge(const lemon::concepts::BaseGraphComponent::Edge&)’ 219 | Edge(const Edge &) : Parent() {} | ^~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::BaseGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::ExtendableBpGraphComponent<>]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseGraphComponent; Type = lemon::concepts::ExtendableBpGraphComponent<>]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:440:53: required from ‘void lemon::concepts::BaseBpGraphComponent::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::ExtendableBpGraphComponent<>]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseBpGraphComponent; Type = lemon::concepts::ExtendableBpGraphComponent<>]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1980:39: required from ‘void lemon::concepts::ExtendableBpGraphComponent::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::ExtendableBpGraphComponent<>; BAS = lemon::concepts::BaseBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::ExtendableBpGraphComponent<>; Type = lemon::concepts::ExtendableBpGraphComponent<>]’ /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:339:38: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:290:16: warning: implicitly-declared ‘lemon::concepts::BaseGraphComponent::Edge& lemon::concepts::BaseGraphComponent::Edge::operator=(const lemon::concepts::BaseGraphComponent::Edge&)’ is deprecated [-Wdeprecated-copy] 290 | ue = e; | ~~~^~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:219:9: note: because ‘lemon::concepts::BaseGraphComponent::Edge’ has user-provided ‘lemon::concepts::BaseGraphComponent::Edge::Edge(const lemon::concepts::BaseGraphComponent::Edge&)’ 219 | Edge(const Edge &) : Parent() {} | ^~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::BaseGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::ErasableBpGraphComponent<>]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseGraphComponent; Type = lemon::concepts::ErasableBpGraphComponent<>]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:440:53: required from ‘void lemon::concepts::BaseBpGraphComponent::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::ErasableBpGraphComponent<>]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseBpGraphComponent; Type = lemon::concepts::ErasableBpGraphComponent<>]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:2062:37: required from ‘void lemon::concepts::ErasableGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::ErasableBpGraphComponent<>; BAS = lemon::concepts::BaseBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::ErasableBpGraphComponent<>; Type = lemon::concepts::ErasableBpGraphComponent<>]’ /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:342:36: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:290:16: warning: implicitly-declared ‘lemon::concepts::BaseGraphComponent::Edge& lemon::concepts::BaseGraphComponent::Edge::operator=(const lemon::concepts::BaseGraphComponent::Edge&)’ is deprecated [-Wdeprecated-copy] 290 | ue = e; | ~~~^~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:219:9: note: because ‘lemon::concepts::BaseGraphComponent::Edge’ has user-provided ‘lemon::concepts::BaseGraphComponent::Edge::Edge(const lemon::concepts::BaseGraphComponent::Edge&)’ 219 | Edge(const Edge &) : Parent() {} | ^~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::BaseGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::ClearableBpGraphComponent<>]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseGraphComponent; Type = lemon::concepts::ClearableBpGraphComponent<>]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:440:53: required from ‘void lemon::concepts::BaseBpGraphComponent::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::ClearableBpGraphComponent<>]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseBpGraphComponent; Type = lemon::concepts::ClearableBpGraphComponent<>]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:2103:39: required from ‘void lemon::concepts::ClearableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::ClearableBpGraphComponent<>; BAS = lemon::concepts::BaseBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::ClearableBpGraphComponent<>; Type = lemon::concepts::ClearableBpGraphComponent<>]’ /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:345:37: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:290:16: warning: implicitly-declared ‘lemon::concepts::BaseGraphComponent::Edge& lemon::concepts::BaseGraphComponent::Edge::operator=(const lemon::concepts::BaseGraphComponent::Edge&)’ is deprecated [-Wdeprecated-copy] 290 | ue = e; | ~~~^~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:219:9: note: because ‘lemon::concepts::BaseGraphComponent::Edge’ has user-provided ‘lemon::concepts::BaseGraphComponent::Edge::Edge(const lemon::concepts::BaseGraphComponent::Edge&)’ 219 | Edge(const Edge &) : Parent() {} | ^~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::BaseGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::BpGraph]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseGraphComponent; Type = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:440:53: required from ‘void lemon::concepts::BaseBpGraphComponent::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseBpGraphComponent; Type = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:1016:55: required from ‘void lemon::concepts::BpGraph::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BpGraph; Type = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:349:36: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:284:15: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::Node& lemon::concepts::BpGraph::Node::operator=(const lemon::concepts::BpGraph::Node&)’ is deprecated [-Wdeprecated-copy] 284 | n = graph.u(ue); In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:96:9: note: because ‘lemon::concepts::BpGraph::Node’ has user-provided ‘lemon::concepts::BpGraph::Node::Node(const lemon::concepts::BpGraph::Node&)’ 96 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:285:15: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::Node& lemon::concepts::BpGraph::Node::operator=(const lemon::concepts::BpGraph::Node&)’ is deprecated [-Wdeprecated-copy] 285 | n = graph.v(ue); In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:96:9: note: because ‘lemon::concepts::BpGraph::Node’ has user-provided ‘lemon::concepts::BpGraph::Node::Node(const lemon::concepts::BpGraph::Node&)’ 96 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:286:15: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::Arc& lemon::concepts::BpGraph::Arc::operator=(const lemon::concepts::BpGraph::Arc&)’ is deprecated [-Wdeprecated-copy] 286 | e = graph.direct(ue, true); In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:462:9: note: because ‘lemon::concepts::BpGraph::Arc’ has user-provided ‘lemon::concepts::BpGraph::Arc::Arc(const lemon::concepts::BpGraph::Arc&)’ 462 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:287:15: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::Arc& lemon::concepts::BpGraph::Arc::operator=(const lemon::concepts::BpGraph::Arc&)’ is deprecated [-Wdeprecated-copy] 287 | e = graph.direct(ue, false); In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:462:9: note: because ‘lemon::concepts::BpGraph::Arc’ has user-provided ‘lemon::concepts::BpGraph::Arc::Arc(const lemon::concepts::BpGraph::Arc&)’ 462 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:288:15: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::Arc& lemon::concepts::BpGraph::Arc::operator=(const lemon::concepts::BpGraph::Arc&)’ is deprecated [-Wdeprecated-copy] 288 | e = graph.direct(ue, n); In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:462:9: note: because ‘lemon::concepts::BpGraph::Arc’ has user-provided ‘lemon::concepts::BpGraph::Arc::Arc(const lemon::concepts::BpGraph::Arc&)’ 462 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:289:15: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::Arc& lemon::concepts::BpGraph::Arc::operator=(const lemon::concepts::BpGraph::Arc&)’ is deprecated [-Wdeprecated-copy] 289 | e = graph.oppositeArc(e); In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:462:9: note: because ‘lemon::concepts::BpGraph::Arc’ has user-provided ‘lemon::concepts::BpGraph::Arc::Arc(const lemon::concepts::BpGraph::Arc&)’ 462 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:290:16: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::Edge& lemon::concepts::BpGraph::Edge::operator=(const lemon::concepts::BpGraph::Edge&)’ is deprecated [-Wdeprecated-copy] 290 | ue = e; | ~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:327:9: note: because ‘lemon::concepts::BpGraph::Edge’ has user-provided ‘lemon::concepts::BpGraph::Edge::Edge(const lemon::concepts::BpGraph::Edge&)’ 327 | Edge(const Edge&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItem::Constraints<_GraphItem>::constraints() [with _GraphItem = lemon::concepts::BpGraph::RedNode; char sel = 'n']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItem<'n'>; Type = lemon::concepts::BpGraph::RedNode]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:441:48: required from ‘void lemon::concepts::BaseBpGraphComponent::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseBpGraphComponent; Type = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:1016:55: required from ‘void lemon::concepts::BpGraph::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BpGraph; Type = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:349:36: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:104:13: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::RedNode& lemon::concepts::BpGraph::RedNode::operator=(const lemon::concepts::BpGraph::RedNode&)’ is deprecated [-Wdeprecated-copy] 104 | i1=INVALID; | ~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:144:9: note: because ‘lemon::concepts::BpGraph::RedNode’ has user-provided ‘lemon::concepts::BpGraph::RedNode::RedNode(const lemon::concepts::BpGraph::RedNode&)’ 144 | RedNode(const RedNode&) : Node() { } | ^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:19: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::RedNode& lemon::concepts::BpGraph::RedNode::operator=(const lemon::concepts::BpGraph::RedNode&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:144:9: note: because ‘lemon::concepts::BpGraph::RedNode’ has user-provided ‘lemon::concepts::BpGraph::RedNode::RedNode(const lemon::concepts::BpGraph::RedNode&)’ 144 | RedNode(const RedNode&) : Node() { } | ^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:14: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::RedNode& lemon::concepts::BpGraph::RedNode::operator=(const lemon::concepts::BpGraph::RedNode&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:144:9: note: because ‘lemon::concepts::BpGraph::RedNode’ has user-provided ‘lemon::concepts::BpGraph::RedNode::RedNode(const lemon::concepts::BpGraph::RedNode&)’ 144 | RedNode(const RedNode&) : Node() { } | ^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItem::Constraints<_GraphItem>::constraints() [with _GraphItem = lemon::concepts::BpGraph::BlueNode; char sel = 'n']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItem<'n'>; Type = lemon::concepts::BpGraph::BlueNode]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:442:49: required from ‘void lemon::concepts::BaseBpGraphComponent::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseBpGraphComponent; Type = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:1016:55: required from ‘void lemon::concepts::BpGraph::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BpGraph; Type = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:349:36: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:104:13: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::BlueNode& lemon::concepts::BpGraph::BlueNode::operator=(const lemon::concepts::BpGraph::BlueNode&)’ is deprecated [-Wdeprecated-copy] 104 | i1=INVALID; | ~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:171:9: note: because ‘lemon::concepts::BpGraph::BlueNode’ has user-provided ‘lemon::concepts::BpGraph::BlueNode::BlueNode(const lemon::concepts::BpGraph::BlueNode&)’ 171 | BlueNode(const BlueNode&) : Node() { } | ^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:19: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::BlueNode& lemon::concepts::BpGraph::BlueNode::operator=(const lemon::concepts::BpGraph::BlueNode&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:171:9: note: because ‘lemon::concepts::BpGraph::BlueNode’ has user-provided ‘lemon::concepts::BpGraph::BlueNode::BlueNode(const lemon::concepts::BpGraph::BlueNode&)’ 171 | BlueNode(const BlueNode&) : Node() { } | ^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:14: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::BlueNode& lemon::concepts::BpGraph::BlueNode::operator=(const lemon::concepts::BpGraph::BlueNode&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:171:9: note: because ‘lemon::concepts::BpGraph::BlueNode’ has user-provided ‘lemon::concepts::BpGraph::BlueNode::BlueNode(const lemon::concepts::BpGraph::BlueNode&)’ 171 | BlueNode(const BlueNode&) : Node() { } | ^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::IterableGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::BpGraph; BAS = lemon::concepts::BaseBpGraphComponent]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableGraphComponent; Type = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1209:63: required from ‘void lemon::concepts::IterableBpGraphComponent::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::BpGraph; BAS = lemon::concepts::BaseBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableBpGraphComponent<>; Type = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:1017:61: required from ‘void lemon::concepts::BpGraph::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BpGraph; Type = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:349:36: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1127:15: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::Node& lemon::concepts::BpGraph::Node::operator=(const lemon::concepts::BpGraph::Node&)’ is deprecated [-Wdeprecated-copy] 1127 | n = graph.baseNode(ieit); In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:96:9: note: because ‘lemon::concepts::BpGraph::Node’ has user-provided ‘lemon::concepts::BpGraph::Node::Node(const lemon::concepts::BpGraph::Node&)’ 96 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1128:15: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::Node& lemon::concepts::BpGraph::Node::operator=(const lemon::concepts::BpGraph::Node&)’ is deprecated [-Wdeprecated-copy] 1128 | n = graph.runningNode(ieit); In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:96:9: note: because ‘lemon::concepts::BpGraph::Node’ has user-provided ‘lemon::concepts::BpGraph::Node::Node(const lemon::concepts::BpGraph::Node&)’ 96 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItemIt::Constraints<_GraphItemIt>::constraints() [with _GraphItemIt = lemon::concepts::BpGraph::RedNodeIt; GR = lemon::concepts::BpGraph; Item = lemon::concepts::BpGraph::RedNode]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItemIt; Type = lemon::concepts::BpGraph::RedNodeIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1219:42: required from ‘void lemon::concepts::IterableBpGraphComponent::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::BpGraph; BAS = lemon::concepts::BaseBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableBpGraphComponent<>; Type = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:1017:61: required from ‘void lemon::concepts::BpGraph::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BpGraph; Type = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:349:36: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:732:15: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::RedNodeIt& lemon::concepts::BpGraph::RedNodeIt::operator=(const lemon::concepts::BpGraph::RedNodeIt&)’ is deprecated [-Wdeprecated-copy] 732 | it2 = ++it1; | ~~~~^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:201:9: note: because ‘lemon::concepts::BpGraph::RedNodeIt’ has user-provided ‘lemon::concepts::BpGraph::RedNodeIt::RedNodeIt(const lemon::concepts::BpGraph::RedNodeIt&)’ 201 | RedNodeIt(const RedNodeIt& n) : RedNode(n) { } | ^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:733:17: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::RedNodeIt& lemon::concepts::BpGraph::RedNodeIt::operator=(const lemon::concepts::BpGraph::RedNodeIt&)’ is deprecated [-Wdeprecated-copy] 733 | ++it2 = it1; | ~~~~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:201:9: note: because ‘lemon::concepts::BpGraph::RedNodeIt’ has user-provided ‘lemon::concepts::BpGraph::RedNodeIt::RedNodeIt(const lemon::concepts::BpGraph::RedNodeIt&)’ 201 | RedNodeIt(const RedNodeIt& n) : RedNode(n) { } | ^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:737:14: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::RedNode& lemon::concepts::BpGraph::RedNode::operator=(const lemon::concepts::BpGraph::RedNode&)’ is deprecated [-Wdeprecated-copy] 737 | bi = it2; | ~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:144:9: note: because ‘lemon::concepts::BpGraph::RedNode’ has user-provided ‘lemon::concepts::BpGraph::RedNode::RedNode(const lemon::concepts::BpGraph::RedNode&)’ 144 | RedNode(const RedNode&) : Node() { } | ^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItemIt::Constraints<_GraphItemIt>::constraints() [with _GraphItemIt = lemon::concepts::BpGraph::BlueNodeIt; GR = lemon::concepts::BpGraph; Item = lemon::concepts::BpGraph::BlueNode]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItemIt; Type = lemon::concepts::BpGraph::BlueNodeIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1221:43: required from ‘void lemon::concepts::IterableBpGraphComponent::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::BpGraph; BAS = lemon::concepts::BaseBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableBpGraphComponent<>; Type = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:1017:61: required from ‘void lemon::concepts::BpGraph::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BpGraph; Type = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:349:36: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:732:15: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::BlueNodeIt& lemon::concepts::BpGraph::BlueNodeIt::operator=(const lemon::concepts::BpGraph::BlueNodeIt&)’ is deprecated [-Wdeprecated-copy] 732 | it2 = ++it1; | ~~~~^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:244:9: note: because ‘lemon::concepts::BpGraph::BlueNodeIt’ has user-provided ‘lemon::concepts::BpGraph::BlueNodeIt::BlueNodeIt(const lemon::concepts::BpGraph::BlueNodeIt&)’ 244 | BlueNodeIt(const BlueNodeIt& n) : BlueNode(n) { } | ^~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:733:17: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::BlueNodeIt& lemon::concepts::BpGraph::BlueNodeIt::operator=(const lemon::concepts::BpGraph::BlueNodeIt&)’ is deprecated [-Wdeprecated-copy] 733 | ++it2 = it1; | ~~~~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:244:9: note: because ‘lemon::concepts::BpGraph::BlueNodeIt’ has user-provided ‘lemon::concepts::BpGraph::BlueNodeIt::BlueNodeIt(const lemon::concepts::BpGraph::BlueNodeIt&)’ 244 | BlueNodeIt(const BlueNodeIt& n) : BlueNode(n) { } | ^~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:737:14: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::BlueNode& lemon::concepts::BpGraph::BlueNode::operator=(const lemon::concepts::BpGraph::BlueNode&)’ is deprecated [-Wdeprecated-copy] 737 | bi = it2; | ~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:171:9: note: because ‘lemon::concepts::BpGraph::BlueNode’ has user-provided ‘lemon::concepts::BpGraph::BlueNode::BlueNode(const lemon::concepts::BpGraph::BlueNode&)’ 171 | BlueNode(const BlueNode&) : Node() { } | ^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::IDableGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::BpGraph; BAS = lemon::concepts::BaseBpGraphComponent]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IDableGraphComponent; Type = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:648:61: required from ‘void lemon::concepts::IDableBpGraphComponent::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::BpGraph; BAS = lemon::concepts::BaseBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IDableBpGraphComponent<>; Type = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:1018:59: required from ‘void lemon::concepts::BpGraph::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BpGraph; Type = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:349:36: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:590:16: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::Edge& lemon::concepts::BpGraph::Edge::operator=(const lemon::concepts::BpGraph::Edge&)’ is deprecated [-Wdeprecated-copy] 590 | edge = graph.edgeFromId(ueid); In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:327:9: note: because ‘lemon::concepts::BpGraph::Edge’ has user-provided ‘lemon::concepts::BpGraph::Edge::Edge(const lemon::concepts::BpGraph::Edge&)’ 327 | Edge(const Edge&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItem::Constraints<_GraphItem>::constraints() [with _GraphItem = lemon::SmartBpGraphBase::RedNode; char sel = 'n']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItem<'n'>; Type = lemon::SmartBpGraphBase::RedNode]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:441:48: required from ‘void lemon::concepts::BaseBpGraphComponent::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::SmartBpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseBpGraphComponent; Type = lemon::SmartBpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:1016:55: required from ‘void lemon::concepts::BpGraph::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::SmartBpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BpGraph; Type = lemon::SmartBpGraph]’ /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:352:41: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:104:13: warning: implicitly-declared ‘constexpr lemon::SmartBpGraphBase::RedNode& lemon::SmartBpGraphBase::RedNode::operator=(const lemon::SmartBpGraphBase::RedNode&)’ is deprecated [-Wdeprecated-copy] 104 | i1=INVALID; | ~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:21: /<>/liblemon-1.3.1+dfsg/lemon/smart_graph.h:865:7: note: because ‘lemon::SmartBpGraphBase::RedNode’ has user-provided ‘lemon::SmartBpGraphBase::RedNode::RedNode(const lemon::SmartBpGraphBase::RedNode&)’ 865 | RedNode(const RedNode& node) : Node(node) {} | ^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:19: warning: implicitly-declared ‘constexpr lemon::SmartBpGraphBase::RedNode& lemon::SmartBpGraphBase::RedNode::operator=(const lemon::SmartBpGraphBase::RedNode&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:21: /<>/liblemon-1.3.1+dfsg/lemon/smart_graph.h:865:7: note: because ‘lemon::SmartBpGraphBase::RedNode’ has user-provided ‘lemon::SmartBpGraphBase::RedNode::RedNode(const lemon::SmartBpGraphBase::RedNode&)’ 865 | RedNode(const RedNode& node) : Node(node) {} | ^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:14: warning: implicitly-declared ‘constexpr lemon::SmartBpGraphBase::RedNode& lemon::SmartBpGraphBase::RedNode::operator=(const lemon::SmartBpGraphBase::RedNode&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:21: /<>/liblemon-1.3.1+dfsg/lemon/smart_graph.h:865:7: note: because ‘lemon::SmartBpGraphBase::RedNode’ has user-provided ‘lemon::SmartBpGraphBase::RedNode::RedNode(const lemon::SmartBpGraphBase::RedNode&)’ 865 | RedNode(const RedNode& node) : Node(node) {} | ^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItem::Constraints<_GraphItem>::constraints() [with _GraphItem = lemon::SmartBpGraphBase::BlueNode; char sel = 'n']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItem<'n'>; Type = lemon::SmartBpGraphBase::BlueNode]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:442:49: required from ‘void lemon::concepts::BaseBpGraphComponent::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::SmartBpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseBpGraphComponent; Type = lemon::SmartBpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:1016:55: required from ‘void lemon::concepts::BpGraph::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::SmartBpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BpGraph; Type = lemon::SmartBpGraph]’ /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:352:41: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:104:13: warning: implicitly-declared ‘constexpr lemon::SmartBpGraphBase::BlueNode& lemon::SmartBpGraphBase::BlueNode::operator=(const lemon::SmartBpGraphBase::BlueNode&)’ is deprecated [-Wdeprecated-copy] 104 | i1=INVALID; | ~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:21: /<>/liblemon-1.3.1+dfsg/lemon/smart_graph.h:877:7: note: because ‘lemon::SmartBpGraphBase::BlueNode’ has user-provided ‘lemon::SmartBpGraphBase::BlueNode::BlueNode(const lemon::SmartBpGraphBase::BlueNode&)’ 877 | BlueNode(const BlueNode& node) : Node(node) {} | ^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:19: warning: implicitly-declared ‘constexpr lemon::SmartBpGraphBase::BlueNode& lemon::SmartBpGraphBase::BlueNode::operator=(const lemon::SmartBpGraphBase::BlueNode&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:21: /<>/liblemon-1.3.1+dfsg/lemon/smart_graph.h:877:7: note: because ‘lemon::SmartBpGraphBase::BlueNode’ has user-provided ‘lemon::SmartBpGraphBase::BlueNode::BlueNode(const lemon::SmartBpGraphBase::BlueNode&)’ 877 | BlueNode(const BlueNode& node) : Node(node) {} | ^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:14: warning: implicitly-declared ‘constexpr lemon::SmartBpGraphBase::BlueNode& lemon::SmartBpGraphBase::BlueNode::operator=(const lemon::SmartBpGraphBase::BlueNode&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:21: /<>/liblemon-1.3.1+dfsg/lemon/smart_graph.h:877:7: note: because ‘lemon::SmartBpGraphBase::BlueNode’ has user-provided ‘lemon::SmartBpGraphBase::BlueNode::BlueNode(const lemon::SmartBpGraphBase::BlueNode&)’ 877 | BlueNode(const BlueNode& node) : Node(node) {} | ^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItemIt::Constraints<_GraphItemIt>::constraints() [with _GraphItemIt = lemon::BpGraphExtender::RedNodeIt; GR = lemon::SmartBpGraph; Item = lemon::SmartBpGraphBase::RedNode]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItemIt; Type = lemon::BpGraphExtender::RedNodeIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1219:42: required from ‘void lemon::concepts::IterableBpGraphComponent::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::SmartBpGraph; BAS = lemon::concepts::BaseBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableBpGraphComponent<>; Type = lemon::SmartBpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:1017:61: required from ‘void lemon::concepts::BpGraph::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::SmartBpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BpGraph; Type = lemon::SmartBpGraph]’ /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:352:41: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:737:14: warning: implicitly-declared ‘constexpr lemon::SmartBpGraphBase::RedNode& lemon::SmartBpGraphBase::RedNode::operator=(const lemon::SmartBpGraphBase::RedNode&)’ is deprecated [-Wdeprecated-copy] 737 | bi = it2; | ~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:21: /<>/liblemon-1.3.1+dfsg/lemon/smart_graph.h:865:7: note: because ‘lemon::SmartBpGraphBase::RedNode’ has user-provided ‘lemon::SmartBpGraphBase::RedNode::RedNode(const lemon::SmartBpGraphBase::RedNode&)’ 865 | RedNode(const RedNode& node) : Node(node) {} | ^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItemIt::Constraints<_GraphItemIt>::constraints() [with _GraphItemIt = lemon::BpGraphExtender::BlueNodeIt; GR = lemon::SmartBpGraph; Item = lemon::SmartBpGraphBase::BlueNode]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItemIt; Type = lemon::BpGraphExtender::BlueNodeIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1221:43: required from ‘void lemon::concepts::IterableBpGraphComponent::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::SmartBpGraph; BAS = lemon::concepts::BaseBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableBpGraphComponent<>; Type = lemon::SmartBpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:1017:61: required from ‘void lemon::concepts::BpGraph::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::SmartBpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BpGraph; Type = lemon::SmartBpGraph]’ /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:352:41: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:737:14: warning: implicitly-declared ‘constexpr lemon::SmartBpGraphBase::BlueNode& lemon::SmartBpGraphBase::BlueNode::operator=(const lemon::SmartBpGraphBase::BlueNode&)’ is deprecated [-Wdeprecated-copy] 737 | bi = it2; | ~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:21: /<>/liblemon-1.3.1+dfsg/lemon/smart_graph.h:877:7: note: because ‘lemon::SmartBpGraphBase::BlueNode’ has user-provided ‘lemon::SmartBpGraphBase::BlueNode::BlueNode(const lemon::SmartBpGraphBase::BlueNode&)’ 877 | BlueNode(const BlueNode& node) : Node(node) {} | ^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::BaseBpGraphComponent::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::IDableBpGraphComponent<>]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseBpGraphComponent; Type = lemon::concepts::IDableBpGraphComponent<>]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:524:40: required from ‘void lemon::concepts::IDableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::IDableBpGraphComponent<>; BAS = lemon::concepts::BaseBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IDableDigraphComponent; Type = lemon::concepts::IDableBpGraphComponent<>]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:586:62: required from ‘void lemon::concepts::IDableGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::IDableBpGraphComponent<>; BAS = lemon::concepts::BaseBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IDableGraphComponent; Type = lemon::concepts::IDableBpGraphComponent<>]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:648:61: required from ‘void lemon::concepts::IDableBpGraphComponent::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::IDableBpGraphComponent<>; BAS = lemon::concepts::BaseBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IDableBpGraphComponent<>; Type = lemon::concepts::IDableBpGraphComponent<>]’ /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:327:34: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:453:16: warning: implicitly-declared ‘lemon::concepts::BaseBpGraphComponent::RedNode& lemon::concepts::BaseBpGraphComponent::RedNode::operator=(const lemon::concepts::BaseBpGraphComponent::RedNode&)’ is deprecated [-Wdeprecated-copy] 453 | rn = bpgraph.redNode(e); /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:337:9: note: because ‘lemon::concepts::BaseBpGraphComponent::RedNode’ has user-provided ‘lemon::concepts::BaseBpGraphComponent::RedNode::RedNode(const lemon::concepts::BaseBpGraphComponent::RedNode&)’ 337 | RedNode(const RedNode &) : Parent() {} | ^~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:454:16: warning: implicitly-declared ‘lemon::concepts::BaseBpGraphComponent::BlueNode& lemon::concepts::BaseBpGraphComponent::BlueNode::operator=(const lemon::concepts::BaseBpGraphComponent::BlueNode&)’ is deprecated [-Wdeprecated-copy] 454 | bn = bpgraph.blueNode(e); /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:366:9: note: because ‘lemon::concepts::BaseBpGraphComponent::BlueNode’ has user-provided ‘lemon::concepts::BaseBpGraphComponent::BlueNode::BlueNode(const lemon::concepts::BaseBpGraphComponent::BlueNode&)’ 366 | BlueNode(const BlueNode &) : Parent() {} | ^~~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:455:16: warning: implicitly-declared ‘lemon::concepts::BaseBpGraphComponent::RedNode& lemon::concepts::BaseBpGraphComponent::RedNode::operator=(const lemon::concepts::BaseBpGraphComponent::RedNode&)’ is deprecated [-Wdeprecated-copy] 455 | rn = bpgraph.asRedNodeUnsafe(rnan); /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:337:9: note: because ‘lemon::concepts::BaseBpGraphComponent::RedNode’ has user-provided ‘lemon::concepts::BaseBpGraphComponent::RedNode::RedNode(const lemon::concepts::BaseBpGraphComponent::RedNode&)’ 337 | RedNode(const RedNode &) : Parent() {} | ^~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:456:16: warning: implicitly-declared ‘lemon::concepts::BaseBpGraphComponent::BlueNode& lemon::concepts::BaseBpGraphComponent::BlueNode::operator=(const lemon::concepts::BaseBpGraphComponent::BlueNode&)’ is deprecated [-Wdeprecated-copy] 456 | bn = bpgraph.asBlueNodeUnsafe(bnan); /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:366:9: note: because ‘lemon::concepts::BaseBpGraphComponent::BlueNode’ has user-provided ‘lemon::concepts::BaseBpGraphComponent::BlueNode::BlueNode(const lemon::concepts::BaseBpGraphComponent::BlueNode&)’ 366 | BlueNode(const BlueNode &) : Parent() {} | ^~~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:457:16: warning: implicitly-declared ‘lemon::concepts::BaseBpGraphComponent::RedNode& lemon::concepts::BaseBpGraphComponent::RedNode::operator=(const lemon::concepts::BaseBpGraphComponent::RedNode&)’ is deprecated [-Wdeprecated-copy] 457 | rn = bpgraph.asRedNode(rnan); /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:337:9: note: because ‘lemon::concepts::BaseBpGraphComponent::RedNode’ has user-provided ‘lemon::concepts::BaseBpGraphComponent::RedNode::RedNode(const lemon::concepts::BaseBpGraphComponent::RedNode&)’ 337 | RedNode(const RedNode &) : Parent() {} | ^~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:458:16: warning: implicitly-declared ‘lemon::concepts::BaseBpGraphComponent::BlueNode& lemon::concepts::BaseBpGraphComponent::BlueNode::operator=(const lemon::concepts::BaseBpGraphComponent::BlueNode&)’ is deprecated [-Wdeprecated-copy] 458 | bn = bpgraph.asBlueNode(bnan); /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:366:9: note: because ‘lemon::concepts::BaseBpGraphComponent::BlueNode’ has user-provided ‘lemon::concepts::BaseBpGraphComponent::BlueNode::BlueNode(const lemon::concepts::BaseBpGraphComponent::BlueNode&)’ 366 | BlueNode(const BlueNode &) : Parent() {} | ^~~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::BaseBpGraphComponent::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::IterableBpGraphComponent<>]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseBpGraphComponent; Type = lemon::concepts::IterableBpGraphComponent<>]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:963:39: required from ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::IterableBpGraphComponent<>; BAS = lemon::concepts::BaseBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent; Type = lemon::concepts::IterableBpGraphComponent<>]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1102:63: required from ‘void lemon::concepts::IterableGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::IterableBpGraphComponent<>; BAS = lemon::concepts::BaseBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableGraphComponent; Type = lemon::concepts::IterableBpGraphComponent<>]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1209:63: required from ‘void lemon::concepts::IterableBpGraphComponent::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::IterableBpGraphComponent<>; BAS = lemon::concepts::BaseBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableBpGraphComponent<>; Type = lemon::concepts::IterableBpGraphComponent<>]’ /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:330:36: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:453:16: warning: implicitly-declared ‘lemon::concepts::BaseBpGraphComponent::RedNode& lemon::concepts::BaseBpGraphComponent::RedNode::operator=(const lemon::concepts::BaseBpGraphComponent::RedNode&)’ is deprecated [-Wdeprecated-copy] 453 | rn = bpgraph.redNode(e); /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:337:9: note: because ‘lemon::concepts::BaseBpGraphComponent::RedNode’ has user-provided ‘lemon::concepts::BaseBpGraphComponent::RedNode::RedNode(const lemon::concepts::BaseBpGraphComponent::RedNode&)’ 337 | RedNode(const RedNode &) : Parent() {} | ^~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:454:16: warning: implicitly-declared ‘lemon::concepts::BaseBpGraphComponent::BlueNode& lemon::concepts::BaseBpGraphComponent::BlueNode::operator=(const lemon::concepts::BaseBpGraphComponent::BlueNode&)’ is deprecated [-Wdeprecated-copy] 454 | bn = bpgraph.blueNode(e); /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:366:9: note: because ‘lemon::concepts::BaseBpGraphComponent::BlueNode’ has user-provided ‘lemon::concepts::BaseBpGraphComponent::BlueNode::BlueNode(const lemon::concepts::BaseBpGraphComponent::BlueNode&)’ 366 | BlueNode(const BlueNode &) : Parent() {} | ^~~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:455:16: warning: implicitly-declared ‘lemon::concepts::BaseBpGraphComponent::RedNode& lemon::concepts::BaseBpGraphComponent::RedNode::operator=(const lemon::concepts::BaseBpGraphComponent::RedNode&)’ is deprecated [-Wdeprecated-copy] 455 | rn = bpgraph.asRedNodeUnsafe(rnan); /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:337:9: note: because ‘lemon::concepts::BaseBpGraphComponent::RedNode’ has user-provided ‘lemon::concepts::BaseBpGraphComponent::RedNode::RedNode(const lemon::concepts::BaseBpGraphComponent::RedNode&)’ 337 | RedNode(const RedNode &) : Parent() {} | ^~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:456:16: warning: implicitly-declared ‘lemon::concepts::BaseBpGraphComponent::BlueNode& lemon::concepts::BaseBpGraphComponent::BlueNode::operator=(const lemon::concepts::BaseBpGraphComponent::BlueNode&)’ is deprecated [-Wdeprecated-copy] 456 | bn = bpgraph.asBlueNodeUnsafe(bnan); /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:366:9: note: because ‘lemon::concepts::BaseBpGraphComponent::BlueNode’ has user-provided ‘lemon::concepts::BaseBpGraphComponent::BlueNode::BlueNode(const lemon::concepts::BaseBpGraphComponent::BlueNode&)’ 366 | BlueNode(const BlueNode &) : Parent() {} | ^~~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:457:16: warning: implicitly-declared ‘lemon::concepts::BaseBpGraphComponent::RedNode& lemon::concepts::BaseBpGraphComponent::RedNode::operator=(const lemon::concepts::BaseBpGraphComponent::RedNode&)’ is deprecated [-Wdeprecated-copy] 457 | rn = bpgraph.asRedNode(rnan); /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:337:9: note: because ‘lemon::concepts::BaseBpGraphComponent::RedNode’ has user-provided ‘lemon::concepts::BaseBpGraphComponent::RedNode::RedNode(const lemon::concepts::BaseBpGraphComponent::RedNode&)’ 337 | RedNode(const RedNode &) : Parent() {} | ^~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:458:16: warning: implicitly-declared ‘lemon::concepts::BaseBpGraphComponent::BlueNode& lemon::concepts::BaseBpGraphComponent::BlueNode::operator=(const lemon::concepts::BaseBpGraphComponent::BlueNode&)’ is deprecated [-Wdeprecated-copy] 458 | bn = bpgraph.asBlueNode(bnan); /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:366:9: note: because ‘lemon::concepts::BaseBpGraphComponent::BlueNode’ has user-provided ‘lemon::concepts::BaseBpGraphComponent::BlueNode::BlueNode(const lemon::concepts::BaseBpGraphComponent::BlueNode&)’ 366 | BlueNode(const BlueNode &) : Parent() {} | ^~~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::BaseBpGraphComponent::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::AlterableBpGraphComponent<>]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseBpGraphComponent; Type = lemon::concepts::AlterableBpGraphComponent<>]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1273:39: required from ‘void lemon::concepts::AlterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::AlterableBpGraphComponent<>; BAS = lemon::concepts::BaseBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::AlterableDigraphComponent; Type = lemon::concepts::AlterableBpGraphComponent<>]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1325:64: required from ‘void lemon::concepts::AlterableGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::AlterableBpGraphComponent<>; BAS = lemon::concepts::BaseBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::AlterableGraphComponent; Type = lemon::concepts::AlterableBpGraphComponent<>]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1385:64: required from ‘void lemon::concepts::AlterableBpGraphComponent::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::AlterableBpGraphComponent<>; BAS = lemon::concepts::BaseBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::AlterableBpGraphComponent<>; Type = lemon::concepts::AlterableBpGraphComponent<>]’ /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:333:37: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:453:16: warning: implicitly-declared ‘lemon::concepts::BaseBpGraphComponent::RedNode& lemon::concepts::BaseBpGraphComponent::RedNode::operator=(const lemon::concepts::BaseBpGraphComponent::RedNode&)’ is deprecated [-Wdeprecated-copy] 453 | rn = bpgraph.redNode(e); /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:337:9: note: because ‘lemon::concepts::BaseBpGraphComponent::RedNode’ has user-provided ‘lemon::concepts::BaseBpGraphComponent::RedNode::RedNode(const lemon::concepts::BaseBpGraphComponent::RedNode&)’ 337 | RedNode(const RedNode &) : Parent() {} | ^~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:454:16: warning: implicitly-declared ‘lemon::concepts::BaseBpGraphComponent::BlueNode& lemon::concepts::BaseBpGraphComponent::BlueNode::operator=(const lemon::concepts::BaseBpGraphComponent::BlueNode&)’ is deprecated [-Wdeprecated-copy] 454 | bn = bpgraph.blueNode(e); /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:366:9: note: because ‘lemon::concepts::BaseBpGraphComponent::BlueNode’ has user-provided ‘lemon::concepts::BaseBpGraphComponent::BlueNode::BlueNode(const lemon::concepts::BaseBpGraphComponent::BlueNode&)’ 366 | BlueNode(const BlueNode &) : Parent() {} | ^~~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:455:16: warning: implicitly-declared ‘lemon::concepts::BaseBpGraphComponent::RedNode& lemon::concepts::BaseBpGraphComponent::RedNode::operator=(const lemon::concepts::BaseBpGraphComponent::RedNode&)’ is deprecated [-Wdeprecated-copy] 455 | rn = bpgraph.asRedNodeUnsafe(rnan); /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:337:9: note: because ‘lemon::concepts::BaseBpGraphComponent::RedNode’ has user-provided ‘lemon::concepts::BaseBpGraphComponent::RedNode::RedNode(const lemon::concepts::BaseBpGraphComponent::RedNode&)’ 337 | RedNode(const RedNode &) : Parent() {} | ^~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:456:16: warning: implicitly-declared ‘lemon::concepts::BaseBpGraphComponent::BlueNode& lemon::concepts::BaseBpGraphComponent::BlueNode::operator=(const lemon::concepts::BaseBpGraphComponent::BlueNode&)’ is deprecated [-Wdeprecated-copy] 456 | bn = bpgraph.asBlueNodeUnsafe(bnan); /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:366:9: note: because ‘lemon::concepts::BaseBpGraphComponent::BlueNode’ has user-provided ‘lemon::concepts::BaseBpGraphComponent::BlueNode::BlueNode(const lemon::concepts::BaseBpGraphComponent::BlueNode&)’ 366 | BlueNode(const BlueNode &) : Parent() {} | ^~~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:457:16: warning: implicitly-declared ‘lemon::concepts::BaseBpGraphComponent::RedNode& lemon::concepts::BaseBpGraphComponent::RedNode::operator=(const lemon::concepts::BaseBpGraphComponent::RedNode&)’ is deprecated [-Wdeprecated-copy] 457 | rn = bpgraph.asRedNode(rnan); /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:337:9: note: because ‘lemon::concepts::BaseBpGraphComponent::RedNode’ has user-provided ‘lemon::concepts::BaseBpGraphComponent::RedNode::RedNode(const lemon::concepts::BaseBpGraphComponent::RedNode&)’ 337 | RedNode(const RedNode &) : Parent() {} | ^~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:458:16: warning: implicitly-declared ‘lemon::concepts::BaseBpGraphComponent::BlueNode& lemon::concepts::BaseBpGraphComponent::BlueNode::operator=(const lemon::concepts::BaseBpGraphComponent::BlueNode&)’ is deprecated [-Wdeprecated-copy] 458 | bn = bpgraph.asBlueNode(bnan); /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:366:9: note: because ‘lemon::concepts::BaseBpGraphComponent::BlueNode’ has user-provided ‘lemon::concepts::BaseBpGraphComponent::BlueNode::BlueNode(const lemon::concepts::BaseBpGraphComponent::BlueNode&)’ 366 | BlueNode(const BlueNode &) : Parent() {} | ^~~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::BaseBpGraphComponent::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::MappableBpGraphComponent<>]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseBpGraphComponent; Type = lemon::concepts::MappableBpGraphComponent<>]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1580:39: required from ‘void lemon::concepts::MappableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::MappableBpGraphComponent<>; BAS = lemon::concepts::BaseBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::MappableDigraphComponent; Type = lemon::concepts::MappableBpGraphComponent<>]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1679:63: required from ‘void lemon::concepts::MappableGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::MappableBpGraphComponent<>; BAS = lemon::concepts::BaseBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::MappableGraphComponent; Type = lemon::concepts::MappableBpGraphComponent<>]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1804:63: required from ‘void lemon::concepts::MappableBpGraphComponent::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::MappableBpGraphComponent<>; BAS = lemon::concepts::BaseBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::MappableBpGraphComponent<>; Type = lemon::concepts::MappableBpGraphComponent<>]’ /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:336:36: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:453:16: warning: implicitly-declared ‘lemon::concepts::BaseBpGraphComponent::RedNode& lemon::concepts::BaseBpGraphComponent::RedNode::operator=(const lemon::concepts::BaseBpGraphComponent::RedNode&)’ is deprecated [-Wdeprecated-copy] 453 | rn = bpgraph.redNode(e); /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:337:9: note: because ‘lemon::concepts::BaseBpGraphComponent::RedNode’ has user-provided ‘lemon::concepts::BaseBpGraphComponent::RedNode::RedNode(const lemon::concepts::BaseBpGraphComponent::RedNode&)’ 337 | RedNode(const RedNode &) : Parent() {} | ^~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:454:16: warning: implicitly-declared ‘lemon::concepts::BaseBpGraphComponent::BlueNode& lemon::concepts::BaseBpGraphComponent::BlueNode::operator=(const lemon::concepts::BaseBpGraphComponent::BlueNode&)’ is deprecated [-Wdeprecated-copy] 454 | bn = bpgraph.blueNode(e); /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:366:9: note: because ‘lemon::concepts::BaseBpGraphComponent::BlueNode’ has user-provided ‘lemon::concepts::BaseBpGraphComponent::BlueNode::BlueNode(const lemon::concepts::BaseBpGraphComponent::BlueNode&)’ 366 | BlueNode(const BlueNode &) : Parent() {} | ^~~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:455:16: warning: implicitly-declared ‘lemon::concepts::BaseBpGraphComponent::RedNode& lemon::concepts::BaseBpGraphComponent::RedNode::operator=(const lemon::concepts::BaseBpGraphComponent::RedNode&)’ is deprecated [-Wdeprecated-copy] 455 | rn = bpgraph.asRedNodeUnsafe(rnan); /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:337:9: note: because ‘lemon::concepts::BaseBpGraphComponent::RedNode’ has user-provided ‘lemon::concepts::BaseBpGraphComponent::RedNode::RedNode(const lemon::concepts::BaseBpGraphComponent::RedNode&)’ 337 | RedNode(const RedNode &) : Parent() {} | ^~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:456:16: warning: implicitly-declared ‘lemon::concepts::BaseBpGraphComponent::BlueNode& lemon::concepts::BaseBpGraphComponent::BlueNode::operator=(const lemon::concepts::BaseBpGraphComponent::BlueNode&)’ is deprecated [-Wdeprecated-copy] 456 | bn = bpgraph.asBlueNodeUnsafe(bnan); /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:366:9: note: because ‘lemon::concepts::BaseBpGraphComponent::BlueNode’ has user-provided ‘lemon::concepts::BaseBpGraphComponent::BlueNode::BlueNode(const lemon::concepts::BaseBpGraphComponent::BlueNode&)’ 366 | BlueNode(const BlueNode &) : Parent() {} | ^~~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:457:16: warning: implicitly-declared ‘lemon::concepts::BaseBpGraphComponent::RedNode& lemon::concepts::BaseBpGraphComponent::RedNode::operator=(const lemon::concepts::BaseBpGraphComponent::RedNode&)’ is deprecated [-Wdeprecated-copy] 457 | rn = bpgraph.asRedNode(rnan); /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:337:9: note: because ‘lemon::concepts::BaseBpGraphComponent::RedNode’ has user-provided ‘lemon::concepts::BaseBpGraphComponent::RedNode::RedNode(const lemon::concepts::BaseBpGraphComponent::RedNode&)’ 337 | RedNode(const RedNode &) : Parent() {} | ^~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:458:16: warning: implicitly-declared ‘lemon::concepts::BaseBpGraphComponent::BlueNode& lemon::concepts::BaseBpGraphComponent::BlueNode::operator=(const lemon::concepts::BaseBpGraphComponent::BlueNode&)’ is deprecated [-Wdeprecated-copy] 458 | bn = bpgraph.asBlueNode(bnan); /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:366:9: note: because ‘lemon::concepts::BaseBpGraphComponent::BlueNode’ has user-provided ‘lemon::concepts::BaseBpGraphComponent::BlueNode::BlueNode(const lemon::concepts::BaseBpGraphComponent::BlueNode&)’ 366 | BlueNode(const BlueNode &) : Parent() {} | ^~~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::BaseDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::BpGraph]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseDigraphComponent; Type = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:278:53: required from ‘void lemon::concepts::BaseGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseGraphComponent; Type = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:440:53: required from ‘void lemon::concepts::BaseBpGraphComponent::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseBpGraphComponent; Type = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:1016:55: required from ‘void lemon::concepts::BpGraph::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BpGraph; Type = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:349:36: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:173:15: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::Node& lemon::concepts::BpGraph::Node::operator=(const lemon::concepts::BpGraph::Node&)’ is deprecated [-Wdeprecated-copy] 173 | n = digraph.source(e); In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:96:9: note: because ‘lemon::concepts::BpGraph::Node’ has user-provided ‘lemon::concepts::BpGraph::Node::Node(const lemon::concepts::BpGraph::Node&)’ 96 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:174:15: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::Node& lemon::concepts::BpGraph::Node::operator=(const lemon::concepts::BpGraph::Node&)’ is deprecated [-Wdeprecated-copy] 174 | n = digraph.target(e); In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:96:9: note: because ‘lemon::concepts::BpGraph::Node’ has user-provided ‘lemon::concepts::BpGraph::Node::Node(const lemon::concepts::BpGraph::Node&)’ 96 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:175:15: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::Node& lemon::concepts::BpGraph::Node::operator=(const lemon::concepts::BpGraph::Node&)’ is deprecated [-Wdeprecated-copy] 175 | n = digraph.oppositeNode(n, e); In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:96:9: note: because ‘lemon::concepts::BpGraph::Node’ has user-provided ‘lemon::concepts::BpGraph::Node::Node(const lemon::concepts::BpGraph::Node&)’ 96 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItem::Constraints<_GraphItem>::constraints() [with _GraphItem = lemon::concepts::BpGraph::Edge; char sel = 'e']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItem<'e'>; Type = lemon::concepts::BpGraph::Edge]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:279:45: required from ‘void lemon::concepts::BaseGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseGraphComponent; Type = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:440:53: required from ‘void lemon::concepts::BaseBpGraphComponent::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseBpGraphComponent; Type = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:1016:55: required from ‘void lemon::concepts::BpGraph::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BpGraph; Type = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:349:36: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:104:13: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::Edge& lemon::concepts::BpGraph::Edge::operator=(const lemon::concepts::BpGraph::Edge&)’ is deprecated [-Wdeprecated-copy] 104 | i1=INVALID; | ~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:327:9: note: because ‘lemon::concepts::BpGraph::Edge’ has user-provided ‘lemon::concepts::BpGraph::Edge::Edge(const lemon::concepts::BpGraph::Edge&)’ 327 | Edge(const Edge&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:19: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::Edge& lemon::concepts::BpGraph::Edge::operator=(const lemon::concepts::BpGraph::Edge&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:327:9: note: because ‘lemon::concepts::BpGraph::Edge’ has user-provided ‘lemon::concepts::BpGraph::Edge::Edge(const lemon::concepts::BpGraph::Edge&)’ 327 | Edge(const Edge&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:14: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::Edge& lemon::concepts::BpGraph::Edge::operator=(const lemon::concepts::BpGraph::Edge&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:327:9: note: because ‘lemon::concepts::BpGraph::Edge’ has user-provided ‘lemon::concepts::BpGraph::Edge::Edge(const lemon::concepts::BpGraph::Edge&)’ 327 | Edge(const Edge&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::BpGraph; BAS = lemon::concepts::BaseBpGraphComponent]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent; Type = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1102:63: required from ‘void lemon::concepts::IterableGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::BpGraph; BAS = lemon::concepts::BaseBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableGraphComponent; Type = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1209:63: required from ‘void lemon::concepts::IterableBpGraphComponent::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::BpGraph; BAS = lemon::concepts::BaseBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableBpGraphComponent<>; Type = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:1017:61: required from ‘void lemon::concepts::BpGraph::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BpGraph; Type = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:349:36: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:999:15: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::Node& lemon::concepts::BpGraph::Node::operator=(const lemon::concepts::BpGraph::Node&)’ is deprecated [-Wdeprecated-copy] 999 | n = digraph.baseNode(iait); In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:96:9: note: because ‘lemon::concepts::BpGraph::Node’ has user-provided ‘lemon::concepts::BpGraph::Node::Node(const lemon::concepts::BpGraph::Node&)’ 96 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1000:15: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::Node& lemon::concepts::BpGraph::Node::operator=(const lemon::concepts::BpGraph::Node&)’ is deprecated [-Wdeprecated-copy] 1000 | n = digraph.runningNode(iait); In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:96:9: note: because ‘lemon::concepts::BpGraph::Node’ has user-provided ‘lemon::concepts::BpGraph::Node::Node(const lemon::concepts::BpGraph::Node&)’ 96 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1001:15: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::Node& lemon::concepts::BpGraph::Node::operator=(const lemon::concepts::BpGraph::Node&)’ is deprecated [-Wdeprecated-copy] 1001 | n = digraph.baseNode(oait); In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:96:9: note: because ‘lemon::concepts::BpGraph::Node’ has user-provided ‘lemon::concepts::BpGraph::Node::Node(const lemon::concepts::BpGraph::Node&)’ 96 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1002:15: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::Node& lemon::concepts::BpGraph::Node::operator=(const lemon::concepts::BpGraph::Node&)’ is deprecated [-Wdeprecated-copy] 1002 | n = digraph.runningNode(oait); In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:96:9: note: because ‘lemon::concepts::BpGraph::Node’ has user-provided ‘lemon::concepts::BpGraph::Node::Node(const lemon::concepts::BpGraph::Node&)’ 96 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItemIt::Constraints<_GraphItemIt>::constraints() [with _GraphItemIt = lemon::concepts::BpGraph::EdgeIt; GR = lemon::concepts::BpGraph; Item = lemon::concepts::BpGraph::Edge]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItemIt; Type = lemon::concepts::BpGraph::EdgeIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1121:40: required from ‘void lemon::concepts::IterableGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::BpGraph; BAS = lemon::concepts::BaseBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableGraphComponent; Type = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1209:63: required from ‘void lemon::concepts::IterableBpGraphComponent::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::BpGraph; BAS = lemon::concepts::BaseBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableBpGraphComponent<>; Type = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:1017:61: required from ‘void lemon::concepts::BpGraph::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BpGraph; Type = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:349:36: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:732:15: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::EdgeIt& lemon::concepts::BpGraph::EdgeIt::operator=(const lemon::concepts::BpGraph::EdgeIt&)’ is deprecated [-Wdeprecated-copy] 732 | it2 = ++it1; | ~~~~^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:375:9: note: because ‘lemon::concepts::BpGraph::EdgeIt’ has user-provided ‘lemon::concepts::BpGraph::EdgeIt::EdgeIt(const lemon::concepts::BpGraph::EdgeIt&)’ 375 | EdgeIt(const EdgeIt& e) : Edge(e) { } | ^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:733:17: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::EdgeIt& lemon::concepts::BpGraph::EdgeIt::operator=(const lemon::concepts::BpGraph::EdgeIt&)’ is deprecated [-Wdeprecated-copy] 733 | ++it2 = it1; | ~~~~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:375:9: note: because ‘lemon::concepts::BpGraph::EdgeIt’ has user-provided ‘lemon::concepts::BpGraph::EdgeIt::EdgeIt(const lemon::concepts::BpGraph::EdgeIt&)’ 375 | EdgeIt(const EdgeIt& e) : Edge(e) { } | ^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:737:14: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::Edge& lemon::concepts::BpGraph::Edge::operator=(const lemon::concepts::BpGraph::Edge&)’ is deprecated [-Wdeprecated-copy] 737 | bi = it2; | ~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:327:9: note: because ‘lemon::concepts::BpGraph::Edge’ has user-provided ‘lemon::concepts::BpGraph::Edge::Edge(const lemon::concepts::BpGraph::Edge&)’ 327 | Edge(const Edge&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphIncIt::Constraints<_GraphIncIt>::constraints() [with _GraphIncIt = lemon::concepts::BpGraph::IncEdgeIt; GR = lemon::concepts::BpGraph; Item = lemon::concepts::BpGraph::Edge; Base = lemon::concepts::BpGraph::Node; char sel = 'e']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphIncIt; Type = lemon::concepts::BpGraph::IncEdgeIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1123:71: required from ‘void lemon::concepts::IterableGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::BpGraph; BAS = lemon::concepts::BaseBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableGraphComponent; Type = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1209:63: required from ‘void lemon::concepts::IterableBpGraphComponent::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::BpGraph; BAS = lemon::concepts::BaseBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableBpGraphComponent<>; Type = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:1017:61: required from ‘void lemon::concepts::BpGraph::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BpGraph; Type = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:349:36: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:823:15: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::IncEdgeIt& lemon::concepts::BpGraph::IncEdgeIt::operator=(const lemon::concepts::BpGraph::IncEdgeIt&)’ is deprecated [-Wdeprecated-copy] 823 | it2 = ++it1; | ~~~~^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:423:9: note: because ‘lemon::concepts::BpGraph::IncEdgeIt’ has user-provided ‘lemon::concepts::BpGraph::IncEdgeIt::IncEdgeIt(const lemon::concepts::BpGraph::IncEdgeIt&)’ 423 | IncEdgeIt(const IncEdgeIt& e) : Edge(e) { } | ^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:824:17: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::IncEdgeIt& lemon::concepts::BpGraph::IncEdgeIt::operator=(const lemon::concepts::BpGraph::IncEdgeIt&)’ is deprecated [-Wdeprecated-copy] 824 | ++it2 = it1; | ~~~~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:423:9: note: because ‘lemon::concepts::BpGraph::IncEdgeIt’ has user-provided ‘lemon::concepts::BpGraph::IncEdgeIt::IncEdgeIt(const lemon::concepts::BpGraph::IncEdgeIt&)’ 423 | IncEdgeIt(const IncEdgeIt& e) : Edge(e) { } | ^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:827:13: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::Edge& lemon::concepts::BpGraph::Edge::operator=(const lemon::concepts::BpGraph::Edge&)’ is deprecated [-Wdeprecated-copy] 827 | e = it2; | ~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:327:9: note: because ‘lemon::concepts::BpGraph::Edge’ has user-provided ‘lemon::concepts::BpGraph::Edge::Edge(const lemon::concepts::BpGraph::Edge&)’ 327 | Edge(const Edge&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItem::Constraints<_GraphItem>::constraints() [with _GraphItem = lemon::concepts::BpGraph::RedNodeIt; char sel = '0']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItem<>; Type = lemon::concepts::BpGraph::RedNodeIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:724:50: required from ‘void lemon::concepts::GraphItemIt::Constraints<_GraphItemIt>::constraints() [with _GraphItemIt = lemon::concepts::BpGraph::RedNodeIt; GR = lemon::concepts::BpGraph; Item = lemon::concepts::BpGraph::RedNode]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItemIt; Type = lemon::concepts::BpGraph::RedNodeIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1219:42: required from ‘void lemon::concepts::IterableBpGraphComponent::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::BpGraph; BAS = lemon::concepts::BaseBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableBpGraphComponent<>; Type = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:1017:61: required from ‘void lemon::concepts::BpGraph::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BpGraph; Type = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:349:36: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:104:13: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::RedNodeIt& lemon::concepts::BpGraph::RedNodeIt::operator=(const lemon::concepts::BpGraph::RedNodeIt&)’ is deprecated [-Wdeprecated-copy] 104 | i1=INVALID; | ~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:201:9: note: because ‘lemon::concepts::BpGraph::RedNodeIt’ has user-provided ‘lemon::concepts::BpGraph::RedNodeIt::RedNodeIt(const lemon::concepts::BpGraph::RedNodeIt&)’ 201 | RedNodeIt(const RedNodeIt& n) : RedNode(n) { } | ^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:19: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::RedNodeIt& lemon::concepts::BpGraph::RedNodeIt::operator=(const lemon::concepts::BpGraph::RedNodeIt&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:201:9: note: because ‘lemon::concepts::BpGraph::RedNodeIt’ has user-provided ‘lemon::concepts::BpGraph::RedNodeIt::RedNodeIt(const lemon::concepts::BpGraph::RedNodeIt&)’ 201 | RedNodeIt(const RedNodeIt& n) : RedNode(n) { } | ^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:14: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::RedNodeIt& lemon::concepts::BpGraph::RedNodeIt::operator=(const lemon::concepts::BpGraph::RedNodeIt&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:201:9: note: because ‘lemon::concepts::BpGraph::RedNodeIt’ has user-provided ‘lemon::concepts::BpGraph::RedNodeIt::RedNodeIt(const lemon::concepts::BpGraph::RedNodeIt&)’ 201 | RedNodeIt(const RedNodeIt& n) : RedNode(n) { } | ^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItem::Constraints<_GraphItem>::constraints() [with _GraphItem = lemon::concepts::BpGraph::BlueNodeIt; char sel = '0']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItem<>; Type = lemon::concepts::BpGraph::BlueNodeIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:724:50: required from ‘void lemon::concepts::GraphItemIt::Constraints<_GraphItemIt>::constraints() [with _GraphItemIt = lemon::concepts::BpGraph::BlueNodeIt; GR = lemon::concepts::BpGraph; Item = lemon::concepts::BpGraph::BlueNode]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItemIt; Type = lemon::concepts::BpGraph::BlueNodeIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1221:43: required from ‘void lemon::concepts::IterableBpGraphComponent::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::BpGraph; BAS = lemon::concepts::BaseBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableBpGraphComponent<>; Type = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:1017:61: required from ‘void lemon::concepts::BpGraph::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BpGraph; Type = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:349:36: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:104:13: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::BlueNodeIt& lemon::concepts::BpGraph::BlueNodeIt::operator=(const lemon::concepts::BpGraph::BlueNodeIt&)’ is deprecated [-Wdeprecated-copy] 104 | i1=INVALID; | ~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:244:9: note: because ‘lemon::concepts::BpGraph::BlueNodeIt’ has user-provided ‘lemon::concepts::BpGraph::BlueNodeIt::BlueNodeIt(const lemon::concepts::BpGraph::BlueNodeIt&)’ 244 | BlueNodeIt(const BlueNodeIt& n) : BlueNode(n) { } | ^~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:19: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::BlueNodeIt& lemon::concepts::BpGraph::BlueNodeIt::operator=(const lemon::concepts::BpGraph::BlueNodeIt&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:244:9: note: because ‘lemon::concepts::BpGraph::BlueNodeIt’ has user-provided ‘lemon::concepts::BpGraph::BlueNodeIt::BlueNodeIt(const lemon::concepts::BpGraph::BlueNodeIt&)’ 244 | BlueNodeIt(const BlueNodeIt& n) : BlueNode(n) { } | ^~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:14: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::BlueNodeIt& lemon::concepts::BpGraph::BlueNodeIt::operator=(const lemon::concepts::BpGraph::BlueNodeIt&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:244:9: note: because ‘lemon::concepts::BpGraph::BlueNodeIt’ has user-provided ‘lemon::concepts::BpGraph::BlueNodeIt::BlueNodeIt(const lemon::concepts::BpGraph::BlueNodeIt&)’ 244 | BlueNodeIt(const BlueNodeIt& n) : BlueNode(n) { } | ^~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::IDableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::BpGraph; BAS = lemon::concepts::BaseBpGraphComponent]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IDableDigraphComponent; Type = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:586:62: required from ‘void lemon::concepts::IDableGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::BpGraph; BAS = lemon::concepts::BaseBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IDableGraphComponent; Type = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:648:61: required from ‘void lemon::concepts::IDableBpGraphComponent::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::BpGraph; BAS = lemon::concepts::BaseBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IDableBpGraphComponent<>; Type = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:1018:59: required from ‘void lemon::concepts::BpGraph::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BpGraph; Type = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:349:36: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:526:15: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::Node& lemon::concepts::BpGraph::Node::operator=(const lemon::concepts::BpGraph::Node&)’ is deprecated [-Wdeprecated-copy] 526 | node=INVALID; | ~~~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:96:9: note: because ‘lemon::concepts::BpGraph::Node’ has user-provided ‘lemon::concepts::BpGraph::Node::Node(const lemon::concepts::BpGraph::Node&)’ 96 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:529:16: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::Node& lemon::concepts::BpGraph::Node::operator=(const lemon::concepts::BpGraph::Node&)’ is deprecated [-Wdeprecated-copy] 529 | node = digraph.nodeFromId(nid); In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:96:9: note: because ‘lemon::concepts::BpGraph::Node’ has user-provided ‘lemon::concepts::BpGraph::Node::Node(const lemon::concepts::BpGraph::Node&)’ 96 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:531:14: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::Arc& lemon::concepts::BpGraph::Arc::operator=(const lemon::concepts::BpGraph::Arc&)’ is deprecated [-Wdeprecated-copy] 531 | arc=INVALID; | ~~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:462:9: note: because ‘lemon::concepts::BpGraph::Arc’ has user-provided ‘lemon::concepts::BpGraph::Arc::Arc(const lemon::concepts::BpGraph::Arc&)’ 462 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:534:15: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::Arc& lemon::concepts::BpGraph::Arc::operator=(const lemon::concepts::BpGraph::Arc&)’ is deprecated [-Wdeprecated-copy] 534 | arc = digraph.arcFromId(eid); In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:462:9: note: because ‘lemon::concepts::BpGraph::Arc’ has user-provided ‘lemon::concepts::BpGraph::Arc::Arc(const lemon::concepts::BpGraph::Arc&)’ 462 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::BaseGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::IDableBpGraphComponent<>]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseGraphComponent; Type = lemon::concepts::IDableBpGraphComponent<>]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:440:53: required from ‘void lemon::concepts::BaseBpGraphComponent::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::IDableBpGraphComponent<>]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseBpGraphComponent; Type = lemon::concepts::IDableBpGraphComponent<>]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:524:40: required from ‘void lemon::concepts::IDableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::IDableBpGraphComponent<>; BAS = lemon::concepts::BaseBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IDableDigraphComponent; Type = lemon::concepts::IDableBpGraphComponent<>]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:586:62: required from ‘void lemon::concepts::IDableGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::IDableBpGraphComponent<>; BAS = lemon::concepts::BaseBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IDableGraphComponent; Type = lemon::concepts::IDableBpGraphComponent<>]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:648:61: required from ‘void lemon::concepts::IDableBpGraphComponent::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::IDableBpGraphComponent<>; BAS = lemon::concepts::BaseBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IDableBpGraphComponent<>; Type = lemon::concepts::IDableBpGraphComponent<>]’ /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:327:34: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:290:16: warning: implicitly-declared ‘lemon::concepts::BaseGraphComponent::Edge& lemon::concepts::BaseGraphComponent::Edge::operator=(const lemon::concepts::BaseGraphComponent::Edge&)’ is deprecated [-Wdeprecated-copy] 290 | ue = e; | ~~~^~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:219:9: note: because ‘lemon::concepts::BaseGraphComponent::Edge’ has user-provided ‘lemon::concepts::BaseGraphComponent::Edge::Edge(const lemon::concepts::BaseGraphComponent::Edge&)’ 219 | Edge(const Edge &) : Parent() {} | ^~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::BaseGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::IterableBpGraphComponent<>]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseGraphComponent; Type = lemon::concepts::IterableBpGraphComponent<>]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:440:53: required from ‘void lemon::concepts::BaseBpGraphComponent::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::IterableBpGraphComponent<>]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseBpGraphComponent; Type = lemon::concepts::IterableBpGraphComponent<>]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:963:39: required from ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::IterableBpGraphComponent<>; BAS = lemon::concepts::BaseBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent; Type = lemon::concepts::IterableBpGraphComponent<>]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1102:63: required from ‘void lemon::concepts::IterableGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::IterableBpGraphComponent<>; BAS = lemon::concepts::BaseBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableGraphComponent; Type = lemon::concepts::IterableBpGraphComponent<>]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1209:63: required from ‘void lemon::concepts::IterableBpGraphComponent::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::IterableBpGraphComponent<>; BAS = lemon::concepts::BaseBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableBpGraphComponent<>; Type = lemon::concepts::IterableBpGraphComponent<>]’ /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:330:36: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:290:16: warning: implicitly-declared ‘lemon::concepts::BaseGraphComponent::Edge& lemon::concepts::BaseGraphComponent::Edge::operator=(const lemon::concepts::BaseGraphComponent::Edge&)’ is deprecated [-Wdeprecated-copy] 290 | ue = e; | ~~~^~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:219:9: note: because ‘lemon::concepts::BaseGraphComponent::Edge’ has user-provided ‘lemon::concepts::BaseGraphComponent::Edge::Edge(const lemon::concepts::BaseGraphComponent::Edge&)’ 219 | Edge(const Edge &) : Parent() {} | ^~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::BaseGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::AlterableBpGraphComponent<>]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseGraphComponent; Type = lemon::concepts::AlterableBpGraphComponent<>]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:440:53: required from ‘void lemon::concepts::BaseBpGraphComponent::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::AlterableBpGraphComponent<>]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseBpGraphComponent; Type = lemon::concepts::AlterableBpGraphComponent<>]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1273:39: required from ‘void lemon::concepts::AlterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::AlterableBpGraphComponent<>; BAS = lemon::concepts::BaseBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::AlterableDigraphComponent; Type = lemon::concepts::AlterableBpGraphComponent<>]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1325:64: required from ‘void lemon::concepts::AlterableGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::AlterableBpGraphComponent<>; BAS = lemon::concepts::BaseBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::AlterableGraphComponent; Type = lemon::concepts::AlterableBpGraphComponent<>]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1385:64: required from ‘void lemon::concepts::AlterableBpGraphComponent::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::AlterableBpGraphComponent<>; BAS = lemon::concepts::BaseBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::AlterableBpGraphComponent<>; Type = lemon::concepts::AlterableBpGraphComponent<>]’ /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:333:37: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:290:16: warning: implicitly-declared ‘lemon::concepts::BaseGraphComponent::Edge& lemon::concepts::BaseGraphComponent::Edge::operator=(const lemon::concepts::BaseGraphComponent::Edge&)’ is deprecated [-Wdeprecated-copy] 290 | ue = e; | ~~~^~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:219:9: note: because ‘lemon::concepts::BaseGraphComponent::Edge’ has user-provided ‘lemon::concepts::BaseGraphComponent::Edge::Edge(const lemon::concepts::BaseGraphComponent::Edge&)’ 219 | Edge(const Edge &) : Parent() {} | ^~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::BaseGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::MappableBpGraphComponent<>]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseGraphComponent; Type = lemon::concepts::MappableBpGraphComponent<>]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:440:53: required from ‘void lemon::concepts::BaseBpGraphComponent::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::MappableBpGraphComponent<>]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseBpGraphComponent; Type = lemon::concepts::MappableBpGraphComponent<>]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1580:39: required from ‘void lemon::concepts::MappableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::MappableBpGraphComponent<>; BAS = lemon::concepts::BaseBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::MappableDigraphComponent; Type = lemon::concepts::MappableBpGraphComponent<>]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1679:63: required from ‘void lemon::concepts::MappableGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::MappableBpGraphComponent<>; BAS = lemon::concepts::BaseBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::MappableGraphComponent; Type = lemon::concepts::MappableBpGraphComponent<>]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1804:63: required from ‘void lemon::concepts::MappableBpGraphComponent::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::MappableBpGraphComponent<>; BAS = lemon::concepts::BaseBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::MappableBpGraphComponent<>; Type = lemon::concepts::MappableBpGraphComponent<>]’ /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:336:36: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:290:16: warning: implicitly-declared ‘lemon::concepts::BaseGraphComponent::Edge& lemon::concepts::BaseGraphComponent::Edge::operator=(const lemon::concepts::BaseGraphComponent::Edge&)’ is deprecated [-Wdeprecated-copy] 290 | ue = e; | ~~~^~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:219:9: note: because ‘lemon::concepts::BaseGraphComponent::Edge’ has user-provided ‘lemon::concepts::BaseGraphComponent::Edge::Edge(const lemon::concepts::BaseGraphComponent::Edge&)’ 219 | Edge(const Edge &) : Parent() {} | ^~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItem::Constraints<_GraphItem>::constraints() [with _GraphItem = lemon::concepts::BpGraph::Node; char sel = 'n']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItem<'n'>; Type = lemon::concepts::BpGraph::Node]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:168:45: required from ‘void lemon::concepts::BaseDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseDigraphComponent; Type = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:278:53: required from ‘void lemon::concepts::BaseGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseGraphComponent; Type = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:440:53: required from ‘void lemon::concepts::BaseBpGraphComponent::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseBpGraphComponent; Type = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:1016:55: required from ‘void lemon::concepts::BpGraph::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BpGraph; Type = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:349:36: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:104:13: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::Node& lemon::concepts::BpGraph::Node::operator=(const lemon::concepts::BpGraph::Node&)’ is deprecated [-Wdeprecated-copy] 104 | i1=INVALID; | ~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:96:9: note: because ‘lemon::concepts::BpGraph::Node’ has user-provided ‘lemon::concepts::BpGraph::Node::Node(const lemon::concepts::BpGraph::Node&)’ 96 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:19: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::Node& lemon::concepts::BpGraph::Node::operator=(const lemon::concepts::BpGraph::Node&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:96:9: note: because ‘lemon::concepts::BpGraph::Node’ has user-provided ‘lemon::concepts::BpGraph::Node::Node(const lemon::concepts::BpGraph::Node&)’ 96 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:14: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::Node& lemon::concepts::BpGraph::Node::operator=(const lemon::concepts::BpGraph::Node&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:96:9: note: because ‘lemon::concepts::BpGraph::Node’ has user-provided ‘lemon::concepts::BpGraph::Node::Node(const lemon::concepts::BpGraph::Node&)’ 96 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItem::Constraints<_GraphItem>::constraints() [with _GraphItem = lemon::concepts::BpGraph::Arc; char sel = 'a']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItem<'a'>; Type = lemon::concepts::BpGraph::Arc]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:169:44: required from ‘void lemon::concepts::BaseDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseDigraphComponent; Type = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:278:53: required from ‘void lemon::concepts::BaseGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseGraphComponent; Type = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:440:53: required from ‘void lemon::concepts::BaseBpGraphComponent::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseBpGraphComponent; Type = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:1016:55: required from ‘void lemon::concepts::BpGraph::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BpGraph; Type = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:349:36: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:104:13: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::Arc& lemon::concepts::BpGraph::Arc::operator=(const lemon::concepts::BpGraph::Arc&)’ is deprecated [-Wdeprecated-copy] 104 | i1=INVALID; | ~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:462:9: note: because ‘lemon::concepts::BpGraph::Arc’ has user-provided ‘lemon::concepts::BpGraph::Arc::Arc(const lemon::concepts::BpGraph::Arc&)’ 462 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:19: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::Arc& lemon::concepts::BpGraph::Arc::operator=(const lemon::concepts::BpGraph::Arc&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:462:9: note: because ‘lemon::concepts::BpGraph::Arc’ has user-provided ‘lemon::concepts::BpGraph::Arc::Arc(const lemon::concepts::BpGraph::Arc&)’ 462 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:14: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::Arc& lemon::concepts::BpGraph::Arc::operator=(const lemon::concepts::BpGraph::Arc&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:462:9: note: because ‘lemon::concepts::BpGraph::Arc’ has user-provided ‘lemon::concepts::BpGraph::Arc::Arc(const lemon::concepts::BpGraph::Arc&)’ 462 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItemIt::Constraints<_GraphItemIt>::constraints() [with _GraphItemIt = lemon::concepts::BpGraph::ArcIt; GR = lemon::concepts::BpGraph; Item = lemon::concepts::BpGraph::Arc]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItemIt; Type = lemon::concepts::BpGraph::ArcIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:988:41: required from ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::BpGraph; BAS = lemon::concepts::BaseBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent; Type = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1102:63: required from ‘void lemon::concepts::IterableGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::BpGraph; BAS = lemon::concepts::BaseBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableGraphComponent; Type = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1209:63: required from ‘void lemon::concepts::IterableBpGraphComponent::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::BpGraph; BAS = lemon::concepts::BaseBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableBpGraphComponent<>; Type = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:1017:61: required from ‘void lemon::concepts::BpGraph::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BpGraph; Type = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:349:36: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:732:15: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::ArcIt& lemon::concepts::BpGraph::ArcIt::operator=(const lemon::concepts::BpGraph::ArcIt&)’ is deprecated [-Wdeprecated-copy] 732 | it2 = ++it1; | ~~~~^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:516:9: note: because ‘lemon::concepts::BpGraph::ArcIt’ has user-provided ‘lemon::concepts::BpGraph::ArcIt::ArcIt(const lemon::concepts::BpGraph::ArcIt&)’ 516 | ArcIt(const ArcIt& e) : Arc(e) { } | ^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:733:17: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::ArcIt& lemon::concepts::BpGraph::ArcIt::operator=(const lemon::concepts::BpGraph::ArcIt&)’ is deprecated [-Wdeprecated-copy] 733 | ++it2 = it1; | ~~~~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:516:9: note: because ‘lemon::concepts::BpGraph::ArcIt’ has user-provided ‘lemon::concepts::BpGraph::ArcIt::ArcIt(const lemon::concepts::BpGraph::ArcIt&)’ 516 | ArcIt(const ArcIt& e) : Arc(e) { } | ^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:737:14: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::Arc& lemon::concepts::BpGraph::Arc::operator=(const lemon::concepts::BpGraph::Arc&)’ is deprecated [-Wdeprecated-copy] 737 | bi = it2; | ~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:462:9: note: because ‘lemon::concepts::BpGraph::Arc’ has user-provided ‘lemon::concepts::BpGraph::Arc::Arc(const lemon::concepts::BpGraph::Arc&)’ 462 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItemIt::Constraints<_GraphItemIt>::constraints() [with _GraphItemIt = lemon::concepts::BpGraph::NodeIt; GR = lemon::concepts::BpGraph; Item = lemon::concepts::BpGraph::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItemIt; Type = lemon::concepts::BpGraph::NodeIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:990:42: required from ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::BpGraph; BAS = lemon::concepts::BaseBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent; Type = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1102:63: required from ‘void lemon::concepts::IterableGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::BpGraph; BAS = lemon::concepts::BaseBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableGraphComponent; Type = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1209:63: required from ‘void lemon::concepts::IterableBpGraphComponent::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::BpGraph; BAS = lemon::concepts::BaseBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableBpGraphComponent<>; Type = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:1017:61: required from ‘void lemon::concepts::BpGraph::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BpGraph; Type = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:349:36: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:732:15: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::NodeIt& lemon::concepts::BpGraph::NodeIt::operator=(const lemon::concepts::BpGraph::NodeIt&)’ is deprecated [-Wdeprecated-copy] 732 | it2 = ++it1; | ~~~~^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:287:9: note: because ‘lemon::concepts::BpGraph::NodeIt’ has user-provided ‘lemon::concepts::BpGraph::NodeIt::NodeIt(const lemon::concepts::BpGraph::NodeIt&)’ 287 | NodeIt(const NodeIt& n) : Node(n) { } | ^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:733:17: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::NodeIt& lemon::concepts::BpGraph::NodeIt::operator=(const lemon::concepts::BpGraph::NodeIt&)’ is deprecated [-Wdeprecated-copy] 733 | ++it2 = it1; | ~~~~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:287:9: note: because ‘lemon::concepts::BpGraph::NodeIt’ has user-provided ‘lemon::concepts::BpGraph::NodeIt::NodeIt(const lemon::concepts::BpGraph::NodeIt&)’ 287 | NodeIt(const NodeIt& n) : Node(n) { } | ^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:737:14: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::Node& lemon::concepts::BpGraph::Node::operator=(const lemon::concepts::BpGraph::Node&)’ is deprecated [-Wdeprecated-copy] 737 | bi = it2; | ~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:96:9: note: because ‘lemon::concepts::BpGraph::Node’ has user-provided ‘lemon::concepts::BpGraph::Node::Node(const lemon::concepts::BpGraph::Node&)’ 96 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphIncIt::Constraints<_GraphIncIt>::constraints() [with _GraphIncIt = lemon::concepts::BpGraph::InArcIt; GR = lemon::concepts::BpGraph; Item = lemon::concepts::BpGraph::Arc; Base = lemon::concepts::BpGraph::Node; char sel = 'i']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphIncIt; Type = lemon::concepts::BpGraph::InArcIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:992:73: required from ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::BpGraph; BAS = lemon::concepts::BaseBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent; Type = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1102:63: required from ‘void lemon::concepts::IterableGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::BpGraph; BAS = lemon::concepts::BaseBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableGraphComponent; Type = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1209:63: required from ‘void lemon::concepts::IterableBpGraphComponent::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::BpGraph; BAS = lemon::concepts::BaseBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableBpGraphComponent<>; Type = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:1017:61: required from ‘void lemon::concepts::BpGraph::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BpGraph; Type = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:349:36: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:823:15: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::InArcIt& lemon::concepts::BpGraph::InArcIt::operator=(const lemon::concepts::BpGraph::InArcIt&)’ is deprecated [-Wdeprecated-copy] 823 | it2 = ++it1; | ~~~~^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:612:9: note: because ‘lemon::concepts::BpGraph::InArcIt’ has user-provided ‘lemon::concepts::BpGraph::InArcIt::InArcIt(const lemon::concepts::BpGraph::InArcIt&)’ 612 | InArcIt(const InArcIt& e) : Arc(e) { } | ^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:824:17: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::InArcIt& lemon::concepts::BpGraph::InArcIt::operator=(const lemon::concepts::BpGraph::InArcIt&)’ is deprecated [-Wdeprecated-copy] 824 | ++it2 = it1; | ~~~~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:612:9: note: because ‘lemon::concepts::BpGraph::InArcIt’ has user-provided ‘lemon::concepts::BpGraph::InArcIt::InArcIt(const lemon::concepts::BpGraph::InArcIt&)’ 612 | InArcIt(const InArcIt& e) : Arc(e) { } | ^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:827:13: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::Arc& lemon::concepts::BpGraph::Arc::operator=(const lemon::concepts::BpGraph::Arc&)’ is deprecated [-Wdeprecated-copy] 827 | e = it2; | ~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:462:9: note: because ‘lemon::concepts::BpGraph::Arc’ has user-provided ‘lemon::concepts::BpGraph::Arc::Arc(const lemon::concepts::BpGraph::Arc&)’ 462 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphIncIt::Constraints<_GraphIncIt>::constraints() [with _GraphIncIt = lemon::concepts::BpGraph::OutArcIt; GR = lemon::concepts::BpGraph; Item = lemon::concepts::BpGraph::Arc; Base = lemon::concepts::BpGraph::Node; char sel = 'o']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphIncIt; Type = lemon::concepts::BpGraph::OutArcIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:994:74: required from ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::BpGraph; BAS = lemon::concepts::BaseBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent; Type = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1102:63: required from ‘void lemon::concepts::IterableGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::BpGraph; BAS = lemon::concepts::BaseBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableGraphComponent; Type = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1209:63: required from ‘void lemon::concepts::IterableBpGraphComponent::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::BpGraph; BAS = lemon::concepts::BaseBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableBpGraphComponent<>; Type = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:1017:61: required from ‘void lemon::concepts::BpGraph::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BpGraph; Type = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:349:36: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:823:15: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::OutArcIt& lemon::concepts::BpGraph::OutArcIt::operator=(const lemon::concepts::BpGraph::OutArcIt&)’ is deprecated [-Wdeprecated-copy] 823 | it2 = ++it1; | ~~~~^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:564:9: note: because ‘lemon::concepts::BpGraph::OutArcIt’ has user-provided ‘lemon::concepts::BpGraph::OutArcIt::OutArcIt(const lemon::concepts::BpGraph::OutArcIt&)’ 564 | OutArcIt(const OutArcIt& e) : Arc(e) { } | ^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:824:17: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::OutArcIt& lemon::concepts::BpGraph::OutArcIt::operator=(const lemon::concepts::BpGraph::OutArcIt&)’ is deprecated [-Wdeprecated-copy] 824 | ++it2 = it1; | ~~~~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:564:9: note: because ‘lemon::concepts::BpGraph::OutArcIt’ has user-provided ‘lemon::concepts::BpGraph::OutArcIt::OutArcIt(const lemon::concepts::BpGraph::OutArcIt&)’ 564 | OutArcIt(const OutArcIt& e) : Arc(e) { } | ^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:827:13: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::Arc& lemon::concepts::BpGraph::Arc::operator=(const lemon::concepts::BpGraph::Arc&)’ is deprecated [-Wdeprecated-copy] 827 | e = it2; | ~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:462:9: note: because ‘lemon::concepts::BpGraph::Arc’ has user-provided ‘lemon::concepts::BpGraph::Arc::Arc(const lemon::concepts::BpGraph::Arc&)’ 462 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItem::Constraints<_GraphItem>::constraints() [with _GraphItem = lemon::concepts::BpGraph::EdgeIt; char sel = '0']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItem<>; Type = lemon::concepts::BpGraph::EdgeIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:724:50: required from ‘void lemon::concepts::GraphItemIt::Constraints<_GraphItemIt>::constraints() [with _GraphItemIt = lemon::concepts::BpGraph::EdgeIt; GR = lemon::concepts::BpGraph; Item = lemon::concepts::BpGraph::Edge]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItemIt; Type = lemon::concepts::BpGraph::EdgeIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1121:40: required from ‘void lemon::concepts::IterableGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::BpGraph; BAS = lemon::concepts::BaseBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableGraphComponent; Type = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1209:63: required from ‘void lemon::concepts::IterableBpGraphComponent::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::BpGraph; BAS = lemon::concepts::BaseBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableBpGraphComponent<>; Type = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:1017:61: required from ‘void lemon::concepts::BpGraph::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BpGraph; Type = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:349:36: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:104:13: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::EdgeIt& lemon::concepts::BpGraph::EdgeIt::operator=(const lemon::concepts::BpGraph::EdgeIt&)’ is deprecated [-Wdeprecated-copy] 104 | i1=INVALID; | ~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:375:9: note: because ‘lemon::concepts::BpGraph::EdgeIt’ has user-provided ‘lemon::concepts::BpGraph::EdgeIt::EdgeIt(const lemon::concepts::BpGraph::EdgeIt&)’ 375 | EdgeIt(const EdgeIt& e) : Edge(e) { } | ^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:19: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::EdgeIt& lemon::concepts::BpGraph::EdgeIt::operator=(const lemon::concepts::BpGraph::EdgeIt&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:375:9: note: because ‘lemon::concepts::BpGraph::EdgeIt’ has user-provided ‘lemon::concepts::BpGraph::EdgeIt::EdgeIt(const lemon::concepts::BpGraph::EdgeIt&)’ 375 | EdgeIt(const EdgeIt& e) : Edge(e) { } | ^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:14: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::EdgeIt& lemon::concepts::BpGraph::EdgeIt::operator=(const lemon::concepts::BpGraph::EdgeIt&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:375:9: note: because ‘lemon::concepts::BpGraph::EdgeIt’ has user-provided ‘lemon::concepts::BpGraph::EdgeIt::EdgeIt(const lemon::concepts::BpGraph::EdgeIt&)’ 375 | EdgeIt(const EdgeIt& e) : Edge(e) { } | ^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItem::Constraints<_GraphItem>::constraints() [with _GraphItem = lemon::concepts::BpGraph::IncEdgeIt; char sel = 'e']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItem<'e'>; Type = lemon::concepts::BpGraph::IncEdgeIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:815:52: required from ‘void lemon::concepts::GraphIncIt::Constraints<_GraphIncIt>::constraints() [with _GraphIncIt = lemon::concepts::BpGraph::IncEdgeIt; GR = lemon::concepts::BpGraph; Item = lemon::concepts::BpGraph::Edge; Base = lemon::concepts::BpGraph::Node; char sel = 'e']’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphIncIt; Type = lemon::concepts::BpGraph::IncEdgeIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1123:71: required from ‘void lemon::concepts::IterableGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::BpGraph; BAS = lemon::concepts::BaseBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableGraphComponent; Type = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1209:63: required from ‘void lemon::concepts::IterableBpGraphComponent::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::BpGraph; BAS = lemon::concepts::BaseBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableBpGraphComponent<>; Type = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:1017:61: required from ‘void lemon::concepts::BpGraph::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BpGraph; Type = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:349:36: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:104:13: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::IncEdgeIt& lemon::concepts::BpGraph::IncEdgeIt::operator=(const lemon::concepts::BpGraph::IncEdgeIt&)’ is deprecated [-Wdeprecated-copy] 104 | i1=INVALID; | ~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:423:9: note: because ‘lemon::concepts::BpGraph::IncEdgeIt’ has user-provided ‘lemon::concepts::BpGraph::IncEdgeIt::IncEdgeIt(const lemon::concepts::BpGraph::IncEdgeIt&)’ 423 | IncEdgeIt(const IncEdgeIt& e) : Edge(e) { } | ^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:19: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::IncEdgeIt& lemon::concepts::BpGraph::IncEdgeIt::operator=(const lemon::concepts::BpGraph::IncEdgeIt&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:423:9: note: because ‘lemon::concepts::BpGraph::IncEdgeIt’ has user-provided ‘lemon::concepts::BpGraph::IncEdgeIt::IncEdgeIt(const lemon::concepts::BpGraph::IncEdgeIt&)’ 423 | IncEdgeIt(const IncEdgeIt& e) : Edge(e) { } | ^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:14: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::IncEdgeIt& lemon::concepts::BpGraph::IncEdgeIt::operator=(const lemon::concepts::BpGraph::IncEdgeIt&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:423:9: note: because ‘lemon::concepts::BpGraph::IncEdgeIt’ has user-provided ‘lemon::concepts::BpGraph::IncEdgeIt::IncEdgeIt(const lemon::concepts::BpGraph::IncEdgeIt&)’ 423 | IncEdgeIt(const IncEdgeIt& e) : Edge(e) { } | ^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItem::Constraints<_GraphItem>::constraints() [with _GraphItem = lemon::concepts::BpGraph::ArcIt; char sel = '0']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItem<>; Type = lemon::concepts::BpGraph::ArcIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:724:50: required from ‘void lemon::concepts::GraphItemIt::Constraints<_GraphItemIt>::constraints() [with _GraphItemIt = lemon::concepts::BpGraph::ArcIt; GR = lemon::concepts::BpGraph; Item = lemon::concepts::BpGraph::Arc]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItemIt; Type = lemon::concepts::BpGraph::ArcIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:988:41: required from ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::BpGraph; BAS = lemon::concepts::BaseBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableGraphComponent; Type = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1209:63: required from ‘void lemon::concepts::IterableBpGraphComponent::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::BpGraph; BAS = lemon::concepts::BaseBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableBpGraphComponent<>; Type = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:1017:61: required from ‘void lemon::concepts::BpGraph::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BpGraph; Type = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:349:36: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:104:13: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::ArcIt& lemon::concepts::BpGraph::ArcIt::operator=(const lemon::concepts::BpGraph::ArcIt&)’ is deprecated [-Wdeprecated-copy] 104 | i1=INVALID; | ~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:516:9: note: because ‘lemon::concepts::BpGraph::ArcIt’ has user-provided ‘lemon::concepts::BpGraph::ArcIt::ArcIt(const lemon::concepts::BpGraph::ArcIt&)’ 516 | ArcIt(const ArcIt& e) : Arc(e) { } | ^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:19: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::ArcIt& lemon::concepts::BpGraph::ArcIt::operator=(const lemon::concepts::BpGraph::ArcIt&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:516:9: note: because ‘lemon::concepts::BpGraph::ArcIt’ has user-provided ‘lemon::concepts::BpGraph::ArcIt::ArcIt(const lemon::concepts::BpGraph::ArcIt&)’ 516 | ArcIt(const ArcIt& e) : Arc(e) { } | ^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:14: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::ArcIt& lemon::concepts::BpGraph::ArcIt::operator=(const lemon::concepts::BpGraph::ArcIt&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:516:9: note: because ‘lemon::concepts::BpGraph::ArcIt’ has user-provided ‘lemon::concepts::BpGraph::ArcIt::ArcIt(const lemon::concepts::BpGraph::ArcIt&)’ 516 | ArcIt(const ArcIt& e) : Arc(e) { } | ^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItem::Constraints<_GraphItem>::constraints() [with _GraphItem = lemon::concepts::BpGraph::NodeIt; char sel = '0']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItem<>; Type = lemon::concepts::BpGraph::NodeIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:724:50: required from ‘void lemon::concepts::GraphItemIt::Constraints<_GraphItemIt>::constraints() [with _GraphItemIt = lemon::concepts::BpGraph::NodeIt; GR = lemon::concepts::BpGraph; Item = lemon::concepts::BpGraph::Node]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItemIt; Type = lemon::concepts::BpGraph::NodeIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:990:42: required from ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::BpGraph; BAS = lemon::concepts::BaseBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableGraphComponent; Type = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1209:63: required from ‘void lemon::concepts::IterableBpGraphComponent::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::BpGraph; BAS = lemon::concepts::BaseBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableBpGraphComponent<>; Type = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:1017:61: required from ‘void lemon::concepts::BpGraph::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BpGraph; Type = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:349:36: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:104:13: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::NodeIt& lemon::concepts::BpGraph::NodeIt::operator=(const lemon::concepts::BpGraph::NodeIt&)’ is deprecated [-Wdeprecated-copy] 104 | i1=INVALID; | ~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:287:9: note: because ‘lemon::concepts::BpGraph::NodeIt’ has user-provided ‘lemon::concepts::BpGraph::NodeIt::NodeIt(const lemon::concepts::BpGraph::NodeIt&)’ 287 | NodeIt(const NodeIt& n) : Node(n) { } | ^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:19: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::NodeIt& lemon::concepts::BpGraph::NodeIt::operator=(const lemon::concepts::BpGraph::NodeIt&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:287:9: note: because ‘lemon::concepts::BpGraph::NodeIt’ has user-provided ‘lemon::concepts::BpGraph::NodeIt::NodeIt(const lemon::concepts::BpGraph::NodeIt&)’ 287 | NodeIt(const NodeIt& n) : Node(n) { } | ^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:14: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::NodeIt& lemon::concepts::BpGraph::NodeIt::operator=(const lemon::concepts::BpGraph::NodeIt&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:287:9: note: because ‘lemon::concepts::BpGraph::NodeIt’ has user-provided ‘lemon::concepts::BpGraph::NodeIt::NodeIt(const lemon::concepts::BpGraph::NodeIt&)’ 287 | NodeIt(const NodeIt& n) : Node(n) { } | ^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItem::Constraints<_GraphItem>::constraints() [with _GraphItem = lemon::concepts::BpGraph::InArcIt; char sel = 'i']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItem<'i'>; Type = lemon::concepts::BpGraph::InArcIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:815:52: required from ‘void lemon::concepts::GraphIncIt::Constraints<_GraphIncIt>::constraints() [with _GraphIncIt = lemon::concepts::BpGraph::InArcIt; GR = lemon::concepts::BpGraph; Item = lemon::concepts::BpGraph::Arc; Base = lemon::concepts::BpGraph::Node; char sel = 'i']’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphIncIt; Type = lemon::concepts::BpGraph::InArcIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:992:73: required from ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::BpGraph; BAS = lemon::concepts::BaseBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableGraphComponent; Type = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1209:63: required from ‘void lemon::concepts::IterableBpGraphComponent::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::BpGraph; BAS = lemon::concepts::BaseBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableBpGraphComponent<>; Type = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:1017:61: required from ‘void lemon::concepts::BpGraph::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BpGraph; Type = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:349:36: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:104:13: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::InArcIt& lemon::concepts::BpGraph::InArcIt::operator=(const lemon::concepts::BpGraph::InArcIt&)’ is deprecated [-Wdeprecated-copy] 104 | i1=INVALID; | ~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:612:9: note: because ‘lemon::concepts::BpGraph::InArcIt’ has user-provided ‘lemon::concepts::BpGraph::InArcIt::InArcIt(const lemon::concepts::BpGraph::InArcIt&)’ 612 | InArcIt(const InArcIt& e) : Arc(e) { } | ^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:19: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::InArcIt& lemon::concepts::BpGraph::InArcIt::operator=(const lemon::concepts::BpGraph::InArcIt&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:612:9: note: because ‘lemon::concepts::BpGraph::InArcIt’ has user-provided ‘lemon::concepts::BpGraph::InArcIt::InArcIt(const lemon::concepts::BpGraph::InArcIt&)’ 612 | InArcIt(const InArcIt& e) : Arc(e) { } | ^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:14: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::InArcIt& lemon::concepts::BpGraph::InArcIt::operator=(const lemon::concepts::BpGraph::InArcIt&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:612:9: note: because ‘lemon::concepts::BpGraph::InArcIt’ has user-provided ‘lemon::concepts::BpGraph::InArcIt::InArcIt(const lemon::concepts::BpGraph::InArcIt&)’ 612 | InArcIt(const InArcIt& e) : Arc(e) { } | ^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItem::Constraints<_GraphItem>::constraints() [with _GraphItem = lemon::concepts::BpGraph::OutArcIt; char sel = 'o']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItem<'o'>; Type = lemon::concepts::BpGraph::OutArcIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:815:52: required from ‘void lemon::concepts::GraphIncIt::Constraints<_GraphIncIt>::constraints() [with _GraphIncIt = lemon::concepts::BpGraph::OutArcIt; GR = lemon::concepts::BpGraph; Item = lemon::concepts::BpGraph::Arc; Base = lemon::concepts::BpGraph::Node; char sel = 'o']’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphIncIt; Type = lemon::concepts::BpGraph::OutArcIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:994:74: required from ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::BpGraph; BAS = lemon::concepts::BaseBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableGraphComponent; Type = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1209:63: required from ‘void lemon::concepts::IterableBpGraphComponent::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::BpGraph; BAS = lemon::concepts::BaseBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableBpGraphComponent<>; Type = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:1017:61: required from ‘void lemon::concepts::BpGraph::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BpGraph; Type = lemon::concepts::BpGraph]’ /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:349:36: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:104:13: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::OutArcIt& lemon::concepts::BpGraph::OutArcIt::operator=(const lemon::concepts::BpGraph::OutArcIt&)’ is deprecated [-Wdeprecated-copy] 104 | i1=INVALID; | ~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:564:9: note: because ‘lemon::concepts::BpGraph::OutArcIt’ has user-provided ‘lemon::concepts::BpGraph::OutArcIt::OutArcIt(const lemon::concepts::BpGraph::OutArcIt&)’ 564 | OutArcIt(const OutArcIt& e) : Arc(e) { } | ^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:19: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::OutArcIt& lemon::concepts::BpGraph::OutArcIt::operator=(const lemon::concepts::BpGraph::OutArcIt&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:564:9: note: because ‘lemon::concepts::BpGraph::OutArcIt’ has user-provided ‘lemon::concepts::BpGraph::OutArcIt::OutArcIt(const lemon::concepts::BpGraph::OutArcIt&)’ 564 | OutArcIt(const OutArcIt& e) : Arc(e) { } | ^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:14: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::OutArcIt& lemon::concepts::BpGraph::OutArcIt::operator=(const lemon::concepts::BpGraph::OutArcIt&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:564:9: note: because ‘lemon::concepts::BpGraph::OutArcIt’ has user-provided ‘lemon::concepts::BpGraph::OutArcIt::OutArcIt(const lemon::concepts::BpGraph::OutArcIt&)’ 564 | OutArcIt(const OutArcIt& e) : Arc(e) { } | ^~~~~~~~ [ 27%] Linking CXX executable bpgraph_test cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/cmake -E cmake_link_script CMakeFiles/bpgraph_test.dir/link.txt --verbose=1 /usr/bin/c++ -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -Wl,-Bsymbolic-functions -Wl,-z,relro -Wl,-z,now -rdynamic CMakeFiles/bpgraph_test.dir/bpgraph_test.cc.o -o bpgraph_test -L/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 27%] Built target bpgraph_test make -f test/CMakeFiles/adaptors_test.dir/build.make test/CMakeFiles/adaptors_test.dir/depend make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<>/liblemon-1.3.1+dfsg /<>/liblemon-1.3.1+dfsg/test /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test/CMakeFiles/adaptors_test.dir/DependInfo.cmake --color= Scanning dependencies of target adaptors_test make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' make -f test/CMakeFiles/adaptors_test.dir/build.make test/CMakeFiles/adaptors_test.dir/build make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 27%] Building CXX object test/CMakeFiles/adaptors_test.dir/adaptors_test.cc.o cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -I/<>/liblemon-1.3.1+dfsg -I/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -o CMakeFiles/adaptors_test.dir/adaptors_test.cc.o -c /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc In file included from /<>/liblemon-1.3.1+dfsg/lemon/adaptors.h:30, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:33: /<>/liblemon-1.3.1+dfsg/lemon/bits/variant.h: In instantiation of ‘lemon::BiVariant<_First, _Second>::BiVariant(const lemon::BiVariant<_First, _Second>&) [with _First = lemon::ListDigraphBase::Arc; _Second = lemon::ListDigraphBase::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/adaptors.h:2951:11: required from ‘void lemon::checkArcIds(const Graph&) [with Graph = lemon::SplitNodes]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:784:22: required from here /<>/liblemon-1.3.1+dfsg/lemon/bits/variant.h:89:13: warning: cast from ‘char*’ to ‘lemon::BiVariant::First*’ {aka ‘lemon::ListDigraphBase::Arc*’} increases required alignment of target type [-Wcast-align] 89 | new(reinterpret_cast(data)) First(bivariant.first()); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/bits/variant.h:91:13: warning: cast from ‘char*’ to ‘lemon::BiVariant::Second*’ {aka ‘lemon::ListDigraphBase::Node*’} increases required alignment of target type [-Wcast-align] 91 | new(reinterpret_cast(data)) Second(bivariant.second()); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/bits/variant.h: In instantiation of ‘void lemon::BiVariant<_First, _Second>::destroy() [with _First = lemon::ListDigraphBase::Arc; _Second = lemon::ListDigraphBase::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/bits/variant.h:99:7: required from ‘lemon::BiVariant<_First, _Second>::~BiVariant() [with _First = lemon::ListDigraphBase::Arc; _Second = lemon::ListDigraphBase::Node]’ /<>/liblemon-1.3.1+dfsg/lemon/adaptors.h:2951:11: required from here /<>/liblemon-1.3.1+dfsg/lemon/bits/variant.h:229:9: warning: cast from ‘char*’ to ‘lemon::BiVariant::First*’ {aka ‘lemon::ListDigraphBase::Arc*’} increases required alignment of target type [-Wcast-align] 229 | reinterpret_cast(data)->~First(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/bits/variant.h:231:9: warning: cast from ‘char*’ to ‘lemon::BiVariant::Second*’ {aka ‘lemon::ListDigraphBase::Node*’} increases required alignment of target type [-Wcast-align] 231 | reinterpret_cast(data)->~Second(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/bits/variant.h: In instantiation of ‘lemon::BiVariant<_First, _Second>::BiVariant(const First&) [with _First = lemon::ListDigraphBase::Arc; _Second = lemon::ListDigraphBase::Node; lemon::BiVariant<_First, _Second>::First = lemon::ListDigraphBase::Arc]’: /<>/liblemon-1.3.1+dfsg/lemon/adaptors.h:2964:47: required from ‘lemon::SplitNodesBase::Arc::Arc(lemon::Invalid) [with DGR = const lemon::ListDigraph]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:790:40: required from here /<>/liblemon-1.3.1+dfsg/lemon/bits/variant.h:71:11: warning: cast from ‘char*’ to ‘lemon::BiVariant::First*’ {aka ‘lemon::ListDigraphBase::Arc*’} increases required alignment of target type [-Wcast-align] 71 | new(reinterpret_cast(data)) First(f); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/bits/variant.h: In instantiation of ‘const First& lemon::BiVariant<_First, _Second>::first() const [with _First = lemon::ListDigraphBase::Arc; _Second = lemon::ListDigraphBase::Node; lemon::BiVariant<_First, _Second>::First = lemon::ListDigraphBase::Arc]’: /<>/liblemon-1.3.1+dfsg/lemon/adaptors.h:2997:56: required from ‘lemon::SplitNodesBase::Arc::operator lemon::SplitNodesBase::DigraphArc() const [with DGR = const lemon::ListDigraph; lemon::SplitNodesBase::DigraphArc = lemon::ListDigraphBase::Arc]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:792:25: required from here /<>/liblemon-1.3.1+dfsg/lemon/bits/variant.h:184:15: warning: cast from ‘const char*’ to ‘const First*’ {aka ‘const lemon::ListDigraphBase::Arc*’} increases required alignment of target type [-Wcast-align] 184 | return *reinterpret_cast(data); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/bits/variant.h: In instantiation of ‘const Second& lemon::BiVariant<_First, _Second>::second() const [with _First = lemon::ListDigraphBase::Arc; _Second = lemon::ListDigraphBase::Node; lemon::BiVariant<_First, _Second>::Second = lemon::ListDigraphBase::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/adaptors.h:3075:16: required from ‘lemon::SplitNodesBase::Node lemon::SplitNodesBase::source(const lemon::SplitNodesBase::Arc&) const [with DGR = const lemon::ListDigraph]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:793:7: required from here /<>/liblemon-1.3.1+dfsg/lemon/bits/variant.h:207:15: warning: cast from ‘const char*’ to ‘const Second*’ {aka ‘const lemon::ListDigraphBase::Node*’} increases required alignment of target type [-Wcast-align] 207 | return *reinterpret_cast(data); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/bits/variant.h: In instantiation of ‘lemon::BiVariant<_First, _Second>::BiVariant(const lemon::BiVariant<_First, _Second>&) [with _First = lemon::GridGraphBase::Edge; _Second = lemon::GridGraphBase::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/adaptors.h:2951:11: required from ‘void lemon::checkArcIds(const Graph&) [with Graph = lemon::SplitNodes::EdgeMap > >]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1418:22: required from here /<>/liblemon-1.3.1+dfsg/lemon/bits/variant.h:89:13: warning: cast from ‘char*’ to ‘lemon::BiVariant::First*’ {aka ‘lemon::GridGraphBase::Edge*’} increases required alignment of target type [-Wcast-align] 89 | new(reinterpret_cast(data)) First(bivariant.first()); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/bits/variant.h:91:13: warning: cast from ‘char*’ to ‘lemon::BiVariant::Second*’ {aka ‘lemon::GridGraphBase::Node*’} increases required alignment of target type [-Wcast-align] 91 | new(reinterpret_cast(data)) Second(bivariant.second()); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/bits/variant.h: In instantiation of ‘lemon::BiVariant<_First, _Second>& lemon::BiVariant<_First, _Second>::operator=(const lemon::BiVariant<_First, _Second>&) [with _First = lemon::ListDigraphBase::Arc; _Second = lemon::ListDigraphBase::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/adaptors.h:2951:11: required from ‘lemon::ConArcIt::ConArcIt(const GR&, lemon::ConArcIt::Node, lemon::ConArcIt::Node) [with GR = lemon::SplitNodes; lemon::ConArcIt::Node = lemon::SplitNodesBase::Node]’ /<>/liblemon-1.3.1+dfsg/test/graph_test.h:169:30: required from ‘void lemon::checkGraphConArcList(const Graph&, int) [with Graph = lemon::SplitNodes]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:767:34: required from here /<>/liblemon-1.3.1+dfsg/lemon/bits/variant.h:162:13: warning: cast from ‘char*’ to ‘lemon::BiVariant::First*’ {aka ‘lemon::ListDigraphBase::Arc*’} increases required alignment of target type [-Wcast-align] 162 | new(reinterpret_cast(data)) First(bivariant.first()); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/bits/variant.h:164:13: warning: cast from ‘char*’ to ‘lemon::BiVariant::Second*’ {aka ‘lemon::ListDigraphBase::Node*’} increases required alignment of target type [-Wcast-align] 164 | new(reinterpret_cast(data)) Second(bivariant.second()); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/bits/variant.h: In instantiation of ‘lemon::BiVariant<_First, _Second>::BiVariant() [with _First = lemon::ListDigraphBase::Arc; _Second = lemon::ListDigraphBase::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/adaptors.h:2963:13: required from ‘lemon::SplitNodesBase::Arc::Arc() [with DGR = const lemon::ListDigraph]’ /<>/liblemon-1.3.1+dfsg/test/graph_test.h:252:5: required from ‘void lemon::checkArcIds(const Graph&) [with Graph = lemon::SplitNodes]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:784:22: required from here /<>/liblemon-1.3.1+dfsg/lemon/bits/variant.h:62:11: warning: cast from ‘char*’ to ‘lemon::BiVariant::First*’ {aka ‘lemon::ListDigraphBase::Arc*’} increases required alignment of target type [-Wcast-align] 62 | new(reinterpret_cast(data)) First(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/bits/variant.h: In instantiation of ‘lemon::BiVariant<_First, _Second>& lemon::BiVariant<_First, _Second>::setSecond() [with _First = lemon::ListDigraphBase::Arc; _Second = lemon::ListDigraphBase::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/adaptors.h:3017:7: required from ‘void lemon::SplitNodesBase::first(lemon::SplitNodesBase::Arc&) const [with DGR = const lemon::ListDigraph]’ /<>/liblemon-1.3.1+dfsg/lemon/bits/graph_adaptor_extender.h:98:9: required from ‘lemon::DigraphAdaptorExtender<_Digraph>::ArcIt::ArcIt(const Adaptor&) [with _Digraph = lemon::SplitNodesBase; lemon::DigraphAdaptorExtender<_Digraph>::Adaptor = lemon::DigraphAdaptorExtender >]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:790:32: required from here /<>/liblemon-1.3.1+dfsg/lemon/bits/variant.h:131:11: warning: cast from ‘char*’ to ‘lemon::BiVariant::Second*’ {aka ‘lemon::ListDigraphBase::Node*’} increases required alignment of target type [-Wcast-align] 131 | new(reinterpret_cast(data)) Second(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/bits/variant.h: In instantiation of ‘lemon::BiVariant<_First, _Second>::Second& lemon::BiVariant<_First, _Second>::second() [with _First = lemon::ListDigraphBase::Arc; _Second = lemon::ListDigraphBase::Node; lemon::BiVariant<_First, _Second>::Second = lemon::ListDigraphBase::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/adaptors.h:3018:7: required from ‘void lemon::SplitNodesBase::first(lemon::SplitNodesBase::Arc&) const [with DGR = const lemon::ListDigraph]’ /<>/liblemon-1.3.1+dfsg/lemon/bits/graph_adaptor_extender.h:98:9: required from ‘lemon::DigraphAdaptorExtender<_Digraph>::ArcIt::ArcIt(const Adaptor&) [with _Digraph = lemon::SplitNodesBase; lemon::DigraphAdaptorExtender<_Digraph>::Adaptor = lemon::DigraphAdaptorExtender >]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:790:32: required from here /<>/liblemon-1.3.1+dfsg/lemon/bits/variant.h:198:15: warning: cast from ‘char*’ to ‘lemon::BiVariant::Second*’ {aka ‘lemon::ListDigraphBase::Node*’} increases required alignment of target type [-Wcast-align] 198 | return *reinterpret_cast(data); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/bits/variant.h: In instantiation of ‘lemon::BiVariant<_First, _Second>& lemon::BiVariant<_First, _Second>::setFirst() [with _First = lemon::ListDigraphBase::Arc; _Second = lemon::ListDigraphBase::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/adaptors.h:3020:9: required from ‘void lemon::SplitNodesBase::first(lemon::SplitNodesBase::Arc&) const [with DGR = const lemon::ListDigraph]’ /<>/liblemon-1.3.1+dfsg/lemon/bits/graph_adaptor_extender.h:98:9: required from ‘lemon::DigraphAdaptorExtender<_Digraph>::ArcIt::ArcIt(const Adaptor&) [with _Digraph = lemon::SplitNodesBase; lemon::DigraphAdaptorExtender<_Digraph>::Adaptor = lemon::DigraphAdaptorExtender >]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:790:32: required from here /<>/liblemon-1.3.1+dfsg/lemon/bits/variant.h:109:11: warning: cast from ‘char*’ to ‘lemon::BiVariant::First*’ {aka ‘lemon::ListDigraphBase::Arc*’} increases required alignment of target type [-Wcast-align] 109 | new(reinterpret_cast(data)) First(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/bits/variant.h: In instantiation of ‘lemon::BiVariant<_First, _Second>::First& lemon::BiVariant<_First, _Second>::first() [with _First = lemon::ListDigraphBase::Arc; _Second = lemon::ListDigraphBase::Node; lemon::BiVariant<_First, _Second>::First = lemon::ListDigraphBase::Arc]’: /<>/liblemon-1.3.1+dfsg/lemon/adaptors.h:3021:9: required from ‘void lemon::SplitNodesBase::first(lemon::SplitNodesBase::Arc&) const [with DGR = const lemon::ListDigraph]’ /<>/liblemon-1.3.1+dfsg/lemon/bits/graph_adaptor_extender.h:98:9: required from ‘lemon::DigraphAdaptorExtender<_Digraph>::ArcIt::ArcIt(const Adaptor&) [with _Digraph = lemon::SplitNodesBase; lemon::DigraphAdaptorExtender<_Digraph>::Adaptor = lemon::DigraphAdaptorExtender >]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:790:32: required from here /<>/liblemon-1.3.1+dfsg/lemon/bits/variant.h:175:15: warning: cast from ‘char*’ to ‘lemon::BiVariant::First*’ {aka ‘lemon::ListDigraphBase::Arc*’} increases required alignment of target type [-Wcast-align] 175 | return *reinterpret_cast(data); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/bits/variant.h: In instantiation of ‘void lemon::BiVariant<_First, _Second>::destroy() [with _First = lemon::GridGraphBase::Edge; _Second = lemon::GridGraphBase::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/bits/variant.h:99:7: required from ‘lemon::BiVariant<_First, _Second>::~BiVariant() [with _First = lemon::GridGraphBase::Edge; _Second = lemon::GridGraphBase::Node]’ /<>/liblemon-1.3.1+dfsg/lemon/adaptors.h:2951:11: required from ‘void lemon::checkGraphArcList(const Graph&, int) [with Graph = lemon::SplitNodes::EdgeMap > >]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1396:31: required from here /<>/liblemon-1.3.1+dfsg/lemon/bits/variant.h:229:9: warning: cast from ‘char*’ to ‘lemon::BiVariant::First*’ {aka ‘lemon::GridGraphBase::Edge*’} increases required alignment of target type [-Wcast-align] 229 | reinterpret_cast(data)->~First(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/bits/variant.h:231:9: warning: cast from ‘char*’ to ‘lemon::BiVariant::Second*’ {aka ‘lemon::GridGraphBase::Node*’} increases required alignment of target type [-Wcast-align] 231 | reinterpret_cast(data)->~Second(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/bits/variant.h: In instantiation of ‘lemon::BiVariant<_First, _Second>::BiVariant(const First&) [with _First = lemon::GridGraphBase::Edge; _Second = lemon::GridGraphBase::Node; lemon::BiVariant<_First, _Second>::First = lemon::GridGraphBase::Edge]’: /<>/liblemon-1.3.1+dfsg/lemon/adaptors.h:2964:47: required from ‘lemon::SplitNodesBase::Arc::Arc(lemon::Invalid) [with DGR = const lemon::Orienter::EdgeMap >]’ /<>/liblemon-1.3.1+dfsg/test/graph_test.h:84:7: required from ‘void lemon::checkGraphArcList(const Graph&, int) [with Graph = lemon::SplitNodes::EdgeMap > >]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1396:31: required from here /<>/liblemon-1.3.1+dfsg/lemon/bits/variant.h:71:11: warning: cast from ‘char*’ to ‘lemon::BiVariant::First*’ {aka ‘lemon::GridGraphBase::Edge*’} increases required alignment of target type [-Wcast-align] 71 | new(reinterpret_cast(data)) First(f); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/bits/variant.h: In instantiation of ‘const First& lemon::BiVariant<_First, _Second>::first() const [with _First = lemon::GridGraphBase::Edge; _Second = lemon::GridGraphBase::Node; lemon::BiVariant<_First, _Second>::First = lemon::GridGraphBase::Edge]’: /<>/liblemon-1.3.1+dfsg/lemon/adaptors.h:3073:16: required from ‘lemon::SplitNodesBase::Node lemon::SplitNodesBase::source(const lemon::SplitNodesBase::Arc&) const [with DGR = const lemon::Orienter::EdgeMap >]’ /<>/liblemon-1.3.1+dfsg/test/graph_test.h:85:7: required from ‘void lemon::checkGraphArcList(const Graph&, int) [with Graph = lemon::SplitNodes::EdgeMap > >]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1396:31: required from here /<>/liblemon-1.3.1+dfsg/lemon/bits/variant.h:184:15: warning: cast from ‘const char*’ to ‘const First*’ {aka ‘const lemon::GridGraphBase::Edge*’} increases required alignment of target type [-Wcast-align] 184 | return *reinterpret_cast(data); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/bits/variant.h: In instantiation of ‘const Second& lemon::BiVariant<_First, _Second>::second() const [with _First = lemon::GridGraphBase::Edge; _Second = lemon::GridGraphBase::Node; lemon::BiVariant<_First, _Second>::Second = lemon::GridGraphBase::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/adaptors.h:3075:16: required from ‘lemon::SplitNodesBase::Node lemon::SplitNodesBase::source(const lemon::SplitNodesBase::Arc&) const [with DGR = const lemon::Orienter::EdgeMap >]’ /<>/liblemon-1.3.1+dfsg/test/graph_test.h:85:7: required from ‘void lemon::checkGraphArcList(const Graph&, int) [with Graph = lemon::SplitNodes::EdgeMap > >]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1396:31: required from here /<>/liblemon-1.3.1+dfsg/lemon/bits/variant.h:207:15: warning: cast from ‘const char*’ to ‘const Second*’ {aka ‘const lemon::GridGraphBase::Node*’} increases required alignment of target type [-Wcast-align] 207 | return *reinterpret_cast(data); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/bits/variant.h: In instantiation of ‘lemon::BiVariant<_First, _Second>& lemon::BiVariant<_First, _Second>::operator=(const lemon::BiVariant<_First, _Second>&) [with _First = lemon::GridGraphBase::Edge; _Second = lemon::GridGraphBase::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/adaptors.h:2951:11: required from ‘lemon::ConArcIt::ConArcIt(const GR&, lemon::ConArcIt::Node, lemon::ConArcIt::Node) [with GR = lemon::SplitNodes::EdgeMap > >; lemon::ConArcIt::Node = lemon::SplitNodesBase::EdgeMap > >::Node]’ /<>/liblemon-1.3.1+dfsg/test/graph_test.h:169:30: required from ‘void lemon::checkGraphConArcList(const Graph&, int) [with Graph = lemon::SplitNodes::EdgeMap > >]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1397:34: required from here /<>/liblemon-1.3.1+dfsg/lemon/bits/variant.h:162:13: warning: cast from ‘char*’ to ‘lemon::BiVariant::First*’ {aka ‘lemon::GridGraphBase::Edge*’} increases required alignment of target type [-Wcast-align] 162 | new(reinterpret_cast(data)) First(bivariant.first()); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/bits/variant.h:164:13: warning: cast from ‘char*’ to ‘lemon::BiVariant::Second*’ {aka ‘lemon::GridGraphBase::Node*’} increases required alignment of target type [-Wcast-align] 164 | new(reinterpret_cast(data)) Second(bivariant.second()); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/bits/variant.h: In instantiation of ‘lemon::BiVariant<_First, _Second>::BiVariant() [with _First = lemon::GridGraphBase::Edge; _Second = lemon::GridGraphBase::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/adaptors.h:2963:13: required from ‘lemon::SplitNodesBase::Arc::Arc() [with DGR = const lemon::Orienter::EdgeMap >]’ /<>/liblemon-1.3.1+dfsg/test/graph_test.h:252:5: required from ‘void lemon::checkArcIds(const Graph&) [with Graph = lemon::SplitNodes::EdgeMap > >]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1418:22: required from here /<>/liblemon-1.3.1+dfsg/lemon/bits/variant.h:62:11: warning: cast from ‘char*’ to ‘lemon::BiVariant::First*’ {aka ‘lemon::GridGraphBase::Edge*’} increases required alignment of target type [-Wcast-align] 62 | new(reinterpret_cast(data)) First(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::BaseDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::ReverseDigraph]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseDigraphComponent; Type = lemon::ReverseDigraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:477:55: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::ReverseDigraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::ReverseDigraph]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:42:71: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:173:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 173 | n = digraph.source(e); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:174:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 174 | n = digraph.target(e); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:175:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 175 | n = digraph.oppositeNode(n, e); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::ReverseDigraph; BAS = lemon::concepts::BaseDigraphComponent]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent<>; Type = lemon::ReverseDigraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::ReverseDigraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::ReverseDigraph]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:42:71: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:999:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 999 | n = digraph.baseNode(iait); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1000:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 1000 | n = digraph.runningNode(iait); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1001:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 1001 | n = digraph.baseNode(oait); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1002:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 1002 | n = digraph.runningNode(oait); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::IDableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::ReverseDigraph; BAS = lemon::concepts::BaseDigraphComponent]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IDableDigraphComponent<>; Type = lemon::ReverseDigraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:479:59: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::ReverseDigraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::ReverseDigraph]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:42:71: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:526:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 526 | node=INVALID; | ~~~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:529:16: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 529 | node = digraph.nodeFromId(nid); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:531:14: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 531 | arc=INVALID; | ~~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:534:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 534 | arc = digraph.arcFromId(eid); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::BaseDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::SubDigraph]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseDigraphComponent; Type = lemon::SubDigraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:477:55: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::SubDigraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::SubDigraph]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:159:67: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:173:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 173 | n = digraph.source(e); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:174:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 174 | n = digraph.target(e); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:175:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 175 | n = digraph.oppositeNode(n, e); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::SubDigraph; BAS = lemon::concepts::BaseDigraphComponent]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent<>; Type = lemon::SubDigraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::SubDigraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::SubDigraph]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:159:67: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:999:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 999 | n = digraph.baseNode(iait); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1000:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 1000 | n = digraph.runningNode(iait); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1001:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 1001 | n = digraph.baseNode(oait); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1002:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 1002 | n = digraph.runningNode(oait); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::IDableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::SubDigraph; BAS = lemon::concepts::BaseDigraphComponent]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IDableDigraphComponent<>; Type = lemon::SubDigraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:479:59: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::SubDigraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::SubDigraph]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:159:67: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:526:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 526 | node=INVALID; | ~~~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:529:16: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 529 | node = digraph.nodeFromId(nid); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:531:14: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 531 | arc=INVALID; | ~~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:534:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 534 | arc = digraph.arcFromId(eid); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::BaseDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::FilterNodes]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseDigraphComponent; Type = lemon::FilterNodes]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:477:55: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::FilterNodes]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::FilterNodes]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:283:68: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:173:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 173 | n = digraph.source(e); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:174:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 174 | n = digraph.target(e); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:175:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 175 | n = digraph.oppositeNode(n, e); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::FilterNodes; BAS = lemon::concepts::BaseDigraphComponent]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent<>; Type = lemon::FilterNodes]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::FilterNodes]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::FilterNodes]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:283:68: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:999:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 999 | n = digraph.baseNode(iait); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1000:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 1000 | n = digraph.runningNode(iait); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1001:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 1001 | n = digraph.baseNode(oait); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1002:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 1002 | n = digraph.runningNode(oait); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::IDableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::FilterNodes; BAS = lemon::concepts::BaseDigraphComponent]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IDableDigraphComponent<>; Type = lemon::FilterNodes]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:479:59: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::FilterNodes]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::FilterNodes]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:283:68: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:526:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 526 | node=INVALID; | ~~~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:529:16: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 529 | node = digraph.nodeFromId(nid); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:531:14: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 531 | arc=INVALID; | ~~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:534:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 534 | arc = digraph.arcFromId(eid); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::BaseDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::FilterArcs]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseDigraphComponent; Type = lemon::FilterArcs]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:477:55: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::FilterArcs]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::FilterArcs]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:379:67: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:173:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 173 | n = digraph.source(e); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:174:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 174 | n = digraph.target(e); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:175:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 175 | n = digraph.oppositeNode(n, e); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::FilterArcs; BAS = lemon::concepts::BaseDigraphComponent]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent<>; Type = lemon::FilterArcs]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::FilterArcs]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::FilterArcs]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:379:67: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:999:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 999 | n = digraph.baseNode(iait); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1000:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 1000 | n = digraph.runningNode(iait); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1001:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 1001 | n = digraph.baseNode(oait); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1002:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 1002 | n = digraph.runningNode(oait); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::IDableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::FilterArcs; BAS = lemon::concepts::BaseDigraphComponent]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IDableDigraphComponent<>; Type = lemon::FilterArcs]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:479:59: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::FilterArcs]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::FilterArcs]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:379:67: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:526:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 526 | node=INVALID; | ~~~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:529:16: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 529 | node = digraph.nodeFromId(nid); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:531:14: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 531 | arc=INVALID; | ~~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:534:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 534 | arc = digraph.arcFromId(eid); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::BaseGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::Undirector]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseGraphComponent; Type = lemon::Undirector]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:775:51: required from ‘void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::Undirector]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Graph; Type = lemon::Undirector]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:477:65: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:284:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 284 | n = graph.u(ue); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:285:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 285 | n = graph.v(ue); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:290:16: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 290 | ue = e; | ~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::IterableGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::Undirector; BAS = lemon::concepts::BaseGraphComponent]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableGraphComponent<>; Type = lemon::Undirector]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:776:57: required from ‘void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::Undirector]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Graph; Type = lemon::Undirector]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:477:65: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1127:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 1127 | n = graph.baseNode(ieit); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1128:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 1128 | n = graph.runningNode(ieit); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::IDableGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::Undirector; BAS = lemon::concepts::BaseGraphComponent]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IDableGraphComponent<>; Type = lemon::Undirector]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:777:55: required from ‘void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::Undirector]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Graph; Type = lemon::Undirector]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:477:65: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:590:16: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 590 | edge = graph.edgeFromId(ueid); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::BaseDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::ResidualDigraph]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseDigraphComponent; Type = lemon::ResidualDigraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:477:55: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::ResidualDigraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::ResidualDigraph]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:588:72: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:173:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 173 | n = digraph.source(e); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:174:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 174 | n = digraph.target(e); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:175:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 175 | n = digraph.oppositeNode(n, e); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::ResidualDigraph; BAS = lemon::concepts::BaseDigraphComponent]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent<>; Type = lemon::ResidualDigraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::ResidualDigraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::ResidualDigraph]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:588:72: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:999:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 999 | n = digraph.baseNode(iait); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1000:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 1000 | n = digraph.runningNode(iait); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1001:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 1001 | n = digraph.baseNode(oait); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1002:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 1002 | n = digraph.runningNode(oait); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::IDableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::ResidualDigraph; BAS = lemon::concepts::BaseDigraphComponent]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IDableDigraphComponent<>; Type = lemon::ResidualDigraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:479:59: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::ResidualDigraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::ResidualDigraph]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:588:72: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:526:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 526 | node=INVALID; | ~~~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:529:16: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 529 | node = digraph.nodeFromId(nid); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/adaptors.h:30, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:33: /<>/liblemon-1.3.1+dfsg/lemon/bits/variant.h: In instantiation of ‘lemon::BiVariant<_First, _Second>& lemon::BiVariant<_First, _Second>::setSecond(const Second&) [with _First = lemon::ListDigraphBase::Arc; _Second = lemon::ListDigraphBase::Node; lemon::BiVariant<_First, _Second>::Second = lemon::ListDigraphBase::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/adaptors.h:3039:9: required from ‘void lemon::SplitNodesBase::firstOut(lemon::SplitNodesBase::Arc&, const lemon::SplitNodesBase::Node&) const [with DGR = const lemon::ListDigraph]’ /<>/liblemon-1.3.1+dfsg/lemon/bits/graph_adaptor_extender.h:122:9: required from ‘lemon::DigraphAdaptorExtender<_Digraph>::OutArcIt::OutArcIt(const Adaptor&, const Node&) [with _Digraph = lemon::SplitNodesBase; lemon::DigraphAdaptorExtender<_Digraph>::Adaptor = lemon::DigraphAdaptorExtender >; lemon::DigraphAdaptorExtender<_Digraph>::Node = lemon::SplitNodesBase::Node]’ /<>/liblemon-1.3.1+dfsg/test/graph_test.h:98:30: required from ‘void lemon::checkGraphOutArcList(const Graph&, typename Graph::Node, int) [with Graph = lemon::SplitNodes; typename Graph::Node = lemon::SplitNodesBase::Node]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:769:54: required from here /<>/liblemon-1.3.1+dfsg/lemon/bits/variant.h:142:11: warning: cast from ‘char*’ to ‘lemon::BiVariant::Second*’ {aka ‘lemon::ListDigraphBase::Node*’} increases required alignment of target type [-Wcast-align] 142 | new(reinterpret_cast(data)) Second(s); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/bits/variant.h: In instantiation of ‘lemon::BiVariant<_First, _Second>& lemon::BiVariant<_First, _Second>::setFirst(const First&) [with _First = lemon::ListDigraphBase::Arc; _Second = lemon::ListDigraphBase::Node; lemon::BiVariant<_First, _Second>::First = lemon::ListDigraphBase::Arc]’: /<>/liblemon-1.3.1+dfsg/lemon/adaptors.h:3048:9: required from ‘void lemon::SplitNodesBase::nextOut(lemon::SplitNodesBase::Arc&) const [with DGR = const lemon::ListDigraph]’ /<>/liblemon-1.3.1+dfsg/lemon/bits/graph_adaptor_extender.h:129:9: required from ‘lemon::DigraphAdaptorExtender<_Digraph>::OutArcIt& lemon::DigraphAdaptorExtender<_Digraph>::OutArcIt::operator++() [with _Digraph = lemon::SplitNodesBase]’ /<>/liblemon-1.3.1+dfsg/test/graph_test.h:104:7: required from ‘void lemon::checkGraphOutArcList(const Graph&, typename Graph::Node, int) [with Graph = lemon::SplitNodes; typename Graph::Node = lemon::SplitNodesBase::Node]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:769:54: required from here /<>/liblemon-1.3.1+dfsg/lemon/bits/variant.h:120:11: warning: cast from ‘char*’ to ‘lemon::BiVariant::First*’ {aka ‘lemon::ListDigraphBase::Arc*’} increases required alignment of target type [-Wcast-align] 120 | new(reinterpret_cast(data)) First(f); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/bits/variant.h: In instantiation of ‘lemon::BiVariant<_First, _Second>::BiVariant(const Second&) [with _First = lemon::ListDigraphBase::Arc; _Second = lemon::ListDigraphBase::Node; lemon::BiVariant<_First, _Second>::Second = lemon::ListDigraphBase::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/adaptors.h:2958:57: required from ‘lemon::SplitNodesBase::Arc::Arc(const DigraphNode&) [with DGR = const lemon::ListDigraph; lemon::SplitNodesBase::DigraphNode = lemon::ListDigraphBase::Node]’ /<>/liblemon-1.3.1+dfsg/lemon/adaptors.h:3108:16: required from ‘lemon::SplitNodesBase::Arc lemon::SplitNodesBase::arcFromId(int) const [with DGR = const lemon::ListDigraph]’ /<>/liblemon-1.3.1+dfsg/test/graph_test.h:247:7: required from ‘void lemon::checkArcIds(const Graph&) [with Graph = lemon::SplitNodes]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:784:22: required from here /<>/liblemon-1.3.1+dfsg/lemon/bits/variant.h:80:11: warning: cast from ‘char*’ to ‘lemon::BiVariant::Second*’ {aka ‘lemon::ListDigraphBase::Node*’} increases required alignment of target type [-Wcast-align] 80 | new(reinterpret_cast(data)) Second(s); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::BaseGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::SubGraph]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseGraphComponent; Type = lemon::SubGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:775:51: required from ‘void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::SubGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Graph; Type = lemon::SubGraph]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:867:61: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:284:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 284 | n = graph.u(ue); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:285:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 285 | n = graph.v(ue); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:286:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 286 | e = graph.direct(ue, true); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:287:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 287 | e = graph.direct(ue, false); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:288:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 288 | e = graph.direct(ue, n); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:289:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 289 | e = graph.oppositeArc(e); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:290:16: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Edge& lemon::concepts::Graph::Edge::operator=(const lemon::concepts::Graph::Edge&)’ is deprecated [-Wdeprecated-copy] 290 | ue = e; | ~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:200:9: note: because ‘lemon::concepts::Graph::Edge’ has user-provided ‘lemon::concepts::Graph::Edge::Edge(const lemon::concepts::Graph::Edge&)’ 200 | Edge(const Edge&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::IterableGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::SubGraph; BAS = lemon::concepts::BaseGraphComponent]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableGraphComponent<>; Type = lemon::SubGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:776:57: required from ‘void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::SubGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Graph; Type = lemon::SubGraph]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:867:61: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1127:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1127 | n = graph.baseNode(ieit); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1128:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1128 | n = graph.runningNode(ieit); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::IDableGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::SubGraph; BAS = lemon::concepts::BaseGraphComponent]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IDableGraphComponent<>; Type = lemon::SubGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:777:55: required from ‘void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::SubGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Graph; Type = lemon::SubGraph]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:867:61: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:590:16: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Edge& lemon::concepts::Graph::Edge::operator=(const lemon::concepts::Graph::Edge&)’ is deprecated [-Wdeprecated-copy] 590 | edge = graph.edgeFromId(ueid); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:200:9: note: because ‘lemon::concepts::Graph::Edge’ has user-provided ‘lemon::concepts::Graph::Edge::Edge(const lemon::concepts::Graph::Edge&)’ 200 | Edge(const Edge&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::BaseGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::FilterNodes]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseGraphComponent; Type = lemon::FilterNodes]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:775:51: required from ‘void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::FilterNodes]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Graph; Type = lemon::FilterNodes]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1001:64: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:284:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 284 | n = graph.u(ue); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:285:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 285 | n = graph.v(ue); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:286:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 286 | e = graph.direct(ue, true); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:287:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 287 | e = graph.direct(ue, false); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:288:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 288 | e = graph.direct(ue, n); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:289:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 289 | e = graph.oppositeArc(e); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:290:16: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Edge& lemon::concepts::Graph::Edge::operator=(const lemon::concepts::Graph::Edge&)’ is deprecated [-Wdeprecated-copy] 290 | ue = e; | ~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:200:9: note: because ‘lemon::concepts::Graph::Edge’ has user-provided ‘lemon::concepts::Graph::Edge::Edge(const lemon::concepts::Graph::Edge&)’ 200 | Edge(const Edge&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::IterableGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::FilterNodes; BAS = lemon::concepts::BaseGraphComponent]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableGraphComponent<>; Type = lemon::FilterNodes]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:776:57: required from ‘void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::FilterNodes]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Graph; Type = lemon::FilterNodes]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1001:64: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1127:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1127 | n = graph.baseNode(ieit); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1128:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1128 | n = graph.runningNode(ieit); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::IDableGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::FilterNodes; BAS = lemon::concepts::BaseGraphComponent]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IDableGraphComponent<>; Type = lemon::FilterNodes]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:777:55: required from ‘void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::FilterNodes]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Graph; Type = lemon::FilterNodes]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1001:64: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:590:16: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Edge& lemon::concepts::Graph::Edge::operator=(const lemon::concepts::Graph::Edge&)’ is deprecated [-Wdeprecated-copy] 590 | edge = graph.edgeFromId(ueid); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:200:9: note: because ‘lemon::concepts::Graph::Edge’ has user-provided ‘lemon::concepts::Graph::Edge::Edge(const lemon::concepts::Graph::Edge&)’ 200 | Edge(const Edge&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::BaseGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::FilterEdges]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseGraphComponent; Type = lemon::FilterEdges]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:775:51: required from ‘void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::FilterEdges]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Graph; Type = lemon::FilterEdges]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1106:64: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:284:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 284 | n = graph.u(ue); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:285:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 285 | n = graph.v(ue); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:286:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 286 | e = graph.direct(ue, true); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:287:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 287 | e = graph.direct(ue, false); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:288:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 288 | e = graph.direct(ue, n); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:289:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 289 | e = graph.oppositeArc(e); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:290:16: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Edge& lemon::concepts::Graph::Edge::operator=(const lemon::concepts::Graph::Edge&)’ is deprecated [-Wdeprecated-copy] 290 | ue = e; | ~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:200:9: note: because ‘lemon::concepts::Graph::Edge’ has user-provided ‘lemon::concepts::Graph::Edge::Edge(const lemon::concepts::Graph::Edge&)’ 200 | Edge(const Edge&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::IterableGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::FilterEdges; BAS = lemon::concepts::BaseGraphComponent]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableGraphComponent<>; Type = lemon::FilterEdges]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:776:57: required from ‘void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::FilterEdges]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Graph; Type = lemon::FilterEdges]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1106:64: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1127:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1127 | n = graph.baseNode(ieit); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1128:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1128 | n = graph.runningNode(ieit); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::IDableGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::FilterEdges; BAS = lemon::concepts::BaseGraphComponent]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IDableGraphComponent<>; Type = lemon::FilterEdges]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:777:55: required from ‘void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::FilterEdges]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Graph; Type = lemon::FilterEdges]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1106:64: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:590:16: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Edge& lemon::concepts::Graph::Edge::operator=(const lemon::concepts::Graph::Edge&)’ is deprecated [-Wdeprecated-copy] 590 | edge = graph.edgeFromId(ueid); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:200:9: note: because ‘lemon::concepts::Graph::Edge’ has user-provided ‘lemon::concepts::Graph::Edge::Edge(const lemon::concepts::Graph::Edge&)’ 200 | Edge(const Edge&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::BaseDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::Orienter]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseDigraphComponent; Type = lemon::Orienter]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:477:55: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::Orienter]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::Orienter]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1212:63: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:173:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 173 | n = digraph.source(e); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:174:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 174 | n = digraph.target(e); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:175:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 175 | n = digraph.oppositeNode(n, e); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::Orienter; BAS = lemon::concepts::BaseDigraphComponent]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent<>; Type = lemon::Orienter]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::Orienter]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::Orienter]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1212:63: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:999:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 999 | n = digraph.baseNode(iait); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1000:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1000 | n = digraph.runningNode(iait); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1001:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1001 | n = digraph.baseNode(oait); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1002:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1002 | n = digraph.runningNode(oait); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::IDableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::Orienter; BAS = lemon::concepts::BaseDigraphComponent]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IDableDigraphComponent<>; Type = lemon::Orienter]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:479:59: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::Orienter]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::Orienter]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1212:63: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:526:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 526 | node=INVALID; | ~~~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:529:16: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 529 | node = digraph.nodeFromId(nid); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:531:14: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Edge& lemon::concepts::Graph::Edge::operator=(const lemon::concepts::Graph::Edge&)’ is deprecated [-Wdeprecated-copy] 531 | arc=INVALID; | ~~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:200:9: note: because ‘lemon::concepts::Graph::Edge’ has user-provided ‘lemon::concepts::Graph::Edge::Edge(const lemon::concepts::Graph::Edge&)’ 200 | Edge(const Edge&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:534:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Edge& lemon::concepts::Graph::Edge::operator=(const lemon::concepts::Graph::Edge&)’ is deprecated [-Wdeprecated-copy] 534 | arc = digraph.arcFromId(eid); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:200:9: note: because ‘lemon::concepts::Graph::Edge’ has user-provided ‘lemon::concepts::Graph::Edge::Edge(const lemon::concepts::Graph::Edge&)’ 200 | Edge(const Edge&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/adaptors.h:30, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:33: /<>/liblemon-1.3.1+dfsg/lemon/bits/variant.h: In instantiation of ‘lemon::BiVariant<_First, _Second>& lemon::BiVariant<_First, _Second>::setSecond() [with _First = lemon::GridGraphBase::Edge; _Second = lemon::GridGraphBase::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/adaptors.h:3017:7: required from ‘void lemon::SplitNodesBase::first(lemon::SplitNodesBase::Arc&) const [with DGR = const lemon::Orienter::EdgeMap >]’ /<>/liblemon-1.3.1+dfsg/lemon/bits/graph_adaptor_extender.h:98:9: required from ‘lemon::DigraphAdaptorExtender<_Digraph>::ArcIt::ArcIt(const Adaptor&) [with _Digraph = lemon::SplitNodesBase::EdgeMap > >; lemon::DigraphAdaptorExtender<_Digraph>::Adaptor = lemon::DigraphAdaptorExtender::EdgeMap > > >]’ /<>/liblemon-1.3.1+dfsg/test/graph_test.h:82:27: required from ‘void lemon::checkGraphArcList(const Graph&, int) [with Graph = lemon::SplitNodes::EdgeMap > >]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1396:31: required from here /<>/liblemon-1.3.1+dfsg/lemon/bits/variant.h:131:11: warning: cast from ‘char*’ to ‘lemon::BiVariant::Second*’ {aka ‘lemon::GridGraphBase::Node*’} increases required alignment of target type [-Wcast-align] 131 | new(reinterpret_cast(data)) Second(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/bits/variant.h: In instantiation of ‘lemon::BiVariant<_First, _Second>::Second& lemon::BiVariant<_First, _Second>::second() [with _First = lemon::GridGraphBase::Edge; _Second = lemon::GridGraphBase::Node; lemon::BiVariant<_First, _Second>::Second = lemon::GridGraphBase::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/adaptors.h:3018:7: required from ‘void lemon::SplitNodesBase::first(lemon::SplitNodesBase::Arc&) const [with DGR = const lemon::Orienter::EdgeMap >]’ /<>/liblemon-1.3.1+dfsg/lemon/bits/graph_adaptor_extender.h:98:9: required from ‘lemon::DigraphAdaptorExtender<_Digraph>::ArcIt::ArcIt(const Adaptor&) [with _Digraph = lemon::SplitNodesBase::EdgeMap > >; lemon::DigraphAdaptorExtender<_Digraph>::Adaptor = lemon::DigraphAdaptorExtender::EdgeMap > > >]’ /<>/liblemon-1.3.1+dfsg/test/graph_test.h:82:27: required from ‘void lemon::checkGraphArcList(const Graph&, int) [with Graph = lemon::SplitNodes::EdgeMap > >]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1396:31: required from here /<>/liblemon-1.3.1+dfsg/lemon/bits/variant.h:198:15: warning: cast from ‘char*’ to ‘lemon::BiVariant::Second*’ {aka ‘lemon::GridGraphBase::Node*’} increases required alignment of target type [-Wcast-align] 198 | return *reinterpret_cast(data); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/bits/variant.h: In instantiation of ‘lemon::BiVariant<_First, _Second>& lemon::BiVariant<_First, _Second>::setFirst() [with _First = lemon::GridGraphBase::Edge; _Second = lemon::GridGraphBase::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/adaptors.h:3020:9: required from ‘void lemon::SplitNodesBase::first(lemon::SplitNodesBase::Arc&) const [with DGR = const lemon::Orienter::EdgeMap >]’ /<>/liblemon-1.3.1+dfsg/lemon/bits/graph_adaptor_extender.h:98:9: required from ‘lemon::DigraphAdaptorExtender<_Digraph>::ArcIt::ArcIt(const Adaptor&) [with _Digraph = lemon::SplitNodesBase::EdgeMap > >; lemon::DigraphAdaptorExtender<_Digraph>::Adaptor = lemon::DigraphAdaptorExtender::EdgeMap > > >]’ /<>/liblemon-1.3.1+dfsg/test/graph_test.h:82:27: required from ‘void lemon::checkGraphArcList(const Graph&, int) [with Graph = lemon::SplitNodes::EdgeMap > >]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1396:31: required from here /<>/liblemon-1.3.1+dfsg/lemon/bits/variant.h:109:11: warning: cast from ‘char*’ to ‘lemon::BiVariant::First*’ {aka ‘lemon::GridGraphBase::Edge*’} increases required alignment of target type [-Wcast-align] 109 | new(reinterpret_cast(data)) First(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/bits/variant.h: In instantiation of ‘lemon::BiVariant<_First, _Second>::First& lemon::BiVariant<_First, _Second>::first() [with _First = lemon::GridGraphBase::Edge; _Second = lemon::GridGraphBase::Node; lemon::BiVariant<_First, _Second>::First = lemon::GridGraphBase::Edge]’: /<>/liblemon-1.3.1+dfsg/lemon/adaptors.h:3021:9: required from ‘void lemon::SplitNodesBase::first(lemon::SplitNodesBase::Arc&) const [with DGR = const lemon::Orienter::EdgeMap >]’ /<>/liblemon-1.3.1+dfsg/lemon/bits/graph_adaptor_extender.h:98:9: required from ‘lemon::DigraphAdaptorExtender<_Digraph>::ArcIt::ArcIt(const Adaptor&) [with _Digraph = lemon::SplitNodesBase::EdgeMap > >; lemon::DigraphAdaptorExtender<_Digraph>::Adaptor = lemon::DigraphAdaptorExtender::EdgeMap > > >]’ /<>/liblemon-1.3.1+dfsg/test/graph_test.h:82:27: required from ‘void lemon::checkGraphArcList(const Graph&, int) [with Graph = lemon::SplitNodes::EdgeMap > >]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1396:31: required from here /<>/liblemon-1.3.1+dfsg/lemon/bits/variant.h:175:15: warning: cast from ‘char*’ to ‘lemon::BiVariant::First*’ {aka ‘lemon::GridGraphBase::Edge*’} increases required alignment of target type [-Wcast-align] 175 | return *reinterpret_cast(data); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/bits/variant.h: In instantiation of ‘lemon::BiVariant<_First, _Second>& lemon::BiVariant<_First, _Second>::setSecond(const Second&) [with _First = lemon::GridGraphBase::Edge; _Second = lemon::GridGraphBase::Node; lemon::BiVariant<_First, _Second>::Second = lemon::GridGraphBase::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/adaptors.h:3039:9: required from ‘void lemon::SplitNodesBase::firstOut(lemon::SplitNodesBase::Arc&, const lemon::SplitNodesBase::Node&) const [with DGR = const lemon::Orienter::EdgeMap >]’ /<>/liblemon-1.3.1+dfsg/lemon/bits/graph_adaptor_extender.h:122:9: required from ‘lemon::DigraphAdaptorExtender<_Digraph>::OutArcIt::OutArcIt(const Adaptor&, const Node&) [with _Digraph = lemon::SplitNodesBase::EdgeMap > >; lemon::DigraphAdaptorExtender<_Digraph>::Adaptor = lemon::DigraphAdaptorExtender::EdgeMap > > >; lemon::DigraphAdaptorExtender<_Digraph>::Node = lemon::SplitNodesBase::EdgeMap > >::Node]’ /<>/liblemon-1.3.1+dfsg/test/graph_test.h:98:30: required from ‘void lemon::checkGraphOutArcList(const Graph&, typename Graph::Node, int) [with Graph = lemon::SplitNodes::EdgeMap > >; typename Graph::Node = lemon::SplitNodesBase::EdgeMap > >::Node]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1399:54: required from here /<>/liblemon-1.3.1+dfsg/lemon/bits/variant.h:142:11: warning: cast from ‘char*’ to ‘lemon::BiVariant::Second*’ {aka ‘lemon::GridGraphBase::Node*’} increases required alignment of target type [-Wcast-align] 142 | new(reinterpret_cast(data)) Second(s); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/bits/variant.h: In instantiation of ‘lemon::BiVariant<_First, _Second>& lemon::BiVariant<_First, _Second>::setFirst(const First&) [with _First = lemon::GridGraphBase::Edge; _Second = lemon::GridGraphBase::Node; lemon::BiVariant<_First, _Second>::First = lemon::GridGraphBase::Edge]’: /<>/liblemon-1.3.1+dfsg/lemon/adaptors.h:3048:9: required from ‘void lemon::SplitNodesBase::nextOut(lemon::SplitNodesBase::Arc&) const [with DGR = const lemon::Orienter::EdgeMap >]’ /<>/liblemon-1.3.1+dfsg/lemon/bits/graph_adaptor_extender.h:129:9: required from ‘lemon::DigraphAdaptorExtender<_Digraph>::OutArcIt& lemon::DigraphAdaptorExtender<_Digraph>::OutArcIt::operator++() [with _Digraph = lemon::SplitNodesBase::EdgeMap > >]’ /<>/liblemon-1.3.1+dfsg/test/graph_test.h:104:7: required from ‘void lemon::checkGraphOutArcList(const Graph&, typename Graph::Node, int) [with Graph = lemon::SplitNodes::EdgeMap > >; typename Graph::Node = lemon::SplitNodesBase::EdgeMap > >::Node]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1399:54: required from here /<>/liblemon-1.3.1+dfsg/lemon/bits/variant.h:120:11: warning: cast from ‘char*’ to ‘lemon::BiVariant::First*’ {aka ‘lemon::GridGraphBase::Edge*’} increases required alignment of target type [-Wcast-align] 120 | new(reinterpret_cast(data)) First(f); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/bits/variant.h: In instantiation of ‘lemon::BiVariant<_First, _Second>::BiVariant(const Second&) [with _First = lemon::GridGraphBase::Edge; _Second = lemon::GridGraphBase::Node; lemon::BiVariant<_First, _Second>::Second = lemon::GridGraphBase::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/adaptors.h:2958:57: required from ‘lemon::SplitNodesBase::Arc::Arc(const DigraphNode&) [with DGR = const lemon::Orienter::EdgeMap >; lemon::SplitNodesBase::DigraphNode = lemon::GridGraphBase::Node]’ /<>/liblemon-1.3.1+dfsg/lemon/adaptors.h:3108:16: required from ‘lemon::SplitNodesBase::Arc lemon::SplitNodesBase::arcFromId(int) const [with DGR = const lemon::Orienter::EdgeMap >]’ /<>/liblemon-1.3.1+dfsg/test/graph_test.h:247:7: required from ‘void lemon::checkArcIds(const Graph&) [with Graph = lemon::SplitNodes::EdgeMap > >]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1418:22: required from here /<>/liblemon-1.3.1+dfsg/lemon/bits/variant.h:80:11: warning: cast from ‘char*’ to ‘lemon::BiVariant::Second*’ {aka ‘lemon::GridGraphBase::Node*’} increases required alignment of target type [-Wcast-align] 80 | new(reinterpret_cast(data)) Second(s); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItem::Constraints<_GraphItem>::constraints() [with _GraphItem = lemon::concepts::Digraph::Node; char sel = 'n']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItem<'n'>; Type = lemon::concepts::Digraph::Node]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:168:45: required from ‘void lemon::concepts::BaseDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::ReverseDigraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseDigraphComponent; Type = lemon::ReverseDigraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:477:55: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::ReverseDigraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::ReverseDigraph]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:42:71: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:104:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 104 | i1=INVALID; | ~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:19: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:14: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItem::Constraints<_GraphItem>::constraints() [with _GraphItem = lemon::concepts::Digraph::Arc; char sel = 'a']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItem<'a'>; Type = lemon::concepts::Digraph::Arc]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:169:44: required from ‘void lemon::concepts::BaseDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::ReverseDigraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseDigraphComponent; Type = lemon::ReverseDigraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:477:55: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::ReverseDigraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::ReverseDigraph]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:42:71: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:104:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 104 | i1=INVALID; | ~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:19: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:14: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItemIt::Constraints<_GraphItemIt>::constraints() [with _GraphItemIt = lemon::DigraphAdaptorExtender >::ArcIt; GR = lemon::ReverseDigraph; Item = lemon::concepts::Digraph::Arc]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItemIt, lemon::concepts::Digraph::Arc>; Type = lemon::DigraphAdaptorExtender >::ArcIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:988:41: required from ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::ReverseDigraph; BAS = lemon::concepts::BaseDigraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent<>; Type = lemon::ReverseDigraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::ReverseDigraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::ReverseDigraph]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:42:71: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:737:14: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 737 | bi = it2; | ~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItemIt::Constraints<_GraphItemIt>::constraints() [with _GraphItemIt = lemon::DigraphAdaptorExtender >::NodeIt; GR = lemon::ReverseDigraph; Item = lemon::concepts::Digraph::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItemIt, lemon::concepts::Digraph::Node>; Type = lemon::DigraphAdaptorExtender >::NodeIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:990:42: required from ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::ReverseDigraph; BAS = lemon::concepts::BaseDigraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent<>; Type = lemon::ReverseDigraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::ReverseDigraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::ReverseDigraph]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:42:71: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:737:14: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 737 | bi = it2; | ~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphIncIt::Constraints<_GraphIncIt>::constraints() [with _GraphIncIt = lemon::DigraphAdaptorExtender >::InArcIt; GR = lemon::ReverseDigraph; Item = lemon::concepts::Digraph::Arc; Base = lemon::concepts::Digraph::Node; char sel = 'i']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphIncIt, lemon::concepts::Digraph::Arc, lemon::concepts::Digraph::Node, 'i'>; Type = lemon::DigraphAdaptorExtender >::InArcIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:992:73: required from ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::ReverseDigraph; BAS = lemon::concepts::BaseDigraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent<>; Type = lemon::ReverseDigraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::ReverseDigraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::ReverseDigraph]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:42:71: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:827:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 827 | e = it2; | ~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphIncIt::Constraints<_GraphIncIt>::constraints() [with _GraphIncIt = lemon::DigraphAdaptorExtender >::OutArcIt; GR = lemon::ReverseDigraph; Item = lemon::concepts::Digraph::Arc; Base = lemon::concepts::Digraph::Node; char sel = 'o']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphIncIt, lemon::concepts::Digraph::Arc, lemon::concepts::Digraph::Node, 'o'>; Type = lemon::DigraphAdaptorExtender >::OutArcIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:994:74: required from ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::ReverseDigraph; BAS = lemon::concepts::BaseDigraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent<>; Type = lemon::ReverseDigraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::ReverseDigraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::ReverseDigraph]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:42:71: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:827:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 827 | e = it2; | ~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItemIt::Constraints<_GraphItemIt>::constraints() [with _GraphItemIt = lemon::DigraphAdaptorExtender, lemon::concepts::Digraph::ArcMap, true> >::ArcIt; GR = lemon::SubDigraph; Item = lemon::concepts::Digraph::Arc]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItemIt, lemon::concepts::Digraph::Arc>; Type = lemon::DigraphAdaptorExtender, lemon::concepts::Digraph::ArcMap, true> >::ArcIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:988:41: required from ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::SubDigraph; BAS = lemon::concepts::BaseDigraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent<>; Type = lemon::SubDigraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::SubDigraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::SubDigraph]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:159:67: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:737:14: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 737 | bi = it2; | ~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItemIt::Constraints<_GraphItemIt>::constraints() [with _GraphItemIt = lemon::DigraphAdaptorExtender, lemon::concepts::Digraph::ArcMap, true> >::NodeIt; GR = lemon::SubDigraph; Item = lemon::concepts::Digraph::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItemIt, lemon::concepts::Digraph::Node>; Type = lemon::DigraphAdaptorExtender, lemon::concepts::Digraph::ArcMap, true> >::NodeIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:990:42: required from ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::SubDigraph; BAS = lemon::concepts::BaseDigraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent<>; Type = lemon::SubDigraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::SubDigraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::SubDigraph]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:159:67: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:737:14: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 737 | bi = it2; | ~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphIncIt::Constraints<_GraphIncIt>::constraints() [with _GraphIncIt = lemon::DigraphAdaptorExtender, lemon::concepts::Digraph::ArcMap, true> >::InArcIt; GR = lemon::SubDigraph; Item = lemon::concepts::Digraph::Arc; Base = lemon::concepts::Digraph::Node; char sel = 'i']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphIncIt, lemon::concepts::Digraph::Arc, lemon::concepts::Digraph::Node, 'i'>; Type = lemon::DigraphAdaptorExtender, lemon::concepts::Digraph::ArcMap, true> >::InArcIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:992:73: required from ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::SubDigraph; BAS = lemon::concepts::BaseDigraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent<>; Type = lemon::SubDigraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::SubDigraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::SubDigraph]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:159:67: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:827:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 827 | e = it2; | ~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphIncIt::Constraints<_GraphIncIt>::constraints() [with _GraphIncIt = lemon::DigraphAdaptorExtender, lemon::concepts::Digraph::ArcMap, true> >::OutArcIt; GR = lemon::SubDigraph; Item = lemon::concepts::Digraph::Arc; Base = lemon::concepts::Digraph::Node; char sel = 'o']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphIncIt, lemon::concepts::Digraph::Arc, lemon::concepts::Digraph::Node, 'o'>; Type = lemon::DigraphAdaptorExtender, lemon::concepts::Digraph::ArcMap, true> >::OutArcIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:994:74: required from ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::SubDigraph; BAS = lemon::concepts::BaseDigraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent<>; Type = lemon::SubDigraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::SubDigraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::SubDigraph]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:159:67: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:827:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 827 | e = it2; | ~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItemIt::Constraints<_GraphItemIt>::constraints() [with _GraphItemIt = lemon::DigraphAdaptorExtender, lemon::ConstMap >, true> >::ArcIt; GR = lemon::FilterNodes; Item = lemon::concepts::Digraph::Arc]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItemIt, lemon::concepts::Digraph::Arc>; Type = lemon::DigraphAdaptorExtender, lemon::ConstMap >, true> >::ArcIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:988:41: required from ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::FilterNodes; BAS = lemon::concepts::BaseDigraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent<>; Type = lemon::FilterNodes]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::FilterNodes]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::FilterNodes]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:283:68: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:737:14: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 737 | bi = it2; | ~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItemIt::Constraints<_GraphItemIt>::constraints() [with _GraphItemIt = lemon::DigraphAdaptorExtender, lemon::ConstMap >, true> >::NodeIt; GR = lemon::FilterNodes; Item = lemon::concepts::Digraph::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItemIt, lemon::concepts::Digraph::Node>; Type = lemon::DigraphAdaptorExtender, lemon::ConstMap >, true> >::NodeIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:990:42: required from ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::FilterNodes; BAS = lemon::concepts::BaseDigraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent<>; Type = lemon::FilterNodes]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::FilterNodes]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::FilterNodes]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:283:68: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:737:14: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 737 | bi = it2; | ~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphIncIt::Constraints<_GraphIncIt>::constraints() [with _GraphIncIt = lemon::DigraphAdaptorExtender, lemon::ConstMap >, true> >::InArcIt; GR = lemon::FilterNodes; Item = lemon::concepts::Digraph::Arc; Base = lemon::concepts::Digraph::Node; char sel = 'i']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphIncIt, lemon::concepts::Digraph::Arc, lemon::concepts::Digraph::Node, 'i'>; Type = lemon::DigraphAdaptorExtender, lemon::ConstMap >, true> >::InArcIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:992:73: required from ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::FilterNodes; BAS = lemon::concepts::BaseDigraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent<>; Type = lemon::FilterNodes]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::FilterNodes]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::FilterNodes]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:283:68: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:827:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 827 | e = it2; | ~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphIncIt::Constraints<_GraphIncIt>::constraints() [with _GraphIncIt = lemon::DigraphAdaptorExtender, lemon::ConstMap >, true> >::OutArcIt; GR = lemon::FilterNodes; Item = lemon::concepts::Digraph::Arc; Base = lemon::concepts::Digraph::Node; char sel = 'o']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphIncIt, lemon::concepts::Digraph::Arc, lemon::concepts::Digraph::Node, 'o'>; Type = lemon::DigraphAdaptorExtender, lemon::ConstMap >, true> >::OutArcIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:994:74: required from ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::FilterNodes; BAS = lemon::concepts::BaseDigraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent<>; Type = lemon::FilterNodes]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::FilterNodes]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::FilterNodes]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:283:68: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:827:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 827 | e = it2; | ~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItemIt::Constraints<_GraphItemIt>::constraints() [with _GraphItemIt = lemon::DigraphAdaptorExtender >, lemon::concepts::Digraph::ArcMap, false> >::ArcIt; GR = lemon::FilterArcs; Item = lemon::concepts::Digraph::Arc]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItemIt, lemon::concepts::Digraph::Arc>; Type = lemon::DigraphAdaptorExtender >, lemon::concepts::Digraph::ArcMap, false> >::ArcIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:988:41: required from ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::FilterArcs; BAS = lemon::concepts::BaseDigraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent<>; Type = lemon::FilterArcs]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::FilterArcs]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::FilterArcs]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:379:67: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:737:14: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 737 | bi = it2; | ~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItemIt::Constraints<_GraphItemIt>::constraints() [with _GraphItemIt = lemon::DigraphAdaptorExtender >, lemon::concepts::Digraph::ArcMap, false> >::NodeIt; GR = lemon::FilterArcs; Item = lemon::concepts::Digraph::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItemIt, lemon::concepts::Digraph::Node>; Type = lemon::DigraphAdaptorExtender >, lemon::concepts::Digraph::ArcMap, false> >::NodeIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:990:42: required from ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::FilterArcs; BAS = lemon::concepts::BaseDigraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent<>; Type = lemon::FilterArcs]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::FilterArcs]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::FilterArcs]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:379:67: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:737:14: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 737 | bi = it2; | ~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphIncIt::Constraints<_GraphIncIt>::constraints() [with _GraphIncIt = lemon::DigraphAdaptorExtender >, lemon::concepts::Digraph::ArcMap, false> >::InArcIt; GR = lemon::FilterArcs; Item = lemon::concepts::Digraph::Arc; Base = lemon::concepts::Digraph::Node; char sel = 'i']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphIncIt, lemon::concepts::Digraph::Arc, lemon::concepts::Digraph::Node, 'i'>; Type = lemon::DigraphAdaptorExtender >, lemon::concepts::Digraph::ArcMap, false> >::InArcIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:992:73: required from ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::FilterArcs; BAS = lemon::concepts::BaseDigraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent<>; Type = lemon::FilterArcs]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::FilterArcs]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::FilterArcs]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:379:67: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:827:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 827 | e = it2; | ~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphIncIt::Constraints<_GraphIncIt>::constraints() [with _GraphIncIt = lemon::DigraphAdaptorExtender >, lemon::concepts::Digraph::ArcMap, false> >::OutArcIt; GR = lemon::FilterArcs; Item = lemon::concepts::Digraph::Arc; Base = lemon::concepts::Digraph::Node; char sel = 'o']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphIncIt, lemon::concepts::Digraph::Arc, lemon::concepts::Digraph::Node, 'o'>; Type = lemon::DigraphAdaptorExtender >, lemon::concepts::Digraph::ArcMap, false> >::OutArcIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:994:74: required from ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::FilterArcs; BAS = lemon::concepts::BaseDigraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent<>; Type = lemon::FilterArcs]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::FilterArcs]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::FilterArcs]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:379:67: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:827:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 827 | e = it2; | ~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::BaseDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::Undirector]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseDigraphComponent; Type = lemon::Undirector]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:278:53: required from ‘void lemon::concepts::BaseGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::Undirector]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseGraphComponent; Type = lemon::Undirector]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:775:51: required from ‘void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::Undirector]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Graph; Type = lemon::Undirector]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:477:65: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:173:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 173 | n = digraph.source(e); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:174:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 174 | n = digraph.target(e); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:175:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 175 | n = digraph.oppositeNode(n, e); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItem::Constraints<_GraphItem>::constraints() [with _GraphItem = lemon::concepts::Digraph::Arc; char sel = 'e']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItem<'e'>; Type = lemon::concepts::Digraph::Arc]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:279:45: required from ‘void lemon::concepts::BaseGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::Undirector]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseGraphComponent; Type = lemon::Undirector]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:775:51: required from ‘void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::Undirector]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Graph; Type = lemon::Undirector]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:477:65: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:104:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 104 | i1=INVALID; | ~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:19: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:14: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::Undirector; BAS = lemon::concepts::BaseGraphComponent]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent; Type = lemon::Undirector]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1102:63: required from ‘void lemon::concepts::IterableGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::Undirector; BAS = lemon::concepts::BaseGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableGraphComponent<>; Type = lemon::Undirector]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:776:57: required from ‘void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::Undirector]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Graph; Type = lemon::Undirector]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:477:65: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:999:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 999 | n = digraph.baseNode(iait); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1000:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 1000 | n = digraph.runningNode(iait); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1001:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 1001 | n = digraph.baseNode(oait); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1002:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 1002 | n = digraph.runningNode(oait); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItemIt::Constraints<_GraphItemIt>::constraints() [with _GraphItemIt = lemon::GraphAdaptorExtender >::EdgeIt; GR = lemon::Undirector; Item = lemon::concepts::Digraph::Arc]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItemIt, lemon::concepts::Digraph::Arc>; Type = lemon::GraphAdaptorExtender >::EdgeIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1121:40: required from ‘void lemon::concepts::IterableGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::Undirector; BAS = lemon::concepts::BaseGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableGraphComponent<>; Type = lemon::Undirector]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:776:57: required from ‘void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::Undirector]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Graph; Type = lemon::Undirector]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:477:65: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:737:14: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 737 | bi = it2; | ~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphIncIt::Constraints<_GraphIncIt>::constraints() [with _GraphIncIt = lemon::GraphAdaptorExtender >::IncEdgeIt; GR = lemon::Undirector; Item = lemon::concepts::Digraph::Arc; Base = lemon::concepts::Digraph::Node; char sel = 'e']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphIncIt, lemon::concepts::Digraph::Arc, lemon::concepts::Digraph::Node, 'e'>; Type = lemon::GraphAdaptorExtender >::IncEdgeIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1123:71: required from ‘void lemon::concepts::IterableGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::Undirector; BAS = lemon::concepts::BaseGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableGraphComponent<>; Type = lemon::Undirector]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:776:57: required from ‘void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::Undirector]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Graph; Type = lemon::Undirector]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:477:65: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:827:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 827 | e = it2; | ~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::IDableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::Undirector; BAS = lemon::concepts::BaseGraphComponent]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IDableDigraphComponent; Type = lemon::Undirector]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:586:62: required from ‘void lemon::concepts::IDableGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::Undirector; BAS = lemon::concepts::BaseGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IDableGraphComponent<>; Type = lemon::Undirector]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:777:55: required from ‘void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::Undirector]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Graph; Type = lemon::Undirector]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:477:65: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:526:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 526 | node=INVALID; | ~~~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:529:16: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 529 | node = digraph.nodeFromId(nid); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItemIt::Constraints<_GraphItemIt>::constraints() [with _GraphItemIt = lemon::DigraphAdaptorExtender, lemon::ConstMap >, lemon::Undirector::CombinedArcMap, lemon::concepts::Digraph::ArcMap, lemon::Tolerance >, lemon::_adaptor_bits::ResBackwardFilter, lemon::concepts::Digraph::ArcMap, lemon::Tolerance > >, true> >::NodeIt; GR = lemon::ResidualDigraph; Item = lemon::concepts::Digraph::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItemIt, lemon::concepts::Digraph::Node>; Type = lemon::DigraphAdaptorExtender, lemon::ConstMap >, lemon::Undirector::CombinedArcMap, lemon::concepts::Digraph::ArcMap, lemon::Tolerance >, lemon::_adaptor_bits::ResBackwardFilter, lemon::concepts::Digraph::ArcMap, lemon::Tolerance > >, true> >::NodeIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:990:42: required from ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::ResidualDigraph; BAS = lemon::concepts::BaseDigraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent<>; Type = lemon::ResidualDigraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::ResidualDigraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::ResidualDigraph]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:588:72: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:737:14: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 737 | bi = it2; | ~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::BaseDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::SubGraph]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseDigraphComponent; Type = lemon::SubGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:278:53: required from ‘void lemon::concepts::BaseGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::SubGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseGraphComponent; Type = lemon::SubGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:775:51: required from ‘void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::SubGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Graph; Type = lemon::SubGraph]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:867:61: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:173:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 173 | n = digraph.source(e); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:174:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 174 | n = digraph.target(e); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:175:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 175 | n = digraph.oppositeNode(n, e); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItem::Constraints<_GraphItem>::constraints() [with _GraphItem = lemon::concepts::Graph::Edge; char sel = 'e']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItem<'e'>; Type = lemon::concepts::Graph::Edge]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:279:45: required from ‘void lemon::concepts::BaseGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::SubGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseGraphComponent; Type = lemon::SubGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:775:51: required from ‘void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::SubGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Graph; Type = lemon::SubGraph]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:867:61: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:104:13: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Edge& lemon::concepts::Graph::Edge::operator=(const lemon::concepts::Graph::Edge&)’ is deprecated [-Wdeprecated-copy] 104 | i1=INVALID; | ~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:200:9: note: because ‘lemon::concepts::Graph::Edge’ has user-provided ‘lemon::concepts::Graph::Edge::Edge(const lemon::concepts::Graph::Edge&)’ 200 | Edge(const Edge&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:19: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Edge& lemon::concepts::Graph::Edge::operator=(const lemon::concepts::Graph::Edge&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:200:9: note: because ‘lemon::concepts::Graph::Edge’ has user-provided ‘lemon::concepts::Graph::Edge::Edge(const lemon::concepts::Graph::Edge&)’ 200 | Edge(const Edge&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:14: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Edge& lemon::concepts::Graph::Edge::operator=(const lemon::concepts::Graph::Edge&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:200:9: note: because ‘lemon::concepts::Graph::Edge’ has user-provided ‘lemon::concepts::Graph::Edge::Edge(const lemon::concepts::Graph::Edge&)’ 200 | Edge(const Edge&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::SubGraph; BAS = lemon::concepts::BaseGraphComponent]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent; Type = lemon::SubGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1102:63: required from ‘void lemon::concepts::IterableGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::SubGraph; BAS = lemon::concepts::BaseGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableGraphComponent<>; Type = lemon::SubGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:776:57: required from ‘void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::SubGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Graph; Type = lemon::SubGraph]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:867:61: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:999:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 999 | n = digraph.baseNode(iait); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1000:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1000 | n = digraph.runningNode(iait); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1001:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1001 | n = digraph.baseNode(oait); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1002:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1002 | n = digraph.runningNode(oait); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItemIt::Constraints<_GraphItemIt>::constraints() [with _GraphItemIt = lemon::GraphAdaptorExtender, lemon::concepts::Graph::EdgeMap, true> >::EdgeIt; GR = lemon::SubGraph; Item = lemon::concepts::Graph::Edge]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItemIt, lemon::concepts::Graph::Edge>; Type = lemon::GraphAdaptorExtender, lemon::concepts::Graph::EdgeMap, true> >::EdgeIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1121:40: required from ‘void lemon::concepts::IterableGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::SubGraph; BAS = lemon::concepts::BaseGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableGraphComponent<>; Type = lemon::SubGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:776:57: required from ‘void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::SubGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Graph; Type = lemon::SubGraph]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:867:61: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:737:14: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Edge& lemon::concepts::Graph::Edge::operator=(const lemon::concepts::Graph::Edge&)’ is deprecated [-Wdeprecated-copy] 737 | bi = it2; | ~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:200:9: note: because ‘lemon::concepts::Graph::Edge’ has user-provided ‘lemon::concepts::Graph::Edge::Edge(const lemon::concepts::Graph::Edge&)’ 200 | Edge(const Edge&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphIncIt::Constraints<_GraphIncIt>::constraints() [with _GraphIncIt = lemon::GraphAdaptorExtender, lemon::concepts::Graph::EdgeMap, true> >::IncEdgeIt; GR = lemon::SubGraph; Item = lemon::concepts::Graph::Edge; Base = lemon::concepts::Graph::Node; char sel = 'e']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphIncIt, lemon::concepts::Graph::Edge, lemon::concepts::Graph::Node, 'e'>; Type = lemon::GraphAdaptorExtender, lemon::concepts::Graph::EdgeMap, true> >::IncEdgeIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1123:71: required from ‘void lemon::concepts::IterableGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::SubGraph; BAS = lemon::concepts::BaseGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableGraphComponent<>; Type = lemon::SubGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:776:57: required from ‘void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::SubGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Graph; Type = lemon::SubGraph]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:867:61: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:827:13: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Edge& lemon::concepts::Graph::Edge::operator=(const lemon::concepts::Graph::Edge&)’ is deprecated [-Wdeprecated-copy] 827 | e = it2; | ~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:200:9: note: because ‘lemon::concepts::Graph::Edge’ has user-provided ‘lemon::concepts::Graph::Edge::Edge(const lemon::concepts::Graph::Edge&)’ 200 | Edge(const Edge&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::IDableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::SubGraph; BAS = lemon::concepts::BaseGraphComponent]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IDableDigraphComponent; Type = lemon::SubGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:586:62: required from ‘void lemon::concepts::IDableGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::SubGraph; BAS = lemon::concepts::BaseGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IDableGraphComponent<>; Type = lemon::SubGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:777:55: required from ‘void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::SubGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Graph; Type = lemon::SubGraph]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:867:61: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:526:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 526 | node=INVALID; | ~~~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:529:16: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 529 | node = digraph.nodeFromId(nid); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:531:14: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 531 | arc=INVALID; | ~~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:534:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 534 | arc = digraph.arcFromId(eid); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::BaseDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::FilterNodes]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseDigraphComponent; Type = lemon::FilterNodes]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:278:53: required from ‘void lemon::concepts::BaseGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::FilterNodes]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseGraphComponent; Type = lemon::FilterNodes]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:775:51: required from ‘void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::FilterNodes]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Graph; Type = lemon::FilterNodes]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1001:64: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:173:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 173 | n = digraph.source(e); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:174:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 174 | n = digraph.target(e); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:175:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 175 | n = digraph.oppositeNode(n, e); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::FilterNodes; BAS = lemon::concepts::BaseGraphComponent]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent; Type = lemon::FilterNodes]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1102:63: required from ‘void lemon::concepts::IterableGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::FilterNodes; BAS = lemon::concepts::BaseGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableGraphComponent<>; Type = lemon::FilterNodes]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:776:57: required from ‘void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::FilterNodes]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Graph; Type = lemon::FilterNodes]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1001:64: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:999:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 999 | n = digraph.baseNode(iait); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1000:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1000 | n = digraph.runningNode(iait); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1001:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1001 | n = digraph.baseNode(oait); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1002:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1002 | n = digraph.runningNode(oait); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItemIt::Constraints<_GraphItemIt>::constraints() [with _GraphItemIt = lemon::GraphAdaptorExtender, lemon::ConstMap >, true> >::EdgeIt; GR = lemon::FilterNodes; Item = lemon::concepts::Graph::Edge]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItemIt, lemon::concepts::Graph::Edge>; Type = lemon::GraphAdaptorExtender, lemon::ConstMap >, true> >::EdgeIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1121:40: required from ‘void lemon::concepts::IterableGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::FilterNodes; BAS = lemon::concepts::BaseGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableGraphComponent<>; Type = lemon::FilterNodes]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:776:57: required from ‘void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::FilterNodes]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Graph; Type = lemon::FilterNodes]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1001:64: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:737:14: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Edge& lemon::concepts::Graph::Edge::operator=(const lemon::concepts::Graph::Edge&)’ is deprecated [-Wdeprecated-copy] 737 | bi = it2; | ~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:200:9: note: because ‘lemon::concepts::Graph::Edge’ has user-provided ‘lemon::concepts::Graph::Edge::Edge(const lemon::concepts::Graph::Edge&)’ 200 | Edge(const Edge&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphIncIt::Constraints<_GraphIncIt>::constraints() [with _GraphIncIt = lemon::GraphAdaptorExtender, lemon::ConstMap >, true> >::IncEdgeIt; GR = lemon::FilterNodes; Item = lemon::concepts::Graph::Edge; Base = lemon::concepts::Graph::Node; char sel = 'e']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphIncIt, lemon::concepts::Graph::Edge, lemon::concepts::Graph::Node, 'e'>; Type = lemon::GraphAdaptorExtender, lemon::ConstMap >, true> >::IncEdgeIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1123:71: required from ‘void lemon::concepts::IterableGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::FilterNodes; BAS = lemon::concepts::BaseGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableGraphComponent<>; Type = lemon::FilterNodes]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:776:57: required from ‘void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::FilterNodes]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Graph; Type = lemon::FilterNodes]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1001:64: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:827:13: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Edge& lemon::concepts::Graph::Edge::operator=(const lemon::concepts::Graph::Edge&)’ is deprecated [-Wdeprecated-copy] 827 | e = it2; | ~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:200:9: note: because ‘lemon::concepts::Graph::Edge’ has user-provided ‘lemon::concepts::Graph::Edge::Edge(const lemon::concepts::Graph::Edge&)’ 200 | Edge(const Edge&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::IDableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::FilterNodes; BAS = lemon::concepts::BaseGraphComponent]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IDableDigraphComponent; Type = lemon::FilterNodes]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:586:62: required from ‘void lemon::concepts::IDableGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::FilterNodes; BAS = lemon::concepts::BaseGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IDableGraphComponent<>; Type = lemon::FilterNodes]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:777:55: required from ‘void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::FilterNodes]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Graph; Type = lemon::FilterNodes]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1001:64: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:526:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 526 | node=INVALID; | ~~~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:529:16: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 529 | node = digraph.nodeFromId(nid); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:531:14: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 531 | arc=INVALID; | ~~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:534:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 534 | arc = digraph.arcFromId(eid); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::BaseDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::FilterEdges]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseDigraphComponent; Type = lemon::FilterEdges]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:278:53: required from ‘void lemon::concepts::BaseGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::FilterEdges]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseGraphComponent; Type = lemon::FilterEdges]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:775:51: required from ‘void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::FilterEdges]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Graph; Type = lemon::FilterEdges]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1106:64: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:173:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 173 | n = digraph.source(e); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:174:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 174 | n = digraph.target(e); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:175:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 175 | n = digraph.oppositeNode(n, e); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::FilterEdges; BAS = lemon::concepts::BaseGraphComponent]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent; Type = lemon::FilterEdges]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1102:63: required from ‘void lemon::concepts::IterableGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::FilterEdges; BAS = lemon::concepts::BaseGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableGraphComponent<>; Type = lemon::FilterEdges]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:776:57: required from ‘void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::FilterEdges]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Graph; Type = lemon::FilterEdges]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1106:64: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:999:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 999 | n = digraph.baseNode(iait); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1000:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1000 | n = digraph.runningNode(iait); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1001:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1001 | n = digraph.baseNode(oait); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1002:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1002 | n = digraph.runningNode(oait); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItemIt::Constraints<_GraphItemIt>::constraints() [with _GraphItemIt = lemon::GraphAdaptorExtender >, lemon::concepts::Graph::EdgeMap, false> >::EdgeIt; GR = lemon::FilterEdges; Item = lemon::concepts::Graph::Edge]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItemIt, lemon::concepts::Graph::Edge>; Type = lemon::GraphAdaptorExtender >, lemon::concepts::Graph::EdgeMap, false> >::EdgeIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1121:40: required from ‘void lemon::concepts::IterableGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::FilterEdges; BAS = lemon::concepts::BaseGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableGraphComponent<>; Type = lemon::FilterEdges]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:776:57: required from ‘void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::FilterEdges]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Graph; Type = lemon::FilterEdges]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1106:64: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:737:14: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Edge& lemon::concepts::Graph::Edge::operator=(const lemon::concepts::Graph::Edge&)’ is deprecated [-Wdeprecated-copy] 737 | bi = it2; | ~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:200:9: note: because ‘lemon::concepts::Graph::Edge’ has user-provided ‘lemon::concepts::Graph::Edge::Edge(const lemon::concepts::Graph::Edge&)’ 200 | Edge(const Edge&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphIncIt::Constraints<_GraphIncIt>::constraints() [with _GraphIncIt = lemon::GraphAdaptorExtender >, lemon::concepts::Graph::EdgeMap, false> >::IncEdgeIt; GR = lemon::FilterEdges; Item = lemon::concepts::Graph::Edge; Base = lemon::concepts::Graph::Node; char sel = 'e']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphIncIt, lemon::concepts::Graph::Edge, lemon::concepts::Graph::Node, 'e'>; Type = lemon::GraphAdaptorExtender >, lemon::concepts::Graph::EdgeMap, false> >::IncEdgeIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1123:71: required from ‘void lemon::concepts::IterableGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::FilterEdges; BAS = lemon::concepts::BaseGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableGraphComponent<>; Type = lemon::FilterEdges]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:776:57: required from ‘void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::FilterEdges]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Graph; Type = lemon::FilterEdges]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1106:64: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:827:13: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Edge& lemon::concepts::Graph::Edge::operator=(const lemon::concepts::Graph::Edge&)’ is deprecated [-Wdeprecated-copy] 827 | e = it2; | ~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:200:9: note: because ‘lemon::concepts::Graph::Edge’ has user-provided ‘lemon::concepts::Graph::Edge::Edge(const lemon::concepts::Graph::Edge&)’ 200 | Edge(const Edge&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::IDableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::FilterEdges; BAS = lemon::concepts::BaseGraphComponent]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IDableDigraphComponent; Type = lemon::FilterEdges]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:586:62: required from ‘void lemon::concepts::IDableGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::FilterEdges; BAS = lemon::concepts::BaseGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IDableGraphComponent<>; Type = lemon::FilterEdges]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:777:55: required from ‘void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::FilterEdges]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Graph; Type = lemon::FilterEdges]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1106:64: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:526:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 526 | node=INVALID; | ~~~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:529:16: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 529 | node = digraph.nodeFromId(nid); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:531:14: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 531 | arc=INVALID; | ~~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:534:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 534 | arc = digraph.arcFromId(eid); In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItem::Constraints<_GraphItem>::constraints() [with _GraphItem = lemon::concepts::Graph::Node; char sel = 'n']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItem<'n'>; Type = lemon::concepts::Graph::Node]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:168:45: required from ‘void lemon::concepts::BaseDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::Orienter]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseDigraphComponent; Type = lemon::Orienter]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:477:55: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::Orienter]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::Orienter]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1212:63: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:104:13: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 104 | i1=INVALID; | ~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:19: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:14: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItem::Constraints<_GraphItem>::constraints() [with _GraphItem = lemon::concepts::Graph::Edge; char sel = 'a']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItem<'a'>; Type = lemon::concepts::Graph::Edge]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:169:44: required from ‘void lemon::concepts::BaseDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::Orienter]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseDigraphComponent; Type = lemon::Orienter]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:477:55: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::Orienter]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::Orienter]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1212:63: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:104:13: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Edge& lemon::concepts::Graph::Edge::operator=(const lemon::concepts::Graph::Edge&)’ is deprecated [-Wdeprecated-copy] 104 | i1=INVALID; | ~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:200:9: note: because ‘lemon::concepts::Graph::Edge’ has user-provided ‘lemon::concepts::Graph::Edge::Edge(const lemon::concepts::Graph::Edge&)’ 200 | Edge(const Edge&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:19: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Edge& lemon::concepts::Graph::Edge::operator=(const lemon::concepts::Graph::Edge&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:200:9: note: because ‘lemon::concepts::Graph::Edge’ has user-provided ‘lemon::concepts::Graph::Edge::Edge(const lemon::concepts::Graph::Edge&)’ 200 | Edge(const Edge&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:14: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Edge& lemon::concepts::Graph::Edge::operator=(const lemon::concepts::Graph::Edge&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:200:9: note: because ‘lemon::concepts::Graph::Edge’ has user-provided ‘lemon::concepts::Graph::Edge::Edge(const lemon::concepts::Graph::Edge&)’ 200 | Edge(const Edge&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItemIt::Constraints<_GraphItemIt>::constraints() [with _GraphItemIt = lemon::DigraphAdaptorExtender > >::ArcIt; GR = lemon::Orienter; Item = lemon::concepts::Graph::Edge]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItemIt, lemon::concepts::Graph::Edge>; Type = lemon::DigraphAdaptorExtender > >::ArcIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:988:41: required from ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::Orienter; BAS = lemon::concepts::BaseDigraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent<>; Type = lemon::Orienter]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::Orienter]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::Orienter]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1212:63: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:737:14: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Edge& lemon::concepts::Graph::Edge::operator=(const lemon::concepts::Graph::Edge&)’ is deprecated [-Wdeprecated-copy] 737 | bi = it2; | ~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:200:9: note: because ‘lemon::concepts::Graph::Edge’ has user-provided ‘lemon::concepts::Graph::Edge::Edge(const lemon::concepts::Graph::Edge&)’ 200 | Edge(const Edge&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItemIt::Constraints<_GraphItemIt>::constraints() [with _GraphItemIt = lemon::DigraphAdaptorExtender > >::NodeIt; GR = lemon::Orienter; Item = lemon::concepts::Graph::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItemIt, lemon::concepts::Graph::Node>; Type = lemon::DigraphAdaptorExtender > >::NodeIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:990:42: required from ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::Orienter; BAS = lemon::concepts::BaseDigraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent<>; Type = lemon::Orienter]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::Orienter]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::Orienter]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1212:63: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:737:14: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 737 | bi = it2; | ~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphIncIt::Constraints<_GraphIncIt>::constraints() [with _GraphIncIt = lemon::DigraphAdaptorExtender > >::InArcIt; GR = lemon::Orienter; Item = lemon::concepts::Graph::Edge; Base = lemon::concepts::Graph::Node; char sel = 'i']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphIncIt, lemon::concepts::Graph::Edge, lemon::concepts::Graph::Node, 'i'>; Type = lemon::DigraphAdaptorExtender > >::InArcIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:992:73: required from ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::Orienter; BAS = lemon::concepts::BaseDigraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent<>; Type = lemon::Orienter]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::Orienter]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::Orienter]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1212:63: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:827:13: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Edge& lemon::concepts::Graph::Edge::operator=(const lemon::concepts::Graph::Edge&)’ is deprecated [-Wdeprecated-copy] 827 | e = it2; | ~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:200:9: note: because ‘lemon::concepts::Graph::Edge’ has user-provided ‘lemon::concepts::Graph::Edge::Edge(const lemon::concepts::Graph::Edge&)’ 200 | Edge(const Edge&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphIncIt::Constraints<_GraphIncIt>::constraints() [with _GraphIncIt = lemon::DigraphAdaptorExtender > >::OutArcIt; GR = lemon::Orienter; Item = lemon::concepts::Graph::Edge; Base = lemon::concepts::Graph::Node; char sel = 'o']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphIncIt, lemon::concepts::Graph::Edge, lemon::concepts::Graph::Node, 'o'>; Type = lemon::DigraphAdaptorExtender > >::OutArcIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:994:74: required from ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::Orienter; BAS = lemon::concepts::BaseDigraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent<>; Type = lemon::Orienter]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::Orienter]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::Orienter]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1212:63: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:827:13: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Edge& lemon::concepts::Graph::Edge::operator=(const lemon::concepts::Graph::Edge&)’ is deprecated [-Wdeprecated-copy] 827 | e = it2; | ~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:200:9: note: because ‘lemon::concepts::Graph::Edge’ has user-provided ‘lemon::concepts::Graph::Edge::Edge(const lemon::concepts::Graph::Edge&)’ 200 | Edge(const Edge&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItemIt::Constraints<_GraphItemIt>::constraints() [with _GraphItemIt = lemon::GraphAdaptorExtender >::NodeIt; GR = lemon::Undirector; Item = lemon::concepts::Digraph::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItemIt, lemon::concepts::Digraph::Node>; Type = lemon::GraphAdaptorExtender >::NodeIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:990:42: required from ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::Undirector; BAS = lemon::concepts::BaseGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent; Type = lemon::Undirector]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1102:63: required from ‘void lemon::concepts::IterableGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::Undirector; BAS = lemon::concepts::BaseGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableGraphComponent<>; Type = lemon::Undirector]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:776:57: required from ‘void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::Undirector]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Graph; Type = lemon::Undirector]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:477:65: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:737:14: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 737 | bi = it2; | ~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItem::Constraints<_GraphItem>::constraints() [with _GraphItem = lemon::concepts::Graph::Arc; char sel = 'a']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItem<'a'>; Type = lemon::concepts::Graph::Arc]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:169:44: required from ‘void lemon::concepts::BaseDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::SubGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseDigraphComponent; Type = lemon::SubGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:278:53: required from ‘void lemon::concepts::BaseGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::SubGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseGraphComponent; Type = lemon::SubGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:775:51: required from ‘void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::SubGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Graph; Type = lemon::SubGraph]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:867:61: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:104:13: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 104 | i1=INVALID; | ~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:19: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:14: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItemIt::Constraints<_GraphItemIt>::constraints() [with _GraphItemIt = lemon::GraphAdaptorExtender, lemon::concepts::Graph::EdgeMap, true> >::ArcIt; GR = lemon::SubGraph; Item = lemon::concepts::Graph::Arc]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItemIt, lemon::concepts::Graph::Arc>; Type = lemon::GraphAdaptorExtender, lemon::concepts::Graph::EdgeMap, true> >::ArcIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:988:41: required from ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::SubGraph; BAS = lemon::concepts::BaseGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent; Type = lemon::SubGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1102:63: required from ‘void lemon::concepts::IterableGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::SubGraph; BAS = lemon::concepts::BaseGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableGraphComponent<>; Type = lemon::SubGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:776:57: required from ‘void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::SubGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Graph; Type = lemon::SubGraph]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:867:61: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:737:14: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 737 | bi = it2; | ~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItemIt::Constraints<_GraphItemIt>::constraints() [with _GraphItemIt = lemon::GraphAdaptorExtender, lemon::concepts::Graph::EdgeMap, true> >::NodeIt; GR = lemon::SubGraph; Item = lemon::concepts::Graph::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItemIt, lemon::concepts::Graph::Node>; Type = lemon::GraphAdaptorExtender, lemon::concepts::Graph::EdgeMap, true> >::NodeIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:990:42: required from ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::SubGraph; BAS = lemon::concepts::BaseGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent; Type = lemon::SubGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1102:63: required from ‘void lemon::concepts::IterableGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::SubGraph; BAS = lemon::concepts::BaseGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableGraphComponent<>; Type = lemon::SubGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:776:57: required from ‘void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::SubGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Graph; Type = lemon::SubGraph]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:867:61: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:737:14: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 737 | bi = it2; | ~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphIncIt::Constraints<_GraphIncIt>::constraints() [with _GraphIncIt = lemon::GraphAdaptorExtender, lemon::concepts::Graph::EdgeMap, true> >::InArcIt; GR = lemon::SubGraph; Item = lemon::concepts::Graph::Arc; Base = lemon::concepts::Graph::Node; char sel = 'i']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphIncIt, lemon::concepts::Graph::Arc, lemon::concepts::Graph::Node, 'i'>; Type = lemon::GraphAdaptorExtender, lemon::concepts::Graph::EdgeMap, true> >::InArcIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:992:73: required from ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::SubGraph; BAS = lemon::concepts::BaseGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent; Type = lemon::SubGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1102:63: required from ‘void lemon::concepts::IterableGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::SubGraph; BAS = lemon::concepts::BaseGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableGraphComponent<>; Type = lemon::SubGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:776:57: required from ‘void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::SubGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Graph; Type = lemon::SubGraph]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:867:61: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:827:13: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 827 | e = it2; | ~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphIncIt::Constraints<_GraphIncIt>::constraints() [with _GraphIncIt = lemon::GraphAdaptorExtender, lemon::concepts::Graph::EdgeMap, true> >::OutArcIt; GR = lemon::SubGraph; Item = lemon::concepts::Graph::Arc; Base = lemon::concepts::Graph::Node; char sel = 'o']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphIncIt, lemon::concepts::Graph::Arc, lemon::concepts::Graph::Node, 'o'>; Type = lemon::GraphAdaptorExtender, lemon::concepts::Graph::EdgeMap, true> >::OutArcIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:994:74: required from ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::SubGraph; BAS = lemon::concepts::BaseGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent; Type = lemon::SubGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1102:63: required from ‘void lemon::concepts::IterableGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::SubGraph; BAS = lemon::concepts::BaseGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableGraphComponent<>; Type = lemon::SubGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:776:57: required from ‘void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::SubGraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Graph; Type = lemon::SubGraph]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:867:61: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:827:13: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 827 | e = it2; | ~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItemIt::Constraints<_GraphItemIt>::constraints() [with _GraphItemIt = lemon::GraphAdaptorExtender, lemon::ConstMap >, true> >::ArcIt; GR = lemon::FilterNodes; Item = lemon::concepts::Graph::Arc]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItemIt, lemon::concepts::Graph::Arc>; Type = lemon::GraphAdaptorExtender, lemon::ConstMap >, true> >::ArcIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:988:41: required from ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::FilterNodes; BAS = lemon::concepts::BaseGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent; Type = lemon::FilterNodes]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1102:63: required from ‘void lemon::concepts::IterableGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::FilterNodes; BAS = lemon::concepts::BaseGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableGraphComponent<>; Type = lemon::FilterNodes]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:776:57: required from ‘void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::FilterNodes]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Graph; Type = lemon::FilterNodes]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1001:64: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:737:14: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 737 | bi = it2; | ~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItemIt::Constraints<_GraphItemIt>::constraints() [with _GraphItemIt = lemon::GraphAdaptorExtender, lemon::ConstMap >, true> >::NodeIt; GR = lemon::FilterNodes; Item = lemon::concepts::Graph::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItemIt, lemon::concepts::Graph::Node>; Type = lemon::GraphAdaptorExtender, lemon::ConstMap >, true> >::NodeIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:990:42: required from ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::FilterNodes; BAS = lemon::concepts::BaseGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent; Type = lemon::FilterNodes]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1102:63: required from ‘void lemon::concepts::IterableGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::FilterNodes; BAS = lemon::concepts::BaseGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableGraphComponent<>; Type = lemon::FilterNodes]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:776:57: required from ‘void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::FilterNodes]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Graph; Type = lemon::FilterNodes]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1001:64: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:737:14: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 737 | bi = it2; | ~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphIncIt::Constraints<_GraphIncIt>::constraints() [with _GraphIncIt = lemon::GraphAdaptorExtender, lemon::ConstMap >, true> >::InArcIt; GR = lemon::FilterNodes; Item = lemon::concepts::Graph::Arc; Base = lemon::concepts::Graph::Node; char sel = 'i']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphIncIt, lemon::concepts::Graph::Arc, lemon::concepts::Graph::Node, 'i'>; Type = lemon::GraphAdaptorExtender, lemon::ConstMap >, true> >::InArcIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:992:73: required from ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::FilterNodes; BAS = lemon::concepts::BaseGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent; Type = lemon::FilterNodes]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1102:63: required from ‘void lemon::concepts::IterableGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::FilterNodes; BAS = lemon::concepts::BaseGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableGraphComponent<>; Type = lemon::FilterNodes]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:776:57: required from ‘void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::FilterNodes]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Graph; Type = lemon::FilterNodes]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1001:64: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:827:13: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 827 | e = it2; | ~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphIncIt::Constraints<_GraphIncIt>::constraints() [with _GraphIncIt = lemon::GraphAdaptorExtender, lemon::ConstMap >, true> >::OutArcIt; GR = lemon::FilterNodes; Item = lemon::concepts::Graph::Arc; Base = lemon::concepts::Graph::Node; char sel = 'o']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphIncIt, lemon::concepts::Graph::Arc, lemon::concepts::Graph::Node, 'o'>; Type = lemon::GraphAdaptorExtender, lemon::ConstMap >, true> >::OutArcIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:994:74: required from ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::FilterNodes; BAS = lemon::concepts::BaseGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent; Type = lemon::FilterNodes]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1102:63: required from ‘void lemon::concepts::IterableGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::FilterNodes; BAS = lemon::concepts::BaseGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableGraphComponent<>; Type = lemon::FilterNodes]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:776:57: required from ‘void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::FilterNodes]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Graph; Type = lemon::FilterNodes]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1001:64: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:827:13: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 827 | e = it2; | ~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItemIt::Constraints<_GraphItemIt>::constraints() [with _GraphItemIt = lemon::GraphAdaptorExtender >, lemon::concepts::Graph::EdgeMap, false> >::ArcIt; GR = lemon::FilterEdges; Item = lemon::concepts::Graph::Arc]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItemIt, lemon::concepts::Graph::Arc>; Type = lemon::GraphAdaptorExtender >, lemon::concepts::Graph::EdgeMap, false> >::ArcIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:988:41: required from ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::FilterEdges; BAS = lemon::concepts::BaseGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent; Type = lemon::FilterEdges]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1102:63: required from ‘void lemon::concepts::IterableGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::FilterEdges; BAS = lemon::concepts::BaseGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableGraphComponent<>; Type = lemon::FilterEdges]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:776:57: required from ‘void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::FilterEdges]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Graph; Type = lemon::FilterEdges]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1106:64: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:737:14: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 737 | bi = it2; | ~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItemIt::Constraints<_GraphItemIt>::constraints() [with _GraphItemIt = lemon::GraphAdaptorExtender >, lemon::concepts::Graph::EdgeMap, false> >::NodeIt; GR = lemon::FilterEdges; Item = lemon::concepts::Graph::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItemIt, lemon::concepts::Graph::Node>; Type = lemon::GraphAdaptorExtender >, lemon::concepts::Graph::EdgeMap, false> >::NodeIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:990:42: required from ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::FilterEdges; BAS = lemon::concepts::BaseGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent; Type = lemon::FilterEdges]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1102:63: required from ‘void lemon::concepts::IterableGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::FilterEdges; BAS = lemon::concepts::BaseGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableGraphComponent<>; Type = lemon::FilterEdges]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:776:57: required from ‘void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::FilterEdges]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Graph; Type = lemon::FilterEdges]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1106:64: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:737:14: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 737 | bi = it2; | ~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphIncIt::Constraints<_GraphIncIt>::constraints() [with _GraphIncIt = lemon::GraphAdaptorExtender >, lemon::concepts::Graph::EdgeMap, false> >::InArcIt; GR = lemon::FilterEdges; Item = lemon::concepts::Graph::Arc; Base = lemon::concepts::Graph::Node; char sel = 'i']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphIncIt, lemon::concepts::Graph::Arc, lemon::concepts::Graph::Node, 'i'>; Type = lemon::GraphAdaptorExtender >, lemon::concepts::Graph::EdgeMap, false> >::InArcIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:992:73: required from ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::FilterEdges; BAS = lemon::concepts::BaseGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent; Type = lemon::FilterEdges]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1102:63: required from ‘void lemon::concepts::IterableGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::FilterEdges; BAS = lemon::concepts::BaseGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableGraphComponent<>; Type = lemon::FilterEdges]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:776:57: required from ‘void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::FilterEdges]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Graph; Type = lemon::FilterEdges]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1106:64: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:827:13: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 827 | e = it2; | ~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphIncIt::Constraints<_GraphIncIt>::constraints() [with _GraphIncIt = lemon::GraphAdaptorExtender >, lemon::concepts::Graph::EdgeMap, false> >::OutArcIt; GR = lemon::FilterEdges; Item = lemon::concepts::Graph::Arc; Base = lemon::concepts::Graph::Node; char sel = 'o']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphIncIt, lemon::concepts::Graph::Arc, lemon::concepts::Graph::Node, 'o'>; Type = lemon::GraphAdaptorExtender >, lemon::concepts::Graph::EdgeMap, false> >::OutArcIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:994:74: required from ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::FilterEdges; BAS = lemon::concepts::BaseGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent; Type = lemon::FilterEdges]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1102:63: required from ‘void lemon::concepts::IterableGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::FilterEdges; BAS = lemon::concepts::BaseGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableGraphComponent<>; Type = lemon::FilterEdges]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:776:57: required from ‘void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::FilterEdges]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Graph; Type = lemon::FilterEdges]’ /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1106:64: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:827:13: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 827 | e = it2; | ~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ [ 28%] Linking CXX executable adaptors_test cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/cmake -E cmake_link_script CMakeFiles/adaptors_test.dir/link.txt --verbose=1 /usr/bin/c++ -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -Wl,-Bsymbolic-functions -Wl,-z,relro -Wl,-z,now -rdynamic CMakeFiles/adaptors_test.dir/adaptors_test.cc.o -o adaptors_test -L/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 28%] Built target adaptors_test make -f test/CMakeFiles/nagamochi_ibaraki_test.dir/build.make test/CMakeFiles/nagamochi_ibaraki_test.dir/depend make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<>/liblemon-1.3.1+dfsg /<>/liblemon-1.3.1+dfsg/test /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test/CMakeFiles/nagamochi_ibaraki_test.dir/DependInfo.cmake --color= Scanning dependencies of target nagamochi_ibaraki_test make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' make -f test/CMakeFiles/nagamochi_ibaraki_test.dir/build.make test/CMakeFiles/nagamochi_ibaraki_test.dir/build make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 30%] Building CXX object test/CMakeFiles/nagamochi_ibaraki_test.dir/nagamochi_ibaraki_test.cc.o cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -I/<>/liblemon-1.3.1+dfsg -I/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -o CMakeFiles/nagamochi_ibaraki_test.dir/nagamochi_ibaraki_test.cc.o -c /<>/liblemon-1.3.1+dfsg/test/nagamochi_ibaraki_test.cc In file included from /<>/liblemon-1.3.1+dfsg/test/nagamochi_ibaraki_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/nagamochi_ibaraki.h: In instantiation of ‘void lemon::NagamochiIbaraki::init() [with GR = lemon::concepts::Graph; CM = lemon::concepts::ReadMap; TR = lemon::NagamochiIbarakiDefaultTraits >]’: /<>/liblemon-1.3.1+dfsg/test/nagamochi_ibaraki_test.cc:73:16: required from here /<>/liblemon-1.3.1+dfsg/lemon/nagamochi_ibaraki.h:397:25: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 397 | (*_next_rep)[n] = INVALID; | ~~~~~~~~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/nagamochi_ibaraki_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/nagamochi_ibaraki_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/nagamochi_ibaraki.h:398:31: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 398 | (*_nodes)[n].last_rep = n; | ~~~~~~~~~~~~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/nagamochi_ibaraki_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/nagamochi_ibaraki_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/nagamochi_ibaraki.h:401:27: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 401 | (*_nodes)[n].prev = prev; | ~~~~~~~~~~~~~~~~~~^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/nagamochi_ibaraki_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/nagamochi_ibaraki_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/nagamochi_ibaraki.h:403:32: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 403 | (*_nodes)[prev].next = n; | ~~~~~~~~~~~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/nagamochi_ibaraki_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/nagamochi_ibaraki_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/nagamochi_ibaraki.h:405:27: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 405 | (*_nodes)[n].next = INVALID; | ~~~~~~~~~~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/nagamochi_ibaraki_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/nagamochi_ibaraki_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/nagamochi_ibaraki.h:407:14: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 407 | prev = n; | ~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/nagamochi_ibaraki_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/nagamochi_ibaraki_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/nagamochi_ibaraki.h:411:19: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 411 | _first_node = typename Graph::NodeIt(_graph); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/nagamochi_ibaraki_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/nagamochi_ibaraki_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/nagamochi_ibaraki.h:435:38: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 435 | _arcs[index << 1].target = m; | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/nagamochi_ibaraki_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/nagamochi_ibaraki_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/nagamochi_ibaraki.h:445:44: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 445 | _arcs[(index << 1) | 1].target = n; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/nagamochi_ibaraki_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/nagamochi_ibaraki_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/nagamochi_ibaraki.h:456:28: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 456 | n != INVALID; n = (*_nodes)[n].next) { | ~~^~~~~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/nagamochi_ibaraki_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/nagamochi_ibaraki_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/nagamochi_ibaraki.h:458:20: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 458 | cut_node = n; | ~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/nagamochi_ibaraki_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/nagamochi_ibaraki_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/nagamochi_ibaraki.h:464:21: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 464 | _first_node = INVALID; | ~~~~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/nagamochi_ibaraki_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/nagamochi_ibaraki_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/nagamochi_ibaraki.h: In instantiation of ‘bool lemon::NagamochiIbaraki::processNextPhase() [with GR = lemon::concepts::Graph; CM = lemon::concepts::ReadMap; TR = lemon::NagamochiIbarakiDefaultTraits >]’: /<>/liblemon-1.3.1+dfsg/test/nagamochi_ibaraki_test.cc:75:32: required from here /<>/liblemon-1.3.1+dfsg/lemon/nagamochi_ibaraki.h:481:28: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 481 | n != INVALID; n = (*_nodes)[n].next) { | ~~^~~~~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/nagamochi_ibaraki_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/nagamochi_ibaraki_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/nagamochi_ibaraki.h:530:21: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 530 | _first_node = INVALID; | ~~~~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/nagamochi_ibaraki_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/nagamochi_ibaraki_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/nagamochi_ibaraki.h:538:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 538 | n = (*_next_rep)[n]; | ~~^~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/nagamochi_ibaraki_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/nagamochi_ibaraki_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/nagamochi_ibaraki.h:553:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 553 | n = (*_next_rep)[n]; | ~~^~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/nagamochi_ibaraki_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/nagamochi_ibaraki_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/nagamochi_ibaraki.h:560:28: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 560 | n != INVALID; n = (*_nodes)[n].next) { | ~~^~~~~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/nagamochi_ibaraki_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/nagamochi_ibaraki_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/nagamochi_ibaraki.h:598:37: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 598 | _arcs[b ^ 1].target = n; | ~~~~~~~~~~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/nagamochi_ibaraki_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/nagamochi_ibaraki_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/nagamochi_ibaraki.h:615:49: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 615 | (*_next_rep)[(*_nodes)[n].last_rep] = m; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/nagamochi_ibaraki_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/nagamochi_ibaraki_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/nagamochi_ibaraki.h:616:35: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 616 | (*_nodes)[n].last_rep = (*_nodes)[m].last_rep; | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/nagamochi_ibaraki_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/nagamochi_ibaraki_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/nagamochi_ibaraki.h:619:49: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 619 | (*_nodes)[(*_nodes)[m].prev].next = (*_nodes)[m].next; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/nagamochi_ibaraki_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/nagamochi_ibaraki_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/nagamochi_ibaraki.h:621:27: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 621 | _first_node = (*_nodes)[m].next; | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/nagamochi_ibaraki_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/nagamochi_ibaraki_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/nagamochi_ibaraki.h:624:49: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 624 | (*_nodes)[(*_nodes)[m].next].prev = (*_nodes)[m].prev; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/nagamochi_ibaraki_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/nagamochi_ibaraki_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/nagamochi_ibaraki.h:632:21: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 632 | _first_node = INVALID; | ~~~~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/nagamochi_ibaraki_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ [ 31%] Linking CXX executable nagamochi_ibaraki_test cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/cmake -E cmake_link_script CMakeFiles/nagamochi_ibaraki_test.dir/link.txt --verbose=1 /usr/bin/c++ -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -Wl,-Bsymbolic-functions -Wl,-z,relro -Wl,-z,now -rdynamic CMakeFiles/nagamochi_ibaraki_test.dir/nagamochi_ibaraki_test.cc.o -o nagamochi_ibaraki_test -L/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 31%] Built target nagamochi_ibaraki_test make -f test/CMakeFiles/lp_test.dir/build.make test/CMakeFiles/lp_test.dir/depend make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<>/liblemon-1.3.1+dfsg /<>/liblemon-1.3.1+dfsg/test /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test/CMakeFiles/lp_test.dir/DependInfo.cmake --color= Scanning dependencies of target lp_test make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' make -f test/CMakeFiles/lp_test.dir/build.make test/CMakeFiles/lp_test.dir/build make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 32%] Building CXX object test/CMakeFiles/lp_test.dir/lp_test.cc.o cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -I/<>/liblemon-1.3.1+dfsg -I/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -o CMakeFiles/lp_test.dir/lp_test.cc.o -c /<>/liblemon-1.3.1+dfsg/test/lp_test.cc [ 33%] Linking CXX executable lp_test cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/cmake -E cmake_link_script CMakeFiles/lp_test.dir/link.txt --verbose=1 /usr/bin/c++ -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -Wl,-Bsymbolic-functions -Wl,-z,relro -Wl,-z,now -rdynamic CMakeFiles/lp_test.dir/lp_test.cc.o -o lp_test -L/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 33%] Built target lp_test make -f test/CMakeFiles/graph_copy_test.dir/build.make test/CMakeFiles/graph_copy_test.dir/depend make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<>/liblemon-1.3.1+dfsg /<>/liblemon-1.3.1+dfsg/test /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test/CMakeFiles/graph_copy_test.dir/DependInfo.cmake --color= Scanning dependencies of target graph_copy_test make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' make -f test/CMakeFiles/graph_copy_test.dir/build.make test/CMakeFiles/graph_copy_test.dir/build make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 34%] Building CXX object test/CMakeFiles/graph_copy_test.dir/graph_copy_test.cc.o cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -I/<>/liblemon-1.3.1+dfsg -I/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -o CMakeFiles/graph_copy_test.dir/graph_copy_test.cc.o -c /<>/liblemon-1.3.1+dfsg/test/graph_copy_test.cc /<>/liblemon-1.3.1+dfsg/test/graph_copy_test.cc: In instantiation of ‘void bpgraph_copy_test() [with GR = lemon::SmartBpGraph]’: /<>/liblemon-1.3.1+dfsg/test/graph_copy_test.cc:384:35: required from here /<>/liblemon-1.3.1+dfsg/test/graph_copy_test.cc:237:11: warning: implicitly-declared ‘constexpr lemon::SmartBpGraphBase::RedNode& lemon::SmartBpGraphBase::RedNode::operator=(const lemon::SmartBpGraphBase::RedNode&)’ is deprecated [-Wdeprecated-copy] 237 | frn = node; | ~~~~^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/graph_copy_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/smart_graph.h:865:7: note: because ‘lemon::SmartBpGraphBase::RedNode’ has user-provided ‘lemon::SmartBpGraphBase::RedNode::RedNode(const lemon::SmartBpGraphBase::RedNode&)’ 865 | RedNode(const RedNode& node) : Node(node) {} | ^~~~~~~ /<>/liblemon-1.3.1+dfsg/test/graph_copy_test.cc:247:21: warning: implicitly-declared ‘constexpr lemon::SmartBpGraphBase::BlueNode& lemon::SmartBpGraphBase::BlueNode::operator=(const lemon::SmartBpGraphBase::BlueNode&)’ is deprecated [-Wdeprecated-copy] 247 | if (i == 0) fbn = node; | ~~~~^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/graph_copy_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/smart_graph.h:877:7: note: because ‘lemon::SmartBpGraphBase::BlueNode’ has user-provided ‘lemon::SmartBpGraphBase::BlueNode::BlueNode(const lemon::SmartBpGraphBase::BlueNode&)’ 877 | BlueNode(const BlueNode& node) : Node(node) {} | ^~~~~~~~ /<>/liblemon-1.3.1+dfsg/test/graph_copy_test.cc: In instantiation of ‘void bpgraph_copy_test() [with GR = lemon::ListBpGraph]’: /<>/liblemon-1.3.1+dfsg/test/graph_copy_test.cc:385:34: required from here /<>/liblemon-1.3.1+dfsg/test/graph_copy_test.cc:237:11: warning: implicitly-declared ‘constexpr lemon::SmartBpGraphBase::RedNode& lemon::SmartBpGraphBase::RedNode::operator=(const lemon::SmartBpGraphBase::RedNode&)’ is deprecated [-Wdeprecated-copy] 237 | frn = node; | ~~~~^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/graph_copy_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/smart_graph.h:865:7: note: because ‘lemon::SmartBpGraphBase::RedNode’ has user-provided ‘lemon::SmartBpGraphBase::RedNode::RedNode(const lemon::SmartBpGraphBase::RedNode&)’ 865 | RedNode(const RedNode& node) : Node(node) {} | ^~~~~~~ /<>/liblemon-1.3.1+dfsg/test/graph_copy_test.cc:247:21: warning: implicitly-declared ‘constexpr lemon::SmartBpGraphBase::BlueNode& lemon::SmartBpGraphBase::BlueNode::operator=(const lemon::SmartBpGraphBase::BlueNode&)’ is deprecated [-Wdeprecated-copy] 247 | if (i == 0) fbn = node; | ~~~~^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/graph_copy_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/smart_graph.h:877:7: note: because ‘lemon::SmartBpGraphBase::BlueNode’ has user-provided ‘lemon::SmartBpGraphBase::BlueNode::BlueNode(const lemon::SmartBpGraphBase::BlueNode&)’ 877 | BlueNode(const BlueNode& node) : Node(node) {} | ^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/smart_graph.h:28, from /<>/liblemon-1.3.1+dfsg/test/graph_copy_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/core.h: In instantiation of ‘static void lemon::_core_bits::BpGraphCopySelector::copy(const From&, BpGraph&, RedNodeRefMap&, BlueNodeRefMap&, EdgeRefMap&) [with From = lemon::SmartBpGraph; RedNodeRefMap = lemon::BpGraphExtender::RedNodeMap; BlueNodeRefMap = lemon::BpGraphExtender::BlueNodeMap; EdgeRefMap = lemon::BpGraphExtender::EdgeMap; BpGraph = lemon::SmartBpGraph; Enable = void]’: /<>/liblemon-1.3.1+dfsg/lemon/core.h:1541:13: required from ‘void lemon::BpGraphCopy::run() [with From = lemon::SmartBpGraph; To = lemon::SmartBpGraph]’ /<>/liblemon-1.3.1+dfsg/test/graph_copy_test.cc:286:3: required from ‘void bpgraph_copy_test() [with GR = lemon::SmartBpGraph]’ /<>/liblemon-1.3.1+dfsg/test/graph_copy_test.cc:384:35: required from here /<>/liblemon-1.3.1+dfsg/lemon/core.h:581:29: warning: implicitly-declared ‘constexpr lemon::SmartBpGraphBase::RedNode& lemon::SmartBpGraphBase::RedNode::operator=(const lemon::SmartBpGraphBase::RedNode&)’ is deprecated [-Wdeprecated-copy] 581 | redNodeRefMap[it] = to.addRedNode(); In file included from /<>/liblemon-1.3.1+dfsg/test/graph_copy_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/smart_graph.h:865:7: note: because ‘lemon::SmartBpGraphBase::RedNode’ has user-provided ‘lemon::SmartBpGraphBase::RedNode::RedNode(const lemon::SmartBpGraphBase::RedNode&)’ 865 | RedNode(const RedNode& node) : Node(node) {} | ^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/smart_graph.h:28, from /<>/liblemon-1.3.1+dfsg/test/graph_copy_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/core.h:584:30: warning: implicitly-declared ‘constexpr lemon::SmartBpGraphBase::BlueNode& lemon::SmartBpGraphBase::BlueNode::operator=(const lemon::SmartBpGraphBase::BlueNode&)’ is deprecated [-Wdeprecated-copy] 584 | blueNodeRefMap[it] = to.addBlueNode(); In file included from /<>/liblemon-1.3.1+dfsg/test/graph_copy_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/smart_graph.h:877:7: note: because ‘lemon::SmartBpGraphBase::BlueNode’ has user-provided ‘lemon::SmartBpGraphBase::BlueNode::BlueNode(const lemon::SmartBpGraphBase::BlueNode&)’ 877 | BlueNode(const BlueNode& node) : Node(node) {} | ^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/smart_graph.h:28, from /<>/liblemon-1.3.1+dfsg/test/graph_copy_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/core.h: In instantiation of ‘static void lemon::_core_bits::BpGraphCopySelector::copy(const From&, BpGraph&, RedNodeRefMap&, BlueNodeRefMap&, EdgeRefMap&) [with From = lemon::SmartBpGraph; RedNodeRefMap = lemon::BpGraphExtender::RedNodeMap; BlueNodeRefMap = lemon::BpGraphExtender::BlueNodeMap; EdgeRefMap = lemon::BpGraphExtender::EdgeMap; BpGraph = lemon::ListBpGraph; Enable = void]’: /<>/liblemon-1.3.1+dfsg/lemon/core.h:1541:13: required from ‘void lemon::BpGraphCopy::run() [with From = lemon::SmartBpGraph; To = lemon::ListBpGraph]’ /<>/liblemon-1.3.1+dfsg/test/graph_copy_test.cc:286:3: required from ‘void bpgraph_copy_test() [with GR = lemon::ListBpGraph]’ /<>/liblemon-1.3.1+dfsg/test/graph_copy_test.cc:385:34: required from here /<>/liblemon-1.3.1+dfsg/lemon/core.h:581:29: warning: implicitly-declared ‘constexpr lemon::ListBpGraphBase::RedNode& lemon::ListBpGraphBase::RedNode::operator=(const lemon::ListBpGraphBase::RedNode&)’ is deprecated [-Wdeprecated-copy] 581 | redNodeRefMap[it] = to.addRedNode(); In file included from /<>/liblemon-1.3.1+dfsg/test/graph_copy_test.cc:20: /<>/liblemon-1.3.1+dfsg/lemon/list_graph.h:1658:7: note: because ‘lemon::ListBpGraphBase::RedNode’ has user-provided ‘lemon::ListBpGraphBase::RedNode::RedNode(const lemon::ListBpGraphBase::RedNode&)’ 1658 | RedNode(const RedNode& node) : Node(node) {} | ^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/smart_graph.h:28, from /<>/liblemon-1.3.1+dfsg/test/graph_copy_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/core.h:584:30: warning: implicitly-declared ‘constexpr lemon::ListBpGraphBase::BlueNode& lemon::ListBpGraphBase::BlueNode::operator=(const lemon::ListBpGraphBase::BlueNode&)’ is deprecated [-Wdeprecated-copy] 584 | blueNodeRefMap[it] = to.addBlueNode(); In file included from /<>/liblemon-1.3.1+dfsg/test/graph_copy_test.cc:20: /<>/liblemon-1.3.1+dfsg/lemon/list_graph.h:1670:7: note: because ‘lemon::ListBpGraphBase::BlueNode’ has user-provided ‘lemon::ListBpGraphBase::BlueNode::BlueNode(const lemon::ListBpGraphBase::BlueNode&)’ 1670 | BlueNode(const BlueNode& node) : Node(node) {} | ^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/smart_graph.h:28, from /<>/liblemon-1.3.1+dfsg/test/graph_copy_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/core.h: In instantiation of ‘void lemon::_core_bits::ItemCopy::copy(const Digraph&, const RefMap&) [with Digraph = lemon::SmartBpGraph; Item = lemon::SmartBpGraphBase::BlueNode; RefMap = lemon::BpGraphExtender::BlueNodeMap; It = lemon::ListBpGraphBase::BlueNode]’: /<>/liblemon-1.3.1+dfsg/lemon/core.h:470:20: required from here /<>/liblemon-1.3.1+dfsg/lemon/core.h:471:13: warning: implicitly-declared ‘constexpr lemon::ListBpGraphBase::BlueNode& lemon::ListBpGraphBase::BlueNode::operator=(const lemon::ListBpGraphBase::BlueNode&)’ is deprecated [-Wdeprecated-copy] 471 | _it = refMap[_item]; | ~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/graph_copy_test.cc:20: /<>/liblemon-1.3.1+dfsg/lemon/list_graph.h:1670:7: note: because ‘lemon::ListBpGraphBase::BlueNode’ has user-provided ‘lemon::ListBpGraphBase::BlueNode::BlueNode(const lemon::ListBpGraphBase::BlueNode&)’ 1670 | BlueNode(const BlueNode& node) : Node(node) {} | ^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/smart_graph.h:28, from /<>/liblemon-1.3.1+dfsg/test/graph_copy_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/core.h: In instantiation of ‘void lemon::_core_bits::ItemCopy::copy(const Digraph&, const RefMap&) [with Digraph = lemon::SmartBpGraph; Item = lemon::SmartBpGraphBase::RedNode; RefMap = lemon::BpGraphExtender::RedNodeMap; It = lemon::ListBpGraphBase::RedNode]’: /<>/liblemon-1.3.1+dfsg/lemon/core.h:470:20: required from here /<>/liblemon-1.3.1+dfsg/lemon/core.h:471:13: warning: implicitly-declared ‘constexpr lemon::ListBpGraphBase::RedNode& lemon::ListBpGraphBase::RedNode::operator=(const lemon::ListBpGraphBase::RedNode&)’ is deprecated [-Wdeprecated-copy] 471 | _it = refMap[_item]; | ~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/graph_copy_test.cc:20: /<>/liblemon-1.3.1+dfsg/lemon/list_graph.h:1658:7: note: because ‘lemon::ListBpGraphBase::RedNode’ has user-provided ‘lemon::ListBpGraphBase::RedNode::RedNode(const lemon::ListBpGraphBase::RedNode&)’ 1658 | RedNode(const RedNode& node) : Node(node) {} | ^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/smart_graph.h:28, from /<>/liblemon-1.3.1+dfsg/test/graph_copy_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/core.h: In instantiation of ‘void lemon::_core_bits::ItemCopy::copy(const Digraph&, const RefMap&) [with Digraph = lemon::SmartBpGraph; Item = lemon::SmartBpGraphBase::BlueNode; RefMap = lemon::BpGraphExtender::BlueNodeMap; It = lemon::SmartBpGraphBase::BlueNode]’: /<>/liblemon-1.3.1+dfsg/lemon/core.h:470:20: required from here /<>/liblemon-1.3.1+dfsg/lemon/core.h:471:13: warning: implicitly-declared ‘constexpr lemon::SmartBpGraphBase::BlueNode& lemon::SmartBpGraphBase::BlueNode::operator=(const lemon::SmartBpGraphBase::BlueNode&)’ is deprecated [-Wdeprecated-copy] 471 | _it = refMap[_item]; | ~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/graph_copy_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/smart_graph.h:877:7: note: because ‘lemon::SmartBpGraphBase::BlueNode’ has user-provided ‘lemon::SmartBpGraphBase::BlueNode::BlueNode(const lemon::SmartBpGraphBase::BlueNode&)’ 877 | BlueNode(const BlueNode& node) : Node(node) {} | ^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/smart_graph.h:28, from /<>/liblemon-1.3.1+dfsg/test/graph_copy_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/core.h: In instantiation of ‘void lemon::_core_bits::ItemCopy::copy(const Digraph&, const RefMap&) [with Digraph = lemon::SmartBpGraph; Item = lemon::SmartBpGraphBase::RedNode; RefMap = lemon::BpGraphExtender::RedNodeMap; It = lemon::SmartBpGraphBase::RedNode]’: /<>/liblemon-1.3.1+dfsg/lemon/core.h:470:20: required from here /<>/liblemon-1.3.1+dfsg/lemon/core.h:471:13: warning: implicitly-declared ‘constexpr lemon::SmartBpGraphBase::RedNode& lemon::SmartBpGraphBase::RedNode::operator=(const lemon::SmartBpGraphBase::RedNode&)’ is deprecated [-Wdeprecated-copy] 471 | _it = refMap[_item]; | ~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/graph_copy_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/smart_graph.h:865:7: note: because ‘lemon::SmartBpGraphBase::RedNode’ has user-provided ‘lemon::SmartBpGraphBase::RedNode::RedNode(const lemon::SmartBpGraphBase::RedNode&)’ 865 | RedNode(const RedNode& node) : Node(node) {} | ^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/bits/default_map.h:23, from /<>/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:25, from /<>/liblemon-1.3.1+dfsg/lemon/smart_graph.h:30, from /<>/liblemon-1.3.1+dfsg/test/graph_copy_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/bits/array_map.h: In instantiation of ‘void lemon::ArrayMap<_Graph, _Item, _Value>::set(const Key&, const Value&) [with _Graph = lemon::BpGraphExtender; _Item = lemon::ListBpGraphBase::BlueNode; _Value = lemon::SmartBpGraphBase::BlueNode; lemon::ArrayMap<_Graph, _Item, _Value>::Key = lemon::ListBpGraphBase::BlueNode; lemon::ArrayMap<_Graph, _Item, _Value>::Value = lemon::SmartBpGraphBase::BlueNode]’: /<>/liblemon-1.3.1+dfsg/lemon/core.h:506:11: required from ‘void lemon::_core_bits::CrossRefCopy::copy(const Digraph&, const RefMap&) [with Digraph = lemon::SmartBpGraph; Item = lemon::SmartBpGraphBase::BlueNode; RefMap = lemon::BpGraphExtender::BlueNodeMap; CrossRef = lemon::BpGraphExtender::BlueNodeMap]’ /<>/liblemon-1.3.1+dfsg/lemon/core.h:503:20: required from here /<>/liblemon-1.3.1+dfsg/lemon/bits/array_map.h:199:20: warning: implicitly-declared ‘constexpr lemon::SmartBpGraphBase::BlueNode& lemon::SmartBpGraphBase::BlueNode::operator=(const lemon::SmartBpGraphBase::BlueNode&)’ is deprecated [-Wdeprecated-copy] 199 | (*this)[key] = val; | ~~~~~~~~~~~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/graph_copy_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/smart_graph.h:877:7: note: because ‘lemon::SmartBpGraphBase::BlueNode’ has user-provided ‘lemon::SmartBpGraphBase::BlueNode::BlueNode(const lemon::SmartBpGraphBase::BlueNode&)’ 877 | BlueNode(const BlueNode& node) : Node(node) {} | ^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/bits/default_map.h:23, from /<>/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:25, from /<>/liblemon-1.3.1+dfsg/lemon/smart_graph.h:30, from /<>/liblemon-1.3.1+dfsg/test/graph_copy_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/bits/array_map.h: In instantiation of ‘void lemon::ArrayMap<_Graph, _Item, _Value>::set(const Key&, const Value&) [with _Graph = lemon::BpGraphExtender; _Item = lemon::ListBpGraphBase::RedNode; _Value = lemon::SmartBpGraphBase::RedNode; lemon::ArrayMap<_Graph, _Item, _Value>::Key = lemon::ListBpGraphBase::RedNode; lemon::ArrayMap<_Graph, _Item, _Value>::Value = lemon::SmartBpGraphBase::RedNode]’: /<>/liblemon-1.3.1+dfsg/lemon/core.h:506:11: required from ‘void lemon::_core_bits::CrossRefCopy::copy(const Digraph&, const RefMap&) [with Digraph = lemon::SmartBpGraph; Item = lemon::SmartBpGraphBase::RedNode; RefMap = lemon::BpGraphExtender::RedNodeMap; CrossRef = lemon::BpGraphExtender::RedNodeMap]’ /<>/liblemon-1.3.1+dfsg/lemon/core.h:503:20: required from here /<>/liblemon-1.3.1+dfsg/lemon/bits/array_map.h:199:20: warning: implicitly-declared ‘constexpr lemon::SmartBpGraphBase::RedNode& lemon::SmartBpGraphBase::RedNode::operator=(const lemon::SmartBpGraphBase::RedNode&)’ is deprecated [-Wdeprecated-copy] 199 | (*this)[key] = val; | ~~~~~~~~~~~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/graph_copy_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/smart_graph.h:865:7: note: because ‘lemon::SmartBpGraphBase::RedNode’ has user-provided ‘lemon::SmartBpGraphBase::RedNode::RedNode(const lemon::SmartBpGraphBase::RedNode&)’ 865 | RedNode(const RedNode& node) : Node(node) {} | ^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/bits/default_map.h:23, from /<>/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:25, from /<>/liblemon-1.3.1+dfsg/lemon/smart_graph.h:30, from /<>/liblemon-1.3.1+dfsg/test/graph_copy_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/bits/array_map.h: In instantiation of ‘void lemon::ArrayMap<_Graph, _Item, _Value>::set(const Key&, const Value&) [with _Graph = lemon::BpGraphExtender; _Item = lemon::SmartBpGraphBase::BlueNode; _Value = lemon::ListBpGraphBase::BlueNode; lemon::ArrayMap<_Graph, _Item, _Value>::Key = lemon::SmartBpGraphBase::BlueNode; lemon::ArrayMap<_Graph, _Item, _Value>::Value = lemon::ListBpGraphBase::BlueNode]’: /<>/liblemon-1.3.1+dfsg/lemon/core.h:488:11: required from ‘void lemon::_core_bits::RefCopy::copy(const Digraph&, const RefMap&) [with Digraph = lemon::SmartBpGraph; Item = lemon::SmartBpGraphBase::BlueNode; RefMap = lemon::BpGraphExtender::BlueNodeMap; Ref = lemon::BpGraphExtender::BlueNodeMap]’ /<>/liblemon-1.3.1+dfsg/lemon/core.h:485:20: required from here /<>/liblemon-1.3.1+dfsg/lemon/bits/array_map.h:199:20: warning: implicitly-declared ‘constexpr lemon::ListBpGraphBase::BlueNode& lemon::ListBpGraphBase::BlueNode::operator=(const lemon::ListBpGraphBase::BlueNode&)’ is deprecated [-Wdeprecated-copy] 199 | (*this)[key] = val; | ~~~~~~~~~~~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/graph_copy_test.cc:20: /<>/liblemon-1.3.1+dfsg/lemon/list_graph.h:1670:7: note: because ‘lemon::ListBpGraphBase::BlueNode’ has user-provided ‘lemon::ListBpGraphBase::BlueNode::BlueNode(const lemon::ListBpGraphBase::BlueNode&)’ 1670 | BlueNode(const BlueNode& node) : Node(node) {} | ^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/bits/default_map.h:23, from /<>/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:25, from /<>/liblemon-1.3.1+dfsg/lemon/smart_graph.h:30, from /<>/liblemon-1.3.1+dfsg/test/graph_copy_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/bits/array_map.h: In instantiation of ‘void lemon::ArrayMap<_Graph, _Item, _Value>::set(const Key&, const Value&) [with _Graph = lemon::BpGraphExtender; _Item = lemon::SmartBpGraphBase::RedNode; _Value = lemon::ListBpGraphBase::RedNode; lemon::ArrayMap<_Graph, _Item, _Value>::Key = lemon::SmartBpGraphBase::RedNode; lemon::ArrayMap<_Graph, _Item, _Value>::Value = lemon::ListBpGraphBase::RedNode]’: /<>/liblemon-1.3.1+dfsg/lemon/core.h:488:11: required from ‘void lemon::_core_bits::RefCopy::copy(const Digraph&, const RefMap&) [with Digraph = lemon::SmartBpGraph; Item = lemon::SmartBpGraphBase::RedNode; RefMap = lemon::BpGraphExtender::RedNodeMap; Ref = lemon::BpGraphExtender::RedNodeMap]’ /<>/liblemon-1.3.1+dfsg/lemon/core.h:485:20: required from here /<>/liblemon-1.3.1+dfsg/lemon/bits/array_map.h:199:20: warning: implicitly-declared ‘constexpr lemon::ListBpGraphBase::RedNode& lemon::ListBpGraphBase::RedNode::operator=(const lemon::ListBpGraphBase::RedNode&)’ is deprecated [-Wdeprecated-copy] 199 | (*this)[key] = val; | ~~~~~~~~~~~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/graph_copy_test.cc:20: /<>/liblemon-1.3.1+dfsg/lemon/list_graph.h:1658:7: note: because ‘lemon::ListBpGraphBase::RedNode’ has user-provided ‘lemon::ListBpGraphBase::RedNode::RedNode(const lemon::ListBpGraphBase::RedNode&)’ 1658 | RedNode(const RedNode& node) : Node(node) {} | ^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/bits/default_map.h:23, from /<>/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:25, from /<>/liblemon-1.3.1+dfsg/lemon/smart_graph.h:30, from /<>/liblemon-1.3.1+dfsg/test/graph_copy_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/bits/array_map.h: In instantiation of ‘void lemon::ArrayMap<_Graph, _Item, _Value>::set(const Key&, const Value&) [with _Graph = lemon::BpGraphExtender; _Item = lemon::SmartBpGraphBase::BlueNode; _Value = lemon::SmartBpGraphBase::BlueNode; lemon::ArrayMap<_Graph, _Item, _Value>::Key = lemon::SmartBpGraphBase::BlueNode; lemon::ArrayMap<_Graph, _Item, _Value>::Value = lemon::SmartBpGraphBase::BlueNode]’: /<>/liblemon-1.3.1+dfsg/lemon/core.h:506:11: required from ‘void lemon::_core_bits::CrossRefCopy::copy(const Digraph&, const RefMap&) [with Digraph = lemon::SmartBpGraph; Item = lemon::SmartBpGraphBase::BlueNode; RefMap = lemon::BpGraphExtender::BlueNodeMap; CrossRef = lemon::BpGraphExtender::BlueNodeMap]’ /<>/liblemon-1.3.1+dfsg/lemon/core.h:503:20: required from here /<>/liblemon-1.3.1+dfsg/lemon/bits/array_map.h:199:20: warning: implicitly-declared ‘constexpr lemon::SmartBpGraphBase::BlueNode& lemon::SmartBpGraphBase::BlueNode::operator=(const lemon::SmartBpGraphBase::BlueNode&)’ is deprecated [-Wdeprecated-copy] 199 | (*this)[key] = val; | ~~~~~~~~~~~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/graph_copy_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/smart_graph.h:877:7: note: because ‘lemon::SmartBpGraphBase::BlueNode’ has user-provided ‘lemon::SmartBpGraphBase::BlueNode::BlueNode(const lemon::SmartBpGraphBase::BlueNode&)’ 877 | BlueNode(const BlueNode& node) : Node(node) {} | ^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/bits/default_map.h:23, from /<>/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:25, from /<>/liblemon-1.3.1+dfsg/lemon/smart_graph.h:30, from /<>/liblemon-1.3.1+dfsg/test/graph_copy_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/bits/array_map.h: In instantiation of ‘void lemon::ArrayMap<_Graph, _Item, _Value>::set(const Key&, const Value&) [with _Graph = lemon::BpGraphExtender; _Item = lemon::SmartBpGraphBase::RedNode; _Value = lemon::SmartBpGraphBase::RedNode; lemon::ArrayMap<_Graph, _Item, _Value>::Key = lemon::SmartBpGraphBase::RedNode; lemon::ArrayMap<_Graph, _Item, _Value>::Value = lemon::SmartBpGraphBase::RedNode]’: /<>/liblemon-1.3.1+dfsg/lemon/core.h:506:11: required from ‘void lemon::_core_bits::CrossRefCopy::copy(const Digraph&, const RefMap&) [with Digraph = lemon::SmartBpGraph; Item = lemon::SmartBpGraphBase::RedNode; RefMap = lemon::BpGraphExtender::RedNodeMap; CrossRef = lemon::BpGraphExtender::RedNodeMap]’ /<>/liblemon-1.3.1+dfsg/lemon/core.h:503:20: required from here /<>/liblemon-1.3.1+dfsg/lemon/bits/array_map.h:199:20: warning: implicitly-declared ‘constexpr lemon::SmartBpGraphBase::RedNode& lemon::SmartBpGraphBase::RedNode::operator=(const lemon::SmartBpGraphBase::RedNode&)’ is deprecated [-Wdeprecated-copy] 199 | (*this)[key] = val; | ~~~~~~~~~~~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/graph_copy_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/smart_graph.h:865:7: note: because ‘lemon::SmartBpGraphBase::RedNode’ has user-provided ‘lemon::SmartBpGraphBase::RedNode::RedNode(const lemon::SmartBpGraphBase::RedNode&)’ 865 | RedNode(const RedNode& node) : Node(node) {} | ^~~~~~~ [ 36%] Linking CXX executable graph_copy_test cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/cmake -E cmake_link_script CMakeFiles/graph_copy_test.dir/link.txt --verbose=1 /usr/bin/c++ -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -Wl,-Bsymbolic-functions -Wl,-z,relro -Wl,-z,now -rdynamic CMakeFiles/graph_copy_test.dir/graph_copy_test.cc.o -o graph_copy_test -L/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 36%] Built target graph_copy_test make -f test/CMakeFiles/mip_test.dir/build.make test/CMakeFiles/mip_test.dir/depend make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<>/liblemon-1.3.1+dfsg /<>/liblemon-1.3.1+dfsg/test /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test/CMakeFiles/mip_test.dir/DependInfo.cmake --color= Scanning dependencies of target mip_test make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' make -f test/CMakeFiles/mip_test.dir/build.make test/CMakeFiles/mip_test.dir/build make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 36%] Building CXX object test/CMakeFiles/mip_test.dir/mip_test.cc.o cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -I/<>/liblemon-1.3.1+dfsg -I/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -o CMakeFiles/mip_test.dir/mip_test.cc.o -c /<>/liblemon-1.3.1+dfsg/test/mip_test.cc [ 37%] Linking CXX executable mip_test cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/cmake -E cmake_link_script CMakeFiles/mip_test.dir/link.txt --verbose=1 /usr/bin/c++ -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -Wl,-Bsymbolic-functions -Wl,-z,relro -Wl,-z,now -rdynamic CMakeFiles/mip_test.dir/mip_test.cc.o -o mip_test -L/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 37%] Built target mip_test make -f test/CMakeFiles/graph_test.dir/build.make test/CMakeFiles/graph_test.dir/depend make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<>/liblemon-1.3.1+dfsg /<>/liblemon-1.3.1+dfsg/test /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test/CMakeFiles/graph_test.dir/DependInfo.cmake --color= Scanning dependencies of target graph_test make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' make -f test/CMakeFiles/graph_test.dir/build.make test/CMakeFiles/graph_test.dir/build make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 38%] Building CXX object test/CMakeFiles/graph_test.dir/graph_test.cc.o cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -I/<>/liblemon-1.3.1+dfsg -I/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -o CMakeFiles/graph_test.dir/graph_test.cc.o -c /<>/liblemon-1.3.1+dfsg/test/graph_test.cc In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:26, from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::BaseGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::BaseGraphComponent]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseGraphComponent; Type = lemon::concepts::BaseGraphComponent]’ /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:337:59: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:290:16: warning: implicitly-declared ‘lemon::concepts::BaseGraphComponent::Edge& lemon::concepts::BaseGraphComponent::Edge::operator=(const lemon::concepts::BaseGraphComponent::Edge&)’ is deprecated [-Wdeprecated-copy] 290 | ue = e; | ~~~^~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:219:9: note: because ‘lemon::concepts::BaseGraphComponent::Edge’ has user-provided ‘lemon::concepts::BaseGraphComponent::Edge::Edge(const lemon::concepts::BaseGraphComponent::Edge&)’ 219 | Edge(const Edge &) : Parent() {} | ^~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::IDableGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::IDableGraphComponent<>; BAS = lemon::concepts::BaseGraphComponent]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IDableGraphComponent<>; Type = lemon::concepts::IDableGraphComponent<>]’ /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:340:32: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:590:16: warning: implicitly-declared ‘lemon::concepts::BaseGraphComponent::Edge& lemon::concepts::BaseGraphComponent::Edge::operator=(const lemon::concepts::BaseGraphComponent::Edge&)’ is deprecated [-Wdeprecated-copy] 590 | edge = graph.edgeFromId(ueid); /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:219:9: note: because ‘lemon::concepts::BaseGraphComponent::Edge’ has user-provided ‘lemon::concepts::BaseGraphComponent::Edge::Edge(const lemon::concepts::BaseGraphComponent::Edge&)’ 219 | Edge(const Edge &) : Parent() {} | ^~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItem::Constraints<_GraphItem>::constraints() [with _GraphItem = lemon::concepts::BaseGraphComponent::Edge; char sel = 'e']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItem<'e'>; Type = lemon::concepts::BaseGraphComponent::Edge]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:279:45: required from ‘void lemon::concepts::BaseGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::BaseGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseGraphComponent; Type = lemon::concepts::BaseGraphComponent]’ /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:337:59: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:104:13: warning: implicitly-declared ‘lemon::concepts::BaseGraphComponent::Edge& lemon::concepts::BaseGraphComponent::Edge::operator=(const lemon::concepts::BaseGraphComponent::Edge&)’ is deprecated [-Wdeprecated-copy] 104 | i1=INVALID; | ~~^~~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:219:9: note: because ‘lemon::concepts::BaseGraphComponent::Edge’ has user-provided ‘lemon::concepts::BaseGraphComponent::Edge::Edge(const lemon::concepts::BaseGraphComponent::Edge&)’ 219 | Edge(const Edge &) : Parent() {} | ^~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:19: warning: implicitly-declared ‘lemon::concepts::BaseGraphComponent::Edge& lemon::concepts::BaseGraphComponent::Edge::operator=(const lemon::concepts::BaseGraphComponent::Edge&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:219:9: note: because ‘lemon::concepts::BaseGraphComponent::Edge’ has user-provided ‘lemon::concepts::BaseGraphComponent::Edge::Edge(const lemon::concepts::BaseGraphComponent::Edge&)’ 219 | Edge(const Edge &) : Parent() {} | ^~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:14: warning: implicitly-declared ‘lemon::concepts::BaseGraphComponent::Edge& lemon::concepts::BaseGraphComponent::Edge::operator=(const lemon::concepts::BaseGraphComponent::Edge&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:219:9: note: because ‘lemon::concepts::BaseGraphComponent::Edge’ has user-provided ‘lemon::concepts::BaseGraphComponent::Edge::Edge(const lemon::concepts::BaseGraphComponent::Edge&)’ 219 | Edge(const Edge &) : Parent() {} | ^~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItemIt::Constraints<_GraphItemIt>::constraints() [with _GraphItemIt = lemon::concepts::GraphItemIt, lemon::concepts::BaseGraphComponent::Edge>; GR = lemon::concepts::IterableGraphComponent<>; Item = lemon::concepts::BaseGraphComponent::Edge]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItemIt, lemon::concepts::BaseGraphComponent::Edge>; Type = lemon::concepts::GraphItemIt, lemon::concepts::BaseGraphComponent::Edge>]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1121:40: required from ‘void lemon::concepts::IterableGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::IterableGraphComponent<>; BAS = lemon::concepts::BaseGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableGraphComponent<>; Type = lemon::concepts::IterableGraphComponent<>]’ /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:343:34: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:737:14: warning: implicitly-declared ‘lemon::concepts::BaseGraphComponent::Edge& lemon::concepts::BaseGraphComponent::Edge::operator=(const lemon::concepts::BaseGraphComponent::Edge&)’ is deprecated [-Wdeprecated-copy] 737 | bi = it2; | ~~~^~~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:219:9: note: because ‘lemon::concepts::BaseGraphComponent::Edge’ has user-provided ‘lemon::concepts::BaseGraphComponent::Edge::Edge(const lemon::concepts::BaseGraphComponent::Edge&)’ 219 | Edge(const Edge &) : Parent() {} | ^~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphIncIt::Constraints<_GraphIncIt>::constraints() [with _GraphIncIt = lemon::concepts::GraphIncIt, lemon::concepts::BaseGraphComponent::Edge, lemon::concepts::GraphItem<'n'>, 'e'>; GR = lemon::concepts::IterableGraphComponent<>; Item = lemon::concepts::BaseGraphComponent::Edge; Base = lemon::concepts::GraphItem<'n'>; char sel = 'e']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphIncIt, lemon::concepts::BaseGraphComponent::Edge, lemon::concepts::GraphItem<'n'>, 'e'>; Type = lemon::concepts::GraphIncIt, lemon::concepts::BaseGraphComponent::Edge, lemon::concepts::GraphItem<'n'>, 'e'>]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1123:71: required from ‘void lemon::concepts::IterableGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::IterableGraphComponent<>; BAS = lemon::concepts::BaseGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableGraphComponent<>; Type = lemon::concepts::IterableGraphComponent<>]’ /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:343:34: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:827:13: warning: implicitly-declared ‘lemon::concepts::BaseGraphComponent::Edge& lemon::concepts::BaseGraphComponent::Edge::operator=(const lemon::concepts::BaseGraphComponent::Edge&)’ is deprecated [-Wdeprecated-copy] 827 | e = it2; | ~~^~~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:219:9: note: because ‘lemon::concepts::BaseGraphComponent::Edge’ has user-provided ‘lemon::concepts::BaseGraphComponent::Edge::Edge(const lemon::concepts::BaseGraphComponent::Edge&)’ 219 | Edge(const Edge &) : Parent() {} | ^~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::BaseGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::Graph]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseGraphComponent; Type = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:775:51: required from ‘void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Graph; Type = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:349:32: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:284:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 284 | n = graph.u(ue); In file included from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:26, from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:285:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 285 | n = graph.v(ue); In file included from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:26, from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:286:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 286 | e = graph.direct(ue, true); In file included from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:26, from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:287:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 287 | e = graph.direct(ue, false); In file included from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:26, from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:288:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 288 | e = graph.direct(ue, n); In file included from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:26, from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:289:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 289 | e = graph.oppositeArc(e); In file included from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:26, from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:290:16: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Edge& lemon::concepts::Graph::Edge::operator=(const lemon::concepts::Graph::Edge&)’ is deprecated [-Wdeprecated-copy] 290 | ue = e; | ~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:200:9: note: because ‘lemon::concepts::Graph::Edge’ has user-provided ‘lemon::concepts::Graph::Edge::Edge(const lemon::concepts::Graph::Edge&)’ 200 | Edge(const Edge&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:26, from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::IterableGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::Graph; BAS = lemon::concepts::BaseGraphComponent]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableGraphComponent<>; Type = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:776:57: required from ‘void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Graph; Type = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:349:32: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1127:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1127 | n = graph.baseNode(ieit); In file included from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:26, from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1128:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1128 | n = graph.runningNode(ieit); In file included from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:26, from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::IDableGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::Graph; BAS = lemon::concepts::BaseGraphComponent]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IDableGraphComponent<>; Type = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:777:55: required from ‘void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Graph; Type = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:349:32: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:590:16: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Edge& lemon::concepts::Graph::Edge::operator=(const lemon::concepts::Graph::Edge&)’ is deprecated [-Wdeprecated-copy] 590 | edge = graph.edgeFromId(ueid); In file included from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:200:9: note: because ‘lemon::concepts::Graph::Edge’ has user-provided ‘lemon::concepts::Graph::Edge::Edge(const lemon::concepts::Graph::Edge&)’ 200 | Edge(const Edge&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:26, from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::BaseGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::IDableGraphComponent<>]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseGraphComponent; Type = lemon::concepts::IDableGraphComponent<>]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:524:40: required from ‘void lemon::concepts::IDableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::IDableGraphComponent<>; BAS = lemon::concepts::BaseGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IDableDigraphComponent; Type = lemon::concepts::IDableGraphComponent<>]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:586:62: required from ‘void lemon::concepts::IDableGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::IDableGraphComponent<>; BAS = lemon::concepts::BaseGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IDableGraphComponent<>; Type = lemon::concepts::IDableGraphComponent<>]’ /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:340:32: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:290:16: warning: implicitly-declared ‘lemon::concepts::BaseGraphComponent::Edge& lemon::concepts::BaseGraphComponent::Edge::operator=(const lemon::concepts::BaseGraphComponent::Edge&)’ is deprecated [-Wdeprecated-copy] 290 | ue = e; | ~~~^~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:219:9: note: because ‘lemon::concepts::BaseGraphComponent::Edge’ has user-provided ‘lemon::concepts::BaseGraphComponent::Edge::Edge(const lemon::concepts::BaseGraphComponent::Edge&)’ 219 | Edge(const Edge &) : Parent() {} | ^~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::BaseGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::IterableGraphComponent<>]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseGraphComponent; Type = lemon::concepts::IterableGraphComponent<>]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:963:39: required from ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::IterableGraphComponent<>; BAS = lemon::concepts::BaseGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent; Type = lemon::concepts::IterableGraphComponent<>]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1102:63: required from ‘void lemon::concepts::IterableGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::IterableGraphComponent<>; BAS = lemon::concepts::BaseGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableGraphComponent<>; Type = lemon::concepts::IterableGraphComponent<>]’ /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:343:34: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:290:16: warning: implicitly-declared ‘lemon::concepts::BaseGraphComponent::Edge& lemon::concepts::BaseGraphComponent::Edge::operator=(const lemon::concepts::BaseGraphComponent::Edge&)’ is deprecated [-Wdeprecated-copy] 290 | ue = e; | ~~~^~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:219:9: note: because ‘lemon::concepts::BaseGraphComponent::Edge’ has user-provided ‘lemon::concepts::BaseGraphComponent::Edge::Edge(const lemon::concepts::BaseGraphComponent::Edge&)’ 219 | Edge(const Edge &) : Parent() {} | ^~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::BaseGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::MappableGraphComponent<>]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseGraphComponent; Type = lemon::concepts::MappableGraphComponent<>]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1580:39: required from ‘void lemon::concepts::MappableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::MappableGraphComponent<>; BAS = lemon::concepts::BaseGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::MappableDigraphComponent; Type = lemon::concepts::MappableGraphComponent<>]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1679:63: required from ‘void lemon::concepts::MappableGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::MappableGraphComponent<>; BAS = lemon::concepts::BaseGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::MappableGraphComponent<>; Type = lemon::concepts::MappableGraphComponent<>]’ /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:346:34: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:290:16: warning: implicitly-declared ‘lemon::concepts::BaseGraphComponent::Edge& lemon::concepts::BaseGraphComponent::Edge::operator=(const lemon::concepts::BaseGraphComponent::Edge&)’ is deprecated [-Wdeprecated-copy] 290 | ue = e; | ~~~^~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:219:9: note: because ‘lemon::concepts::BaseGraphComponent::Edge’ has user-provided ‘lemon::concepts::BaseGraphComponent::Edge::Edge(const lemon::concepts::BaseGraphComponent::Edge&)’ 219 | Edge(const Edge &) : Parent() {} | ^~~~ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::BaseDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Graph]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseDigraphComponent; Type = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:278:53: required from ‘void lemon::concepts::BaseGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseGraphComponent; Type = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:775:51: required from ‘void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Graph; Type = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:349:32: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:173:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 173 | n = digraph.source(e); In file included from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:26, from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:174:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 174 | n = digraph.target(e); In file included from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:26, from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:175:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 175 | n = digraph.oppositeNode(n, e); In file included from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:26, from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItem::Constraints<_GraphItem>::constraints() [with _GraphItem = lemon::concepts::Graph::Edge; char sel = 'e']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItem<'e'>; Type = lemon::concepts::Graph::Edge]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:279:45: required from ‘void lemon::concepts::BaseGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseGraphComponent; Type = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:775:51: required from ‘void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Graph; Type = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:349:32: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:104:13: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Edge& lemon::concepts::Graph::Edge::operator=(const lemon::concepts::Graph::Edge&)’ is deprecated [-Wdeprecated-copy] 104 | i1=INVALID; | ~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:200:9: note: because ‘lemon::concepts::Graph::Edge’ has user-provided ‘lemon::concepts::Graph::Edge::Edge(const lemon::concepts::Graph::Edge&)’ 200 | Edge(const Edge&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:26, from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:19: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Edge& lemon::concepts::Graph::Edge::operator=(const lemon::concepts::Graph::Edge&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:200:9: note: because ‘lemon::concepts::Graph::Edge’ has user-provided ‘lemon::concepts::Graph::Edge::Edge(const lemon::concepts::Graph::Edge&)’ 200 | Edge(const Edge&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:26, from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:14: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Edge& lemon::concepts::Graph::Edge::operator=(const lemon::concepts::Graph::Edge&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:200:9: note: because ‘lemon::concepts::Graph::Edge’ has user-provided ‘lemon::concepts::Graph::Edge::Edge(const lemon::concepts::Graph::Edge&)’ 200 | Edge(const Edge&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:26, from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Graph; BAS = lemon::concepts::BaseGraphComponent]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent; Type = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1102:63: required from ‘void lemon::concepts::IterableGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::Graph; BAS = lemon::concepts::BaseGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableGraphComponent<>; Type = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:776:57: required from ‘void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Graph; Type = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:349:32: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:999:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 999 | n = digraph.baseNode(iait); In file included from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:26, from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1000:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1000 | n = digraph.runningNode(iait); In file included from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:26, from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1001:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1001 | n = digraph.baseNode(oait); In file included from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:26, from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1002:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1002 | n = digraph.runningNode(oait); In file included from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:26, from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItemIt::Constraints<_GraphItemIt>::constraints() [with _GraphItemIt = lemon::concepts::Graph::EdgeIt; GR = lemon::concepts::Graph; Item = lemon::concepts::Graph::Edge]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItemIt; Type = lemon::concepts::Graph::EdgeIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1121:40: required from ‘void lemon::concepts::IterableGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::Graph; BAS = lemon::concepts::BaseGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableGraphComponent<>; Type = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:776:57: required from ‘void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Graph; Type = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:349:32: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:732:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::EdgeIt& lemon::concepts::Graph::EdgeIt::operator=(const lemon::concepts::Graph::EdgeIt&)’ is deprecated [-Wdeprecated-copy] 732 | it2 = ++it1; | ~~~~^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:248:9: note: because ‘lemon::concepts::Graph::EdgeIt’ has user-provided ‘lemon::concepts::Graph::EdgeIt::EdgeIt(const lemon::concepts::Graph::EdgeIt&)’ 248 | EdgeIt(const EdgeIt& e) : Edge(e) { } | ^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:26, from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:733:17: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::EdgeIt& lemon::concepts::Graph::EdgeIt::operator=(const lemon::concepts::Graph::EdgeIt&)’ is deprecated [-Wdeprecated-copy] 733 | ++it2 = it1; | ~~~~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:248:9: note: because ‘lemon::concepts::Graph::EdgeIt’ has user-provided ‘lemon::concepts::Graph::EdgeIt::EdgeIt(const lemon::concepts::Graph::EdgeIt&)’ 248 | EdgeIt(const EdgeIt& e) : Edge(e) { } | ^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:26, from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:737:14: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Edge& lemon::concepts::Graph::Edge::operator=(const lemon::concepts::Graph::Edge&)’ is deprecated [-Wdeprecated-copy] 737 | bi = it2; | ~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:200:9: note: because ‘lemon::concepts::Graph::Edge’ has user-provided ‘lemon::concepts::Graph::Edge::Edge(const lemon::concepts::Graph::Edge&)’ 200 | Edge(const Edge&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:26, from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphIncIt::Constraints<_GraphIncIt>::constraints() [with _GraphIncIt = lemon::concepts::Graph::IncEdgeIt; GR = lemon::concepts::Graph; Item = lemon::concepts::Graph::Edge; Base = lemon::concepts::Graph::Node; char sel = 'e']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphIncIt; Type = lemon::concepts::Graph::IncEdgeIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1123:71: required from ‘void lemon::concepts::IterableGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::Graph; BAS = lemon::concepts::BaseGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableGraphComponent<>; Type = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:776:57: required from ‘void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Graph; Type = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:349:32: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:823:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::IncEdgeIt& lemon::concepts::Graph::IncEdgeIt::operator=(const lemon::concepts::Graph::IncEdgeIt&)’ is deprecated [-Wdeprecated-copy] 823 | it2 = ++it1; | ~~~~^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:296:9: note: because ‘lemon::concepts::Graph::IncEdgeIt’ has user-provided ‘lemon::concepts::Graph::IncEdgeIt::IncEdgeIt(const lemon::concepts::Graph::IncEdgeIt&)’ 296 | IncEdgeIt(const IncEdgeIt& e) : Edge(e) { } | ^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:26, from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:824:17: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::IncEdgeIt& lemon::concepts::Graph::IncEdgeIt::operator=(const lemon::concepts::Graph::IncEdgeIt&)’ is deprecated [-Wdeprecated-copy] 824 | ++it2 = it1; | ~~~~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:296:9: note: because ‘lemon::concepts::Graph::IncEdgeIt’ has user-provided ‘lemon::concepts::Graph::IncEdgeIt::IncEdgeIt(const lemon::concepts::Graph::IncEdgeIt&)’ 296 | IncEdgeIt(const IncEdgeIt& e) : Edge(e) { } | ^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:26, from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:827:13: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Edge& lemon::concepts::Graph::Edge::operator=(const lemon::concepts::Graph::Edge&)’ is deprecated [-Wdeprecated-copy] 827 | e = it2; | ~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:200:9: note: because ‘lemon::concepts::Graph::Edge’ has user-provided ‘lemon::concepts::Graph::Edge::Edge(const lemon::concepts::Graph::Edge&)’ 200 | Edge(const Edge&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:26, from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::IDableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Graph; BAS = lemon::concepts::BaseGraphComponent]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IDableDigraphComponent; Type = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:586:62: required from ‘void lemon::concepts::IDableGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::Graph; BAS = lemon::concepts::BaseGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IDableGraphComponent<>; Type = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:777:55: required from ‘void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Graph; Type = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:349:32: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:526:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 526 | node=INVALID; | ~~~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:26, from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:529:16: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 529 | node = digraph.nodeFromId(nid); In file included from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:26, from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:531:14: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 531 | arc=INVALID; | ~~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:26, from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:534:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 534 | arc = digraph.arcFromId(eid); In file included from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:26, from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItem::Constraints<_GraphItem>::constraints() [with _GraphItem = lemon::concepts::Graph::Node; char sel = 'n']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItem<'n'>; Type = lemon::concepts::Graph::Node]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:168:45: required from ‘void lemon::concepts::BaseDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseDigraphComponent; Type = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:278:53: required from ‘void lemon::concepts::BaseGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseGraphComponent; Type = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:775:51: required from ‘void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Graph; Type = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:349:32: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:104:13: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 104 | i1=INVALID; | ~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:26, from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:19: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:26, from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:14: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:26, from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItem::Constraints<_GraphItem>::constraints() [with _GraphItem = lemon::concepts::Graph::Arc; char sel = 'a']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItem<'a'>; Type = lemon::concepts::Graph::Arc]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:169:44: required from ‘void lemon::concepts::BaseDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseDigraphComponent; Type = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:278:53: required from ‘void lemon::concepts::BaseGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseGraphComponent; Type = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:775:51: required from ‘void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Graph; Type = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:349:32: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:104:13: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 104 | i1=INVALID; | ~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:26, from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:19: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:26, from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:14: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:26, from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItemIt::Constraints<_GraphItemIt>::constraints() [with _GraphItemIt = lemon::concepts::Graph::ArcIt; GR = lemon::concepts::Graph; Item = lemon::concepts::Graph::Arc]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItemIt; Type = lemon::concepts::Graph::ArcIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:988:41: required from ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Graph; BAS = lemon::concepts::BaseGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent; Type = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1102:63: required from ‘void lemon::concepts::IterableGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::Graph; BAS = lemon::concepts::BaseGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableGraphComponent<>; Type = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:776:57: required from ‘void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Graph; Type = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:349:32: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:732:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::ArcIt& lemon::concepts::Graph::ArcIt::operator=(const lemon::concepts::Graph::ArcIt&)’ is deprecated [-Wdeprecated-copy] 732 | it2 = ++it1; | ~~~~^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:389:9: note: because ‘lemon::concepts::Graph::ArcIt’ has user-provided ‘lemon::concepts::Graph::ArcIt::ArcIt(const lemon::concepts::Graph::ArcIt&)’ 389 | ArcIt(const ArcIt& e) : Arc(e) { } | ^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:26, from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:733:17: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::ArcIt& lemon::concepts::Graph::ArcIt::operator=(const lemon::concepts::Graph::ArcIt&)’ is deprecated [-Wdeprecated-copy] 733 | ++it2 = it1; | ~~~~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:389:9: note: because ‘lemon::concepts::Graph::ArcIt’ has user-provided ‘lemon::concepts::Graph::ArcIt::ArcIt(const lemon::concepts::Graph::ArcIt&)’ 389 | ArcIt(const ArcIt& e) : Arc(e) { } | ^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:26, from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:737:14: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 737 | bi = it2; | ~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:26, from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItemIt::Constraints<_GraphItemIt>::constraints() [with _GraphItemIt = lemon::concepts::Graph::NodeIt; GR = lemon::concepts::Graph; Item = lemon::concepts::Graph::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItemIt; Type = lemon::concepts::Graph::NodeIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:990:42: required from ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Graph; BAS = lemon::concepts::BaseGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent; Type = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1102:63: required from ‘void lemon::concepts::IterableGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::Graph; BAS = lemon::concepts::BaseGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableGraphComponent<>; Type = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:776:57: required from ‘void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Graph; Type = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:349:32: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:732:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::NodeIt& lemon::concepts::Graph::NodeIt::operator=(const lemon::concepts::Graph::NodeIt&)’ is deprecated [-Wdeprecated-copy] 732 | it2 = ++it1; | ~~~~^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:160:9: note: because ‘lemon::concepts::Graph::NodeIt’ has user-provided ‘lemon::concepts::Graph::NodeIt::NodeIt(const lemon::concepts::Graph::NodeIt&)’ 160 | NodeIt(const NodeIt& n) : Node(n) { } | ^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:26, from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:733:17: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::NodeIt& lemon::concepts::Graph::NodeIt::operator=(const lemon::concepts::Graph::NodeIt&)’ is deprecated [-Wdeprecated-copy] 733 | ++it2 = it1; | ~~~~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:160:9: note: because ‘lemon::concepts::Graph::NodeIt’ has user-provided ‘lemon::concepts::Graph::NodeIt::NodeIt(const lemon::concepts::Graph::NodeIt&)’ 160 | NodeIt(const NodeIt& n) : Node(n) { } | ^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:26, from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:737:14: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 737 | bi = it2; | ~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:26, from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphIncIt::Constraints<_GraphIncIt>::constraints() [with _GraphIncIt = lemon::concepts::Graph::InArcIt; GR = lemon::concepts::Graph; Item = lemon::concepts::Graph::Arc; Base = lemon::concepts::Graph::Node; char sel = 'i']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphIncIt; Type = lemon::concepts::Graph::InArcIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:992:73: required from ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Graph; BAS = lemon::concepts::BaseGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent; Type = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1102:63: required from ‘void lemon::concepts::IterableGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::Graph; BAS = lemon::concepts::BaseGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableGraphComponent<>; Type = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:776:57: required from ‘void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Graph; Type = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:349:32: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:823:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::InArcIt& lemon::concepts::Graph::InArcIt::operator=(const lemon::concepts::Graph::InArcIt&)’ is deprecated [-Wdeprecated-copy] 823 | it2 = ++it1; | ~~~~^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:484:9: note: because ‘lemon::concepts::Graph::InArcIt’ has user-provided ‘lemon::concepts::Graph::InArcIt::InArcIt(const lemon::concepts::Graph::InArcIt&)’ 484 | InArcIt(const InArcIt& e) : Arc(e) { } | ^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:26, from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:824:17: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::InArcIt& lemon::concepts::Graph::InArcIt::operator=(const lemon::concepts::Graph::InArcIt&)’ is deprecated [-Wdeprecated-copy] 824 | ++it2 = it1; | ~~~~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:484:9: note: because ‘lemon::concepts::Graph::InArcIt’ has user-provided ‘lemon::concepts::Graph::InArcIt::InArcIt(const lemon::concepts::Graph::InArcIt&)’ 484 | InArcIt(const InArcIt& e) : Arc(e) { } | ^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:26, from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:827:13: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 827 | e = it2; | ~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:26, from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphIncIt::Constraints<_GraphIncIt>::constraints() [with _GraphIncIt = lemon::concepts::Graph::OutArcIt; GR = lemon::concepts::Graph; Item = lemon::concepts::Graph::Arc; Base = lemon::concepts::Graph::Node; char sel = 'o']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphIncIt; Type = lemon::concepts::Graph::OutArcIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:994:74: required from ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Graph; BAS = lemon::concepts::BaseGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent; Type = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1102:63: required from ‘void lemon::concepts::IterableGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::Graph; BAS = lemon::concepts::BaseGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableGraphComponent<>; Type = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:776:57: required from ‘void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Graph; Type = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:349:32: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:823:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::OutArcIt& lemon::concepts::Graph::OutArcIt::operator=(const lemon::concepts::Graph::OutArcIt&)’ is deprecated [-Wdeprecated-copy] 823 | it2 = ++it1; | ~~~~^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:436:9: note: because ‘lemon::concepts::Graph::OutArcIt’ has user-provided ‘lemon::concepts::Graph::OutArcIt::OutArcIt(const lemon::concepts::Graph::OutArcIt&)’ 436 | OutArcIt(const OutArcIt& e) : Arc(e) { } | ^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:26, from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:824:17: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::OutArcIt& lemon::concepts::Graph::OutArcIt::operator=(const lemon::concepts::Graph::OutArcIt&)’ is deprecated [-Wdeprecated-copy] 824 | ++it2 = it1; | ~~~~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:436:9: note: because ‘lemon::concepts::Graph::OutArcIt’ has user-provided ‘lemon::concepts::Graph::OutArcIt::OutArcIt(const lemon::concepts::Graph::OutArcIt&)’ 436 | OutArcIt(const OutArcIt& e) : Arc(e) { } | ^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:26, from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:827:13: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 827 | e = it2; | ~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:26, from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItem::Constraints<_GraphItem>::constraints() [with _GraphItem = lemon::concepts::Graph::EdgeIt; char sel = '0']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItem<>; Type = lemon::concepts::Graph::EdgeIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:724:50: required from ‘void lemon::concepts::GraphItemIt::Constraints<_GraphItemIt>::constraints() [with _GraphItemIt = lemon::concepts::Graph::EdgeIt; GR = lemon::concepts::Graph; Item = lemon::concepts::Graph::Edge]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItemIt; Type = lemon::concepts::Graph::EdgeIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1121:40: required from ‘void lemon::concepts::IterableGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::Graph; BAS = lemon::concepts::BaseGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableGraphComponent<>; Type = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:776:57: required from ‘void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Graph; Type = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:349:32: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:104:13: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::EdgeIt& lemon::concepts::Graph::EdgeIt::operator=(const lemon::concepts::Graph::EdgeIt&)’ is deprecated [-Wdeprecated-copy] 104 | i1=INVALID; | ~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:248:9: note: because ‘lemon::concepts::Graph::EdgeIt’ has user-provided ‘lemon::concepts::Graph::EdgeIt::EdgeIt(const lemon::concepts::Graph::EdgeIt&)’ 248 | EdgeIt(const EdgeIt& e) : Edge(e) { } | ^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:26, from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:19: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::EdgeIt& lemon::concepts::Graph::EdgeIt::operator=(const lemon::concepts::Graph::EdgeIt&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:248:9: note: because ‘lemon::concepts::Graph::EdgeIt’ has user-provided ‘lemon::concepts::Graph::EdgeIt::EdgeIt(const lemon::concepts::Graph::EdgeIt&)’ 248 | EdgeIt(const EdgeIt& e) : Edge(e) { } | ^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:26, from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:14: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::EdgeIt& lemon::concepts::Graph::EdgeIt::operator=(const lemon::concepts::Graph::EdgeIt&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:248:9: note: because ‘lemon::concepts::Graph::EdgeIt’ has user-provided ‘lemon::concepts::Graph::EdgeIt::EdgeIt(const lemon::concepts::Graph::EdgeIt&)’ 248 | EdgeIt(const EdgeIt& e) : Edge(e) { } | ^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:26, from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItem::Constraints<_GraphItem>::constraints() [with _GraphItem = lemon::concepts::Graph::IncEdgeIt; char sel = 'e']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItem<'e'>; Type = lemon::concepts::Graph::IncEdgeIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:815:52: required from ‘void lemon::concepts::GraphIncIt::Constraints<_GraphIncIt>::constraints() [with _GraphIncIt = lemon::concepts::Graph::IncEdgeIt; GR = lemon::concepts::Graph; Item = lemon::concepts::Graph::Edge; Base = lemon::concepts::Graph::Node; char sel = 'e']’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphIncIt; Type = lemon::concepts::Graph::IncEdgeIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1123:71: required from ‘void lemon::concepts::IterableGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::Graph; BAS = lemon::concepts::BaseGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableGraphComponent<>; Type = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:776:57: required from ‘void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Graph; Type = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:349:32: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:104:13: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::IncEdgeIt& lemon::concepts::Graph::IncEdgeIt::operator=(const lemon::concepts::Graph::IncEdgeIt&)’ is deprecated [-Wdeprecated-copy] 104 | i1=INVALID; | ~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:296:9: note: because ‘lemon::concepts::Graph::IncEdgeIt’ has user-provided ‘lemon::concepts::Graph::IncEdgeIt::IncEdgeIt(const lemon::concepts::Graph::IncEdgeIt&)’ 296 | IncEdgeIt(const IncEdgeIt& e) : Edge(e) { } | ^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:26, from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:19: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::IncEdgeIt& lemon::concepts::Graph::IncEdgeIt::operator=(const lemon::concepts::Graph::IncEdgeIt&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:296:9: note: because ‘lemon::concepts::Graph::IncEdgeIt’ has user-provided ‘lemon::concepts::Graph::IncEdgeIt::IncEdgeIt(const lemon::concepts::Graph::IncEdgeIt&)’ 296 | IncEdgeIt(const IncEdgeIt& e) : Edge(e) { } | ^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:26, from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:14: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::IncEdgeIt& lemon::concepts::Graph::IncEdgeIt::operator=(const lemon::concepts::Graph::IncEdgeIt&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:296:9: note: because ‘lemon::concepts::Graph::IncEdgeIt’ has user-provided ‘lemon::concepts::Graph::IncEdgeIt::IncEdgeIt(const lemon::concepts::Graph::IncEdgeIt&)’ 296 | IncEdgeIt(const IncEdgeIt& e) : Edge(e) { } | ^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:26, from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItem::Constraints<_GraphItem>::constraints() [with _GraphItem = lemon::concepts::Graph::ArcIt; char sel = '0']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItem<>; Type = lemon::concepts::Graph::ArcIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:724:50: required from ‘void lemon::concepts::GraphItemIt::Constraints<_GraphItemIt>::constraints() [with _GraphItemIt = lemon::concepts::Graph::ArcIt; GR = lemon::concepts::Graph; Item = lemon::concepts::Graph::Arc]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItemIt; Type = lemon::concepts::Graph::ArcIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:988:41: required from ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Graph; BAS = lemon::concepts::BaseGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent; Type = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1102:63: required from ‘void lemon::concepts::IterableGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::Graph; BAS = lemon::concepts::BaseGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableGraphComponent<>; Type = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:776:57: required from ‘void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Graph; Type = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:349:32: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:104:13: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::ArcIt& lemon::concepts::Graph::ArcIt::operator=(const lemon::concepts::Graph::ArcIt&)’ is deprecated [-Wdeprecated-copy] 104 | i1=INVALID; | ~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:389:9: note: because ‘lemon::concepts::Graph::ArcIt’ has user-provided ‘lemon::concepts::Graph::ArcIt::ArcIt(const lemon::concepts::Graph::ArcIt&)’ 389 | ArcIt(const ArcIt& e) : Arc(e) { } | ^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:26, from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:19: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::ArcIt& lemon::concepts::Graph::ArcIt::operator=(const lemon::concepts::Graph::ArcIt&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:389:9: note: because ‘lemon::concepts::Graph::ArcIt’ has user-provided ‘lemon::concepts::Graph::ArcIt::ArcIt(const lemon::concepts::Graph::ArcIt&)’ 389 | ArcIt(const ArcIt& e) : Arc(e) { } | ^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:26, from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:14: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::ArcIt& lemon::concepts::Graph::ArcIt::operator=(const lemon::concepts::Graph::ArcIt&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:389:9: note: because ‘lemon::concepts::Graph::ArcIt’ has user-provided ‘lemon::concepts::Graph::ArcIt::ArcIt(const lemon::concepts::Graph::ArcIt&)’ 389 | ArcIt(const ArcIt& e) : Arc(e) { } | ^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:26, from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItem::Constraints<_GraphItem>::constraints() [with _GraphItem = lemon::concepts::Graph::NodeIt; char sel = '0']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItem<>; Type = lemon::concepts::Graph::NodeIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:724:50: required from ‘void lemon::concepts::GraphItemIt::Constraints<_GraphItemIt>::constraints() [with _GraphItemIt = lemon::concepts::Graph::NodeIt; GR = lemon::concepts::Graph; Item = lemon::concepts::Graph::Node]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItemIt; Type = lemon::concepts::Graph::NodeIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:990:42: required from ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Graph; BAS = lemon::concepts::BaseGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent; Type = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1102:63: required from ‘void lemon::concepts::IterableGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::Graph; BAS = lemon::concepts::BaseGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableGraphComponent<>; Type = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:776:57: required from ‘void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Graph; Type = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:349:32: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:104:13: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::NodeIt& lemon::concepts::Graph::NodeIt::operator=(const lemon::concepts::Graph::NodeIt&)’ is deprecated [-Wdeprecated-copy] 104 | i1=INVALID; | ~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:160:9: note: because ‘lemon::concepts::Graph::NodeIt’ has user-provided ‘lemon::concepts::Graph::NodeIt::NodeIt(const lemon::concepts::Graph::NodeIt&)’ 160 | NodeIt(const NodeIt& n) : Node(n) { } | ^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:26, from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:19: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::NodeIt& lemon::concepts::Graph::NodeIt::operator=(const lemon::concepts::Graph::NodeIt&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:160:9: note: because ‘lemon::concepts::Graph::NodeIt’ has user-provided ‘lemon::concepts::Graph::NodeIt::NodeIt(const lemon::concepts::Graph::NodeIt&)’ 160 | NodeIt(const NodeIt& n) : Node(n) { } | ^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:26, from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:14: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::NodeIt& lemon::concepts::Graph::NodeIt::operator=(const lemon::concepts::Graph::NodeIt&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:160:9: note: because ‘lemon::concepts::Graph::NodeIt’ has user-provided ‘lemon::concepts::Graph::NodeIt::NodeIt(const lemon::concepts::Graph::NodeIt&)’ 160 | NodeIt(const NodeIt& n) : Node(n) { } | ^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:26, from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItem::Constraints<_GraphItem>::constraints() [with _GraphItem = lemon::concepts::Graph::InArcIt; char sel = 'i']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItem<'i'>; Type = lemon::concepts::Graph::InArcIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:815:52: required from ‘void lemon::concepts::GraphIncIt::Constraints<_GraphIncIt>::constraints() [with _GraphIncIt = lemon::concepts::Graph::InArcIt; GR = lemon::concepts::Graph; Item = lemon::concepts::Graph::Arc; Base = lemon::concepts::Graph::Node; char sel = 'i']’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphIncIt; Type = lemon::concepts::Graph::InArcIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:992:73: required from ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Graph; BAS = lemon::concepts::BaseGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent; Type = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1102:63: required from ‘void lemon::concepts::IterableGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::Graph; BAS = lemon::concepts::BaseGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableGraphComponent<>; Type = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:776:57: required from ‘void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Graph; Type = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:349:32: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:104:13: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::InArcIt& lemon::concepts::Graph::InArcIt::operator=(const lemon::concepts::Graph::InArcIt&)’ is deprecated [-Wdeprecated-copy] 104 | i1=INVALID; | ~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:484:9: note: because ‘lemon::concepts::Graph::InArcIt’ has user-provided ‘lemon::concepts::Graph::InArcIt::InArcIt(const lemon::concepts::Graph::InArcIt&)’ 484 | InArcIt(const InArcIt& e) : Arc(e) { } | ^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:26, from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:19: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::InArcIt& lemon::concepts::Graph::InArcIt::operator=(const lemon::concepts::Graph::InArcIt&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:484:9: note: because ‘lemon::concepts::Graph::InArcIt’ has user-provided ‘lemon::concepts::Graph::InArcIt::InArcIt(const lemon::concepts::Graph::InArcIt&)’ 484 | InArcIt(const InArcIt& e) : Arc(e) { } | ^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:26, from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:14: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::InArcIt& lemon::concepts::Graph::InArcIt::operator=(const lemon::concepts::Graph::InArcIt&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:484:9: note: because ‘lemon::concepts::Graph::InArcIt’ has user-provided ‘lemon::concepts::Graph::InArcIt::InArcIt(const lemon::concepts::Graph::InArcIt&)’ 484 | InArcIt(const InArcIt& e) : Arc(e) { } | ^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:26, from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItem::Constraints<_GraphItem>::constraints() [with _GraphItem = lemon::concepts::Graph::OutArcIt; char sel = 'o']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItem<'o'>; Type = lemon::concepts::Graph::OutArcIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:815:52: required from ‘void lemon::concepts::GraphIncIt::Constraints<_GraphIncIt>::constraints() [with _GraphIncIt = lemon::concepts::Graph::OutArcIt; GR = lemon::concepts::Graph; Item = lemon::concepts::Graph::Arc; Base = lemon::concepts::Graph::Node; char sel = 'o']’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphIncIt; Type = lemon::concepts::Graph::OutArcIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:994:74: required from ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Graph; BAS = lemon::concepts::BaseGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent; Type = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1102:63: required from ‘void lemon::concepts::IterableGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::Graph; BAS = lemon::concepts::BaseGraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableGraphComponent<>; Type = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:776:57: required from ‘void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Graph; Type = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:349:32: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:104:13: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::OutArcIt& lemon::concepts::Graph::OutArcIt::operator=(const lemon::concepts::Graph::OutArcIt&)’ is deprecated [-Wdeprecated-copy] 104 | i1=INVALID; | ~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:436:9: note: because ‘lemon::concepts::Graph::OutArcIt’ has user-provided ‘lemon::concepts::Graph::OutArcIt::OutArcIt(const lemon::concepts::Graph::OutArcIt&)’ 436 | OutArcIt(const OutArcIt& e) : Arc(e) { } | ^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:26, from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:19: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::OutArcIt& lemon::concepts::Graph::OutArcIt::operator=(const lemon::concepts::Graph::OutArcIt&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:436:9: note: because ‘lemon::concepts::Graph::OutArcIt’ has user-provided ‘lemon::concepts::Graph::OutArcIt::OutArcIt(const lemon::concepts::Graph::OutArcIt&)’ 436 | OutArcIt(const OutArcIt& e) : Arc(e) { } | ^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:26, from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:14: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::OutArcIt& lemon::concepts::Graph::OutArcIt::operator=(const lemon::concepts::Graph::OutArcIt&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:436:9: note: because ‘lemon::concepts::Graph::OutArcIt’ has user-provided ‘lemon::concepts::Graph::OutArcIt::OutArcIt(const lemon::concepts::Graph::OutArcIt&)’ 436 | OutArcIt(const OutArcIt& e) : Arc(e) { } | ^~~~~~~~ [ 39%] Linking CXX executable graph_test cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/cmake -E cmake_link_script CMakeFiles/graph_test.dir/link.txt --verbose=1 /usr/bin/c++ -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -Wl,-Bsymbolic-functions -Wl,-z,relro -Wl,-z,now -rdynamic CMakeFiles/graph_test.dir/graph_test.cc.o -o graph_test -L/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 39%] Built target graph_test make -f test/CMakeFiles/bfs_test.dir/build.make test/CMakeFiles/bfs_test.dir/depend make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<>/liblemon-1.3.1+dfsg /<>/liblemon-1.3.1+dfsg/test /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test/CMakeFiles/bfs_test.dir/DependInfo.cmake --color= Scanning dependencies of target bfs_test make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' make -f test/CMakeFiles/bfs_test.dir/build.make test/CMakeFiles/bfs_test.dir/build make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 40%] Building CXX object test/CMakeFiles/bfs_test.dir/bfs_test.cc.o cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -I/<>/liblemon-1.3.1+dfsg -I/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -o CMakeFiles/bfs_test.dir/bfs_test.cc.o -c /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc: In function ‘void checkBfsCompile()’: /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:81:34: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 81 | n = bfs_test.processNextNode(); | ^ In file included from /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:82:38: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 82 | n = bfs_test.processNextNode(t, b); | ^ In file included from /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:83:39: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 83 | n = bfs_test.processNextNode(nm, n); | ^ In file included from /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:84:33: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 84 | n = const_bfs_test.nextNode(); | ^ In file included from /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:93:34: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 93 | e = const_bfs_test.predArc(t); | ^ In file included from /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:94:35: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 94 | s = const_bfs_test.predNode(t); | ^ In file included from /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:96:33: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::NodeMap& lemon::concepts::Digraph::NodeMap::operator=(const lemon::concepts::Digraph::NodeMap&)’ is deprecated [-Wdeprecated-copy] 96 | d = const_bfs_test.distMap(); | ^ In file included from /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:439:9: note: because ‘lemon::concepts::Digraph::NodeMap’ has user-provided ‘lemon::concepts::Digraph::NodeMap::NodeMap(const lemon::concepts::Digraph::NodeMap&) [with T = int]’ 439 | NodeMap(const NodeMap& nm) : | ^~~~~~~ /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:97:33: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::NodeMap& lemon::concepts::Digraph::NodeMap::operator=(const lemon::concepts::Digraph::NodeMap&)’ is deprecated [-Wdeprecated-copy] 97 | p = const_bfs_test.predMap(); | ^ In file included from /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:439:9: note: because ‘lemon::concepts::Digraph::NodeMap’ has user-provided ‘lemon::concepts::Digraph::NodeMap::NodeMap(const lemon::concepts::Digraph::NodeMap&) [with T = lemon::concepts::Digraph::Arc]’ 439 | NodeMap(const NodeMap& nm) : | ^~~~~~~ /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:126:34: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 126 | n = bfs_test.processNextNode(); | ^ In file included from /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:127:38: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 127 | n = bfs_test.processNextNode(t, b); | ^ In file included from /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:128:39: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 128 | n = bfs_test.processNextNode(nm, n); | ^ In file included from /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:129:27: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 129 | n = bfs_test.nextNode(); | ^ In file included from /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:138:28: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 138 | e = bfs_test.predArc(t); | ^ In file included from /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:139:29: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 139 | s = bfs_test.predNode(t); | ^ In file included from /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/bfs.h: In instantiation of ‘void lemon::Bfs::addSource(lemon::Bfs::Node) [with GR = lemon::concepts::Digraph; TR = lemon::BfsDefaultTraits; lemon::Bfs::Node = lemon::concepts::Digraph::Node]’: /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:80:25: required from here /<>/liblemon-1.3.1+dfsg/lemon/bfs.h:458:32: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 458 | _queue[_queue_head++]=s; | ~~~~~~~~~~~~~~~~~~~~~^~ In file included from /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/bfs.h: In instantiation of ‘lemon::Bfs::Node lemon::Bfs::processNextNode() [with GR = lemon::concepts::Digraph; TR = lemon::BfsDefaultTraits; lemon::Bfs::Node = lemon::concepts::Digraph::Node]’: /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:81:34: required from here /<>/liblemon-1.3.1+dfsg/lemon/bfs.h:480:26: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 480 | if(!(*_reached)[m=G->target(e)]) { In file included from /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/bfs.h:481:32: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 481 | _queue[_queue_head++]=m; | ~~~~~~~~~~~~~~~~~~~~~^~ In file included from /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/bfs.h: In instantiation of ‘lemon::Bfs::Node lemon::Bfs::processNextNode(lemon::Bfs::Node, bool&) [with GR = lemon::concepts::Digraph; TR = lemon::BfsDefaultTraits; lemon::Bfs::Node = lemon::concepts::Digraph::Node]’: /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:82:38: required from here /<>/liblemon-1.3.1+dfsg/lemon/bfs.h:512:26: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 512 | if(!(*_reached)[m=G->target(e)]) { In file included from /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/bfs.h:513:32: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 513 | _queue[_queue_head++]=m; | ~~~~~~~~~~~~~~~~~~~~~^~ In file included from /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/bfs.h: In instantiation of ‘lemon::Bfs::Node lemon::Bfs::processNextNode(const NM&, lemon::Bfs::Node&) [with NM = lemon::concepts::ReadMap; GR = lemon::concepts::Digraph; TR = lemon::BfsDefaultTraits; lemon::Bfs::Node = lemon::concepts::Digraph::Node]’: /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:83:39: required from here /<>/liblemon-1.3.1+dfsg/lemon/bfs.h:548:26: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 548 | if(!(*_reached)[m=G->target(e)]) { In file included from /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/bfs.h:549:32: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 549 | _queue[_queue_head++]=m; | ~~~~~~~~~~~~~~~~~~~~~^~ In file included from /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/bfs.h:553:48: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 553 | if (nm[m] && rnode == INVALID) rnode = m; | ~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/bfs.h: In instantiation of ‘void lemon::Bfs::addSource(lemon::Bfs::Node) [with GR = lemon::concepts::Digraph; TR = lemon::Bfs::SetPredMapTraits > >::SetDistMapTraits > >::SetReachedMapTraits > >::SetStandardProcessedMapTraits>::SetProcessedMapTraits >; lemon::Bfs::Node = lemon::concepts::Digraph::Node]’: /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:125:25: required from here /<>/liblemon-1.3.1+dfsg/lemon/bfs.h:458:32: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 458 | _queue[_queue_head++]=s; | ~~~~~~~~~~~~~~~~~~~~~^~ In file included from /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/bfs.h: In instantiation of ‘lemon::Bfs::Node lemon::Bfs::processNextNode() [with GR = lemon::concepts::Digraph; TR = lemon::Bfs::SetPredMapTraits > >::SetDistMapTraits > >::SetReachedMapTraits > >::SetStandardProcessedMapTraits>::SetProcessedMapTraits >; lemon::Bfs::Node = lemon::concepts::Digraph::Node]’: /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:126:34: required from here /<>/liblemon-1.3.1+dfsg/lemon/bfs.h:480:26: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 480 | if(!(*_reached)[m=G->target(e)]) { In file included from /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/bfs.h:481:32: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 481 | _queue[_queue_head++]=m; | ~~~~~~~~~~~~~~~~~~~~~^~ In file included from /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/bfs.h: In instantiation of ‘lemon::Bfs::Node lemon::Bfs::processNextNode(lemon::Bfs::Node, bool&) [with GR = lemon::concepts::Digraph; TR = lemon::Bfs::SetPredMapTraits > >::SetDistMapTraits > >::SetReachedMapTraits > >::SetStandardProcessedMapTraits>::SetProcessedMapTraits >; lemon::Bfs::Node = lemon::concepts::Digraph::Node]’: /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:127:38: required from here /<>/liblemon-1.3.1+dfsg/lemon/bfs.h:512:26: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 512 | if(!(*_reached)[m=G->target(e)]) { In file included from /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/bfs.h:513:32: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 513 | _queue[_queue_head++]=m; | ~~~~~~~~~~~~~~~~~~~~~^~ In file included from /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/bfs.h: In instantiation of ‘lemon::Bfs::Node lemon::Bfs::processNextNode(const NM&, lemon::Bfs::Node&) [with NM = lemon::concepts::ReadMap; GR = lemon::concepts::Digraph; TR = lemon::Bfs::SetPredMapTraits > >::SetDistMapTraits > >::SetReachedMapTraits > >::SetStandardProcessedMapTraits>::SetProcessedMapTraits >; lemon::Bfs::Node = lemon::concepts::Digraph::Node]’: /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:128:39: required from here /<>/liblemon-1.3.1+dfsg/lemon/bfs.h:548:26: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 548 | if(!(*_reached)[m=G->target(e)]) { In file included from /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/bfs.h:549:32: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 549 | _queue[_queue_head++]=m; | ~~~~~~~~~~~~~~~~~~~~~^~ In file included from /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/bfs.h:553:48: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 553 | if (nm[m] && rnode == INVALID) rnode = m; | ~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:27, from /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/maps.h: In instantiation of ‘void lemon::concepts::ReferenceMap::set(const Key&, const Value&) [with K = lemon::concepts::Digraph::Node; T = lemon::concepts::Digraph::Arc; R = lemon::concepts::Digraph::Arc&; CR = const lemon::concepts::Digraph::Arc&; lemon::concepts::ReferenceMap::Key = lemon::concepts::Digraph::Node; lemon::concepts::ReferenceMap::Value = lemon::concepts::Digraph::Arc]’: /<>/liblemon-1.3.1+dfsg/lemon/bfs.h:441:9: required from ‘void lemon::Bfs::init() [with GR = lemon::concepts::Digraph; TR = lemon::BfsDefaultTraits]’ /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:79:19: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/maps.h:186:60: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 186 | void set(const Key &k,const Value &t) { operator[](k)=t; } In file included from /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/bfs.h: In instantiation of ‘void lemon::Bfs::addSource(lemon::Bfs::Node) [with GR = lemon::concepts::Digraph; TR = lemon::BfsWizardBase; lemon::Bfs::Node = lemon::concepts::Digraph::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/bfs.h:683:7: required from ‘void lemon::Bfs::run(lemon::Bfs::Node) [with GR = lemon::concepts::Digraph; TR = lemon::BfsWizardBase; lemon::Bfs::Node = lemon::concepts::Digraph::Node]’ /<>/liblemon-1.3.1+dfsg/lemon/bfs.h:1023:9: required from ‘void lemon::BfsWizard::run(lemon::BfsWizard::Node) [with TR = lemon::BfsWizardBase; lemon::BfsWizard::Node = lemon::concepts::Digraph::Node]’ /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:156:20: required from here /<>/liblemon-1.3.1+dfsg/lemon/bfs.h:458:32: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 458 | _queue[_queue_head++]=s; | ~~~~~~~~~~~~~~~~~~~~~^~ In file included from /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/bfs.h: In instantiation of ‘void lemon::Bfs::addSource(lemon::Bfs::Node) [with GR = lemon::concepts::Digraph; TR = lemon::BfsWizard >::SetPredMapBase > >::SetDistMapBase > >::SetReachedMapBase > >::SetProcessedMapBase >; lemon::Bfs::Node = lemon::concepts::Digraph::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/bfs.h:683:7: required from ‘void lemon::Bfs::run(lemon::Bfs::Node) [with GR = lemon::concepts::Digraph; TR = lemon::BfsWizard >::SetPredMapBase > >::SetDistMapBase > >::SetReachedMapBase > >::SetProcessedMapBase >; lemon::Bfs::Node = lemon::concepts::Digraph::Node]’ /<>/liblemon-1.3.1+dfsg/lemon/bfs.h:1023:9: required from ‘void lemon::BfsWizard::run(lemon::BfsWizard::Node) [with TR = lemon::BfsWizard >::SetPredMapBase > >::SetDistMapBase > >::SetReachedMapBase > >::SetProcessedMapBase >; lemon::BfsWizard::Node = lemon::concepts::Digraph::Node]’ /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:164:16: required from here /<>/liblemon-1.3.1+dfsg/lemon/bfs.h:458:32: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 458 | _queue[_queue_head++]=s; | ~~~~~~~~~~~~~~~~~~~~~^~ In file included from /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/bfs.h: In instantiation of ‘void lemon::Bfs::addSource(lemon::Bfs::Node) [with GR = lemon::concepts::Digraph; TR = lemon::BfsWizard >::SetPredMapBase > >::SetDistMapBase > >::SetReachedMapBase > >::SetProcessedMapBase > >::SetPathBase >; lemon::Bfs::Node = lemon::concepts::Digraph::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/bfs.h:704:7: required from ‘bool lemon::Bfs::run(lemon::Bfs::Node, lemon::Bfs::Node) [with GR = lemon::concepts::Digraph; TR = lemon::BfsWizard >::SetPredMapBase > >::SetDistMapBase > >::SetReachedMapBase > >::SetProcessedMapBase > >::SetPathBase >; lemon::Bfs::Node = lemon::concepts::Digraph::Node]’ /<>/liblemon-1.3.1+dfsg/lemon/bfs.h:1046:7: required from ‘bool lemon::BfsWizard::run(lemon::BfsWizard::Node, lemon::BfsWizard::Node) [with TR = lemon::BfsWizard >::SetPredMapBase > >::SetDistMapBase > >::SetReachedMapBase > >::SetProcessedMapBase > >::SetPathBase >; lemon::BfsWizard::Node = lemon::concepts::Digraph::Node]’ /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:172:23: required from here /<>/liblemon-1.3.1+dfsg/lemon/bfs.h:458:32: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 458 | _queue[_queue_head++]=s; | ~~~~~~~~~~~~~~~~~~~~~^~ In file included from /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/bfs.h: In instantiation of ‘lemon::Bfs::Node lemon::Bfs::processNextNode() [with GR = lemon::concepts::Digraph; TR = lemon::BfsWizardBase; lemon::Bfs::Node = lemon::concepts::Digraph::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/bfs.h:601:31: required from ‘void lemon::Bfs::start() [with GR = lemon::concepts::Digraph; TR = lemon::BfsWizardBase]’ /<>/liblemon-1.3.1+dfsg/lemon/bfs.h:684:7: required from ‘void lemon::Bfs::run(lemon::Bfs::Node) [with GR = lemon::concepts::Digraph; TR = lemon::BfsWizardBase; lemon::Bfs::Node = lemon::concepts::Digraph::Node]’ /<>/liblemon-1.3.1+dfsg/lemon/bfs.h:1023:9: required from ‘void lemon::BfsWizard::run(lemon::BfsWizard::Node) [with TR = lemon::BfsWizardBase; lemon::BfsWizard::Node = lemon::concepts::Digraph::Node]’ /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:156:20: required from here /<>/liblemon-1.3.1+dfsg/lemon/bfs.h:480:26: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 480 | if(!(*_reached)[m=G->target(e)]) { In file included from /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/bfs.h:481:32: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 481 | _queue[_queue_head++]=m; | ~~~~~~~~~~~~~~~~~~~~~^~ In file included from /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/bfs.h: In instantiation of ‘lemon::Bfs::Node lemon::Bfs::processNextNode(lemon::Bfs::Node, bool&) [with GR = lemon::concepts::Digraph; TR = lemon::BfsWizardBase; lemon::Bfs::Node = lemon::concepts::Digraph::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/bfs.h:628:41: required from ‘void lemon::Bfs::start(lemon::Bfs::Node) [with GR = lemon::concepts::Digraph; TR = lemon::BfsWizardBase; lemon::Bfs::Node = lemon::concepts::Digraph::Node]’ /<>/liblemon-1.3.1+dfsg/lemon/bfs.h:705:7: required from ‘bool lemon::Bfs::run(lemon::Bfs::Node, lemon::Bfs::Node) [with GR = lemon::concepts::Digraph; TR = lemon::BfsWizardBase; lemon::Bfs::Node = lemon::concepts::Digraph::Node]’ /<>/liblemon-1.3.1+dfsg/lemon/bfs.h:1046:7: required from ‘bool lemon::BfsWizard::run(lemon::BfsWizard::Node, lemon::BfsWizard::Node) [with TR = lemon::BfsWizardBase; lemon::BfsWizard::Node = lemon::concepts::Digraph::Node]’ /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:157:29: required from here /<>/liblemon-1.3.1+dfsg/lemon/bfs.h:512:26: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 512 | if(!(*_reached)[m=G->target(e)]) { In file included from /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/bfs.h:513:32: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 513 | _queue[_queue_head++]=m; | ~~~~~~~~~~~~~~~~~~~~~^~ In file included from /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/bfs.h: In instantiation of ‘lemon::Bfs::Node lemon::Bfs::processNextNode() [with GR = lemon::concepts::Digraph; TR = lemon::BfsWizard >::SetPredMapBase > >::SetDistMapBase > >::SetReachedMapBase > >::SetProcessedMapBase >; lemon::Bfs::Node = lemon::concepts::Digraph::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/bfs.h:601:31: required from ‘void lemon::Bfs::start() [with GR = lemon::concepts::Digraph; TR = lemon::BfsWizard >::SetPredMapBase > >::SetDistMapBase > >::SetReachedMapBase > >::SetProcessedMapBase >]’ /<>/liblemon-1.3.1+dfsg/lemon/bfs.h:684:7: required from ‘void lemon::Bfs::run(lemon::Bfs::Node) [with GR = lemon::concepts::Digraph; TR = lemon::BfsWizard >::SetPredMapBase > >::SetDistMapBase > >::SetReachedMapBase > >::SetProcessedMapBase >; lemon::Bfs::Node = lemon::concepts::Digraph::Node]’ /<>/liblemon-1.3.1+dfsg/lemon/bfs.h:1023:9: required from ‘void lemon::BfsWizard::run(lemon::BfsWizard::Node) [with TR = lemon::BfsWizard >::SetPredMapBase > >::SetDistMapBase > >::SetReachedMapBase > >::SetProcessedMapBase >; lemon::BfsWizard::Node = lemon::concepts::Digraph::Node]’ /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:164:16: required from here /<>/liblemon-1.3.1+dfsg/lemon/bfs.h:480:26: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 480 | if(!(*_reached)[m=G->target(e)]) { In file included from /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/bfs.h:481:32: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 481 | _queue[_queue_head++]=m; | ~~~~~~~~~~~~~~~~~~~~~^~ In file included from /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/bfs.h: In instantiation of ‘lemon::Bfs::Node lemon::Bfs::processNextNode(lemon::Bfs::Node, bool&) [with GR = lemon::concepts::Digraph; TR = lemon::BfsWizard >::SetPredMapBase > >::SetDistMapBase > >::SetReachedMapBase > >::SetProcessedMapBase > >::SetPathBase >; lemon::Bfs::Node = lemon::concepts::Digraph::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/bfs.h:628:41: required from ‘void lemon::Bfs::start(lemon::Bfs::Node) [with GR = lemon::concepts::Digraph; TR = lemon::BfsWizard >::SetPredMapBase > >::SetDistMapBase > >::SetReachedMapBase > >::SetProcessedMapBase > >::SetPathBase >; lemon::Bfs::Node = lemon::concepts::Digraph::Node]’ /<>/liblemon-1.3.1+dfsg/lemon/bfs.h:705:7: required from ‘bool lemon::Bfs::run(lemon::Bfs::Node, lemon::Bfs::Node) [with GR = lemon::concepts::Digraph; TR = lemon::BfsWizard >::SetPredMapBase > >::SetDistMapBase > >::SetReachedMapBase > >::SetProcessedMapBase > >::SetPathBase >; lemon::Bfs::Node = lemon::concepts::Digraph::Node]’ /<>/liblemon-1.3.1+dfsg/lemon/bfs.h:1046:7: required from ‘bool lemon::BfsWizard::run(lemon::BfsWizard::Node, lemon::BfsWizard::Node) [with TR = lemon::BfsWizard >::SetPredMapBase > >::SetDistMapBase > >::SetReachedMapBase > >::SetProcessedMapBase > >::SetPathBase >; lemon::BfsWizard::Node = lemon::concepts::Digraph::Node]’ /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:172:23: required from here /<>/liblemon-1.3.1+dfsg/lemon/bfs.h:512:26: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 512 | if(!(*_reached)[m=G->target(e)]) { In file included from /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/bfs.h:513:32: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 513 | _queue[_queue_head++]=m; | ~~~~~~~~~~~~~~~~~~~~~^~ In file included from /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/bfs.h:27, from /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/bits/path_dump.h: In instantiation of ‘int lemon::PredMapPath<_Digraph, _PredMap>::length() const [with _Digraph = lemon::concepts::Digraph; _PredMap = lemon::concepts::Digraph::NodeMap]’: /<>/liblemon-1.3.1+dfsg/lemon/path.h:228:11: required from ‘void lemon::Path::buildRev(const CPath&) [with CPath = lemon::PredMapPath >; GR = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:1017:9: required from ‘static void lemon::_path_bits::PathCopySelectorBackward::copy(const From&, To&) [with From = lemon::PredMapPath >; To = lemon::Path]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:1033:49: required from ‘static void lemon::_path_bits::PathCopySelector::copy(const From&, To&) [with From = lemon::PredMapPath >; To = lemon::Path]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:1046:49: required from ‘void lemon::pathCopy(const From&, To&) [with From = lemon::PredMapPath >; To = lemon::Path]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:94:15: required from ‘lemon::Path& lemon::Path::operator=(const CPath&) [with CPath = lemon::PredMapPath >; GR = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:98:31: required from here /<>/liblemon-1.3.1+dfsg/lemon/bits/path_dump.h:44:19: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 44 | while ((arc = predMap[node]) != INVALID) { | ~~~~~^~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/bfs.h:27, from /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/bits/path_dump.h:45:14: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 45 | node = digraph.source(arc); In file included from /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/bfs.h:27, from /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/bits/path_dump.h: In instantiation of ‘lemon::PredMapPath<_Digraph, _PredMap>::RevArcIt::RevArcIt(const lemon::PredMapPath<_Digraph, _PredMap>&) [with _Digraph = lemon::concepts::Digraph; _PredMap = lemon::concepts::Digraph::NodeMap]’: /<>/liblemon-1.3.1+dfsg/lemon/path.h:230:37: required from ‘void lemon::Path::buildRev(const CPath&) [with CPath = lemon::PredMapPath >; GR = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:1017:9: required from ‘static void lemon::_path_bits::PathCopySelectorBackward::copy(const From&, To&) [with From = lemon::PredMapPath >; To = lemon::Path]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:1033:49: required from ‘static void lemon::_path_bits::PathCopySelector::copy(const From&, To&) [with From = lemon::PredMapPath >; To = lemon::Path]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:1046:49: required from ‘void lemon::pathCopy(const From&, To&) [with From = lemon::PredMapPath >; To = lemon::Path]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:94:15: required from ‘lemon::Path& lemon::Path::operator=(const CPath&) [with CPath = lemon::PredMapPath >; GR = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:98:31: required from here /<>/liblemon-1.3.1+dfsg/lemon/bits/path_dump.h:61:56: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 61 | if (path->predMap[current] == INVALID) current = INVALID; | ~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/bfs.h:27, from /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/bits/path_dump.h: In instantiation of ‘lemon::PredMapPath<_Digraph, _PredMap>::RevArcIt& lemon::PredMapPath<_Digraph, _PredMap>::RevArcIt::operator++() [with _Digraph = lemon::concepts::Digraph; _PredMap = lemon::concepts::Digraph::NodeMap]’: /<>/liblemon-1.3.1+dfsg/lemon/path.h:230:62: required from ‘void lemon::Path::buildRev(const CPath&) [with CPath = lemon::PredMapPath >; GR = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:1017:9: required from ‘static void lemon::_path_bits::PathCopySelectorBackward::copy(const From&, To&) [with From = lemon::PredMapPath >; To = lemon::Path]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:1033:49: required from ‘static void lemon::_path_bits::PathCopySelector::copy(const From&, To&) [with From = lemon::PredMapPath >; To = lemon::Path]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:1046:49: required from ‘void lemon::pathCopy(const From&, To&) [with From = lemon::PredMapPath >; To = lemon::Path]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:94:15: required from ‘lemon::Path& lemon::Path::operator=(const CPath&) [with CPath = lemon::PredMapPath >; GR = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:98:31: required from here /<>/liblemon-1.3.1+dfsg/lemon/bits/path_dump.h:69:17: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 69 | current = path->digraph.source(path->predMap[current]); In file included from /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/bfs.h:27, from /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/bits/path_dump.h:70:56: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 70 | if (path->predMap[current] == INVALID) current = INVALID; | ~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/bfs.h:27, from /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/bits/path_dump.h: In instantiation of ‘int lemon::PredMapPath<_Digraph, _PredMap>::length() const [with _Digraph = lemon::concepts::Digraph; _PredMap = lemon::concepts::ReadWriteMap]’: /<>/liblemon-1.3.1+dfsg/lemon/path.h:228:11: required from ‘void lemon::Path::buildRev(const CPath&) [with CPath = lemon::PredMapPath >; GR = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:1017:9: required from ‘static void lemon::_path_bits::PathCopySelectorBackward::copy(const From&, To&) [with From = lemon::PredMapPath >; To = lemon::Path]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:1033:49: required from ‘static void lemon::_path_bits::PathCopySelector::copy(const From&, To&) [with From = lemon::PredMapPath >; To = lemon::Path]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:1046:49: required from ‘void lemon::pathCopy(const From&, To&) [with From = lemon::PredMapPath >; To = lemon::Path]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:94:15: required from ‘lemon::Path& lemon::Path::operator=(const CPath&) [with CPath = lemon::PredMapPath >; GR = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:141:25: required from here /<>/liblemon-1.3.1+dfsg/lemon/bits/path_dump.h:44:19: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 44 | while ((arc = predMap[node]) != INVALID) { | ~~~~~^~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/bfs.h:27, from /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/bits/path_dump.h:45:14: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 45 | node = digraph.source(arc); In file included from /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/bfs.h:27, from /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/bits/path_dump.h: In instantiation of ‘lemon::PredMapPath<_Digraph, _PredMap>::RevArcIt::RevArcIt(const lemon::PredMapPath<_Digraph, _PredMap>&) [with _Digraph = lemon::concepts::Digraph; _PredMap = lemon::concepts::ReadWriteMap]’: /<>/liblemon-1.3.1+dfsg/lemon/path.h:230:37: required from ‘void lemon::Path::buildRev(const CPath&) [with CPath = lemon::PredMapPath >; GR = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:1017:9: required from ‘static void lemon::_path_bits::PathCopySelectorBackward::copy(const From&, To&) [with From = lemon::PredMapPath >; To = lemon::Path]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:1033:49: required from ‘static void lemon::_path_bits::PathCopySelector::copy(const From&, To&) [with From = lemon::PredMapPath >; To = lemon::Path]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:1046:49: required from ‘void lemon::pathCopy(const From&, To&) [with From = lemon::PredMapPath >; To = lemon::Path]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:94:15: required from ‘lemon::Path& lemon::Path::operator=(const CPath&) [with CPath = lemon::PredMapPath >; GR = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:141:25: required from here /<>/liblemon-1.3.1+dfsg/lemon/bits/path_dump.h:61:56: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 61 | if (path->predMap[current] == INVALID) current = INVALID; | ~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/bfs.h:27, from /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/bits/path_dump.h: In instantiation of ‘lemon::PredMapPath<_Digraph, _PredMap>::RevArcIt& lemon::PredMapPath<_Digraph, _PredMap>::RevArcIt::operator++() [with _Digraph = lemon::concepts::Digraph; _PredMap = lemon::concepts::ReadWriteMap]’: /<>/liblemon-1.3.1+dfsg/lemon/path.h:230:62: required from ‘void lemon::Path::buildRev(const CPath&) [with CPath = lemon::PredMapPath >; GR = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:1017:9: required from ‘static void lemon::_path_bits::PathCopySelectorBackward::copy(const From&, To&) [with From = lemon::PredMapPath >; To = lemon::Path]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:1033:49: required from ‘static void lemon::_path_bits::PathCopySelector::copy(const From&, To&) [with From = lemon::PredMapPath >; To = lemon::Path]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:1046:49: required from ‘void lemon::pathCopy(const From&, To&) [with From = lemon::PredMapPath >; To = lemon::Path]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:94:15: required from ‘lemon::Path& lemon::Path::operator=(const CPath&) [with CPath = lemon::PredMapPath >; GR = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:141:25: required from here /<>/liblemon-1.3.1+dfsg/lemon/bits/path_dump.h:69:17: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 69 | current = path->digraph.source(path->predMap[current]); In file included from /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/bfs.h:27, from /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/bits/path_dump.h:70:56: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 70 | if (path->predMap[current] == INVALID) current = INVALID; | ~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/bfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ [ 42%] Linking CXX executable bfs_test cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/cmake -E cmake_link_script CMakeFiles/bfs_test.dir/link.txt --verbose=1 /usr/bin/c++ -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -Wl,-Bsymbolic-functions -Wl,-z,relro -Wl,-z,now -rdynamic CMakeFiles/bfs_test.dir/bfs_test.cc.o -o bfs_test -L/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 42%] Built target bfs_test make -f test/CMakeFiles/tsp_test.dir/build.make test/CMakeFiles/tsp_test.dir/depend make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<>/liblemon-1.3.1+dfsg /<>/liblemon-1.3.1+dfsg/test /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test/CMakeFiles/tsp_test.dir/DependInfo.cmake --color= Scanning dependencies of target tsp_test make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' make -f test/CMakeFiles/tsp_test.dir/build.make test/CMakeFiles/tsp_test.dir/build make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 43%] Building CXX object test/CMakeFiles/tsp_test.dir/tsp_test.cc.o cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -I/<>/liblemon-1.3.1+dfsg -I/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -o CMakeFiles/tsp_test.dir/tsp_test.cc.o -c /<>/liblemon-1.3.1+dfsg/test/tsp_test.cc In file included from /usr/include/c++/9/vector:72, from /<>/liblemon-1.3.1+dfsg/lemon/core.h:22, from /<>/liblemon-1.3.1+dfsg/lemon/full_graph.h:22, from /<>/liblemon-1.3.1+dfsg/test/tsp_test.cc:21: /usr/include/c++/9/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(std::vector<_Tp, _Alloc>::iterator, _Args&& ...) [with _Args = {std::pair}; _Tp = std::pair; _Alloc = std::allocator >]’: /usr/include/c++/9/bits/vector.tcc:426:7: note: parameter passing for argument of type ‘std::vector, std::allocator > >::iterator’ {aka ‘__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >’} changed in GCC 7.1 426 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/9/bits/vector.tcc:426:7: note: parameter passing for argument of type ‘std::vector, std::allocator > >::iterator’ {aka ‘__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >’} changed in GCC 7.1 In file included from /usr/include/c++/9/algorithm:62, from /<>/liblemon-1.3.1+dfsg/lemon/core.h:23, from /<>/liblemon-1.3.1+dfsg/lemon/full_graph.h:22, from /<>/liblemon-1.3.1+dfsg/test/tsp_test.cc:21: /usr/include/c++/9/bits/stl_algo.h: In function ‘void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter, std::allocator > > > >]’: /usr/include/c++/9/bits/stl_algo.h:78:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >’ changed in GCC 7.1 78 | __move_median_to_first(_Iterator __result,_Iterator __a, _Iterator __b, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/9/bits/stl_algo.h:78:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >’ changed in GCC 7.1 /usr/include/c++/9/bits/stl_algo.h:78:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >’ changed in GCC 7.1 /usr/include/c++/9/bits/stl_algo.h:78:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >’ changed in GCC 7.1 /usr/include/c++/9/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter, std::allocator > > > >]’: /usr/include/c++/9/bits/stl_algo.h:1820:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >’ changed in GCC 7.1 1820 | __unguarded_linear_insert(_RandomAccessIterator __last, | ^~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/9/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter, std::allocator > > > >]’: /usr/include/c++/9/bits/stl_algo.h:1839:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >’ changed in GCC 7.1 1839 | __insertion_sort(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/9/bits/stl_algo.h:1839:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >’ changed in GCC 7.1 In file included from /usr/include/c++/9/vector:72, from /<>/liblemon-1.3.1+dfsg/lemon/core.h:22, from /<>/liblemon-1.3.1+dfsg/lemon/full_graph.h:22, from /<>/liblemon-1.3.1+dfsg/test/tsp_test.cc:21: /usr/include/c++/9/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(std::vector<_Tp, _Alloc>::iterator, _Args&& ...) [with _Args = {lemon::HeapUnionFind::NodeMap, std::less >::ItemNode}; _Tp = lemon::HeapUnionFind::NodeMap, std::less >::ItemNode; _Alloc = std::allocator::NodeMap, std::less >::ItemNode>]’: /usr/include/c++/9/bits/vector.tcc:426:7: note: parameter passing for argument of type ‘std::vector::NodeMap, std::less >::ItemNode, std::allocator::NodeMap, std::less >::ItemNode> >::iterator’ {aka ‘__gnu_cxx::__normal_iterator::NodeMap, std::less >::ItemNode*, std::vector::NodeMap, std::less >::ItemNode, std::allocator::NodeMap, std::less >::ItemNode> > >’} changed in GCC 7.1 426 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/9/bits/vector.tcc:426:7: note: parameter passing for argument of type ‘std::vector::NodeMap, std::less >::ItemNode, std::allocator::NodeMap, std::less >::ItemNode> >::iterator’ {aka ‘__gnu_cxx::__normal_iterator::NodeMap, std::less >::ItemNode*, std::vector::NodeMap, std::less >::ItemNode, std::allocator::NodeMap, std::less >::ItemNode> > >’} changed in GCC 7.1 /usr/include/c++/9/bits/vector.tcc: In member function ‘void lemon::HeapUnionFind::split(int, Iterator) [with Iterator = std::back_insert_iterator >; V = double; IM = lemon::GraphExtender::NodeMap; Comp = std::less]’: /usr/include/c++/9/bits/vector.tcc:121:4: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator::NodeMap, std::less >::ItemNode*, std::vector::NodeMap, std::less >::ItemNode, std::allocator::NodeMap, std::less >::ItemNode> > >’ changed in GCC 7.1 121 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ^~~~~~~~~~~~~~~~~ /usr/include/c++/9/bits/vector.tcc: In member function ‘int lemon::HeapUnionFind::join(Iterator, Iterator) [with Iterator = __gnu_cxx::__normal_iterator >; V = double; IM = lemon::GraphExtender::NodeMap; Comp = std::less]’: /usr/include/c++/9/bits/vector.tcc:121:4: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator::NodeMap, std::less >::ItemNode*, std::vector::NodeMap, std::less >::ItemNode, std::allocator::NodeMap, std::less >::ItemNode> > >’ changed in GCC 7.1 121 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ^~~~~~~~~~~~~~~~~ /usr/include/c++/9/bits/vector.tcc:121:4: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator::NodeMap, std::less >::ItemNode*, std::vector::NodeMap, std::less >::ItemNode, std::allocator::NodeMap, std::less >::ItemNode> > >’ changed in GCC 7.1 121 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ^~~~~~~~~~~~~~~~~ /usr/include/c++/9/bits/vector.tcc:121:4: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator::NodeMap, std::less >::ItemNode*, std::vector::NodeMap, std::less >::ItemNode, std::allocator::NodeMap, std::less >::ItemNode> > >’ changed in GCC 7.1 121 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ^~~~~~~~~~~~~~~~~ /usr/include/c++/9/bits/vector.tcc:121:4: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator::NodeMap, std::less >::ItemNode*, std::vector::NodeMap, std::less >::ItemNode, std::allocator::NodeMap, std::less >::ItemNode> > >’ changed in GCC 7.1 121 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ^~~~~~~~~~~~~~~~~ /usr/include/c++/9/bits/vector.tcc:121:4: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator::NodeMap, std::less >::ItemNode*, std::vector::NodeMap, std::less >::ItemNode, std::allocator::NodeMap, std::less >::ItemNode> > >’ changed in GCC 7.1 121 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ^~~~~~~~~~~~~~~~~ /usr/include/c++/9/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(std::vector<_Tp, _Alloc>::iterator, _Args&& ...) [with _Args = {lemon::MaxWeightedPerfectMatching::EdgeMap >::BlossomVariable}; _Tp = lemon::MaxWeightedPerfectMatching::EdgeMap >::BlossomVariable; _Alloc = std::allocator::EdgeMap >::BlossomVariable>]’: /usr/include/c++/9/bits/vector.tcc:426:7: note: parameter passing for argument of type ‘std::vector::EdgeMap >::BlossomVariable, std::allocator::EdgeMap >::BlossomVariable> >::iterator’ {aka ‘__gnu_cxx::__normal_iterator::EdgeMap >::BlossomVariable*, std::vector::EdgeMap >::BlossomVariable, std::allocator::EdgeMap >::BlossomVariable> > >’} changed in GCC 7.1 426 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/9/bits/vector.tcc: In member function ‘void lemon::MaxWeightedPerfectMatching::extractBlossom(int, const Node&, const Arc&) [with GR = lemon::SmartGraph; WM = lemon::GraphExtender::EdgeMap]’: /usr/include/c++/9/bits/vector.tcc:121:4: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator::EdgeMap >::BlossomVariable*, std::vector::EdgeMap >::BlossomVariable, std::allocator::EdgeMap >::BlossomVariable> > >’ changed in GCC 7.1 121 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ^~~~~~~~~~~~~~~~~ /usr/include/c++/9/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_fill_insert(std::vector<_Tp, _Alloc>::iterator, std::vector<_Tp, _Alloc>::size_type, const value_type&) [with _Tp = double; _Alloc = std::allocator]’: /usr/include/c++/9/bits/vector.tcc:509:5: note: parameter passing for argument of type ‘std::vector >::iterator’ {aka ‘__gnu_cxx::__normal_iterator > >’} changed in GCC 7.1 509 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/9/vector:67, from /<>/liblemon-1.3.1+dfsg/lemon/core.h:22, from /<>/liblemon-1.3.1+dfsg/lemon/full_graph.h:22, from /<>/liblemon-1.3.1+dfsg/test/tsp_test.cc:21: /usr/include/c++/9/bits/stl_vector.h: In constructor ‘lemon::VectorMap<_Graph, _Item, _Value>::VectorMap(const GraphType&, const Value&) [with _Graph = lemon::GraphExtender; _Item = lemon::FullGraphBase::Node; _Value = double]’: /usr/include/c++/9/bits/stl_vector.h:957:4: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator > >’ changed in GCC 7.1 957 | _M_fill_insert(end(), __new_size - size(), __x); | ^~~~~~~~~~~~~~ /usr/include/c++/9/bits/stl_vector.h: In member function ‘void lemon::InsertionTsp::start() [with SelectionFunctor = lemon::InsertionTsp::EdgeMap >::CheapestSelection; InsertionFunctor = lemon::InsertionTsp::EdgeMap >::CheapestInsertion; CM = lemon::GraphExtender::EdgeMap]’: /usr/include/c++/9/bits/stl_vector.h:957:4: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator > >’ changed in GCC 7.1 957 | _M_fill_insert(end(), __new_size - size(), __x); | ^~~~~~~~~~~~~~ In file included from /usr/include/c++/9/bits/stl_algo.h:61, from /usr/include/c++/9/algorithm:62, from /<>/liblemon-1.3.1+dfsg/lemon/core.h:23, from /<>/liblemon-1.3.1+dfsg/lemon/full_graph.h:22, from /<>/liblemon-1.3.1+dfsg/test/tsp_test.cc:21: /usr/include/c++/9/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; _Distance = int; _Tp = std::pair; _Compare = __gnu_cxx::__ops::_Iter_comp_iter, std::allocator > > > >]’: /usr/include/c++/9/bits/stl_heap.h:214:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >’ changed in GCC 7.1 214 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, | ^~~~~~~~~~~~~ In file included from /usr/include/c++/9/algorithm:62, from /<>/liblemon-1.3.1+dfsg/lemon/core.h:23, from /<>/liblemon-1.3.1+dfsg/lemon/full_graph.h:22, from /<>/liblemon-1.3.1+dfsg/test/tsp_test.cc:21: /usr/include/c++/9/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter, std::allocator > > > >]’: /usr/include/c++/9/bits/stl_algo.h:1939:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >’ changed in GCC 7.1 1939 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/9/bits/stl_algo.h:1939:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >’ changed in GCC 7.1 /usr/include/c++/9/bits/stl_algo.h:1939:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >’ changed in GCC 7.1 /usr/include/c++/9/bits/stl_algo.h:1920:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >’ changed in GCC 7.1 1920 | std::__move_median_to_first(__first, __first + 1, __mid, __last - 1, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1921 | __comp); | ~~~~~~~ /usr/include/c++/9/bits/stl_algo.h:1920:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >’ changed in GCC 7.1 /usr/include/c++/9/bits/stl_algo.h:1953:25: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >’ changed in GCC 7.1 1953 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/9/vector:72, from /<>/liblemon-1.3.1+dfsg/lemon/core.h:22, from /<>/liblemon-1.3.1+dfsg/lemon/full_graph.h:22, from /<>/liblemon-1.3.1+dfsg/test/tsp_test.cc:21: /usr/include/c++/9/bits/vector.tcc: In member function ‘void lemon::MaxWeightedPerfectMatching::fractionalInit() [with GR = lemon::SmartGraph; WM = lemon::GraphExtender::EdgeMap]’: /usr/include/c++/9/bits/vector.tcc:121:4: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator::NodeMap, std::less >::ItemNode*, std::vector::NodeMap, std::less >::ItemNode, std::allocator::NodeMap, std::less >::ItemNode> > >’ changed in GCC 7.1 121 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ^~~~~~~~~~~~~~~~~ /usr/include/c++/9/bits/vector.tcc: In member function ‘lemon::ChristofidesTsp::Cost lemon::ChristofidesTsp::run() [with CM = lemon::GraphExtender::EdgeMap]’: /usr/include/c++/9/bits/vector.tcc:121:4: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >’ changed in GCC 7.1 121 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ^~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/9/algorithm:62, from /<>/liblemon-1.3.1+dfsg/lemon/core.h:23, from /<>/liblemon-1.3.1+dfsg/lemon/full_graph.h:22, from /<>/liblemon-1.3.1+dfsg/test/tsp_test.cc:21: /usr/include/c++/9/bits/stl_algo.h:1967:25: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >’ changed in GCC 7.1 1967 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1968 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1969 | __comp); | ~~~~~~~ /usr/include/c++/9/bits/stl_algo.h:1884:25: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >’ changed in GCC 7.1 1884 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/9/bits/stl_algo.h:1889:23: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >’ changed in GCC 7.1 1889 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ [ 44%] Linking CXX executable tsp_test cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/cmake -E cmake_link_script CMakeFiles/tsp_test.dir/link.txt --verbose=1 /usr/bin/c++ -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -Wl,-Bsymbolic-functions -Wl,-z,relro -Wl,-z,now -rdynamic CMakeFiles/tsp_test.dir/tsp_test.cc.o -o tsp_test -L/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 44%] Built target tsp_test make -f test/CMakeFiles/connectivity_test.dir/build.make test/CMakeFiles/connectivity_test.dir/depend make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<>/liblemon-1.3.1+dfsg /<>/liblemon-1.3.1+dfsg/test /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test/CMakeFiles/connectivity_test.dir/DependInfo.cmake --color= Scanning dependencies of target connectivity_test make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' make -f test/CMakeFiles/connectivity_test.dir/build.make test/CMakeFiles/connectivity_test.dir/build make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 45%] Building CXX object test/CMakeFiles/connectivity_test.dir/connectivity_test.cc.o cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -I/<>/liblemon-1.3.1+dfsg -I/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -o CMakeFiles/connectivity_test.dir/connectivity_test.cc.o -c /<>/liblemon-1.3.1+dfsg/test/connectivity_test.cc [ 46%] Linking CXX executable connectivity_test cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/cmake -E cmake_link_script CMakeFiles/connectivity_test.dir/link.txt --verbose=1 /usr/bin/c++ -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -Wl,-Bsymbolic-functions -Wl,-z,relro -Wl,-z,now -rdynamic CMakeFiles/connectivity_test.dir/connectivity_test.cc.o -o connectivity_test -L/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 46%] Built target connectivity_test make -f test/CMakeFiles/euler_test.dir/build.make test/CMakeFiles/euler_test.dir/depend make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<>/liblemon-1.3.1+dfsg /<>/liblemon-1.3.1+dfsg/test /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test/CMakeFiles/euler_test.dir/DependInfo.cmake --color= Scanning dependencies of target euler_test make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' make -f test/CMakeFiles/euler_test.dir/build.make test/CMakeFiles/euler_test.dir/build make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 48%] Building CXX object test/CMakeFiles/euler_test.dir/euler_test.cc.o cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -I/<>/liblemon-1.3.1+dfsg -I/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -o CMakeFiles/euler_test.dir/euler_test.cc.o -c /<>/liblemon-1.3.1+dfsg/test/euler_test.cc [ 49%] Linking CXX executable euler_test cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/cmake -E cmake_link_script CMakeFiles/euler_test.dir/link.txt --verbose=1 /usr/bin/c++ -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -Wl,-Bsymbolic-functions -Wl,-z,relro -Wl,-z,now -rdynamic CMakeFiles/euler_test.dir/euler_test.cc.o -o euler_test -L/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 49%] Built target euler_test make -f test/CMakeFiles/counter_test.dir/build.make test/CMakeFiles/counter_test.dir/depend make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<>/liblemon-1.3.1+dfsg /<>/liblemon-1.3.1+dfsg/test /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test/CMakeFiles/counter_test.dir/DependInfo.cmake --color= Scanning dependencies of target counter_test make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' make -f test/CMakeFiles/counter_test.dir/build.make test/CMakeFiles/counter_test.dir/build make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 50%] Building CXX object test/CMakeFiles/counter_test.dir/counter_test.cc.o cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -I/<>/liblemon-1.3.1+dfsg -I/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -o CMakeFiles/counter_test.dir/counter_test.cc.o -c /<>/liblemon-1.3.1+dfsg/test/counter_test.cc [ 51%] Linking CXX executable counter_test cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/cmake -E cmake_link_script CMakeFiles/counter_test.dir/link.txt --verbose=1 /usr/bin/c++ -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -Wl,-Bsymbolic-functions -Wl,-z,relro -Wl,-z,now -rdynamic CMakeFiles/counter_test.dir/counter_test.cc.o -o counter_test -L/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 51%] Built target counter_test make -f test/CMakeFiles/digraph_test.dir/build.make test/CMakeFiles/digraph_test.dir/depend make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<>/liblemon-1.3.1+dfsg /<>/liblemon-1.3.1+dfsg/test /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test/CMakeFiles/digraph_test.dir/DependInfo.cmake --color= Scanning dependencies of target digraph_test make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' make -f test/CMakeFiles/digraph_test.dir/build.make test/CMakeFiles/digraph_test.dir/build make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 53%] Building CXX object test/CMakeFiles/digraph_test.dir/digraph_test.cc.o cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -I/<>/liblemon-1.3.1+dfsg -I/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -o CMakeFiles/digraph_test.dir/digraph_test.cc.o -c /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::BaseDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseDigraphComponent; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:477:55: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:322:36: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:173:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 173 | n = digraph.source(e); In file included from /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:174:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 174 | n = digraph.target(e); In file included from /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:175:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 175 | n = digraph.oppositeNode(n, e); In file included from /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph; BAS = lemon::concepts::BaseDigraphComponent]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent<>; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:322:36: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:999:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 999 | n = digraph.baseNode(iait); In file included from /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1000:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 1000 | n = digraph.runningNode(iait); In file included from /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1001:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 1001 | n = digraph.baseNode(oait); In file included from /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1002:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 1002 | n = digraph.runningNode(oait); In file included from /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::IDableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph; BAS = lemon::concepts::BaseDigraphComponent]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IDableDigraphComponent<>; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:479:59: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:322:36: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:526:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 526 | node=INVALID; | ~~~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:529:16: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 529 | node = digraph.nodeFromId(nid); In file included from /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:531:14: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 531 | arc=INVALID; | ~~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:534:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 534 | arc = digraph.arcFromId(eid); In file included from /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItem::Constraints<_GraphItem>::constraints() [with _GraphItem = lemon::concepts::Digraph::Node; char sel = 'n']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItem<'n'>; Type = lemon::concepts::Digraph::Node]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:168:45: required from ‘void lemon::concepts::BaseDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseDigraphComponent; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:477:55: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:322:36: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:104:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 104 | i1=INVALID; | ~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:19: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:14: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItem::Constraints<_GraphItem>::constraints() [with _GraphItem = lemon::concepts::Digraph::Arc; char sel = 'a']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItem<'a'>; Type = lemon::concepts::Digraph::Arc]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:169:44: required from ‘void lemon::concepts::BaseDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseDigraphComponent; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:477:55: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:322:36: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:104:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 104 | i1=INVALID; | ~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:19: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:14: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItemIt::Constraints<_GraphItemIt>::constraints() [with _GraphItemIt = lemon::concepts::Digraph::ArcIt; GR = lemon::concepts::Digraph; Item = lemon::concepts::Digraph::Arc]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItemIt; Type = lemon::concepts::Digraph::ArcIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:988:41: required from ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph; BAS = lemon::concepts::BaseDigraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent<>; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:322:36: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:732:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::ArcIt& lemon::concepts::Digraph::ArcIt::operator=(const lemon::concepts::Digraph::ArcIt&)’ is deprecated [-Wdeprecated-copy] 732 | it2 = ++it1; | ~~~~^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:305:9: note: because ‘lemon::concepts::Digraph::ArcIt’ has user-provided ‘lemon::concepts::Digraph::ArcIt::ArcIt(const lemon::concepts::Digraph::ArcIt&)’ 305 | ArcIt(const ArcIt& e) : Arc(e) { } | ^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:733:17: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::ArcIt& lemon::concepts::Digraph::ArcIt::operator=(const lemon::concepts::Digraph::ArcIt&)’ is deprecated [-Wdeprecated-copy] 733 | ++it2 = it1; | ~~~~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:305:9: note: because ‘lemon::concepts::Digraph::ArcIt’ has user-provided ‘lemon::concepts::Digraph::ArcIt::ArcIt(const lemon::concepts::Digraph::ArcIt&)’ 305 | ArcIt(const ArcIt& e) : Arc(e) { } | ^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:737:14: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 737 | bi = it2; | ~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItemIt::Constraints<_GraphItemIt>::constraints() [with _GraphItemIt = lemon::concepts::Digraph::NodeIt; GR = lemon::concepts::Digraph; Item = lemon::concepts::Digraph::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItemIt; Type = lemon::concepts::Digraph::NodeIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:990:42: required from ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph; BAS = lemon::concepts::BaseDigraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent<>; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:322:36: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:732:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::NodeIt& lemon::concepts::Digraph::NodeIt::operator=(const lemon::concepts::Digraph::NodeIt&)’ is deprecated [-Wdeprecated-copy] 732 | it2 = ++it1; | ~~~~^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:127:9: note: because ‘lemon::concepts::Digraph::NodeIt’ has user-provided ‘lemon::concepts::Digraph::NodeIt::NodeIt(const lemon::concepts::Digraph::NodeIt&)’ 127 | NodeIt(const NodeIt& n) : Node(n) { } | ^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:733:17: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::NodeIt& lemon::concepts::Digraph::NodeIt::operator=(const lemon::concepts::Digraph::NodeIt&)’ is deprecated [-Wdeprecated-copy] 733 | ++it2 = it1; | ~~~~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:127:9: note: because ‘lemon::concepts::Digraph::NodeIt’ has user-provided ‘lemon::concepts::Digraph::NodeIt::NodeIt(const lemon::concepts::Digraph::NodeIt&)’ 127 | NodeIt(const NodeIt& n) : Node(n) { } | ^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:737:14: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 737 | bi = it2; | ~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphIncIt::Constraints<_GraphIncIt>::constraints() [with _GraphIncIt = lemon::concepts::Digraph::InArcIt; GR = lemon::concepts::Digraph; Item = lemon::concepts::Digraph::Arc; Base = lemon::concepts::Digraph::Node; char sel = 'i']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphIncIt; Type = lemon::concepts::Digraph::InArcIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:992:73: required from ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph; BAS = lemon::concepts::BaseDigraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent<>; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:322:36: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:823:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::InArcIt& lemon::concepts::Digraph::InArcIt::operator=(const lemon::concepts::Digraph::InArcIt&)’ is deprecated [-Wdeprecated-copy] 823 | it2 = ++it1; | ~~~~^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:262:9: note: because ‘lemon::concepts::Digraph::InArcIt’ has user-provided ‘lemon::concepts::Digraph::InArcIt::InArcIt(const lemon::concepts::Digraph::InArcIt&)’ 262 | InArcIt(const InArcIt& e) : Arc(e) { } | ^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:824:17: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::InArcIt& lemon::concepts::Digraph::InArcIt::operator=(const lemon::concepts::Digraph::InArcIt&)’ is deprecated [-Wdeprecated-copy] 824 | ++it2 = it1; | ~~~~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:262:9: note: because ‘lemon::concepts::Digraph::InArcIt’ has user-provided ‘lemon::concepts::Digraph::InArcIt::InArcIt(const lemon::concepts::Digraph::InArcIt&)’ 262 | InArcIt(const InArcIt& e) : Arc(e) { } | ^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:827:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 827 | e = it2; | ~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphIncIt::Constraints<_GraphIncIt>::constraints() [with _GraphIncIt = lemon::concepts::Digraph::OutArcIt; GR = lemon::concepts::Digraph; Item = lemon::concepts::Digraph::Arc; Base = lemon::concepts::Digraph::Node; char sel = 'o']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphIncIt; Type = lemon::concepts::Digraph::OutArcIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:994:74: required from ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph; BAS = lemon::concepts::BaseDigraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent<>; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:322:36: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:823:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::OutArcIt& lemon::concepts::Digraph::OutArcIt::operator=(const lemon::concepts::Digraph::OutArcIt&)’ is deprecated [-Wdeprecated-copy] 823 | it2 = ++it1; | ~~~~^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:217:9: note: because ‘lemon::concepts::Digraph::OutArcIt’ has user-provided ‘lemon::concepts::Digraph::OutArcIt::OutArcIt(const lemon::concepts::Digraph::OutArcIt&)’ 217 | OutArcIt(const OutArcIt& e) : Arc(e) { } | ^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:824:17: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::OutArcIt& lemon::concepts::Digraph::OutArcIt::operator=(const lemon::concepts::Digraph::OutArcIt&)’ is deprecated [-Wdeprecated-copy] 824 | ++it2 = it1; | ~~~~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:217:9: note: because ‘lemon::concepts::Digraph::OutArcIt’ has user-provided ‘lemon::concepts::Digraph::OutArcIt::OutArcIt(const lemon::concepts::Digraph::OutArcIt&)’ 217 | OutArcIt(const OutArcIt& e) : Arc(e) { } | ^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:827:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 827 | e = it2; | ~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItem::Constraints<_GraphItem>::constraints() [with _GraphItem = lemon::concepts::Digraph::ArcIt; char sel = '0']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItem<>; Type = lemon::concepts::Digraph::ArcIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:724:50: required from ‘void lemon::concepts::GraphItemIt::Constraints<_GraphItemIt>::constraints() [with _GraphItemIt = lemon::concepts::Digraph::ArcIt; GR = lemon::concepts::Digraph; Item = lemon::concepts::Digraph::Arc]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItemIt; Type = lemon::concepts::Digraph::ArcIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:988:41: required from ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph; BAS = lemon::concepts::BaseDigraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent<>; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:322:36: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:104:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::ArcIt& lemon::concepts::Digraph::ArcIt::operator=(const lemon::concepts::Digraph::ArcIt&)’ is deprecated [-Wdeprecated-copy] 104 | i1=INVALID; | ~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:305:9: note: because ‘lemon::concepts::Digraph::ArcIt’ has user-provided ‘lemon::concepts::Digraph::ArcIt::ArcIt(const lemon::concepts::Digraph::ArcIt&)’ 305 | ArcIt(const ArcIt& e) : Arc(e) { } | ^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:19: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::ArcIt& lemon::concepts::Digraph::ArcIt::operator=(const lemon::concepts::Digraph::ArcIt&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:305:9: note: because ‘lemon::concepts::Digraph::ArcIt’ has user-provided ‘lemon::concepts::Digraph::ArcIt::ArcIt(const lemon::concepts::Digraph::ArcIt&)’ 305 | ArcIt(const ArcIt& e) : Arc(e) { } | ^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:14: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::ArcIt& lemon::concepts::Digraph::ArcIt::operator=(const lemon::concepts::Digraph::ArcIt&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:305:9: note: because ‘lemon::concepts::Digraph::ArcIt’ has user-provided ‘lemon::concepts::Digraph::ArcIt::ArcIt(const lemon::concepts::Digraph::ArcIt&)’ 305 | ArcIt(const ArcIt& e) : Arc(e) { } | ^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItem::Constraints<_GraphItem>::constraints() [with _GraphItem = lemon::concepts::Digraph::NodeIt; char sel = '0']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItem<>; Type = lemon::concepts::Digraph::NodeIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:724:50: required from ‘void lemon::concepts::GraphItemIt::Constraints<_GraphItemIt>::constraints() [with _GraphItemIt = lemon::concepts::Digraph::NodeIt; GR = lemon::concepts::Digraph; Item = lemon::concepts::Digraph::Node]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItemIt; Type = lemon::concepts::Digraph::NodeIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:990:42: required from ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph; BAS = lemon::concepts::BaseDigraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent<>; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:322:36: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:104:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::NodeIt& lemon::concepts::Digraph::NodeIt::operator=(const lemon::concepts::Digraph::NodeIt&)’ is deprecated [-Wdeprecated-copy] 104 | i1=INVALID; | ~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:127:9: note: because ‘lemon::concepts::Digraph::NodeIt’ has user-provided ‘lemon::concepts::Digraph::NodeIt::NodeIt(const lemon::concepts::Digraph::NodeIt&)’ 127 | NodeIt(const NodeIt& n) : Node(n) { } | ^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:19: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::NodeIt& lemon::concepts::Digraph::NodeIt::operator=(const lemon::concepts::Digraph::NodeIt&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:127:9: note: because ‘lemon::concepts::Digraph::NodeIt’ has user-provided ‘lemon::concepts::Digraph::NodeIt::NodeIt(const lemon::concepts::Digraph::NodeIt&)’ 127 | NodeIt(const NodeIt& n) : Node(n) { } | ^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:14: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::NodeIt& lemon::concepts::Digraph::NodeIt::operator=(const lemon::concepts::Digraph::NodeIt&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:127:9: note: because ‘lemon::concepts::Digraph::NodeIt’ has user-provided ‘lemon::concepts::Digraph::NodeIt::NodeIt(const lemon::concepts::Digraph::NodeIt&)’ 127 | NodeIt(const NodeIt& n) : Node(n) { } | ^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItem::Constraints<_GraphItem>::constraints() [with _GraphItem = lemon::concepts::Digraph::InArcIt; char sel = 'i']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItem<'i'>; Type = lemon::concepts::Digraph::InArcIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:815:52: required from ‘void lemon::concepts::GraphIncIt::Constraints<_GraphIncIt>::constraints() [with _GraphIncIt = lemon::concepts::Digraph::InArcIt; GR = lemon::concepts::Digraph; Item = lemon::concepts::Digraph::Arc; Base = lemon::concepts::Digraph::Node; char sel = 'i']’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphIncIt; Type = lemon::concepts::Digraph::InArcIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:992:73: required from ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph; BAS = lemon::concepts::BaseDigraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent<>; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:322:36: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:104:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::InArcIt& lemon::concepts::Digraph::InArcIt::operator=(const lemon::concepts::Digraph::InArcIt&)’ is deprecated [-Wdeprecated-copy] 104 | i1=INVALID; | ~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:262:9: note: because ‘lemon::concepts::Digraph::InArcIt’ has user-provided ‘lemon::concepts::Digraph::InArcIt::InArcIt(const lemon::concepts::Digraph::InArcIt&)’ 262 | InArcIt(const InArcIt& e) : Arc(e) { } | ^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:19: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::InArcIt& lemon::concepts::Digraph::InArcIt::operator=(const lemon::concepts::Digraph::InArcIt&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:262:9: note: because ‘lemon::concepts::Digraph::InArcIt’ has user-provided ‘lemon::concepts::Digraph::InArcIt::InArcIt(const lemon::concepts::Digraph::InArcIt&)’ 262 | InArcIt(const InArcIt& e) : Arc(e) { } | ^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:14: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::InArcIt& lemon::concepts::Digraph::InArcIt::operator=(const lemon::concepts::Digraph::InArcIt&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:262:9: note: because ‘lemon::concepts::Digraph::InArcIt’ has user-provided ‘lemon::concepts::Digraph::InArcIt::InArcIt(const lemon::concepts::Digraph::InArcIt&)’ 262 | InArcIt(const InArcIt& e) : Arc(e) { } | ^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItem::Constraints<_GraphItem>::constraints() [with _GraphItem = lemon::concepts::Digraph::OutArcIt; char sel = 'o']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItem<'o'>; Type = lemon::concepts::Digraph::OutArcIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:815:52: required from ‘void lemon::concepts::GraphIncIt::Constraints<_GraphIncIt>::constraints() [with _GraphIncIt = lemon::concepts::Digraph::OutArcIt; GR = lemon::concepts::Digraph; Item = lemon::concepts::Digraph::Arc; Base = lemon::concepts::Digraph::Node; char sel = 'o']’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphIncIt; Type = lemon::concepts::Digraph::OutArcIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:994:74: required from ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph; BAS = lemon::concepts::BaseDigraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent<>; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:322:36: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:104:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::OutArcIt& lemon::concepts::Digraph::OutArcIt::operator=(const lemon::concepts::Digraph::OutArcIt&)’ is deprecated [-Wdeprecated-copy] 104 | i1=INVALID; | ~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:217:9: note: because ‘lemon::concepts::Digraph::OutArcIt’ has user-provided ‘lemon::concepts::Digraph::OutArcIt::OutArcIt(const lemon::concepts::Digraph::OutArcIt&)’ 217 | OutArcIt(const OutArcIt& e) : Arc(e) { } | ^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:19: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::OutArcIt& lemon::concepts::Digraph::OutArcIt::operator=(const lemon::concepts::Digraph::OutArcIt&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:217:9: note: because ‘lemon::concepts::Digraph::OutArcIt’ has user-provided ‘lemon::concepts::Digraph::OutArcIt::OutArcIt(const lemon::concepts::Digraph::OutArcIt&)’ 217 | OutArcIt(const OutArcIt& e) : Arc(e) { } | ^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:14: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::OutArcIt& lemon::concepts::Digraph::OutArcIt::operator=(const lemon::concepts::Digraph::OutArcIt&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/digraph_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:217:9: note: because ‘lemon::concepts::Digraph::OutArcIt’ has user-provided ‘lemon::concepts::Digraph::OutArcIt::OutArcIt(const lemon::concepts::Digraph::OutArcIt&)’ 217 | OutArcIt(const OutArcIt& e) : Arc(e) { } | ^~~~~~~~ [ 54%] Linking CXX executable digraph_test cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/cmake -E cmake_link_script CMakeFiles/digraph_test.dir/link.txt --verbose=1 /usr/bin/c++ -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -Wl,-Bsymbolic-functions -Wl,-z,relro -Wl,-z,now -rdynamic CMakeFiles/digraph_test.dir/digraph_test.cc.o -o digraph_test -L/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 54%] Built target digraph_test make -f test/CMakeFiles/arc_look_up_test.dir/build.make test/CMakeFiles/arc_look_up_test.dir/depend make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<>/liblemon-1.3.1+dfsg /<>/liblemon-1.3.1+dfsg/test /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test/CMakeFiles/arc_look_up_test.dir/DependInfo.cmake --color= Scanning dependencies of target arc_look_up_test make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' make -f test/CMakeFiles/arc_look_up_test.dir/build.make test/CMakeFiles/arc_look_up_test.dir/build make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 55%] Building CXX object test/CMakeFiles/arc_look_up_test.dir/arc_look_up_test.cc.o cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -I/<>/liblemon-1.3.1+dfsg -I/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -o CMakeFiles/arc_look_up_test.dir/arc_look_up_test.cc.o -c /<>/liblemon-1.3.1+dfsg/test/arc_look_up_test.cc [ 56%] Linking CXX executable arc_look_up_test cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/cmake -E cmake_link_script CMakeFiles/arc_look_up_test.dir/link.txt --verbose=1 /usr/bin/c++ -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -Wl,-Bsymbolic-functions -Wl,-z,relro -Wl,-z,now -rdynamic CMakeFiles/arc_look_up_test.dir/arc_look_up_test.cc.o -o arc_look_up_test -L/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 56%] Built target arc_look_up_test make -f test/CMakeFiles/lgf_reader_writer_test.dir/build.make test/CMakeFiles/lgf_reader_writer_test.dir/depend make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<>/liblemon-1.3.1+dfsg /<>/liblemon-1.3.1+dfsg/test /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test/CMakeFiles/lgf_reader_writer_test.dir/DependInfo.cmake --color= Scanning dependencies of target lgf_reader_writer_test make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' make -f test/CMakeFiles/lgf_reader_writer_test.dir/build.make test/CMakeFiles/lgf_reader_writer_test.dir/build make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 57%] Building CXX object test/CMakeFiles/lgf_reader_writer_test.dir/lgf_reader_writer_test.cc.o cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -I/<>/liblemon-1.3.1+dfsg -I/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -o CMakeFiles/lgf_reader_writer_test.dir/lgf_reader_writer_test.cc.o -c /<>/liblemon-1.3.1+dfsg/test/lgf_reader_writer_test.cc In file included from /<>/liblemon-1.3.1+dfsg/test/lgf_reader_writer_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/lgf_reader.h: In instantiation of ‘void lemon::DigraphReader::readNodes() [with DGR = lemon::concepts::ExtendableDigraphComponent]’: /<>/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:1188:15: required from ‘void lemon::DigraphReader::run() [with DGR = lemon::concepts::ExtendableDigraphComponent]’ /<>/liblemon-1.3.1+dfsg/test/lgf_reader_writer_test.cc:75:14: required from here /<>/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:954:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 954 | n = _digraph.addNode(); In file included from /<>/liblemon-1.3.1+dfsg/test/lgf_reader_writer_test.cc:21: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/lgf_reader_writer_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:967:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 967 | n = it->second; | ~~^~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/lgf_reader_writer_test.cc:21: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/lgf_reader_writer_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/lgf_reader.h: In instantiation of ‘void lemon::DigraphReader::readArcs() [with DGR = lemon::concepts::ExtendableDigraphComponent]’: /<>/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:1194:15: required from ‘void lemon::DigraphReader::run() [with DGR = lemon::concepts::ExtendableDigraphComponent]’ /<>/liblemon-1.3.1+dfsg/test/lgf_reader_writer_test.cc:75:14: required from here /<>/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:1082:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 1082 | a = _digraph.addArc(source, target); In file included from /<>/liblemon-1.3.1+dfsg/test/lgf_reader_writer_test.cc:21: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/lgf_reader_writer_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:1095:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 1095 | a = it->second; | ~~^~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/lgf_reader_writer_test.cc:21: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/lgf_reader_writer_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/lgf_reader.h: In instantiation of ‘void lemon::GraphReader::readNodes() [with GR = lemon::concepts::ExtendableGraphComponent]’: /<>/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:2068:15: required from ‘void lemon::GraphReader::run() [with GR = lemon::concepts::ExtendableGraphComponent]’ /<>/liblemon-1.3.1+dfsg/test/lgf_reader_writer_test.cc:145:14: required from here /<>/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:1833:13: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1833 | n = _graph.addNode(); In file included from /<>/liblemon-1.3.1+dfsg/test/lgf_reader_writer_test.cc:22: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/lgf_reader_writer_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:1846:13: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1846 | n = it->second; | ~~^~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/lgf_reader_writer_test.cc:22: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/lgf_reader_writer_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/lgf_reader.h: In instantiation of ‘void lemon::GraphReader::readEdges() [with GR = lemon::concepts::ExtendableGraphComponent]’: /<>/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:2074:15: required from ‘void lemon::GraphReader::run() [with GR = lemon::concepts::ExtendableGraphComponent]’ /<>/liblemon-1.3.1+dfsg/test/lgf_reader_writer_test.cc:145:14: required from here /<>/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:1961:13: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Edge& lemon::concepts::Graph::Edge::operator=(const lemon::concepts::Graph::Edge&)’ is deprecated [-Wdeprecated-copy] 1961 | e = _graph.addEdge(source, target); In file included from /<>/liblemon-1.3.1+dfsg/test/lgf_reader_writer_test.cc:22: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:200:9: note: because ‘lemon::concepts::Graph::Edge’ has user-provided ‘lemon::concepts::Graph::Edge::Edge(const lemon::concepts::Graph::Edge&)’ 200 | Edge(const Edge&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/lgf_reader_writer_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:1974:13: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Edge& lemon::concepts::Graph::Edge::operator=(const lemon::concepts::Graph::Edge&)’ is deprecated [-Wdeprecated-copy] 1974 | e = it->second; | ~~^~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/lgf_reader_writer_test.cc:22: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:200:9: note: because ‘lemon::concepts::Graph::Edge’ has user-provided ‘lemon::concepts::Graph::Edge::Edge(const lemon::concepts::Graph::Edge&)’ 200 | Edge(const Edge&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/lgf_reader_writer_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/lgf_reader.h: In instantiation of ‘void lemon::BpGraphReader::readRedNodes() [with BGR = lemon::concepts::ExtendableBpGraphComponent]’: /<>/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:3126:15: required from ‘void lemon::BpGraphReader::run() [with BGR = lemon::concepts::ExtendableBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/test/lgf_reader_writer_test.cc:232:14: required from here /<>/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:2804:13: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::RedNode& lemon::concepts::BpGraph::RedNode::operator=(const lemon::concepts::BpGraph::RedNode&)’ is deprecated [-Wdeprecated-copy] 2804 | n = _graph.addRedNode(); In file included from /<>/liblemon-1.3.1+dfsg/test/lgf_reader_writer_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:144:9: note: because ‘lemon::concepts::BpGraph::RedNode’ has user-provided ‘lemon::concepts::BpGraph::RedNode::RedNode(const lemon::concepts::BpGraph::RedNode&)’ 144 | RedNode(const RedNode&) : Node() { } | ^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/lgf_reader_writer_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:2817:13: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::RedNode& lemon::concepts::BpGraph::RedNode::operator=(const lemon::concepts::BpGraph::RedNode&)’ is deprecated [-Wdeprecated-copy] 2817 | n = it->second; | ~~^~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/lgf_reader_writer_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:144:9: note: because ‘lemon::concepts::BpGraph::RedNode’ has user-provided ‘lemon::concepts::BpGraph::RedNode::RedNode(const lemon::concepts::BpGraph::RedNode&)’ 144 | RedNode(const RedNode&) : Node() { } | ^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/lgf_reader_writer_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/lgf_reader.h: In instantiation of ‘void lemon::BpGraphReader::readBlueNodes() [with BGR = lemon::concepts::ExtendableBpGraphComponent]’: /<>/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:3131:15: required from ‘void lemon::BpGraphReader::run() [with BGR = lemon::concepts::ExtendableBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/test/lgf_reader_writer_test.cc:232:14: required from here /<>/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:2897:13: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::BlueNode& lemon::concepts::BpGraph::BlueNode::operator=(const lemon::concepts::BpGraph::BlueNode&)’ is deprecated [-Wdeprecated-copy] 2897 | n = _graph.addBlueNode(); In file included from /<>/liblemon-1.3.1+dfsg/test/lgf_reader_writer_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:171:9: note: because ‘lemon::concepts::BpGraph::BlueNode’ has user-provided ‘lemon::concepts::BpGraph::BlueNode::BlueNode(const lemon::concepts::BpGraph::BlueNode&)’ 171 | BlueNode(const BlueNode&) : Node() { } | ^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/lgf_reader_writer_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:2910:13: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::BlueNode& lemon::concepts::BpGraph::BlueNode::operator=(const lemon::concepts::BpGraph::BlueNode&)’ is deprecated [-Wdeprecated-copy] 2910 | n = it->second; | ~~^~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/lgf_reader_writer_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:171:9: note: because ‘lemon::concepts::BpGraph::BlueNode’ has user-provided ‘lemon::concepts::BpGraph::BlueNode::BlueNode(const lemon::concepts::BpGraph::BlueNode&)’ 171 | BlueNode(const BlueNode&) : Node() { } | ^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/lgf_reader_writer_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/lgf_reader.h: In instantiation of ‘void lemon::BpGraphReader::readEdges() [with BGR = lemon::concepts::ExtendableBpGraphComponent]’: /<>/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:3137:15: required from ‘void lemon::BpGraphReader::run() [with BGR = lemon::concepts::ExtendableBpGraphComponent]’ /<>/liblemon-1.3.1+dfsg/test/lgf_reader_writer_test.cc:232:14: required from here /<>/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:3018:13: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::Edge& lemon::concepts::BpGraph::Edge::operator=(const lemon::concepts::BpGraph::Edge&)’ is deprecated [-Wdeprecated-copy] 3018 | e = _graph.addEdge(source, target); In file included from /<>/liblemon-1.3.1+dfsg/test/lgf_reader_writer_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:327:9: note: because ‘lemon::concepts::BpGraph::Edge’ has user-provided ‘lemon::concepts::BpGraph::Edge::Edge(const lemon::concepts::BpGraph::Edge&)’ 327 | Edge(const Edge&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/lgf_reader_writer_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:3031:13: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::Edge& lemon::concepts::BpGraph::Edge::operator=(const lemon::concepts::BpGraph::Edge&)’ is deprecated [-Wdeprecated-copy] 3031 | e = it->second; | ~~^~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/lgf_reader_writer_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:327:9: note: because ‘lemon::concepts::BpGraph::Edge’ has user-provided ‘lemon::concepts::BpGraph::Edge::Edge(const lemon::concepts::BpGraph::Edge&)’ 327 | Edge(const Edge&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/lgf_reader_writer_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/lgf_reader.h: In instantiation of ‘void lemon::BpGraphReader::readRedNodes() [with BGR = lemon::ListBpGraph]’: /<>/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:3126:15: required from ‘void lemon::BpGraphReader::run() [with BGR = lemon::ListBpGraph]’ /<>/liblemon-1.3.1+dfsg/test/lgf_reader_writer_test.cc:545:14: required from here /<>/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:2804:13: warning: implicitly-declared ‘constexpr lemon::ListBpGraphBase::RedNode& lemon::ListBpGraphBase::RedNode::operator=(const lemon::ListBpGraphBase::RedNode&)’ is deprecated [-Wdeprecated-copy] 2804 | n = _graph.addRedNode(); In file included from /<>/liblemon-1.3.1+dfsg/test/lgf_reader_writer_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/list_graph.h:1658:7: note: because ‘lemon::ListBpGraphBase::RedNode’ has user-provided ‘lemon::ListBpGraphBase::RedNode::RedNode(const lemon::ListBpGraphBase::RedNode&)’ 1658 | RedNode(const RedNode& node) : Node(node) {} | ^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/lgf_reader_writer_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:2817:13: warning: implicitly-declared ‘constexpr lemon::ListBpGraphBase::RedNode& lemon::ListBpGraphBase::RedNode::operator=(const lemon::ListBpGraphBase::RedNode&)’ is deprecated [-Wdeprecated-copy] 2817 | n = it->second; | ~~^~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/lgf_reader_writer_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/list_graph.h:1658:7: note: because ‘lemon::ListBpGraphBase::RedNode’ has user-provided ‘lemon::ListBpGraphBase::RedNode::RedNode(const lemon::ListBpGraphBase::RedNode&)’ 1658 | RedNode(const RedNode& node) : Node(node) {} | ^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/lgf_reader_writer_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/lgf_reader.h: In instantiation of ‘void lemon::BpGraphReader::readBlueNodes() [with BGR = lemon::ListBpGraph]’: /<>/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:3131:15: required from ‘void lemon::BpGraphReader::run() [with BGR = lemon::ListBpGraph]’ /<>/liblemon-1.3.1+dfsg/test/lgf_reader_writer_test.cc:545:14: required from here /<>/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:2897:13: warning: implicitly-declared ‘constexpr lemon::ListBpGraphBase::BlueNode& lemon::ListBpGraphBase::BlueNode::operator=(const lemon::ListBpGraphBase::BlueNode&)’ is deprecated [-Wdeprecated-copy] 2897 | n = _graph.addBlueNode(); In file included from /<>/liblemon-1.3.1+dfsg/test/lgf_reader_writer_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/list_graph.h:1670:7: note: because ‘lemon::ListBpGraphBase::BlueNode’ has user-provided ‘lemon::ListBpGraphBase::BlueNode::BlueNode(const lemon::ListBpGraphBase::BlueNode&)’ 1670 | BlueNode(const BlueNode& node) : Node(node) {} | ^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/lgf_reader_writer_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:2910:13: warning: implicitly-declared ‘constexpr lemon::ListBpGraphBase::BlueNode& lemon::ListBpGraphBase::BlueNode::operator=(const lemon::ListBpGraphBase::BlueNode&)’ is deprecated [-Wdeprecated-copy] 2910 | n = it->second; | ~~^~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/lgf_reader_writer_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/list_graph.h:1670:7: note: because ‘lemon::ListBpGraphBase::BlueNode’ has user-provided ‘lemon::ListBpGraphBase::BlueNode::BlueNode(const lemon::ListBpGraphBase::BlueNode&)’ 1670 | BlueNode(const BlueNode& node) : Node(node) {} | ^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/lgf_reader_writer_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/lgf_reader.h: In instantiation of ‘void lemon::_reader_bits::ValueStorage<_Value, _Converter>::set(const string&) [with _Value = lemon::ListBpGraphBase::BlueNode; _Converter = lemon::_reader_bits::MapLookUpConverter, lemon::ListBpGraphBase::BlueNode, std::less >, std::allocator, lemon::ListBpGraphBase::BlueNode> > > >; std::string = std::__cxx11::basic_string]’: /<>/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:152:20: required from here /<>/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:153:16: warning: implicitly-declared ‘constexpr lemon::ListBpGraphBase::BlueNode& lemon::ListBpGraphBase::BlueNode::operator=(const lemon::ListBpGraphBase::BlueNode&)’ is deprecated [-Wdeprecated-copy] 153 | _value = _converter(value); In file included from /<>/liblemon-1.3.1+dfsg/test/lgf_reader_writer_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/list_graph.h:1670:7: note: because ‘lemon::ListBpGraphBase::BlueNode’ has user-provided ‘lemon::ListBpGraphBase::BlueNode::BlueNode(const lemon::ListBpGraphBase::BlueNode&)’ 1670 | BlueNode(const BlueNode& node) : Node(node) {} | ^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/lgf_reader_writer_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/lgf_reader.h: In instantiation of ‘void lemon::_reader_bits::ValueStorage<_Value, _Converter>::set(const string&) [with _Value = lemon::ListBpGraphBase::RedNode; _Converter = lemon::_reader_bits::MapLookUpConverter, lemon::ListBpGraphBase::RedNode, std::less >, std::allocator, lemon::ListBpGraphBase::RedNode> > > >; std::string = std::__cxx11::basic_string]’: /<>/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:152:20: required from here /<>/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:153:16: warning: implicitly-declared ‘constexpr lemon::ListBpGraphBase::RedNode& lemon::ListBpGraphBase::RedNode::operator=(const lemon::ListBpGraphBase::RedNode&)’ is deprecated [-Wdeprecated-copy] 153 | _value = _converter(value); In file included from /<>/liblemon-1.3.1+dfsg/test/lgf_reader_writer_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/list_graph.h:1658:7: note: because ‘lemon::ListBpGraphBase::RedNode’ has user-provided ‘lemon::ListBpGraphBase::RedNode::RedNode(const lemon::ListBpGraphBase::RedNode&)’ 1658 | RedNode(const RedNode& node) : Node(node) {} | ^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/lgf_reader_writer_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/lgf_reader.h: In instantiation of ‘void lemon::_reader_bits::ValueStorage<_Value, _Converter>::set(const string&) [with _Value = lemon::concepts::BpGraph::Arc; _Converter = lemon::_reader_bits::GraphArcLookUpConverter >; std::string = std::__cxx11::basic_string]’: /<>/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:152:20: required from here /<>/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:153:16: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::Arc& lemon::concepts::BpGraph::Arc::operator=(const lemon::concepts::BpGraph::Arc&)’ is deprecated [-Wdeprecated-copy] 153 | _value = _converter(value); In file included from /<>/liblemon-1.3.1+dfsg/test/lgf_reader_writer_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:462:9: note: because ‘lemon::concepts::BpGraph::Arc’ has user-provided ‘lemon::concepts::BpGraph::Arc::Arc(const lemon::concepts::BpGraph::Arc&)’ 462 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/lgf_reader_writer_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/lgf_reader.h: In instantiation of ‘void lemon::_reader_bits::ValueStorage<_Value, _Converter>::set(const string&) [with _Value = lemon::concepts::BpGraph::BlueNode; _Converter = lemon::_reader_bits::MapLookUpConverter, lemon::concepts::BpGraph::BlueNode, std::less >, std::allocator, lemon::concepts::BpGraph::BlueNode> > > >; std::string = std::__cxx11::basic_string]’: /<>/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:152:20: required from here /<>/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:153:16: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::BlueNode& lemon::concepts::BpGraph::BlueNode::operator=(const lemon::concepts::BpGraph::BlueNode&)’ is deprecated [-Wdeprecated-copy] 153 | _value = _converter(value); In file included from /<>/liblemon-1.3.1+dfsg/test/lgf_reader_writer_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:171:9: note: because ‘lemon::concepts::BpGraph::BlueNode’ has user-provided ‘lemon::concepts::BpGraph::BlueNode::BlueNode(const lemon::concepts::BpGraph::BlueNode&)’ 171 | BlueNode(const BlueNode&) : Node() { } | ^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/lgf_reader_writer_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/lgf_reader.h: In instantiation of ‘void lemon::_reader_bits::ValueStorage<_Value, _Converter>::set(const string&) [with _Value = lemon::concepts::BpGraph::RedNode; _Converter = lemon::_reader_bits::MapLookUpConverter, lemon::concepts::BpGraph::RedNode, std::less >, std::allocator, lemon::concepts::BpGraph::RedNode> > > >; std::string = std::__cxx11::basic_string]’: /<>/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:152:20: required from here /<>/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:153:16: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::RedNode& lemon::concepts::BpGraph::RedNode::operator=(const lemon::concepts::BpGraph::RedNode&)’ is deprecated [-Wdeprecated-copy] 153 | _value = _converter(value); In file included from /<>/liblemon-1.3.1+dfsg/test/lgf_reader_writer_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:144:9: note: because ‘lemon::concepts::BpGraph::RedNode’ has user-provided ‘lemon::concepts::BpGraph::RedNode::RedNode(const lemon::concepts::BpGraph::RedNode&)’ 144 | RedNode(const RedNode&) : Node() { } | ^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/lgf_reader_writer_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/lgf_reader.h: In instantiation of ‘void lemon::_reader_bits::ValueStorage<_Value, _Converter>::set(const string&) [with _Value = lemon::concepts::BpGraph::Node; _Converter = lemon::_reader_bits::DoubleMapLookUpConverter, lemon::concepts::BpGraph::RedNode, std::less >, std::allocator, lemon::concepts::BpGraph::RedNode> > >, std::map, lemon::concepts::BpGraph::BlueNode, std::less >, std::allocator, lemon::concepts::BpGraph::BlueNode> > > >; std::string = std::__cxx11::basic_string]’: /<>/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:152:20: required from here /<>/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:153:16: warning: implicitly-declared ‘constexpr lemon::concepts::BpGraph::Node& lemon::concepts::BpGraph::Node::operator=(const lemon::concepts::BpGraph::Node&)’ is deprecated [-Wdeprecated-copy] 153 | _value = _converter(value); In file included from /<>/liblemon-1.3.1+dfsg/test/lgf_reader_writer_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:96:9: note: because ‘lemon::concepts::BpGraph::Node’ has user-provided ‘lemon::concepts::BpGraph::Node::Node(const lemon::concepts::BpGraph::Node&)’ 96 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/lgf_reader_writer_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/lgf_reader.h: In instantiation of ‘void lemon::_reader_bits::ValueStorage<_Value, _Converter>::set(const string&) [with _Value = lemon::concepts::Graph::Arc; _Converter = lemon::_reader_bits::GraphArcLookUpConverter >; std::string = std::__cxx11::basic_string]’: /<>/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:152:20: required from here /<>/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:153:16: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 153 | _value = _converter(value); In file included from /<>/liblemon-1.3.1+dfsg/test/lgf_reader_writer_test.cc:22: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/lgf_reader_writer_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/lgf_reader.h: In instantiation of ‘void lemon::_reader_bits::ValueStorage<_Value, _Converter>::set(const string&) [with _Value = lemon::concepts::Graph::Node; _Converter = lemon::_reader_bits::MapLookUpConverter, lemon::concepts::Graph::Node, std::less >, std::allocator, lemon::concepts::Graph::Node> > > >; std::string = std::__cxx11::basic_string]’: /<>/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:152:20: required from here /<>/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:153:16: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 153 | _value = _converter(value); In file included from /<>/liblemon-1.3.1+dfsg/test/lgf_reader_writer_test.cc:22: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/lgf_reader_writer_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/lgf_reader.h: In instantiation of ‘void lemon::_reader_bits::ValueStorage<_Value, _Converter>::set(const string&) [with _Value = lemon::concepts::Digraph::Arc; _Converter = lemon::_reader_bits::MapLookUpConverter, lemon::concepts::Digraph::Arc, std::less >, std::allocator, lemon::concepts::Digraph::Arc> > > >; std::string = std::__cxx11::basic_string]’: /<>/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:152:20: required from here /<>/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:153:16: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 153 | _value = _converter(value); In file included from /<>/liblemon-1.3.1+dfsg/test/lgf_reader_writer_test.cc:21: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/lgf_reader_writer_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/lgf_reader.h: In instantiation of ‘void lemon::_reader_bits::ValueStorage<_Value, _Converter>::set(const string&) [with _Value = lemon::concepts::Digraph::Node; _Converter = lemon::_reader_bits::MapLookUpConverter, lemon::concepts::Digraph::Node, std::less >, std::allocator, lemon::concepts::Digraph::Node> > > >; std::string = std::__cxx11::basic_string]’: /<>/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:152:20: required from here /<>/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:153:16: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 153 | _value = _converter(value); In file included from /<>/liblemon-1.3.1+dfsg/test/lgf_reader_writer_test.cc:21: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ [ 59%] Linking CXX executable lgf_reader_writer_test cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/cmake -E cmake_link_script CMakeFiles/lgf_reader_writer_test.dir/link.txt --verbose=1 /usr/bin/c++ -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -Wl,-Bsymbolic-functions -Wl,-z,relro -Wl,-z,now -rdynamic CMakeFiles/lgf_reader_writer_test.dir/lgf_reader_writer_test.cc.o -o lgf_reader_writer_test -L/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 59%] Built target lgf_reader_writer_test make -f test/CMakeFiles/dfs_test.dir/build.make test/CMakeFiles/dfs_test.dir/depend make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<>/liblemon-1.3.1+dfsg /<>/liblemon-1.3.1+dfsg/test /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test/CMakeFiles/dfs_test.dir/DependInfo.cmake --color= Scanning dependencies of target dfs_test make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' make -f test/CMakeFiles/dfs_test.dir/build.make test/CMakeFiles/dfs_test.dir/build make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 60%] Building CXX object test/CMakeFiles/dfs_test.dir/dfs_test.cc.o cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -I/<>/liblemon-1.3.1+dfsg -I/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -o CMakeFiles/dfs_test.dir/dfs_test.cc.o -c /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc: In function ‘void checkDfsCompile()’: /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:87:33: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 87 | e = dfs_test.processNextArc(); | ^ In file included from /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:88:32: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 88 | e = const_dfs_test.nextArc(); | ^ In file included from /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:97:34: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 97 | e = const_dfs_test.predArc(t); | ^ In file included from /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:98:35: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 98 | s = const_dfs_test.predNode(t); | ^ In file included from /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:100:33: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::NodeMap& lemon::concepts::Digraph::NodeMap::operator=(const lemon::concepts::Digraph::NodeMap&)’ is deprecated [-Wdeprecated-copy] 100 | d = const_dfs_test.distMap(); | ^ In file included from /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:439:9: note: because ‘lemon::concepts::Digraph::NodeMap’ has user-provided ‘lemon::concepts::Digraph::NodeMap::NodeMap(const lemon::concepts::Digraph::NodeMap&) [with T = int]’ 439 | NodeMap(const NodeMap& nm) : | ^~~~~~~ /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:101:33: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::NodeMap& lemon::concepts::Digraph::NodeMap::operator=(const lemon::concepts::Digraph::NodeMap&)’ is deprecated [-Wdeprecated-copy] 101 | p = const_dfs_test.predMap(); | ^ In file included from /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:439:9: note: because ‘lemon::concepts::Digraph::NodeMap’ has user-provided ‘lemon::concepts::Digraph::NodeMap::NodeMap(const lemon::concepts::Digraph::NodeMap&) [with T = lemon::concepts::Digraph::Arc]’ 439 | NodeMap(const NodeMap& nm) : | ^~~~~~~ /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:130:33: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 130 | e = dfs_test.processNextArc(); | ^ In file included from /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:131:26: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 131 | e = dfs_test.nextArc(); | ^ In file included from /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:140:28: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 140 | e = dfs_test.predArc(t); | ^ In file included from /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:141:29: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 141 | s = dfs_test.predNode(t); | ^ In file included from /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/dfs.h: In instantiation of ‘void lemon::Dfs::addSource(lemon::Dfs::Node) [with GR = lemon::concepts::Digraph; TR = lemon::DfsDefaultTraits; lemon::Dfs::Node = lemon::concepts::Digraph::Node]’: /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:86:25: required from here /<>/liblemon-1.3.1+dfsg/lemon/dfs.h:462:34: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::OutArcIt& lemon::concepts::Digraph::OutArcIt::operator=(const lemon::concepts::Digraph::OutArcIt&)’ is deprecated [-Wdeprecated-copy] 462 | _stack[++_stack_head]=e; | ~~~~~~~~~~~~~~~~~~~~~^~ In file included from /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:217:9: note: because ‘lemon::concepts::Digraph::OutArcIt’ has user-provided ‘lemon::concepts::Digraph::OutArcIt::OutArcIt(const lemon::concepts::Digraph::OutArcIt&)’ 217 | OutArcIt(const OutArcIt& e) : Arc(e) { } | ^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/dfs.h: In instantiation of ‘lemon::Dfs::Arc lemon::Dfs::processNextArc() [with GR = lemon::concepts::Digraph; TR = lemon::DfsDefaultTraits; lemon::Dfs::Arc = lemon::concepts::Digraph::Arc]’: /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:87:33: required from here /<>/liblemon-1.3.1+dfsg/lemon/dfs.h:483:24: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 483 | if(!(*_reached)[m=G->target(e)]) { In file included from /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/dfs.h:487:29: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::OutArcIt& lemon::concepts::Digraph::OutArcIt::operator=(const lemon::concepts::Digraph::OutArcIt&)’ is deprecated [-Wdeprecated-copy] 487 | _stack[_stack_head] = OutArcIt(*G, m); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:217:9: note: because ‘lemon::concepts::Digraph::OutArcIt’ has user-provided ‘lemon::concepts::Digraph::OutArcIt::OutArcIt(const lemon::concepts::Digraph::OutArcIt&)’ 217 | OutArcIt(const OutArcIt& e) : Arc(e) { } | ^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/dfs.h:491:10: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 491 | m=G->source(e); In file included from /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/dfs.h:498:12: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 498 | m=G->source(_stack[_stack_head]); In file included from /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/dfs.h: In instantiation of ‘void lemon::Dfs::addSource(lemon::Dfs::Node) [with GR = lemon::concepts::Digraph; TR = lemon::Dfs::SetPredMapTraits > >::SetDistMapTraits > >::SetReachedMapTraits > >::SetStandardProcessedMapTraits>::SetProcessedMapTraits >; lemon::Dfs::Node = lemon::concepts::Digraph::Node]’: /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:129:25: required from here /<>/liblemon-1.3.1+dfsg/lemon/dfs.h:462:34: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::OutArcIt& lemon::concepts::Digraph::OutArcIt::operator=(const lemon::concepts::Digraph::OutArcIt&)’ is deprecated [-Wdeprecated-copy] 462 | _stack[++_stack_head]=e; | ~~~~~~~~~~~~~~~~~~~~~^~ In file included from /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:217:9: note: because ‘lemon::concepts::Digraph::OutArcIt’ has user-provided ‘lemon::concepts::Digraph::OutArcIt::OutArcIt(const lemon::concepts::Digraph::OutArcIt&)’ 217 | OutArcIt(const OutArcIt& e) : Arc(e) { } | ^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/dfs.h: In instantiation of ‘lemon::Dfs::Arc lemon::Dfs::processNextArc() [with GR = lemon::concepts::Digraph; TR = lemon::Dfs::SetPredMapTraits > >::SetDistMapTraits > >::SetReachedMapTraits > >::SetStandardProcessedMapTraits>::SetProcessedMapTraits >; lemon::Dfs::Arc = lemon::concepts::Digraph::Arc]’: /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:130:33: required from here /<>/liblemon-1.3.1+dfsg/lemon/dfs.h:483:24: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 483 | if(!(*_reached)[m=G->target(e)]) { In file included from /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/dfs.h:487:29: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::OutArcIt& lemon::concepts::Digraph::OutArcIt::operator=(const lemon::concepts::Digraph::OutArcIt&)’ is deprecated [-Wdeprecated-copy] 487 | _stack[_stack_head] = OutArcIt(*G, m); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:217:9: note: because ‘lemon::concepts::Digraph::OutArcIt’ has user-provided ‘lemon::concepts::Digraph::OutArcIt::OutArcIt(const lemon::concepts::Digraph::OutArcIt&)’ 217 | OutArcIt(const OutArcIt& e) : Arc(e) { } | ^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/dfs.h:491:10: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 491 | m=G->source(e); In file included from /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/dfs.h:498:12: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 498 | m=G->source(_stack[_stack_head]); In file included from /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:27, from /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/maps.h: In instantiation of ‘void lemon::concepts::ReferenceMap::set(const Key&, const Value&) [with K = lemon::concepts::Digraph::Node; T = lemon::concepts::Digraph::Arc; R = lemon::concepts::Digraph::Arc&; CR = const lemon::concepts::Digraph::Arc&; lemon::concepts::ReferenceMap::Key = lemon::concepts::Digraph::Node; lemon::concepts::ReferenceMap::Value = lemon::concepts::Digraph::Arc]’: /<>/liblemon-1.3.1+dfsg/lemon/dfs.h:439:9: required from ‘void lemon::Dfs::init() [with GR = lemon::concepts::Digraph; TR = lemon::DfsDefaultTraits]’ /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:85:19: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/maps.h:186:60: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 186 | void set(const Key &k,const Value &t) { operator[](k)=t; } In file included from /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/dfs.h: In instantiation of ‘void lemon::Dfs::addSource(lemon::Dfs::Node) [with GR = lemon::concepts::Digraph; TR = lemon::DfsWizardBase; lemon::Dfs::Node = lemon::concepts::Digraph::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/dfs.h:615:7: required from ‘void lemon::Dfs::run(lemon::Dfs::Node) [with GR = lemon::concepts::Digraph; TR = lemon::DfsWizardBase; lemon::Dfs::Node = lemon::concepts::Digraph::Node]’ /<>/liblemon-1.3.1+dfsg/lemon/dfs.h:953:9: required from ‘void lemon::DfsWizard::run(lemon::DfsWizard::Node) [with TR = lemon::DfsWizardBase; lemon::DfsWizard::Node = lemon::concepts::Digraph::Node]’ /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:158:20: required from here /<>/liblemon-1.3.1+dfsg/lemon/dfs.h:462:34: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::OutArcIt& lemon::concepts::Digraph::OutArcIt::operator=(const lemon::concepts::Digraph::OutArcIt&)’ is deprecated [-Wdeprecated-copy] 462 | _stack[++_stack_head]=e; | ~~~~~~~~~~~~~~~~~~~~~^~ In file included from /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:217:9: note: because ‘lemon::concepts::Digraph::OutArcIt’ has user-provided ‘lemon::concepts::Digraph::OutArcIt::OutArcIt(const lemon::concepts::Digraph::OutArcIt&)’ 217 | OutArcIt(const OutArcIt& e) : Arc(e) { } | ^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/dfs.h: In instantiation of ‘void lemon::Dfs::addSource(lemon::Dfs::Node) [with GR = lemon::concepts::Digraph; TR = lemon::DfsWizard >::SetPredMapBase > >::SetDistMapBase > >::SetReachedMapBase > >::SetProcessedMapBase >; lemon::Dfs::Node = lemon::concepts::Digraph::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/dfs.h:615:7: required from ‘void lemon::Dfs::run(lemon::Dfs::Node) [with GR = lemon::concepts::Digraph; TR = lemon::DfsWizard >::SetPredMapBase > >::SetDistMapBase > >::SetReachedMapBase > >::SetProcessedMapBase >; lemon::Dfs::Node = lemon::concepts::Digraph::Node]’ /<>/liblemon-1.3.1+dfsg/lemon/dfs.h:953:9: required from ‘void lemon::DfsWizard::run(lemon::DfsWizard::Node) [with TR = lemon::DfsWizard >::SetPredMapBase > >::SetDistMapBase > >::SetReachedMapBase > >::SetProcessedMapBase >; lemon::DfsWizard::Node = lemon::concepts::Digraph::Node]’ /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:166:16: required from here /<>/liblemon-1.3.1+dfsg/lemon/dfs.h:462:34: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::OutArcIt& lemon::concepts::Digraph::OutArcIt::operator=(const lemon::concepts::Digraph::OutArcIt&)’ is deprecated [-Wdeprecated-copy] 462 | _stack[++_stack_head]=e; | ~~~~~~~~~~~~~~~~~~~~~^~ In file included from /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:217:9: note: because ‘lemon::concepts::Digraph::OutArcIt’ has user-provided ‘lemon::concepts::Digraph::OutArcIt::OutArcIt(const lemon::concepts::Digraph::OutArcIt&)’ 217 | OutArcIt(const OutArcIt& e) : Arc(e) { } | ^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/dfs.h: In instantiation of ‘void lemon::Dfs::addSource(lemon::Dfs::Node) [with GR = lemon::concepts::Digraph; TR = lemon::DfsWizard >::SetPredMapBase > >::SetDistMapBase > >::SetReachedMapBase > >::SetProcessedMapBase > >::SetPathBase >; lemon::Dfs::Node = lemon::concepts::Digraph::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/dfs.h:636:7: required from ‘bool lemon::Dfs::run(lemon::Dfs::Node, lemon::Dfs::Node) [with GR = lemon::concepts::Digraph; TR = lemon::DfsWizard >::SetPredMapBase > >::SetDistMapBase > >::SetReachedMapBase > >::SetProcessedMapBase > >::SetPathBase >; lemon::Dfs::Node = lemon::concepts::Digraph::Node]’ /<>/liblemon-1.3.1+dfsg/lemon/dfs.h:976:7: required from ‘bool lemon::DfsWizard::run(lemon::DfsWizard::Node, lemon::DfsWizard::Node) [with TR = lemon::DfsWizard >::SetPredMapBase > >::SetDistMapBase > >::SetReachedMapBase > >::SetProcessedMapBase > >::SetPathBase >; lemon::DfsWizard::Node = lemon::concepts::Digraph::Node]’ /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:174:23: required from here /<>/liblemon-1.3.1+dfsg/lemon/dfs.h:462:34: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::OutArcIt& lemon::concepts::Digraph::OutArcIt::operator=(const lemon::concepts::Digraph::OutArcIt&)’ is deprecated [-Wdeprecated-copy] 462 | _stack[++_stack_head]=e; | ~~~~~~~~~~~~~~~~~~~~~^~ In file included from /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:217:9: note: because ‘lemon::concepts::Digraph::OutArcIt’ has user-provided ‘lemon::concepts::Digraph::OutArcIt::OutArcIt(const lemon::concepts::Digraph::OutArcIt&)’ 217 | OutArcIt(const OutArcIt& e) : Arc(e) { } | ^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/dfs.h: In instantiation of ‘lemon::Dfs::Arc lemon::Dfs::processNextArc() [with GR = lemon::concepts::Digraph; TR = lemon::DfsWizardBase; lemon::Dfs::Arc = lemon::concepts::Digraph::Arc]’: /<>/liblemon-1.3.1+dfsg/lemon/dfs.h:550:31: required from ‘void lemon::Dfs::start() [with GR = lemon::concepts::Digraph; TR = lemon::DfsWizardBase]’ /<>/liblemon-1.3.1+dfsg/lemon/dfs.h:616:7: required from ‘void lemon::Dfs::run(lemon::Dfs::Node) [with GR = lemon::concepts::Digraph; TR = lemon::DfsWizardBase; lemon::Dfs::Node = lemon::concepts::Digraph::Node]’ /<>/liblemon-1.3.1+dfsg/lemon/dfs.h:953:9: required from ‘void lemon::DfsWizard::run(lemon::DfsWizard::Node) [with TR = lemon::DfsWizardBase; lemon::DfsWizard::Node = lemon::concepts::Digraph::Node]’ /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:158:20: required from here /<>/liblemon-1.3.1+dfsg/lemon/dfs.h:483:24: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 483 | if(!(*_reached)[m=G->target(e)]) { In file included from /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/dfs.h:487:29: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::OutArcIt& lemon::concepts::Digraph::OutArcIt::operator=(const lemon::concepts::Digraph::OutArcIt&)’ is deprecated [-Wdeprecated-copy] 487 | _stack[_stack_head] = OutArcIt(*G, m); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:217:9: note: because ‘lemon::concepts::Digraph::OutArcIt’ has user-provided ‘lemon::concepts::Digraph::OutArcIt::OutArcIt(const lemon::concepts::Digraph::OutArcIt&)’ 217 | OutArcIt(const OutArcIt& e) : Arc(e) { } | ^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/dfs.h:491:10: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 491 | m=G->source(e); In file included from /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/dfs.h:498:12: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 498 | m=G->source(_stack[_stack_head]); In file included from /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/dfs.h: In instantiation of ‘lemon::Dfs::Arc lemon::Dfs::processNextArc() [with GR = lemon::concepts::Digraph; TR = lemon::DfsWizard >::SetPredMapBase > >::SetDistMapBase > >::SetReachedMapBase > >::SetProcessedMapBase >; lemon::Dfs::Arc = lemon::concepts::Digraph::Arc]’: /<>/liblemon-1.3.1+dfsg/lemon/dfs.h:550:31: required from ‘void lemon::Dfs::start() [with GR = lemon::concepts::Digraph; TR = lemon::DfsWizard >::SetPredMapBase > >::SetDistMapBase > >::SetReachedMapBase > >::SetProcessedMapBase >]’ /<>/liblemon-1.3.1+dfsg/lemon/dfs.h:616:7: required from ‘void lemon::Dfs::run(lemon::Dfs::Node) [with GR = lemon::concepts::Digraph; TR = lemon::DfsWizard >::SetPredMapBase > >::SetDistMapBase > >::SetReachedMapBase > >::SetProcessedMapBase >; lemon::Dfs::Node = lemon::concepts::Digraph::Node]’ /<>/liblemon-1.3.1+dfsg/lemon/dfs.h:953:9: required from ‘void lemon::DfsWizard::run(lemon::DfsWizard::Node) [with TR = lemon::DfsWizard >::SetPredMapBase > >::SetDistMapBase > >::SetReachedMapBase > >::SetProcessedMapBase >; lemon::DfsWizard::Node = lemon::concepts::Digraph::Node]’ /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:166:16: required from here /<>/liblemon-1.3.1+dfsg/lemon/dfs.h:483:24: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 483 | if(!(*_reached)[m=G->target(e)]) { In file included from /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/dfs.h:487:29: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::OutArcIt& lemon::concepts::Digraph::OutArcIt::operator=(const lemon::concepts::Digraph::OutArcIt&)’ is deprecated [-Wdeprecated-copy] 487 | _stack[_stack_head] = OutArcIt(*G, m); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:217:9: note: because ‘lemon::concepts::Digraph::OutArcIt’ has user-provided ‘lemon::concepts::Digraph::OutArcIt::OutArcIt(const lemon::concepts::Digraph::OutArcIt&)’ 217 | OutArcIt(const OutArcIt& e) : Arc(e) { } | ^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/dfs.h:491:10: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 491 | m=G->source(e); In file included from /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/dfs.h:498:12: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 498 | m=G->source(_stack[_stack_head]); In file included from /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/dfs.h: In instantiation of ‘lemon::Dfs::Arc lemon::Dfs::processNextArc() [with GR = lemon::concepts::Digraph; TR = lemon::DfsWizard >::SetPredMapBase > >::SetDistMapBase > >::SetReachedMapBase > >::SetProcessedMapBase > >::SetPathBase >; lemon::Dfs::Arc = lemon::concepts::Digraph::Arc]’: /<>/liblemon-1.3.1+dfsg/lemon/dfs.h:569:9: required from ‘void lemon::Dfs::start(lemon::Dfs::Node) [with GR = lemon::concepts::Digraph; TR = lemon::DfsWizard >::SetPredMapBase > >::SetDistMapBase > >::SetReachedMapBase > >::SetProcessedMapBase > >::SetPathBase >; lemon::Dfs::Node = lemon::concepts::Digraph::Node]’ /<>/liblemon-1.3.1+dfsg/lemon/dfs.h:637:7: required from ‘bool lemon::Dfs::run(lemon::Dfs::Node, lemon::Dfs::Node) [with GR = lemon::concepts::Digraph; TR = lemon::DfsWizard >::SetPredMapBase > >::SetDistMapBase > >::SetReachedMapBase > >::SetProcessedMapBase > >::SetPathBase >; lemon::Dfs::Node = lemon::concepts::Digraph::Node]’ /<>/liblemon-1.3.1+dfsg/lemon/dfs.h:976:7: required from ‘bool lemon::DfsWizard::run(lemon::DfsWizard::Node, lemon::DfsWizard::Node) [with TR = lemon::DfsWizard >::SetPredMapBase > >::SetDistMapBase > >::SetReachedMapBase > >::SetProcessedMapBase > >::SetPathBase >; lemon::DfsWizard::Node = lemon::concepts::Digraph::Node]’ /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:174:23: required from here /<>/liblemon-1.3.1+dfsg/lemon/dfs.h:483:24: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 483 | if(!(*_reached)[m=G->target(e)]) { In file included from /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/dfs.h:487:29: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::OutArcIt& lemon::concepts::Digraph::OutArcIt::operator=(const lemon::concepts::Digraph::OutArcIt&)’ is deprecated [-Wdeprecated-copy] 487 | _stack[_stack_head] = OutArcIt(*G, m); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:217:9: note: because ‘lemon::concepts::Digraph::OutArcIt’ has user-provided ‘lemon::concepts::Digraph::OutArcIt::OutArcIt(const lemon::concepts::Digraph::OutArcIt&)’ 217 | OutArcIt(const OutArcIt& e) : Arc(e) { } | ^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/dfs.h:491:10: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 491 | m=G->source(e); In file included from /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/dfs.h:498:12: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 498 | m=G->source(_stack[_stack_head]); In file included from /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/dfs.h:27, from /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/bits/path_dump.h: In instantiation of ‘int lemon::PredMapPath<_Digraph, _PredMap>::length() const [with _Digraph = lemon::concepts::Digraph; _PredMap = lemon::concepts::Digraph::NodeMap]’: /<>/liblemon-1.3.1+dfsg/lemon/path.h:228:11: required from ‘void lemon::Path::buildRev(const CPath&) [with CPath = lemon::PredMapPath >; GR = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:1017:9: required from ‘static void lemon::_path_bits::PathCopySelectorBackward::copy(const From&, To&) [with From = lemon::PredMapPath >; To = lemon::Path]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:1033:49: required from ‘static void lemon::_path_bits::PathCopySelector::copy(const From&, To&) [with From = lemon::PredMapPath >; To = lemon::Path]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:1046:49: required from ‘void lemon::pathCopy(const From&, To&) [with From = lemon::PredMapPath >; To = lemon::Path]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:94:15: required from ‘lemon::Path& lemon::Path::operator=(const CPath&) [with CPath = lemon::PredMapPath >; GR = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:102:31: required from here /<>/liblemon-1.3.1+dfsg/lemon/bits/path_dump.h:44:19: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 44 | while ((arc = predMap[node]) != INVALID) { | ~~~~~^~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/dfs.h:27, from /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/bits/path_dump.h:45:14: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 45 | node = digraph.source(arc); In file included from /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/dfs.h:27, from /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/bits/path_dump.h: In instantiation of ‘lemon::PredMapPath<_Digraph, _PredMap>::RevArcIt::RevArcIt(const lemon::PredMapPath<_Digraph, _PredMap>&) [with _Digraph = lemon::concepts::Digraph; _PredMap = lemon::concepts::Digraph::NodeMap]’: /<>/liblemon-1.3.1+dfsg/lemon/path.h:230:37: required from ‘void lemon::Path::buildRev(const CPath&) [with CPath = lemon::PredMapPath >; GR = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:1017:9: required from ‘static void lemon::_path_bits::PathCopySelectorBackward::copy(const From&, To&) [with From = lemon::PredMapPath >; To = lemon::Path]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:1033:49: required from ‘static void lemon::_path_bits::PathCopySelector::copy(const From&, To&) [with From = lemon::PredMapPath >; To = lemon::Path]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:1046:49: required from ‘void lemon::pathCopy(const From&, To&) [with From = lemon::PredMapPath >; To = lemon::Path]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:94:15: required from ‘lemon::Path& lemon::Path::operator=(const CPath&) [with CPath = lemon::PredMapPath >; GR = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:102:31: required from here /<>/liblemon-1.3.1+dfsg/lemon/bits/path_dump.h:61:56: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 61 | if (path->predMap[current] == INVALID) current = INVALID; | ~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/dfs.h:27, from /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/bits/path_dump.h: In instantiation of ‘lemon::PredMapPath<_Digraph, _PredMap>::RevArcIt& lemon::PredMapPath<_Digraph, _PredMap>::RevArcIt::operator++() [with _Digraph = lemon::concepts::Digraph; _PredMap = lemon::concepts::Digraph::NodeMap]’: /<>/liblemon-1.3.1+dfsg/lemon/path.h:230:62: required from ‘void lemon::Path::buildRev(const CPath&) [with CPath = lemon::PredMapPath >; GR = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:1017:9: required from ‘static void lemon::_path_bits::PathCopySelectorBackward::copy(const From&, To&) [with From = lemon::PredMapPath >; To = lemon::Path]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:1033:49: required from ‘static void lemon::_path_bits::PathCopySelector::copy(const From&, To&) [with From = lemon::PredMapPath >; To = lemon::Path]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:1046:49: required from ‘void lemon::pathCopy(const From&, To&) [with From = lemon::PredMapPath >; To = lemon::Path]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:94:15: required from ‘lemon::Path& lemon::Path::operator=(const CPath&) [with CPath = lemon::PredMapPath >; GR = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:102:31: required from here /<>/liblemon-1.3.1+dfsg/lemon/bits/path_dump.h:69:17: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 69 | current = path->digraph.source(path->predMap[current]); In file included from /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/dfs.h:27, from /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/bits/path_dump.h:70:56: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 70 | if (path->predMap[current] == INVALID) current = INVALID; | ~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/dfs.h:27, from /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/bits/path_dump.h: In instantiation of ‘int lemon::PredMapPath<_Digraph, _PredMap>::length() const [with _Digraph = lemon::concepts::Digraph; _PredMap = lemon::concepts::ReadWriteMap]’: /<>/liblemon-1.3.1+dfsg/lemon/path.h:228:11: required from ‘void lemon::Path::buildRev(const CPath&) [with CPath = lemon::PredMapPath >; GR = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:1017:9: required from ‘static void lemon::_path_bits::PathCopySelectorBackward::copy(const From&, To&) [with From = lemon::PredMapPath >; To = lemon::Path]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:1033:49: required from ‘static void lemon::_path_bits::PathCopySelector::copy(const From&, To&) [with From = lemon::PredMapPath >; To = lemon::Path]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:1046:49: required from ‘void lemon::pathCopy(const From&, To&) [with From = lemon::PredMapPath >; To = lemon::Path]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:94:15: required from ‘lemon::Path& lemon::Path::operator=(const CPath&) [with CPath = lemon::PredMapPath >; GR = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:143:25: required from here /<>/liblemon-1.3.1+dfsg/lemon/bits/path_dump.h:44:19: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 44 | while ((arc = predMap[node]) != INVALID) { | ~~~~~^~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/dfs.h:27, from /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/bits/path_dump.h:45:14: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 45 | node = digraph.source(arc); In file included from /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/dfs.h:27, from /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/bits/path_dump.h: In instantiation of ‘lemon::PredMapPath<_Digraph, _PredMap>::RevArcIt::RevArcIt(const lemon::PredMapPath<_Digraph, _PredMap>&) [with _Digraph = lemon::concepts::Digraph; _PredMap = lemon::concepts::ReadWriteMap]’: /<>/liblemon-1.3.1+dfsg/lemon/path.h:230:37: required from ‘void lemon::Path::buildRev(const CPath&) [with CPath = lemon::PredMapPath >; GR = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:1017:9: required from ‘static void lemon::_path_bits::PathCopySelectorBackward::copy(const From&, To&) [with From = lemon::PredMapPath >; To = lemon::Path]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:1033:49: required from ‘static void lemon::_path_bits::PathCopySelector::copy(const From&, To&) [with From = lemon::PredMapPath >; To = lemon::Path]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:1046:49: required from ‘void lemon::pathCopy(const From&, To&) [with From = lemon::PredMapPath >; To = lemon::Path]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:94:15: required from ‘lemon::Path& lemon::Path::operator=(const CPath&) [with CPath = lemon::PredMapPath >; GR = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:143:25: required from here /<>/liblemon-1.3.1+dfsg/lemon/bits/path_dump.h:61:56: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 61 | if (path->predMap[current] == INVALID) current = INVALID; | ~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/dfs.h:27, from /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/bits/path_dump.h: In instantiation of ‘lemon::PredMapPath<_Digraph, _PredMap>::RevArcIt& lemon::PredMapPath<_Digraph, _PredMap>::RevArcIt::operator++() [with _Digraph = lemon::concepts::Digraph; _PredMap = lemon::concepts::ReadWriteMap]’: /<>/liblemon-1.3.1+dfsg/lemon/path.h:230:62: required from ‘void lemon::Path::buildRev(const CPath&) [with CPath = lemon::PredMapPath >; GR = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:1017:9: required from ‘static void lemon::_path_bits::PathCopySelectorBackward::copy(const From&, To&) [with From = lemon::PredMapPath >; To = lemon::Path]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:1033:49: required from ‘static void lemon::_path_bits::PathCopySelector::copy(const From&, To&) [with From = lemon::PredMapPath >; To = lemon::Path]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:1046:49: required from ‘void lemon::pathCopy(const From&, To&) [with From = lemon::PredMapPath >; To = lemon::Path]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:94:15: required from ‘lemon::Path& lemon::Path::operator=(const CPath&) [with CPath = lemon::PredMapPath >; GR = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:143:25: required from here /<>/liblemon-1.3.1+dfsg/lemon/bits/path_dump.h:69:17: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 69 | current = path->digraph.source(path->predMap[current]); In file included from /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/dfs.h:27, from /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/bits/path_dump.h:70:56: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 70 | if (path->predMap[current] == INVALID) current = INVALID; | ~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/dfs_test.cc:19: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ [ 60%] Linking CXX executable dfs_test cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/cmake -E cmake_link_script CMakeFiles/dfs_test.dir/link.txt --verbose=1 /usr/bin/c++ -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -Wl,-Bsymbolic-functions -Wl,-z,relro -Wl,-z,now -rdynamic CMakeFiles/dfs_test.dir/dfs_test.cc.o -o dfs_test -L/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 60%] Built target dfs_test make -f test/CMakeFiles/kruskal_test.dir/build.make test/CMakeFiles/kruskal_test.dir/depend make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<>/liblemon-1.3.1+dfsg /<>/liblemon-1.3.1+dfsg/test /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test/CMakeFiles/kruskal_test.dir/DependInfo.cmake --color= Scanning dependencies of target kruskal_test make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' make -f test/CMakeFiles/kruskal_test.dir/build.make test/CMakeFiles/kruskal_test.dir/build make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 60%] Building CXX object test/CMakeFiles/kruskal_test.dir/kruskal_test.cc.o cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -I/<>/liblemon-1.3.1+dfsg -I/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -o CMakeFiles/kruskal_test.dir/kruskal_test.cc.o -c /<>/liblemon-1.3.1+dfsg/test/kruskal_test.cc In file included from /<>/liblemon-1.3.1+dfsg/test/kruskal_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/maps.h: In instantiation of ‘void lemon::LoggerBoolMap::set(const Key&, lemon::LoggerBoolMap::Value) [with IT = __gnu_cxx::__normal_iterator >; KEY = lemon::concepts::Digraph::Arc; lemon::LoggerBoolMap::Key = lemon::concepts::Digraph::Arc; lemon::LoggerBoolMap::Value = bool]’: /<>/liblemon-1.3.1+dfsg/lemon/kruskal.h:57:11: required from ‘typename lemon::disable_if, typename In::value_type::second_type>::type lemon::_kruskal_bits::kruskal(const Digraph&, const In&, Out&, lemon::dummy<0>) [with Digraph = lemon::concepts::Digraph; In = std::vector >; Out = lemon::LoggerBoolMap<__gnu_cxx::__normal_iterator >, lemon::concepts::Digraph::Arc>; typename lemon::disable_if, typename In::value_type::second_type>::type = int]’ /<>/liblemon-1.3.1+dfsg/lemon/kruskal.h:228:38: required from ‘static lemon::_kruskal_bits::KruskalOutputSelector, void>::type>::Value lemon::_kruskal_bits::KruskalOutputSelector, void>::type>::kruskal(const Graph&, const In&, Out&) [with Graph = lemon::concepts::Digraph; In = std::vector >; Out = const __gnu_cxx::__normal_iterator >; lemon::_kruskal_bits::KruskalOutputSelector, void>::type>::Value = int]’ /<>/liblemon-1.3.1+dfsg/lemon/kruskal.h:205:18: required from ‘static lemon::_kruskal_bits::KruskalInputSelector, void>::type>::Value lemon::_kruskal_bits::KruskalInputSelector, void>::type>::kruskal(const Graph&, const In&, Out&) [with Graph = lemon::concepts::Digraph; In = lemon::concepts::ReadMap; Out = const __gnu_cxx::__normal_iterator >; lemon::_kruskal_bits::KruskalInputSelector, void>::type>::Value = int]’ /<>/liblemon-1.3.1+dfsg/lemon/kruskal.h:319:14: required from ‘typename lemon::_kruskal_bits::KruskalValueSelector::Value lemon::kruskal(const Graph&, const In&, const Out&) [with Graph = lemon::concepts::Digraph; In = lemon::concepts::ReadMap; Out = __gnu_cxx::__normal_iterator >; typename lemon::_kruskal_bits::KruskalValueSelector::Value = int]’ /<>/liblemon-1.3.1+dfsg/test/kruskal_test.cc:57:27: required from here /<>/liblemon-1.3.1+dfsg/lemon/maps.h:1773:17: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 1773 | *_end++ = key; | ~~~~~~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/kruskal_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/kruskal_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/maps.h: In instantiation of ‘void lemon::LoggerBoolMap::set(const Key&, lemon::LoggerBoolMap::Value) [with IT = __gnu_cxx::__normal_iterator >; KEY = lemon::concepts::Graph::Edge; lemon::LoggerBoolMap::Key = lemon::concepts::Graph::Edge; lemon::LoggerBoolMap::Value = bool]’: /<>/liblemon-1.3.1+dfsg/lemon/kruskal.h:86:11: required from ‘typename lemon::enable_if, typename In::value_type::second_type>::type lemon::_kruskal_bits::kruskal(const Graph&, const In&, Out&, lemon::dummy<1>) [with Graph = lemon::concepts::Graph; In = std::vector >; Out = lemon::LoggerBoolMap<__gnu_cxx::__normal_iterator >, lemon::concepts::Graph::Edge>; typename lemon::enable_if, typename In::value_type::second_type>::type = int]’ /<>/liblemon-1.3.1+dfsg/lemon/kruskal.h:228:38: required from ‘static lemon::_kruskal_bits::KruskalOutputSelector, void>::type>::Value lemon::_kruskal_bits::KruskalOutputSelector, void>::type>::kruskal(const Graph&, const In&, Out&) [with Graph = lemon::concepts::Graph; In = std::vector >; Out = const __gnu_cxx::__normal_iterator >; lemon::_kruskal_bits::KruskalOutputSelector, void>::type>::Value = int]’ /<>/liblemon-1.3.1+dfsg/lemon/kruskal.h:205:18: required from ‘static lemon::_kruskal_bits::KruskalInputSelector, void>::type>::Value lemon::_kruskal_bits::KruskalInputSelector, void>::type>::kruskal(const Graph&, const In&, Out&) [with Graph = lemon::concepts::Graph; In = lemon::concepts::ReadMap; Out = const __gnu_cxx::__normal_iterator >; lemon::_kruskal_bits::KruskalInputSelector, void>::type>::Value = int]’ /<>/liblemon-1.3.1+dfsg/lemon/kruskal.h:319:14: required from ‘typename lemon::_kruskal_bits::KruskalValueSelector::Value lemon::kruskal(const Graph&, const In&, const Out&) [with Graph = lemon::concepts::Graph; In = lemon::concepts::ReadMap; Out = __gnu_cxx::__normal_iterator >; typename lemon::_kruskal_bits::KruskalValueSelector::Value = int]’ /<>/liblemon-1.3.1+dfsg/test/kruskal_test.cc:58:30: required from here /<>/liblemon-1.3.1+dfsg/lemon/maps.h:1773:17: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Edge& lemon::concepts::Graph::Edge::operator=(const lemon::concepts::Graph::Edge&)’ is deprecated [-Wdeprecated-copy] 1773 | *_end++ = key; | ~~~~~~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/kruskal_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:200:9: note: because ‘lemon::concepts::Graph::Edge’ has user-provided ‘lemon::concepts::Graph::Edge::Edge(const lemon::concepts::Graph::Edge&)’ 200 | Edge(const Edge&) { } | ^~~~ [ 61%] Linking CXX executable kruskal_test cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/cmake -E cmake_link_script CMakeFiles/kruskal_test.dir/link.txt --verbose=1 /usr/bin/c++ -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -Wl,-Bsymbolic-functions -Wl,-z,relro -Wl,-z,now -rdynamic CMakeFiles/kruskal_test.dir/kruskal_test.cc.o -o kruskal_test -L/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 61%] Built target kruskal_test make -f test/CMakeFiles/radix_sort_test.dir/build.make test/CMakeFiles/radix_sort_test.dir/depend make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<>/liblemon-1.3.1+dfsg /<>/liblemon-1.3.1+dfsg/test /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test/CMakeFiles/radix_sort_test.dir/DependInfo.cmake --color= Scanning dependencies of target radix_sort_test make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' make -f test/CMakeFiles/radix_sort_test.dir/build.make test/CMakeFiles/radix_sort_test.dir/build make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 62%] Building CXX object test/CMakeFiles/radix_sort_test.dir/radix_sort_test.cc.o cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -I/<>/liblemon-1.3.1+dfsg -I/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -o CMakeFiles/radix_sort_test.dir/radix_sort_test.cc.o -c /<>/liblemon-1.3.1+dfsg/test/radix_sort_test.cc [ 63%] Linking CXX executable radix_sort_test cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/cmake -E cmake_link_script CMakeFiles/radix_sort_test.dir/link.txt --verbose=1 /usr/bin/c++ -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -Wl,-Bsymbolic-functions -Wl,-z,relro -Wl,-z,now -rdynamic CMakeFiles/radix_sort_test.dir/radix_sort_test.cc.o -o radix_sort_test -L/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 63%] Built target radix_sort_test make -f test/CMakeFiles/random_test.dir/build.make test/CMakeFiles/random_test.dir/depend make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<>/liblemon-1.3.1+dfsg /<>/liblemon-1.3.1+dfsg/test /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test/CMakeFiles/random_test.dir/DependInfo.cmake --color= Scanning dependencies of target random_test make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' make -f test/CMakeFiles/random_test.dir/build.make test/CMakeFiles/random_test.dir/build make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 65%] Building CXX object test/CMakeFiles/random_test.dir/random_test.cc.o cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -I/<>/liblemon-1.3.1+dfsg -I/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -o CMakeFiles/random_test.dir/random_test.cc.o -c /<>/liblemon-1.3.1+dfsg/test/random_test.cc [ 66%] Linking CXX executable random_test cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/cmake -E cmake_link_script CMakeFiles/random_test.dir/link.txt --verbose=1 /usr/bin/c++ -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -Wl,-Bsymbolic-functions -Wl,-z,relro -Wl,-z,now -rdynamic CMakeFiles/random_test.dir/random_test.cc.o -o random_test -L/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 66%] Built target random_test make -f test/CMakeFiles/dim_test.dir/build.make test/CMakeFiles/dim_test.dir/depend make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<>/liblemon-1.3.1+dfsg /<>/liblemon-1.3.1+dfsg/test /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test/CMakeFiles/dim_test.dir/DependInfo.cmake --color= Scanning dependencies of target dim_test make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' make -f test/CMakeFiles/dim_test.dir/build.make test/CMakeFiles/dim_test.dir/build make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 67%] Building CXX object test/CMakeFiles/dim_test.dir/dim_test.cc.o cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -I/<>/liblemon-1.3.1+dfsg -I/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -o CMakeFiles/dim_test.dir/dim_test.cc.o -c /<>/liblemon-1.3.1+dfsg/test/dim_test.cc [ 68%] Linking CXX executable dim_test cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/cmake -E cmake_link_script CMakeFiles/dim_test.dir/link.txt --verbose=1 /usr/bin/c++ -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -Wl,-Bsymbolic-functions -Wl,-z,relro -Wl,-z,now -rdynamic CMakeFiles/dim_test.dir/dim_test.cc.o -o dim_test -L/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 68%] Built target dim_test make -f test/CMakeFiles/planarity_test.dir/build.make test/CMakeFiles/planarity_test.dir/depend make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<>/liblemon-1.3.1+dfsg /<>/liblemon-1.3.1+dfsg/test /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test/CMakeFiles/planarity_test.dir/DependInfo.cmake --color= Scanning dependencies of target planarity_test make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' make -f test/CMakeFiles/planarity_test.dir/build.make test/CMakeFiles/planarity_test.dir/build make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 68%] Building CXX object test/CMakeFiles/planarity_test.dir/planarity_test.cc.o cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -I/<>/liblemon-1.3.1+dfsg -I/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -o CMakeFiles/planarity_test.dir/planarity_test.cc.o -c /<>/liblemon-1.3.1+dfsg/test/planarity_test.cc In file included from /usr/include/c++/9/vector:72, from /<>/liblemon-1.3.1+dfsg/lemon/planarity.h:26, from /<>/liblemon-1.3.1+dfsg/test/planarity_test.cc:21: /usr/include/c++/9/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(std::vector<_Tp, _Alloc>::iterator, _Args&& ...) [with _Args = {const lemon::Color&}; _Tp = lemon::Color; _Alloc = std::allocator]’: /usr/include/c++/9/bits/vector.tcc:426:7: note: parameter passing for argument of type ‘std::vector::iterator’ {aka ‘__gnu_cxx::__normal_iterator >’} changed in GCC 7.1 426 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/9/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(std::vector<_Tp, _Alloc>::iterator, _Args&& ...) [with _Args = {lemon::Color}; _Tp = lemon::Color; _Alloc = std::allocator]’: /usr/include/c++/9/bits/vector.tcc:426:7: note: parameter passing for argument of type ‘std::vector::iterator’ {aka ‘__gnu_cxx::__normal_iterator >’} changed in GCC 7.1 /usr/include/c++/9/bits/vector.tcc:426:7: note: parameter passing for argument of type ‘std::vector::iterator’ {aka ‘__gnu_cxx::__normal_iterator >’} changed in GCC 7.1 /usr/include/c++/9/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {lemon::Color}; _Tp = lemon::Color; _Alloc = std::allocator]’: /usr/include/c++/9/bits/vector.tcc:121:4: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator >’ changed in GCC 7.1 121 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ^~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/9/vector:67, from /<>/liblemon-1.3.1+dfsg/lemon/planarity.h:26, from /<>/liblemon-1.3.1+dfsg/test/planarity_test.cc:21: /usr/include/c++/9/bits/stl_vector.h: In constructor ‘lemon::PlanarColoring::PlanarColoring(const Graph&) [with Graph = lemon::SmartGraph]’: /usr/include/c++/9/bits/stl_vector.h:1195:4: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator >’ changed in GCC 7.1 1195 | _M_realloc_insert(end(), __x); | ^~~~~~~~~~~~~~~~~ /usr/include/c++/9/bits/stl_vector.h:1195:4: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator >’ changed in GCC 7.1 1195 | _M_realloc_insert(end(), __x); | ^~~~~~~~~~~~~~~~~ /usr/include/c++/9/bits/stl_vector.h:1195:4: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator >’ changed in GCC 7.1 1195 | _M_realloc_insert(end(), __x); | ^~~~~~~~~~~~~~~~~ /usr/include/c++/9/bits/stl_vector.h:1195:4: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator >’ changed in GCC 7.1 1195 | _M_realloc_insert(end(), __x); | ^~~~~~~~~~~~~~~~~ /usr/include/c++/9/bits/stl_vector.h:1195:4: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator >’ changed in GCC 7.1 1195 | _M_realloc_insert(end(), __x); | ^~~~~~~~~~~~~~~~~ /usr/include/c++/9/bits/stl_vector.h:1195:4: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator >’ changed in GCC 7.1 1195 | _M_realloc_insert(end(), __x); | ^~~~~~~~~~~~~~~~~ [ 69%] Linking CXX executable planarity_test cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/cmake -E cmake_link_script CMakeFiles/planarity_test.dir/link.txt --verbose=1 /usr/bin/c++ -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -Wl,-Bsymbolic-functions -Wl,-z,relro -Wl,-z,now -rdynamic CMakeFiles/planarity_test.dir/planarity_test.cc.o -o planarity_test -L/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 69%] Built target planarity_test make -f test/CMakeFiles/edge_set_test.dir/build.make test/CMakeFiles/edge_set_test.dir/depend make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<>/liblemon-1.3.1+dfsg /<>/liblemon-1.3.1+dfsg/test /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test/CMakeFiles/edge_set_test.dir/DependInfo.cmake --color= Scanning dependencies of target edge_set_test make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' make -f test/CMakeFiles/edge_set_test.dir/build.make test/CMakeFiles/edge_set_test.dir/build make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 71%] Building CXX object test/CMakeFiles/edge_set_test.dir/edge_set_test.cc.o cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -I/<>/liblemon-1.3.1+dfsg -I/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -o CMakeFiles/edge_set_test.dir/edge_set_test.cc.o -c /<>/liblemon-1.3.1+dfsg/test/edge_set_test.cc [ 72%] Linking CXX executable edge_set_test cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/cmake -E cmake_link_script CMakeFiles/edge_set_test.dir/link.txt --verbose=1 /usr/bin/c++ -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -Wl,-Bsymbolic-functions -Wl,-z,relro -Wl,-z,now -rdynamic CMakeFiles/edge_set_test.dir/edge_set_test.cc.o -o edge_set_test -L/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 72%] Built target edge_set_test make -f test/CMakeFiles/matching_test.dir/build.make test/CMakeFiles/matching_test.dir/depend make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<>/liblemon-1.3.1+dfsg /<>/liblemon-1.3.1+dfsg/test /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test/CMakeFiles/matching_test.dir/DependInfo.cmake --color= Scanning dependencies of target matching_test make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' make -f test/CMakeFiles/matching_test.dir/build.make test/CMakeFiles/matching_test.dir/build make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 73%] Building CXX object test/CMakeFiles/matching_test.dir/matching_test.cc.o cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -I/<>/liblemon-1.3.1+dfsg -I/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -o CMakeFiles/matching_test.dir/matching_test.cc.o -c /<>/liblemon-1.3.1+dfsg/test/matching_test.cc /<>/liblemon-1.3.1+dfsg/test/matching_test.cc: In function ‘void checkMaxMatchingCompile()’: /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:143:13: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Edge& lemon::concepts::Graph::Edge::operator=(const lemon::concepts::Graph::Edge&)’ is deprecated [-Wdeprecated-copy] 143 | e = mmap[n]; | ^ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:200:9: note: because ‘lemon::concepts::Graph::Edge’ has user-provided ‘lemon::concepts::Graph::Edge::Edge(const lemon::concepts::Graph::Edge&)’ 200 | Edge(const Edge&) { } | ^~~~ /<>/liblemon-1.3.1+dfsg/test/matching_test.cc: In function ‘void checkMaxWeightedMatchingCompile()’: /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:181:13: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Edge& lemon::concepts::Graph::Edge::operator=(const lemon::concepts::Graph::Edge&)’ is deprecated [-Wdeprecated-copy] 181 | e = mmap[n]; | ^ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:200:9: note: because ‘lemon::concepts::Graph::Edge’ has user-provided ‘lemon::concepts::Graph::Edge::Edge(const lemon::concepts::Graph::Edge&)’ 200 | Edge(const Edge&) { } | ^~~~ /<>/liblemon-1.3.1+dfsg/test/matching_test.cc: In function ‘void checkMaxWeightedPerfectMatchingCompile()’: /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:217:13: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Edge& lemon::concepts::Graph::Edge::operator=(const lemon::concepts::Graph::Edge&)’ is deprecated [-Wdeprecated-copy] 217 | e = mmap[n]; | ^ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:200:9: note: because ‘lemon::concepts::Graph::Edge’ has user-provided ‘lemon::concepts::Graph::Edge::Edge(const lemon::concepts::Graph::Edge&)’ 200 | Edge(const Edge&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h: In instantiation of ‘void lemon::MaxMatching::init() [with GR = lemon::concepts::Graph]’: /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:131:17: required from here /<>/liblemon-1.3.1+dfsg/lemon/matching.h:437:25: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 437 | (*_matching)[n] = INVALID; | ~~~~~~~~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h: In instantiation of ‘void lemon::MaxMatching::greedyInit() [with GR = lemon::concepts::Graph]’: /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:132:23: required from here /<>/liblemon-1.3.1+dfsg/lemon/matching.h:448:25: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 448 | (*_matching)[n] = INVALID; | ~~~~~~~~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:456:31: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 456 | (*_matching)[n] = a; | ~~~~~~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:458:31: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 458 | (*_matching)[v] = _graph.oppositeArc(a); In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h: In instantiation of ‘bool lemon::MaxMatching::matchingInit(const MatchingMap&) [with MatchingMap = lemon::concepts::Graph::EdgeMap; GR = lemon::concepts::Graph]’: /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:133:28: required from here /<>/liblemon-1.3.1+dfsg/lemon/matching.h:479:25: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 479 | (*_matching)[n] = INVALID; | ~~~~~~~~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:487:27: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 487 | (*_matching)[u] = _graph.direct(e, true); In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:492:27: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 492 | (*_matching)[v] = _graph.direct(e, false); In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h: In instantiation of ‘void lemon::MaxMatching::startSparse() [with GR = lemon::concepts::Graph]’: /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:134:24: required from here /<>/liblemon-1.3.1+dfsg/lemon/matching.h:508:52: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 508 | (*_blossom_rep)[_blossom_set->insert(n)] = n; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h: In instantiation of ‘void lemon::MaxMatching::startDense() [with GR = lemon::concepts::Graph]’: /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:135:23: required from here /<>/liblemon-1.3.1+dfsg/lemon/matching.h:527:52: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 527 | (*_blossom_rep)[_blossom_set->insert(n)] = n; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h: In instantiation of ‘void lemon::MaxWeightedMatching::init() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’: /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:171:17: required from here /<>/liblemon-1.3.1+dfsg/lemon/matching.h:1656:40: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 1656 | (*_blossom_data)[blossom].pred = INVALID; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:1657:40: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 1657 | (*_blossom_data)[blossom].next = INVALID; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h: In instantiation of ‘void lemon::MaxWeightedPerfectMatching::init() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’: /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:208:17: required from here /<>/liblemon-1.3.1+dfsg/lemon/matching.h:3073:40: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 3073 | (*_blossom_data)[blossom].pred = INVALID; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:3074:40: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 3074 | (*_blossom_data)[blossom].next = INVALID; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/matching.h:28, from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/unionfind.h: In instantiation of ‘int lemon::UnionFindEnum::insert(const Item&) [with IM = lemon::concepts::Graph::NodeMap; lemon::UnionFindEnum::Item = lemon::concepts::Graph::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:508:26: required from ‘void lemon::MaxMatching::startSparse() [with GR = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:134:24: required from here /<>/liblemon-1.3.1+dfsg/lemon/unionfind.h:328:23: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 328 | items[idx].item = item; | ~~~~~~~~~~~~~~~~^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/matching.h:28, from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/unionfind.h: In instantiation of ‘int lemon::ExtendFindEnum::insert(const Item&) [with IM = lemon::concepts::Graph::NodeMap; lemon::ExtendFindEnum::Item = lemon::concepts::Graph::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:509:11: required from ‘void lemon::MaxMatching::startSparse() [with GR = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:134:24: required from here /<>/liblemon-1.3.1+dfsg/lemon/unionfind.h:708:23: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 708 | items[idx].item = item; | ~~~~~~~~~~~~~~~~^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h: In instantiation of ‘void lemon::MaxMatching::processSparse(const Node&) [with GR = lemon::concepts::Graph; lemon::MaxMatching::Node = lemon::concepts::Graph::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:511:11: required from ‘void lemon::MaxMatching::startSparse() [with GR = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:134:24: required from here /<>/liblemon-1.3.1+dfsg/lemon/matching.h:217:28: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 217 | _node_queue[_last++] = n; | ~~~~~~~~~~~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h: In instantiation of ‘void lemon::MaxMatching::processDense(const Node&) [with GR = lemon::concepts::Graph; lemon::MaxMatching::Node = lemon::concepts::Graph::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:530:11: required from ‘void lemon::MaxMatching::startDense() [with GR = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:135:23: required from here /<>/liblemon-1.3.1+dfsg/lemon/matching.h:172:28: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 172 | _node_queue[_last++] = n; | ~~~~~~~~~~~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/matching.h:28, from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/unionfind.h: In instantiation of ‘int lemon::HeapUnionFind::insert(const Item&, const Value&) [with V = int; IM = lemon::concepts::Graph::NodeMap; Comp = std::less; lemon::HeapUnionFind::Item = lemon::concepts::Graph::Node; lemon::HeapUnionFind::Value = int]’: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:1650:13: required from ‘void lemon::MaxWeightedMatching::init() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:171:17: required from here /<>/liblemon-1.3.1+dfsg/lemon/unionfind.h:1308:22: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1308 | nodes[id].item = item; | ~~~~~~~~~~~~~~~^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/matching.h:28, from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/unionfind.h:1318:22: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1318 | nodes[id].item = item; | ~~~~~~~~~~~~~~~^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h: In instantiation of ‘void lemon::MaxWeightedMatching::unmatchNode(const Node&) [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap; lemon::MaxWeightedMatching::Node = lemon::concepts::Graph::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:1854:13: required from ‘void lemon::MaxWeightedMatching::start() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:172:18: required from here /<>/liblemon-1.3.1+dfsg/lemon/matching.h:1210:38: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1210 | (*_blossom_data)[blossom].base = node; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:1211:38: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 1211 | (*_blossom_data)[blossom].next = INVALID; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h: In instantiation of ‘void lemon::MaxWeightedMatching::augmentOnArc(const Arc&) [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap; lemon::MaxWeightedMatching::Arc = lemon::concepts::Graph::Arc]’: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:1864:15: required from ‘void lemon::MaxWeightedMatching::start() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:172:18: required from here /<>/liblemon-1.3.1+dfsg/lemon/matching.h:1242:35: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 1242 | (*_blossom_data)[left].next = arc; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:1243:36: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 1243 | (*_blossom_data)[right].next = _graph.oppositeArc(arc); In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h: In instantiation of ‘void lemon::MaxWeightedMatching::extendOnArc(const Arc&) [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap; lemon::MaxWeightedMatching::Arc = lemon::concepts::Graph::Arc]’: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:1867:15: required from ‘void lemon::MaxWeightedMatching::start() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:172:18: required from here /<>/liblemon-1.3.1+dfsg/lemon/matching.h:1254:34: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 1254 | (*_blossom_data)[odd].pred = arc; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:1257:35: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 1257 | (*_blossom_data)[even].pred = (*_blossom_data)[even].next; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h: In instantiation of ‘void lemon::MaxWeightedMatching::shrinkOnEdge(const Edge&, int) [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap; lemon::MaxWeightedMatching::Edge = lemon::concepts::Graph::Edge]’: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:1885:17: required from ‘void lemon::MaxWeightedMatching::start() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:172:18: required from here /<>/liblemon-1.3.1+dfsg/lemon/matching.h:1341:12: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 1341 | prev = _graph.direct(edge, true); In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:1344:45: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 1344 | (*_blossom_data)[left_path[i]].next = prev; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:1351:14: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 1351 | prev = _graph.oppositeArc((*_blossom_data)[left_path[i + 1]].pred); In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:1358:34: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 1358 | (*_blossom_data)[nca].next = prev; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:1366:50: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 1366 | (*_blossom_data)[right_path[i + 1]].next = | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 1367 | (*_blossom_data)[right_path[i + 1]].pred; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:1386:38: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 1386 | (*_blossom_data)[surface].pred = (*_blossom_data)[nca].pred; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:1387:38: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 1387 | (*_blossom_data)[surface].next = (*_blossom_data)[nca].pred; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h: In instantiation of ‘void lemon::MaxWeightedMatching::augmentOnEdge(const Edge&) [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap; lemon::MaxWeightedMatching::Edge = lemon::concepts::Graph::Edge]’: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:1887:17: required from ‘void lemon::MaxWeightedMatching::start() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:172:18: required from here /<>/liblemon-1.3.1+dfsg/lemon/matching.h:1227:35: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 1227 | (*_blossom_data)[left].next = _graph.direct(edge, true); In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:1228:36: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 1228 | (*_blossom_data)[right].next = _graph.direct(edge, false); In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h: In instantiation of ‘void lemon::MaxWeightedMatching::splitBlossom(int) [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:1893:11: required from ‘void lemon::MaxWeightedMatching::start() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:172:18: required from here /<>/liblemon-1.3.1+dfsg/lemon/matching.h:1434:37: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 1434 | (*_blossom_data)[sb].next = In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:1446:37: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 1446 | (*_blossom_data)[sb].pred = pred; | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:1447:37: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 1447 | (*_blossom_data)[sb].next = In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:1450:16: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 1450 | pred = (*_blossom_data)[ub].next; | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:1455:37: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 1455 | (*_blossom_data)[tb].pred = (*_blossom_data)[tb].next; | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:1461:48: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 1461 | (*_blossom_data)[subblossoms[id]].next = next; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:1462:48: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 1462 | (*_blossom_data)[subblossoms[id]].pred = pred; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:1470:37: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 1470 | (*_blossom_data)[sb].next = In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:1482:37: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 1482 | (*_blossom_data)[sb].next = next; | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:1483:37: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 1483 | (*_blossom_data)[sb].pred = In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:1490:39: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 1490 | (*_blossom_data)[tb].next = In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:1489:37: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 1489 | (*_blossom_data)[tb].pred = In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:1492:16: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 1492 | next = (*_blossom_data)[ub].next; | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:1498:48: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 1498 | (*_blossom_data)[subblossoms[ib]].next = next; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:1499:48: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 1499 | (*_blossom_data)[subblossoms[ib]].pred = pred; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h: In instantiation of ‘void lemon::MaxWeightedMatching::fractionalInit() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:1910:7: required from ‘void lemon::MaxWeightedMatching::run() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:173:16: required from here /<>/liblemon-1.3.1+dfsg/lemon/matching.h:1721:40: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 1721 | (*_blossom_data)[blossom].pred = INVALID; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:1722:40: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 1722 | (*_blossom_data)[blossom].next = _fractional->matching(n); In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:1724:42: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1724 | (*_blossom_data)[blossom].base = n; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:1740:13: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1740 | v = _graph.target(_fractional->matching(v)); In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:1749:13: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1749 | v = _graph.target(_fractional->matching(n)); In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:1753:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1753 | v = _graph.target(_fractional->matching(v)); In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:1759:42: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 1759 | (*_blossom_data)[surface].pred = INVALID; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:1760:42: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 1760 | (*_blossom_data)[surface].next = INVALID; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:1805:28: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 1805 | it->second = e; | ~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h: In instantiation of ‘void lemon::MaxWeightedPerfectMatching::extendOnArc(const Arc&) [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap; lemon::MaxWeightedPerfectMatching::Arc = lemon::concepts::Graph::Arc]’: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:3269:13: required from ‘bool lemon::MaxWeightedPerfectMatching::start() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:209:18: required from here /<>/liblemon-1.3.1+dfsg/lemon/matching.h:2682:34: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 2682 | (*_blossom_data)[odd].pred = arc; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:2685:35: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 2685 | (*_blossom_data)[even].pred = (*_blossom_data)[even].next; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h: In instantiation of ‘void lemon::MaxWeightedPerfectMatching::shrinkOnEdge(const Edge&, int) [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap; lemon::MaxWeightedPerfectMatching::Edge = lemon::concepts::Graph::Edge]’: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:3286:17: required from ‘bool lemon::MaxWeightedPerfectMatching::start() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:209:18: required from here /<>/liblemon-1.3.1+dfsg/lemon/matching.h:2769:12: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 2769 | prev = _graph.direct(edge, true); In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:2772:45: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 2772 | (*_blossom_data)[left_path[i]].next = prev; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:2779:14: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 2779 | prev = _graph.oppositeArc((*_blossom_data)[left_path[i + 1]].pred); In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:2786:34: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 2786 | (*_blossom_data)[nca].next = prev; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:2794:50: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 2794 | (*_blossom_data)[right_path[i + 1]].next = | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 2795 | (*_blossom_data)[right_path[i + 1]].pred; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:2814:38: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 2814 | (*_blossom_data)[surface].pred = (*_blossom_data)[nca].pred; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:2815:38: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 2815 | (*_blossom_data)[surface].next = (*_blossom_data)[nca].pred; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h: In instantiation of ‘void lemon::MaxWeightedPerfectMatching::augmentOnEdge(const Edge&) [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap; lemon::MaxWeightedPerfectMatching::Edge = lemon::concepts::Graph::Edge]’: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:3288:17: required from ‘bool lemon::MaxWeightedPerfectMatching::start() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:209:18: required from here /<>/liblemon-1.3.1+dfsg/lemon/matching.h:2670:35: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 2670 | (*_blossom_data)[left].next = _graph.direct(edge, true); In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:2671:36: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 2671 | (*_blossom_data)[right].next = _graph.direct(edge, false); In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h: In instantiation of ‘void lemon::MaxWeightedPerfectMatching::splitBlossom(int) [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:3294:11: required from ‘bool lemon::MaxWeightedPerfectMatching::start() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:209:18: required from here /<>/liblemon-1.3.1+dfsg/lemon/matching.h:2862:37: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 2862 | (*_blossom_data)[sb].next = In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:2874:37: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 2874 | (*_blossom_data)[sb].pred = pred; | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:2875:37: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 2875 | (*_blossom_data)[sb].next = In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:2878:16: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 2878 | pred = (*_blossom_data)[ub].next; | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:2883:37: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 2883 | (*_blossom_data)[tb].pred = (*_blossom_data)[tb].next; | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:2889:48: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 2889 | (*_blossom_data)[subblossoms[id]].next = next; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:2890:48: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 2890 | (*_blossom_data)[subblossoms[id]].pred = pred; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:2898:37: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 2898 | (*_blossom_data)[sb].next = In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:2910:37: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 2910 | (*_blossom_data)[sb].next = next; | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:2911:37: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 2911 | (*_blossom_data)[sb].pred = In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:2918:39: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 2918 | (*_blossom_data)[tb].next = In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:2917:37: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 2917 | (*_blossom_data)[tb].pred = In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:2920:16: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 2920 | next = (*_blossom_data)[ub].next; | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:2926:48: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 2926 | (*_blossom_data)[subblossoms[ib]].next = next; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:2927:48: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 2927 | (*_blossom_data)[subblossoms[ib]].pred = pred; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h: In instantiation of ‘void lemon::MaxWeightedPerfectMatching::fractionalInit() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:3312:7: required from ‘bool lemon::MaxWeightedPerfectMatching::run() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:210:16: required from here /<>/liblemon-1.3.1+dfsg/lemon/matching.h:3137:40: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 3137 | (*_blossom_data)[blossom].pred = INVALID; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:3138:40: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 3138 | (*_blossom_data)[blossom].next = _fractional->matching(n); In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:3153:13: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 3153 | v = _graph.target(_fractional->matching(v)); In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:3161:13: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 3161 | v = _graph.target(_fractional->matching(n)); In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:3164:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 3164 | v = _graph.target(_fractional->matching(v)); In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:3170:42: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 3170 | (*_blossom_data)[surface].pred = INVALID; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:3171:42: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 3171 | (*_blossom_data)[surface].next = INVALID; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:3216:28: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 3216 | it->second = e; | ~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h: In instantiation of ‘void lemon::MaxMatching::shrinkOnEdge(const Edge&) [with GR = lemon::concepts::Graph; lemon::MaxMatching::Edge = lemon::concepts::Graph::Edge]’: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:225:15: required from ‘void lemon::MaxMatching::processSparse(const Node&) [with GR = lemon::concepts::Graph; lemon::MaxMatching::Node = lemon::concepts::Graph::Node]’ /<>/liblemon-1.3.1+dfsg/lemon/matching.h:511:11: required from ‘void lemon::MaxMatching::startSparse() [with GR = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:134:24: required from here /<>/liblemon-1.3.1+dfsg/lemon/matching.h:251:16: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 251 | left = _graph.target((*_matching)[left]); In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:252:16: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 252 | left = (*_blossom_rep)[_blossom_set-> | ~~~~~^~~~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:255:17: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 255 | nca = left; | ~~~~^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:261:17: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 261 | right = _graph.target((*_matching)[right]); In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:262:17: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 262 | right = (*_blossom_rep)[_blossom_set-> | ~~~~~~^~~~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:265:17: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 265 | nca = right; | ~~~~^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:273:17: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 273 | nca = right; | ~~~~^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:275:19: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 275 | nca = _graph.target((*_matching)[nca]); In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:276:19: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 276 | nca =(*_blossom_rep)[_blossom_set-> | ~~~~^~~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:280:17: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 280 | nca = left; | ~~~~^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:282:19: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 282 | nca = _graph.target((*_matching)[nca]); In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:283:19: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 283 | nca = (*_blossom_rep)[_blossom_set-> | ~~~~^~~~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:297:25: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 297 | (*_ear)[node] = arc; | ~~~~~~~~~~~~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:301:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 301 | n = _graph.target((*_matching)[n]); In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:303:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 303 | n = _graph.target(a); In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:304:24: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 304 | (*_ear)[n] = _graph.oppositeArc(a); In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:306:16: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 306 | node = _graph.target((*_matching)[base]); In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:311:32: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 311 | _node_queue[_last++] = node; | ~~~~~~~~~~~~~~~~~~~~~^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:312:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 312 | arc = _graph.oppositeArc((*_ear)[node]); In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:313:16: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 313 | node = _graph.target((*_ear)[node]); In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:314:16: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 314 | base = (*_blossom_rep)[_blossom_set->find(node)]; | ~~~~~^~~~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:319:48: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 319 | (*_blossom_rep)[_blossom_set->find(nca)] = nca; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:328:25: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 328 | (*_ear)[node] = arc; | ~~~~~~~~~~~~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:332:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 332 | n = _graph.target((*_matching)[n]); In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:334:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 334 | n = _graph.target(a); In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:335:24: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 335 | (*_ear)[n] = _graph.oppositeArc(a); In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:337:16: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 337 | node = _graph.target((*_matching)[base]); In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:342:32: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 342 | _node_queue[_last++] = node; | ~~~~~~~~~~~~~~~~~~~~~^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:343:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 343 | arc = _graph.oppositeArc((*_ear)[node]); In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:344:16: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 344 | node = _graph.target((*_ear)[node]); In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:345:16: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 345 | base = (*_blossom_rep)[_blossom_set->find(node)]; | ~~~~~^~~~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:350:48: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 350 | (*_blossom_rep)[_blossom_set->find(nca)] = nca; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h: In instantiation of ‘void lemon::MaxMatching::extendOnArc(const Arc&) [with GR = lemon::concepts::Graph; lemon::MaxMatching::Arc = lemon::concepts::Graph::Arc]’: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:228:13: required from ‘void lemon::MaxMatching::processSparse(const Node&) [with GR = lemon::concepts::Graph; lemon::MaxMatching::Node = lemon::concepts::Graph::Node]’ /<>/liblemon-1.3.1+dfsg/lemon/matching.h:511:11: required from ‘void lemon::MaxMatching::startSparse() [with GR = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:134:24: required from here /<>/liblemon-1.3.1+dfsg/lemon/matching.h:357:20: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 357 | (*_ear)[odd] = _graph.oppositeArc(a); In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:359:51: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 359 | (*_blossom_rep)[_blossom_set->insert(even)] = even; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:365:28: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 365 | _node_queue[_last++] = even; | ~~~~~~~~~~~~~~~~~~~~~^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h: In instantiation of ‘void lemon::MaxMatching::augmentOnArc(const Arc&) [with GR = lemon::concepts::Graph; lemon::MaxMatching::Arc = lemon::concepts::Graph::Arc]’: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:230:13: required from ‘void lemon::MaxMatching::processSparse(const Node&) [with GR = lemon::concepts::Graph; lemon::MaxMatching::Node = lemon::concepts::Graph::Node]’ /<>/liblemon-1.3.1+dfsg/lemon/matching.h:511:11: required from ‘void lemon::MaxMatching::startSparse() [with GR = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:134:24: required from here /<>/liblemon-1.3.1+dfsg/lemon/matching.h:375:25: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 375 | (*_matching)[odd] = _graph.oppositeArc(a); In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:379:26: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 379 | (*_matching)[even] = a; | ~~~~~~~~~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:382:13: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 382 | odd = _graph.target(arc); In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:383:13: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 383 | arc = (*_ear)[odd]; | ~~~~^~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:384:14: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 384 | even = _graph.target(arc); In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:385:27: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 385 | (*_matching)[odd] = arc; | ~~~~~~~~~~~~~~~~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:386:13: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 386 | arc = (*_matching)[even]; | ~~~~^~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:387:28: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 387 | (*_matching)[even] = _graph.oppositeArc((*_matching)[odd]); In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h: In instantiation of ‘void lemon::MaxWeightedMatching::alternatePath(int, int) [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:1207:7: required from ‘void lemon::MaxWeightedMatching::unmatchNode(const Node&) [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap; lemon::MaxWeightedMatching::Node = lemon::concepts::Graph::Node]’ /<>/liblemon-1.3.1+dfsg/lemon/matching.h:1854:13: required from ‘void lemon::MaxWeightedMatching::start() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:172:18: required from here /<>/liblemon-1.3.1+dfsg/lemon/matching.h:1178:36: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 1178 | (*_blossom_data)[odd].next = (*_blossom_data)[odd].pred; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:1183:37: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 1183 | (*_blossom_data)[even].next = In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h: In instantiation of ‘void lemon::MaxWeightedMatching::matchedToEven(int, int) [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:1260:7: required from ‘void lemon::MaxWeightedMatching::extendOnArc(const Arc&) [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap; lemon::MaxWeightedMatching::Arc = lemon::concepts::Graph::Arc]’ /<>/liblemon-1.3.1+dfsg/lemon/matching.h:1867:15: required from ‘void lemon::MaxWeightedMatching::start() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:172:18: required from here /<>/liblemon-1.3.1+dfsg/lemon/matching.h:954:28: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 954 | it->second = e; | ~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h: In instantiation of ‘void lemon::MaxWeightedMatching::oddToEven(int, int) [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:1349:9: required from ‘void lemon::MaxWeightedMatching::shrinkOnEdge(const Edge&, int) [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap; lemon::MaxWeightedMatching::Edge = lemon::concepts::Graph::Edge]’ /<>/liblemon-1.3.1+dfsg/lemon/matching.h:1885:17: required from ‘void lemon::MaxWeightedMatching::start() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:172:18: required from here /<>/liblemon-1.3.1+dfsg/lemon/matching.h:1141:28: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 1141 | it->second = e; | ~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/matching.h:28, from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/unionfind.h: In instantiation of ‘int lemon::HeapUnionFind::join(Iterator, Iterator) [with Iterator = __gnu_cxx::__normal_iterator >; V = int; IM = lemon::concepts::Graph::NodeMap; Comp = std::less]’: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:1373:11: required from ‘void lemon::MaxWeightedMatching::shrinkOnEdge(const Edge&, int) [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap; lemon::MaxWeightedMatching::Edge = lemon::concepts::Graph::Edge]’ /<>/liblemon-1.3.1+dfsg/lemon/matching.h:1885:17: required from ‘void lemon::MaxWeightedMatching::start() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:172:18: required from here /<>/liblemon-1.3.1+dfsg/lemon/unionfind.h:1419:36: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1419 | nodes[new_id].item = nodes[~classes[r].parent].item; | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/matching.h:28, from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/unionfind.h:1422:36: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1422 | nodes[new_id].item = nodes[right_id].item; | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/matching.h:28, from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/unionfind.h:1445:32: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1445 | nodes[id].item = nodes[~(classes[r].parent)].item; | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/matching.h:28, from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/unionfind.h:1466:36: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1466 | nodes[new_id].item = nodes[~classes[l].parent].item; | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/matching.h:28, from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/unionfind.h:1469:36: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1469 | nodes[new_id].item = nodes[left_id].item; | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/matching.h:28, from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/unionfind.h:1493:32: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1493 | nodes[id].item = nodes[~(classes[l].parent)].item; | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/matching.h:28, from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/unionfind.h:1509:50: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1509 | nodes[~(classes[l].parent)].item = | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 1510 | nodes[~(classes[r].parent)].item; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h: In instantiation of ‘void lemon::MaxWeightedMatching::extractBlossom(int, const Node&, const Arc&) [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap; lemon::MaxWeightedMatching::Node = lemon::concepts::Graph::Node; lemon::MaxWeightedMatching::Arc = lemon::concepts::Graph::Arc]’: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:1559:11: required from ‘void lemon::MaxWeightedMatching::extractMatching() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/lemon/matching.h:1897:7: required from ‘void lemon::MaxWeightedMatching::start() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:172:18: required from here /<>/liblemon-1.3.1+dfsg/lemon/matching.h:1509:28: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 1509 | (*_matching)[base] = matching; | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/matching.h:29, from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/bin_heap.h: In instantiation of ‘void lemon::BinHeap::replace(const Item&, const Item&) [with PR = int; IM = lemon::concepts::Graph::ArcMap; CMP = std::less; lemon::BinHeap::Item = lemon::concepts::Graph::Arc]’: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:1803:17: required from ‘void lemon::MaxWeightedMatching::fractionalInit() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/lemon/matching.h:1910:7: required from ‘void lemon::MaxWeightedMatching::run() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:173:16: required from here /<>/liblemon-1.3.1+dfsg/lemon/bin_heap.h:340:24: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 340 | _data[idx].first = j; | ~~~~~~~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/matching.h:28, from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/unionfind.h: In instantiation of ‘void lemon::HeapUnionFind::decrease(const Item&, const Value&) [with V = int; IM = lemon::concepts::Graph::NodeMap; Comp = std::less; lemon::HeapUnionFind::Item = lemon::concepts::Graph::Node; lemon::HeapUnionFind::Value = int]’: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:1815:11: required from ‘void lemon::MaxWeightedMatching::fractionalInit() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/lemon/matching.h:1910:7: required from ‘void lemon::MaxWeightedMatching::run() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:173:16: required from here /<>/liblemon-1.3.1+dfsg/lemon/unionfind.h:1657:24: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1657 | nodes[kd].item = item; | ~~~~~~~~~~~~~~~^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h: In instantiation of ‘void lemon::MaxWeightedPerfectMatching::matchedToEven(int, int) [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:2688:7: required from ‘void lemon::MaxWeightedPerfectMatching::extendOnArc(const Arc&) [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap; lemon::MaxWeightedPerfectMatching::Arc = lemon::concepts::Graph::Arc]’ /<>/liblemon-1.3.1+dfsg/lemon/matching.h:3269:13: required from ‘bool lemon::MaxWeightedPerfectMatching::start() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:209:18: required from here /<>/liblemon-1.3.1+dfsg/lemon/matching.h:2413:28: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 2413 | it->second = e; | ~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h: In instantiation of ‘void lemon::MaxWeightedPerfectMatching::oddToEven(int, int) [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:2777:9: required from ‘void lemon::MaxWeightedPerfectMatching::shrinkOnEdge(const Edge&, int) [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap; lemon::MaxWeightedPerfectMatching::Edge = lemon::concepts::Graph::Edge]’ /<>/liblemon-1.3.1+dfsg/lemon/matching.h:3286:17: required from ‘bool lemon::MaxWeightedPerfectMatching::start() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:209:18: required from here /<>/liblemon-1.3.1+dfsg/lemon/matching.h:2596:28: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 2596 | it->second = e; | ~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h: In instantiation of ‘void lemon::MaxWeightedPerfectMatching::alternatePath(int, int) [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:2663:7: required from ‘void lemon::MaxWeightedPerfectMatching::augmentOnEdge(const Edge&) [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap; lemon::MaxWeightedPerfectMatching::Edge = lemon::concepts::Graph::Edge]’ /<>/liblemon-1.3.1+dfsg/lemon/matching.h:3288:17: required from ‘bool lemon::MaxWeightedPerfectMatching::start() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:209:18: required from here /<>/liblemon-1.3.1+dfsg/lemon/matching.h:2633:36: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 2633 | (*_blossom_data)[odd].next = (*_blossom_data)[odd].pred; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:2638:37: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 2638 | (*_blossom_data)[even].next = In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h: In instantiation of ‘void lemon::MaxWeightedPerfectMatching::extractBlossom(int, const Node&, const Arc&) [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap; lemon::MaxWeightedPerfectMatching::Node = lemon::concepts::Graph::Node; lemon::MaxWeightedPerfectMatching::Arc = lemon::concepts::Graph::Arc]’: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:2986:9: required from ‘void lemon::MaxWeightedPerfectMatching::extractMatching() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/lemon/matching.h:3298:7: required from ‘bool lemon::MaxWeightedPerfectMatching::start() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:209:18: required from here /<>/liblemon-1.3.1+dfsg/lemon/matching.h:2937:28: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 2937 | (*_matching)[base] = matching; | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/matching.h:28, from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/unionfind.h: In instantiation of ‘void lemon::UnionFindEnum::insert(const Item&, int) [with IM = lemon::concepts::Graph::NodeMap; lemon::UnionFindEnum::Item = lemon::concepts::Graph::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:309:11: required from ‘void lemon::MaxMatching::shrinkOnEdge(const Edge&) [with GR = lemon::concepts::Graph; lemon::MaxMatching::Edge = lemon::concepts::Graph::Edge]’ /<>/liblemon-1.3.1+dfsg/lemon/matching.h:225:15: required from ‘void lemon::MaxMatching::processSparse(const Node&) [with GR = lemon::concepts::Graph; lemon::MaxMatching::Node = lemon::concepts::Graph::Node]’ /<>/liblemon-1.3.1+dfsg/lemon/matching.h:511:11: required from ‘void lemon::MaxMatching::startSparse() [with GR = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:134:24: required from here /<>/liblemon-1.3.1+dfsg/lemon/unionfind.h:355:23: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 355 | items[idx].item = item; | ~~~~~~~~~~~~~~~~^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/matching.h:28, from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/unionfind.h: In instantiation of ‘void lemon::ExtendFindEnum::insert(const Item&, int) [with IM = lemon::concepts::Graph::NodeMap; lemon::ExtendFindEnum::Item = lemon::concepts::Graph::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:363:7: required from ‘void lemon::MaxMatching::extendOnArc(const Arc&) [with GR = lemon::concepts::Graph; lemon::MaxMatching::Arc = lemon::concepts::Graph::Arc]’ /<>/liblemon-1.3.1+dfsg/lemon/matching.h:228:13: required from ‘void lemon::MaxMatching::processSparse(const Node&) [with GR = lemon::concepts::Graph; lemon::MaxMatching::Node = lemon::concepts::Graph::Node]’ /<>/liblemon-1.3.1+dfsg/lemon/matching.h:511:11: required from ‘void lemon::MaxMatching::startSparse() [with GR = lemon::concepts::Graph]’ /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:134:24: required from here /<>/liblemon-1.3.1+dfsg/lemon/unionfind.h:726:23: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 726 | items[idx].item = item; | ~~~~~~~~~~~~~~~~^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h: In instantiation of ‘void lemon::MaxWeightedMatching::evenToMatched(int, int) [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:1171:7: required from ‘void lemon::MaxWeightedMatching::alternatePath(int, int) [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/lemon/matching.h:1207:7: required from ‘void lemon::MaxWeightedMatching::unmatchNode(const Node&) [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap; lemon::MaxWeightedMatching::Node = lemon::concepts::Graph::Node]’ /<>/liblemon-1.3.1+dfsg/lemon/matching.h:1854:13: required from ‘void lemon::MaxWeightedMatching::start() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:172:18: required from here /<>/liblemon-1.3.1+dfsg/lemon/matching.h:1035:30: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 1035 | it->second = r; | ~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/matching.h:28, from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/unionfind.h: In instantiation of ‘void lemon::HeapUnionFind::setPrio(int) [with V = int; IM = lemon::concepts::Graph::NodeMap; Comp = std::less]’: /<>/liblemon-1.3.1+dfsg/lemon/unionfind.h:1413:17: required from ‘int lemon::HeapUnionFind::join(Iterator, Iterator) [with Iterator = __gnu_cxx::__normal_iterator >; V = int; IM = lemon::concepts::Graph::NodeMap; Comp = std::less]’ /<>/liblemon-1.3.1+dfsg/lemon/matching.h:1373:11: required from ‘void lemon::MaxWeightedMatching::shrinkOnEdge(const Edge&, int) [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap; lemon::MaxWeightedMatching::Edge = lemon::concepts::Graph::Edge]’ /<>/liblemon-1.3.1+dfsg/lemon/matching.h:1885:17: required from ‘void lemon::MaxWeightedMatching::start() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:172:18: required from here /<>/liblemon-1.3.1+dfsg/lemon/unionfind.h:1072:22: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1072 | nodes[id].item = nodes[jd].item; | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/matching.h:28, from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/unionfind.h:1077:26: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1077 | nodes[id].item = nodes[jd].item; | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/matching.h:28, from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/unionfind.h: In instantiation of ‘void lemon::HeapUnionFind::repairRight(int) [with V = int; IM = lemon::concepts::Graph::NodeMap; Comp = std::less]’: /<>/liblemon-1.3.1+dfsg/lemon/unionfind.h:1609:11: required from ‘void lemon::HeapUnionFind::split(int, Iterator) [with Iterator = std::back_insert_iterator >; V = int; IM = lemon::concepts::Graph::NodeMap; Comp = std::less]’ /<>/liblemon-1.3.1+dfsg/lemon/matching.h:1406:7: required from ‘void lemon::MaxWeightedMatching::splitBlossom(int) [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/lemon/matching.h:1893:11: required from ‘void lemon::MaxWeightedMatching::start() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:172:18: required from here /<>/liblemon-1.3.1+dfsg/lemon/unionfind.h:1233:44: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1233 | nodes[nodes[jd].prev].item = nodes[jd].item; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/matching.h:28, from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/unionfind.h:1244:32: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1244 | nodes[jd].item = nodes[ld].item; | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/matching.h:28, from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/unionfind.h: In instantiation of ‘void lemon::HeapUnionFind::repairLeft(int) [with V = int; IM = lemon::concepts::Graph::NodeMap; Comp = std::less]’: /<>/liblemon-1.3.1+dfsg/lemon/unionfind.h:1610:11: required from ‘void lemon::HeapUnionFind::split(int, Iterator) [with Iterator = std::back_insert_iterator >; V = int; IM = lemon::concepts::Graph::NodeMap; Comp = std::less]’ /<>/liblemon-1.3.1+dfsg/lemon/matching.h:1406:7: required from ‘void lemon::MaxWeightedMatching::splitBlossom(int) [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/lemon/matching.h:1893:11: required from ‘void lemon::MaxWeightedMatching::start() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:172:18: required from here /<>/liblemon-1.3.1+dfsg/lemon/unionfind.h:1189:44: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1189 | nodes[nodes[jd].next].item = nodes[jd].item; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/matching.h:28, from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/unionfind.h:1200:32: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1200 | nodes[jd].item = nodes[ld].item; | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/matching.h: In instantiation of ‘void lemon::MaxWeightedPerfectMatching::evenToMatched(int, int) [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’: /<>/liblemon-1.3.1+dfsg/lemon/matching.h:2626:7: required from ‘void lemon::MaxWeightedPerfectMatching::alternatePath(int, int) [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/lemon/matching.h:2663:7: required from ‘void lemon::MaxWeightedPerfectMatching::augmentOnEdge(const Edge&) [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap; lemon::MaxWeightedPerfectMatching::Edge = lemon::concepts::Graph::Edge]’ /<>/liblemon-1.3.1+dfsg/lemon/matching.h:3288:17: required from ‘bool lemon::MaxWeightedPerfectMatching::start() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:209:18: required from here /<>/liblemon-1.3.1+dfsg/lemon/matching.h:2492:30: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 2492 | it->second = r; | ~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/bits/map_extender.h:27, from /<>/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:24, from /<>/liblemon-1.3.1+dfsg/lemon/smart_graph.h:30, from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/concepts/maps.h: In instantiation of ‘void lemon::concepts::ReferenceMap::set(const Key&, const Value&) [with K = lemon::concepts::Graph::Node; T = lemon::concepts::Graph::Arc; R = lemon::concepts::Graph::Arc&; CR = const lemon::concepts::Graph::Arc&; lemon::concepts::ReferenceMap::Key = lemon::concepts::Graph::Node; lemon::concepts::ReferenceMap::Value = lemon::concepts::Graph::Arc]’: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1187:9: required from ‘void lemon::MaxWeightedFractionalMatching::init() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1284:7: required from ‘void lemon::MaxWeightedFractionalMatching::run() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/lemon/matching.h:1685:7: required from ‘void lemon::MaxWeightedMatching::fractionalInit() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/lemon/matching.h:1910:7: required from ‘void lemon::MaxWeightedMatching::run() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:173:16: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/maps.h:186:60: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 186 | void set(const Key &k,const Value &t) { operator[](k)=t; } In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/matching.h:31, from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h: In instantiation of ‘void lemon::MaxWeightedFractionalMatching::extractCycle(const Arc&) [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap; lemon::MaxWeightedFractionalMatching::Arc = lemon::concepts::Graph::Arc]’: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1245:17: required from ‘void lemon::MaxWeightedFractionalMatching::start() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1285:7: required from ‘void lemon::MaxWeightedFractionalMatching::run() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/lemon/matching.h:1685:7: required from ‘void lemon::MaxWeightedMatching::fractionalInit() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/lemon/matching.h:1910:7: required from ‘void lemon::MaxWeightedMatching::run() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:173:16: required from here /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1114:14: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 1114 | prev = (*_matching)[odd]; | ~~~~~^~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/matching.h:31, from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1115:13: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1115 | odd = _graph.target((*_matching)[even]); In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/matching.h:31, from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h: In instantiation of ‘void lemon::MaxWeightedFractionalMatching::cycleOnEdge(const Edge&, int) [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap; lemon::MaxWeightedFractionalMatching::Edge = lemon::concepts::Graph::Edge]’: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1263:15: required from ‘void lemon::MaxWeightedFractionalMatching::start() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1285:7: required from ‘void lemon::MaxWeightedFractionalMatching::run() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/lemon/matching.h:1685:7: required from ‘void lemon::MaxWeightedMatching::fractionalInit() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/lemon/matching.h:1910:7: required from ‘void lemon::MaxWeightedMatching::run() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:173:16: required from here /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1031:17: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1031 | nca = right; | ~~~~^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/matching.h:31, from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1037:16: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1037 | left = _graph.target((*_matching)[left]); In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/matching.h:31, from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1039:16: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1039 | left = _graph.target((*_pred)[left]); In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/matching.h:31, from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1045:17: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1045 | nca = left; | ~~~~^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/matching.h:31, from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1051:17: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1051 | right = _graph.target((*_matching)[right]); In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/matching.h:31, from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1053:17: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1053 | right = _graph.target((*_pred)[right]); In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/matching.h:31, from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1062:17: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1062 | nca = right; | ~~~~^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/matching.h:31, from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1064:19: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1064 | nca = _graph.target((*_matching)[nca]); In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/matching.h:31, from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1066:19: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1066 | nca = _graph.target((*_pred)[nca]); In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/matching.h:31, from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1070:17: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1070 | nca = left; | ~~~~^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/matching.h:31, from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1072:19: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1072 | nca = _graph.target((*_matching)[nca]); In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/matching.h:31, from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1074:19: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1074 | nca = _graph.target((*_pred)[nca]); In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/matching.h:31, from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1084:12: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 1084 | prev = _graph.direct(edge, true); In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/matching.h:31, from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1090:14: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 1090 | prev = _graph.oppositeArc((*_pred)[left_path[i + 1]]); In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/matching.h:31, from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h: In instantiation of ‘void lemon::MaxWeightedPerfectFractionalMatching::extractCycle(const Arc&) [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap; lemon::MaxWeightedPerfectFractionalMatching::Arc = lemon::concepts::Graph::Arc]’: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1980:17: required from ‘bool lemon::MaxWeightedPerfectFractionalMatching::start() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:2022:14: required from ‘bool lemon::MaxWeightedPerfectFractionalMatching::run() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/lemon/matching.h:3102:11: required from ‘void lemon::MaxWeightedPerfectMatching::fractionalInit() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/lemon/matching.h:3312:7: required from ‘bool lemon::MaxWeightedPerfectMatching::run() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:210:16: required from here /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1859:14: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 1859 | prev = (*_matching)[odd]; | ~~~~~^~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/matching.h:31, from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1860:13: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1860 | odd = _graph.target((*_matching)[even]); In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/matching.h:31, from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h: In instantiation of ‘void lemon::MaxWeightedPerfectFractionalMatching::cycleOnEdge(const Edge&, int) [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap; lemon::MaxWeightedPerfectFractionalMatching::Edge = lemon::concepts::Graph::Edge]’: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1998:15: required from ‘bool lemon::MaxWeightedPerfectFractionalMatching::start() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:2022:14: required from ‘bool lemon::MaxWeightedPerfectFractionalMatching::run() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/lemon/matching.h:3102:11: required from ‘void lemon::MaxWeightedPerfectMatching::fractionalInit() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/lemon/matching.h:3312:7: required from ‘bool lemon::MaxWeightedPerfectMatching::run() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:210:16: required from here /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1776:17: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1776 | nca = right; | ~~~~^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/matching.h:31, from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1782:16: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1782 | left = _graph.target((*_matching)[left]); In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/matching.h:31, from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1784:16: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1784 | left = _graph.target((*_pred)[left]); In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/matching.h:31, from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1790:17: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1790 | nca = left; | ~~~~^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/matching.h:31, from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1796:17: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1796 | right = _graph.target((*_matching)[right]); In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/matching.h:31, from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1798:17: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1798 | right = _graph.target((*_pred)[right]); In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/matching.h:31, from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1807:17: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1807 | nca = right; | ~~~~^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/matching.h:31, from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1809:19: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1809 | nca = _graph.target((*_matching)[nca]); In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/matching.h:31, from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1811:19: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1811 | nca = _graph.target((*_pred)[nca]); In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/matching.h:31, from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1815:17: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1815 | nca = left; | ~~~~^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/matching.h:31, from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1817:19: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1817 | nca = _graph.target((*_matching)[nca]); In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/matching.h:31, from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1819:19: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1819 | nca = _graph.target((*_pred)[nca]); In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/matching.h:31, from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1829:12: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 1829 | prev = _graph.direct(edge, true); In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/matching.h:31, from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1835:14: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 1835 | prev = _graph.oppositeArc((*_pred)[left_path[i + 1]]); In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/matching.h:31, from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h: In instantiation of ‘void lemon::MaxWeightedFractionalMatching::alternatePath(lemon::MaxWeightedFractionalMatching::Node, int) [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap; lemon::MaxWeightedFractionalMatching::Node = lemon::concepts::Graph::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:961:7: required from ‘void lemon::MaxWeightedFractionalMatching::unmatchNode(const Node&) [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap; lemon::MaxWeightedFractionalMatching::Node = lemon::concepts::Graph::Node]’ /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1230:13: required from ‘void lemon::MaxWeightedFractionalMatching::start() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1285:7: required from ‘void lemon::MaxWeightedFractionalMatching::run() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/lemon/matching.h:1685:7: required from ‘void lemon::MaxWeightedMatching::fractionalInit() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/lemon/matching.h:1910:7: required from ‘void lemon::MaxWeightedMatching::run() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:173:16: required from here /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:931:13: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 931 | odd = _graph.target(prev); In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/matching.h:31, from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:932:14: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 932 | even = _graph.target((*_pred)[odd]); In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/matching.h:31, from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:937:14: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 937 | prev = (*_matching)[even]; | ~~~~~^~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/matching.h:31, from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h: In instantiation of ‘void lemon::MaxWeightedFractionalMatching::evenToMatched(lemon::MaxWeightedFractionalMatching::Node, int) [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap; lemon::MaxWeightedFractionalMatching::Node = lemon::concepts::Graph::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1088:9: required from ‘void lemon::MaxWeightedFractionalMatching::cycleOnEdge(const Edge&, int) [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap; lemon::MaxWeightedFractionalMatching::Edge = lemon::concepts::Graph::Edge]’ /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1263:15: required from ‘void lemon::MaxWeightedFractionalMatching::start() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1285:7: required from ‘void lemon::MaxWeightedFractionalMatching::run() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/lemon/matching.h:1685:7: required from ‘void lemon::MaxWeightedMatching::fractionalInit() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/lemon/matching.h:1910:7: required from ‘void lemon::MaxWeightedMatching::run() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:173:16: required from here /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:864:17: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 864 | min = _graph.oppositeArc(a); In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/matching.h:31, from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:879:22: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 879 | mina = aa; | ~~~~~^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/matching.h:31, from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h: In instantiation of ‘void lemon::MaxWeightedFractionalMatching::oddToMatched(lemon::MaxWeightedFractionalMatching::Node) [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap; lemon::MaxWeightedFractionalMatching::Node = lemon::concepts::Graph::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1092:9: required from ‘void lemon::MaxWeightedFractionalMatching::cycleOnEdge(const Edge&, int) [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap; lemon::MaxWeightedFractionalMatching::Edge = lemon::concepts::Graph::Edge]’ /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1263:15: required from ‘void lemon::MaxWeightedFractionalMatching::start() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1285:7: required from ‘void lemon::MaxWeightedFractionalMatching::run() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/lemon/matching.h:1685:7: required from ‘void lemon::MaxWeightedMatching::fractionalInit() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/lemon/matching.h:1910:7: required from ‘void lemon::MaxWeightedMatching::run() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:173:16: required from here /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:911:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 911 | min = _graph.oppositeArc(a); In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/matching.h:31, from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h: In instantiation of ‘void lemon::MaxWeightedPerfectFractionalMatching::alternatePath(lemon::MaxWeightedPerfectFractionalMatching::Node, int) [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap; lemon::MaxWeightedPerfectFractionalMatching::Node = lemon::concepts::Graph::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1738:7: required from ‘void lemon::MaxWeightedPerfectFractionalMatching::augmentOnArc(const Arc&) [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap; lemon::MaxWeightedPerfectFractionalMatching::Arc = lemon::concepts::Graph::Arc]’ /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1974:15: required from ‘bool lemon::MaxWeightedPerfectFractionalMatching::start() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:2022:14: required from ‘bool lemon::MaxWeightedPerfectFractionalMatching::run() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/lemon/matching.h:3102:11: required from ‘void lemon::MaxWeightedPerfectMatching::fractionalInit() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/lemon/matching.h:3312:7: required from ‘bool lemon::MaxWeightedPerfectMatching::run() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:210:16: required from here /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1687:13: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1687 | odd = _graph.target(prev); In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/matching.h:31, from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1688:14: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Node& lemon::concepts::Graph::Node::operator=(const lemon::concepts::Graph::Node&)’ is deprecated [-Wdeprecated-copy] 1688 | even = _graph.target((*_pred)[odd]); In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because ‘lemon::concepts::Graph::Node’ has user-provided ‘lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)’ 109 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/matching.h:31, from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1693:14: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 1693 | prev = (*_matching)[even]; | ~~~~~^~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/matching.h:31, from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h: In instantiation of ‘void lemon::MaxWeightedPerfectFractionalMatching::evenToMatched(lemon::MaxWeightedPerfectFractionalMatching::Node, int) [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap; lemon::MaxWeightedPerfectFractionalMatching::Node = lemon::concepts::Graph::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1833:9: required from ‘void lemon::MaxWeightedPerfectFractionalMatching::cycleOnEdge(const Edge&, int) [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap; lemon::MaxWeightedPerfectFractionalMatching::Edge = lemon::concepts::Graph::Edge]’ /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1998:15: required from ‘bool lemon::MaxWeightedPerfectFractionalMatching::start() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:2022:14: required from ‘bool lemon::MaxWeightedPerfectFractionalMatching::run() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/lemon/matching.h:3102:11: required from ‘void lemon::MaxWeightedPerfectMatching::fractionalInit() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/lemon/matching.h:3312:7: required from ‘bool lemon::MaxWeightedPerfectMatching::run() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:210:16: required from here /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1620:17: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 1620 | min = _graph.oppositeArc(a); In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/matching.h:31, from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1635:22: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 1635 | mina = aa; | ~~~~~^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/matching.h:31, from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h: In instantiation of ‘void lemon::MaxWeightedPerfectFractionalMatching::oddToMatched(lemon::MaxWeightedPerfectFractionalMatching::Node) [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap; lemon::MaxWeightedPerfectFractionalMatching::Node = lemon::concepts::Graph::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1837:9: required from ‘void lemon::MaxWeightedPerfectFractionalMatching::cycleOnEdge(const Edge&, int) [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap; lemon::MaxWeightedPerfectFractionalMatching::Edge = lemon::concepts::Graph::Edge]’ /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1998:15: required from ‘bool lemon::MaxWeightedPerfectFractionalMatching::start() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:2022:14: required from ‘bool lemon::MaxWeightedPerfectFractionalMatching::run() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/lemon/matching.h:3102:11: required from ‘void lemon::MaxWeightedPerfectMatching::fractionalInit() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/lemon/matching.h:3312:7: required from ‘bool lemon::MaxWeightedPerfectMatching::run() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]’ /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:210:16: required from here /<>/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1667:15: warning: implicitly-declared ‘constexpr lemon::concepts::Graph::Arc& lemon::concepts::Graph::Arc::operator=(const lemon::concepts::Graph::Arc&)’ is deprecated [-Wdeprecated-copy] 1667 | min = _graph.oppositeArc(a); In file included from /<>/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:335:9: note: because ‘lemon::concepts::Graph::Arc’ has user-provided ‘lemon::concepts::Graph::Arc::Arc(const lemon::concepts::Graph::Arc&)’ 335 | Arc(const Arc&) { } | ^~~ [ 73%] Linking CXX executable matching_test cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/cmake -E cmake_link_script CMakeFiles/matching_test.dir/link.txt --verbose=1 /usr/bin/c++ -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -Wl,-Bsymbolic-functions -Wl,-z,relro -Wl,-z,now -rdynamic CMakeFiles/matching_test.dir/matching_test.cc.o -o matching_test -L/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 73%] Built target matching_test make -f test/CMakeFiles/time_measure_test.dir/build.make test/CMakeFiles/time_measure_test.dir/depend make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<>/liblemon-1.3.1+dfsg /<>/liblemon-1.3.1+dfsg/test /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test/CMakeFiles/time_measure_test.dir/DependInfo.cmake --color= Scanning dependencies of target time_measure_test make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' make -f test/CMakeFiles/time_measure_test.dir/build.make test/CMakeFiles/time_measure_test.dir/build make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 74%] Building CXX object test/CMakeFiles/time_measure_test.dir/time_measure_test.cc.o cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -I/<>/liblemon-1.3.1+dfsg -I/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -o CMakeFiles/time_measure_test.dir/time_measure_test.cc.o -c /<>/liblemon-1.3.1+dfsg/test/time_measure_test.cc [ 75%] Linking CXX executable time_measure_test cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/cmake -E cmake_link_script CMakeFiles/time_measure_test.dir/link.txt --verbose=1 /usr/bin/c++ -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -Wl,-Bsymbolic-functions -Wl,-z,relro -Wl,-z,now -rdynamic CMakeFiles/time_measure_test.dir/time_measure_test.cc.o -o time_measure_test -L/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 75%] Built target time_measure_test make -f test/CMakeFiles/graph_utils_test.dir/build.make test/CMakeFiles/graph_utils_test.dir/depend make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<>/liblemon-1.3.1+dfsg /<>/liblemon-1.3.1+dfsg/test /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test/CMakeFiles/graph_utils_test.dir/DependInfo.cmake --color= Scanning dependencies of target graph_utils_test make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' make -f test/CMakeFiles/graph_utils_test.dir/build.make test/CMakeFiles/graph_utils_test.dir/build make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 77%] Building CXX object test/CMakeFiles/graph_utils_test.dir/graph_utils_test.cc.o cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -I/<>/liblemon-1.3.1+dfsg -I/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -o CMakeFiles/graph_utils_test.dir/graph_utils_test.cc.o -c /<>/liblemon-1.3.1+dfsg/test/graph_utils_test.cc [ 78%] Linking CXX executable graph_utils_test cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/cmake -E cmake_link_script CMakeFiles/graph_utils_test.dir/link.txt --verbose=1 /usr/bin/c++ -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -Wl,-Bsymbolic-functions -Wl,-z,relro -Wl,-z,now -rdynamic CMakeFiles/graph_utils_test.dir/graph_utils_test.cc.o -o graph_utils_test -L/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 78%] Built target graph_utils_test make -f test/CMakeFiles/max_flow_test.dir/build.make test/CMakeFiles/max_flow_test.dir/depend make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<>/liblemon-1.3.1+dfsg /<>/liblemon-1.3.1+dfsg/test /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test/CMakeFiles/max_flow_test.dir/DependInfo.cmake --color= Scanning dependencies of target max_flow_test make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' make -f test/CMakeFiles/max_flow_test.dir/build.make test/CMakeFiles/max_flow_test.dir/build make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 79%] Building CXX object test/CMakeFiles/max_flow_test.dir/max_flow_test.cc.o cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -I/<>/liblemon-1.3.1+dfsg -I/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -o CMakeFiles/max_flow_test.dir/max_flow_test.cc.o -c /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/preflow.h: In instantiation of ‘void lemon::Preflow::startFirstPhase() [with GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap; TR = lemon::Preflow, lemon::Preflow >::SetElevatorTraits > >::SetStandardElevatorTraits >]’: /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:155:32: required from here /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:584:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 584 | n = _level->highestActive(); In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:662:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 662 | n = _level->highestActive(); In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:666:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 666 | n = _level->activeOn(level); In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/preflow.h: In instantiation of ‘void lemon::Preflow::startSecondPhase() [with GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap; TR = lemon::Preflow, lemon::Preflow >::SetElevatorTraits > >::SetStandardElevatorTraits >]’: /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:156:33: required from here /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:800:17: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 800 | while ((n = _level->highestActive()) != INVALID) { | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:24: /<>/liblemon-1.3.1+dfsg/lemon/edmonds_karp.h: In instantiation of ‘bool lemon::EdmondsKarp::augment() [with GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap; TR = lemon::EdmondsKarpDefaultTraits >]’: /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:179:23: required from here /<>/liblemon-1.3.1+dfsg/lemon/edmonds_karp.h:391:17: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 391 | _queue[0] = _source; | ~~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:24: /<>/liblemon-1.3.1+dfsg/lemon/edmonds_karp.h:402:28: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 402 | _queue[last++] = t; | ~~~~~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:24: /<>/liblemon-1.3.1+dfsg/lemon/edmonds_karp.h:410:28: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 410 | _queue[last++] = t; | ~~~~~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:24: /<>/liblemon-1.3.1+dfsg/lemon/edmonds_karp.h:420:11: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 420 | n = _graph.source(e); In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:24: /<>/liblemon-1.3.1+dfsg/lemon/edmonds_karp.h:422:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 422 | e = (*_pred)[n]; | ~~^~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:24: /<>/liblemon-1.3.1+dfsg/lemon/edmonds_karp.h:426:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 426 | n = _graph.source(e); In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:24: /<>/liblemon-1.3.1+dfsg/lemon/edmonds_karp.h:430:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 430 | n = _graph.target(e); In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:24: /<>/liblemon-1.3.1+dfsg/lemon/edmonds_karp.h:434:11: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 434 | n = _target; | ~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:24: /<>/liblemon-1.3.1+dfsg/lemon/edmonds_karp.h:435:11: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 435 | e = (*_pred)[n]; | ~~^~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:24: /<>/liblemon-1.3.1+dfsg/lemon/edmonds_karp.h:438:11: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 438 | n = _graph.source(e); In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:24: /<>/liblemon-1.3.1+dfsg/lemon/edmonds_karp.h:440:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 440 | e = (*_pred)[n]; | ~~^~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:24: /<>/liblemon-1.3.1+dfsg/lemon/edmonds_karp.h:443:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 443 | n = _graph.source(e); In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:24: /<>/liblemon-1.3.1+dfsg/lemon/edmonds_karp.h:446:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 446 | n = _graph.target(e); In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:23, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h: In instantiation of ‘void lemon::LinkedElevator::initStart() [with GR = lemon::concepts::Digraph; Item = lemon::concepts::Digraph::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:504:7: required from ‘bool lemon::Preflow::init(const FlowMap&) [with FlowMap = lemon::concepts::ReadMap; GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap; TR = lemon::Preflow, lemon::Preflow >::SetElevatorTraits > >::SetStandardElevatorTraits >]’ /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:154:33: required from here /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:935:30: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 935 | _first[i] = _last[i] = INVALID; | ~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:23, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:935:19: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 935 | _first[i] = _last[i] = INVALID; | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:23, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h: In instantiation of ‘void lemon::LinkedElevator::initAddItem(Item) [with GR = lemon::concepts::Digraph; Item = lemon::concepts::Digraph::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:505:7: required from ‘bool lemon::Preflow::init(const FlowMap&) [with FlowMap = lemon::concepts::ReadMap; GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap; TR = lemon::Preflow, lemon::Preflow >::SetElevatorTraits > >::SetStandardElevatorTraits >]’ /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:154:33: required from here /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:949:29: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 949 | _first[_init_level] = i; | ~~~~~~~~~~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:23, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:950:28: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 950 | _last[_init_level] = i; | ~~~~~~~~~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:23, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:951:18: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 951 | _prev[i] = INVALID; | ~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:23, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:952:18: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 952 | _next[i] = INVALID; | ~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:23, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:954:18: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 954 | _prev[i] = _last[_init_level]; | ~~~~~~~~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:23, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:955:18: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 955 | _next[i] = INVALID; | ~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:23, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:956:35: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 956 | _next[_last[_init_level]] = i; | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:23, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:957:28: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 957 | _last[_init_level] = i; | ~~~~~~~~~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:23, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h: In instantiation of ‘void lemon::LinkedElevator::activate(Item) [with GR = lemon::concepts::Digraph; Item = lemon::concepts::Digraph::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:559:11: required from ‘bool lemon::Preflow::init(const FlowMap&) [with FlowMap = lemon::concepts::ReadMap; GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap; TR = lemon::Preflow, lemon::Preflow >::SetElevatorTraits > >::SetStandardElevatorTraits >]’ /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:154:33: required from here /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:563:23: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 563 | _next[_prev[i]] = _next[i]; | ~~~~~~~~~~~~~~~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:23, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:565:25: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 565 | _prev[_next[i]] = _prev[i]; | ~~~~~~~~~~~~~~~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:23, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:567:22: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 567 | _last[level] = _prev[i]; | ~~~~~~~~~~~~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:23, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:570:16: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 570 | _next[i] = _first[level]; | ~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:23, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:571:28: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 571 | _prev[_first[level]] = i; | ~~~~~~~~~~~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:23, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:572:16: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 572 | _prev[i] = INVALID; | ~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:23, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:573:21: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 573 | _first[level] = i; | ~~~~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:23, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h: In instantiation of ‘void lemon::LinkedElevator::liftHighestActive(int) [with GR = lemon::concepts::Digraph; Item = lemon::concepts::Digraph::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:644:15: required from ‘void lemon::Preflow::startFirstPhase() [with GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap; TR = lemon::Preflow, lemon::Preflow >::SetElevatorTraits > >::SetStandardElevatorTraits >]’ /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:155:32: required from here /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:717:25: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 717 | _prev[_next[i]] = INVALID; | ~~~~~~~~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:23, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:718:33: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 718 | _first[_highest_active] = _next[i]; | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:23, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:720:33: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 720 | _first[_highest_active] = INVALID; | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:23, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:721:32: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 721 | _last[_highest_active] = INVALID; | ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:23, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:725:58: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 725 | _first[_highest_active] = _last[_highest_active] = i; | ~~~~~~~~~~~~~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:23, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:725:33: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 725 | _first[_highest_active] = _last[_highest_active] = i; | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:23, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:726:18: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 726 | _prev[i] = INVALID; | ~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:23, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:727:18: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 727 | _next[i] = INVALID; | ~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:23, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:729:40: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 729 | _prev[_first[_highest_active]] = i; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:23, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:730:18: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 730 | _next[i] = _first[_highest_active]; | ~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:23, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:731:33: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 731 | _first[_highest_active] = i; | ~~~~~~~~~~~~~~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:23, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h: In instantiation of ‘void lemon::LinkedElevator::liftHighestActiveToTop() [with GR = lemon::concepts::Digraph; Item = lemon::concepts::Digraph::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:646:15: required from ‘void lemon::Preflow::startFirstPhase() [with GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap; TR = lemon::Preflow, lemon::Preflow >::SetElevatorTraits > >::SetStandardElevatorTraits >]’ /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:155:32: required from here /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:743:25: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 743 | _prev[_next[i]] = INVALID; | ~~~~~~~~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:23, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:744:33: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 744 | _first[_highest_active] = _next[i]; | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:23, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:746:33: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 746 | _first[_highest_active] = INVALID; | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:23, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:747:32: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 747 | _last[_highest_active] = INVALID; | ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:23, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h: In instantiation of ‘void lemon::LinkedElevator::liftToTop(int) [with GR = lemon::concepts::Digraph; Item = lemon::concepts::Digraph::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:649:15: required from ‘void lemon::Preflow::startFirstPhase() [with GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap; TR = lemon::Preflow, lemon::Preflow >::SetElevatorTraits > >::SetStandardElevatorTraits >]’ /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:155:32: required from here /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:903:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 903 | n = _next[n]; | ~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:23, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:905:19: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 905 | _first[i] = INVALID; | ~~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:23, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:906:18: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 906 | _last[i] = INVALID; | ~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:23, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h: In instantiation of ‘void lemon::LinkedElevator::deactivate(Item) [with GR = lemon::concepts::Digraph; Item = lemon::concepts::Digraph::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:652:13: required from ‘void lemon::Preflow::startFirstPhase() [with GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap; TR = lemon::Preflow, lemon::Preflow >::SetElevatorTraits > >::SetStandardElevatorTraits >]’ /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:155:32: required from here /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:589:23: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 589 | _prev[_next[i]] = _prev[i]; | ~~~~~~~~~~~~~~~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:23, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:591:25: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 591 | _next[_prev[i]] = _next[i]; | ~~~~~~~~~~~~~~~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:23, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:593:27: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 593 | _first[_level[i]] = _next[i]; | ~~~~~~~~~~~~~~~~~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:23, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:596:16: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 596 | _prev[i] = _last[level]; | ~~~~~~~~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:23, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:597:27: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 597 | _next[_last[level]] = i; | ~~~~~~~~~~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:23, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:598:16: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 598 | _next[i] = INVALID; | ~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:23, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:599:20: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 599 | _last[level] = i; | ~~~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:23, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h: In instantiation of ‘void lemon::LinkedElevator::liftActiveOn(int, int) [with GR = lemon::concepts::Digraph; Item = lemon::concepts::Digraph::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:725:15: required from ‘void lemon::Preflow::startFirstPhase() [with GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap; TR = lemon::Preflow, lemon::Preflow >::SetElevatorTraits > >::SetStandardElevatorTraits >]’ /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:155:32: required from here /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:806:25: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 806 | _prev[_next[i]] = INVALID; | ~~~~~~~~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:23, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:807:19: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 807 | _first[l] = _next[i]; | ~~~~~~~~~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:23, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:809:19: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 809 | _first[l] = INVALID; | ~~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:23, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:810:18: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 810 | _last[l] = INVALID; | ~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:23, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:814:30: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 814 | _first[l] = _last[l] = i; | ~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:23, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:814:19: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 814 | _first[l] = _last[l] = i; | ~~~~~~~~~~^~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:23, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:815:18: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 815 | _prev[i] = INVALID; | ~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:23, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:816:18: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 816 | _next[i] = INVALID; | ~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:23, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:818:26: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 818 | _prev[_first[l]] = i; | ~~~~~~~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:23, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:819:18: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 819 | _next[i] = _first[l]; | ~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:23, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:820:19: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 820 | _first[l] = i; | ~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:23, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h: In instantiation of ‘void lemon::LinkedElevator::liftActiveToTop(int) [with GR = lemon::concepts::Digraph; Item = lemon::concepts::Digraph::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:727:15: required from ‘void lemon::Preflow::startFirstPhase() [with GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap; TR = lemon::Preflow, lemon::Preflow >::SetElevatorTraits > >::SetStandardElevatorTraits >]’ /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:155:32: required from here /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:835:25: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 835 | _prev[_next[i]] = INVALID; | ~~~~~~~~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:23, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:836:19: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 836 | _first[l] = _next[i]; | ~~~~~~~~~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:23, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:838:19: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 838 | _first[l] = INVALID; | ~~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:23, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:839:18: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 839 | _last[l] = INVALID; | ~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/bits/map_extender.h:27, from /<>/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:24, from /<>/liblemon-1.3.1+dfsg/lemon/smart_graph.h:30, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:22: /<>/liblemon-1.3.1+dfsg/lemon/concepts/maps.h: In instantiation of ‘void lemon::concepts::ReferenceMap::set(const Key&, const Value&) [with K = lemon::concepts::Digraph::Node; T = lemon::concepts::Digraph::Arc; R = lemon::concepts::Digraph::Arc&; CR = const lemon::concepts::Digraph::Arc&; lemon::concepts::ReferenceMap::Key = lemon::concepts::Digraph::Node; lemon::concepts::ReferenceMap::Value = lemon::concepts::Digraph::Arc]’: /<>/liblemon-1.3.1+dfsg/lemon/edmonds_karp.h:386:9: required from ‘bool lemon::EdmondsKarp::augment() [with GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap; TR = lemon::EdmondsKarpDefaultTraits >]’ /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:179:23: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/maps.h:186:60: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 186 | void set(const Key &k,const Value &t) { operator[](k)=t; } In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/preflow.h: In instantiation of ‘lemon::Preflow& lemon::Preflow::source(const Node&) [with GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap; TR = lemon::Preflow >::SetFlowMapTraits >; lemon::Preflow::Node = lemon::concepts::Digraph::Node]’: /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:108:12: required from ‘void MaxFlowClassConcept::Constraints::constraints() [with MF = lemon::Preflow >; GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = MaxFlowClassConcept >; Type = lemon::Preflow >]’ /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:369:36: required from here /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:350:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 350 | _source = node; | ~~~~~~~~^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/preflow.h: In instantiation of ‘lemon::Preflow& lemon::Preflow::target(const Node&) [with GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap; TR = lemon::Preflow >::SetFlowMapTraits >; lemon::Preflow::Node = lemon::concepts::Digraph::Node]’: /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:104:7: required from ‘void MaxFlowClassConcept::Constraints::constraints() [with MF = lemon::Preflow >; GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = MaxFlowClassConcept >; Type = lemon::Preflow >]’ /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:369:36: required from here /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:359:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 359 | _target = node; | ~~~~~~~~^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/preflow.h: In instantiation of ‘lemon::Preflow& lemon::Preflow::source(const Node&) [with GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap; TR = lemon::Preflow >::SetFlowMapTraits >; lemon::Preflow::Node = lemon::concepts::Digraph::Node]’: /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:108:12: required from ‘void MaxFlowClassConcept::Constraints::constraints() [with MF = lemon::Preflow >; GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = MaxFlowClassConcept >; Type = lemon::Preflow >]’ /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:371:36: required from here /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:350:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 350 | _source = node; | ~~~~~~~~^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/preflow.h: In instantiation of ‘lemon::Preflow& lemon::Preflow::target(const Node&) [with GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap; TR = lemon::Preflow >::SetFlowMapTraits >; lemon::Preflow::Node = lemon::concepts::Digraph::Node]’: /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:104:7: required from ‘void MaxFlowClassConcept::Constraints::constraints() [with MF = lemon::Preflow >; GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = MaxFlowClassConcept >; Type = lemon::Preflow >]’ /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:371:36: required from here /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:359:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 359 | _target = node; | ~~~~~~~~^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:24: /<>/liblemon-1.3.1+dfsg/lemon/edmonds_karp.h: In instantiation of ‘lemon::EdmondsKarp& lemon::EdmondsKarp::source(const Node&) [with GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap; TR = lemon::EdmondsKarp >::SetFlowMapTraits >; lemon::EdmondsKarp::Node = lemon::concepts::Digraph::Node]’: /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:108:12: required from ‘void MaxFlowClassConcept::Constraints::constraints() [with MF = lemon::EdmondsKarp >; GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = MaxFlowClassConcept >; Type = lemon::EdmondsKarp >]’ /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:375:40: required from here /<>/liblemon-1.3.1+dfsg/lemon/edmonds_karp.h:259:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 259 | _source = node; | ~~~~~~~~^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:24: /<>/liblemon-1.3.1+dfsg/lemon/edmonds_karp.h: In instantiation of ‘lemon::EdmondsKarp& lemon::EdmondsKarp::target(const Node&) [with GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap; TR = lemon::EdmondsKarp >::SetFlowMapTraits >; lemon::EdmondsKarp::Node = lemon::concepts::Digraph::Node]’: /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:104:7: required from ‘void MaxFlowClassConcept::Constraints::constraints() [with MF = lemon::EdmondsKarp >; GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = MaxFlowClassConcept >; Type = lemon::EdmondsKarp >]’ /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:375:40: required from here /<>/liblemon-1.3.1+dfsg/lemon/edmonds_karp.h:268:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 268 | _target = node; | ~~~~~~~~^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:24: /<>/liblemon-1.3.1+dfsg/lemon/edmonds_karp.h: In instantiation of ‘lemon::EdmondsKarp& lemon::EdmondsKarp::source(const Node&) [with GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap; TR = lemon::EdmondsKarp >::SetFlowMapTraits >; lemon::EdmondsKarp::Node = lemon::concepts::Digraph::Node]’: /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:108:12: required from ‘void MaxFlowClassConcept::Constraints::constraints() [with MF = lemon::EdmondsKarp >; GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = MaxFlowClassConcept >; Type = lemon::EdmondsKarp >]’ /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:377:40: required from here /<>/liblemon-1.3.1+dfsg/lemon/edmonds_karp.h:259:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 259 | _source = node; | ~~~~~~~~^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:24: /<>/liblemon-1.3.1+dfsg/lemon/edmonds_karp.h: In instantiation of ‘lemon::EdmondsKarp& lemon::EdmondsKarp::target(const Node&) [with GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap; TR = lemon::EdmondsKarp >::SetFlowMapTraits >; lemon::EdmondsKarp::Node = lemon::concepts::Digraph::Node]’: /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:104:7: required from ‘void MaxFlowClassConcept::Constraints::constraints() [with MF = lemon::EdmondsKarp >; GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = MaxFlowClassConcept >; Type = lemon::EdmondsKarp >]’ /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:377:40: required from here /<>/liblemon-1.3.1+dfsg/lemon/edmonds_karp.h:268:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 268 | _target = node; | ~~~~~~~~^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:23, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h: In instantiation of ‘void lemon::Elevator::initStart() [with GR = lemon::concepts::Digraph; Item = lemon::concepts::Digraph::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:434:7: required from ‘void lemon::Preflow::init() [with GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap; TR = lemon::Preflow >::SetFlowMapTraits >]’ /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:113:7: required from ‘void MaxFlowClassConcept::Constraints::constraints() [with MF = lemon::Preflow >; GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = MaxFlowClassConcept >; Type = lemon::Preflow >]’ /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:369:36: required from here /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:435:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 435 | *n=i; | ~~^~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/preflow.h: In instantiation of ‘void lemon::Preflow::startFirstPhase() [with GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap; TR = lemon::Preflow >::SetFlowMapTraits >]’: /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:884:7: required from ‘void lemon::Preflow::run() [with GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap; TR = lemon::Preflow >::SetFlowMapTraits >]’ /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:115:7: required from ‘void MaxFlowClassConcept::Constraints::constraints() [with MF = lemon::Preflow >; GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = MaxFlowClassConcept >; Type = lemon::Preflow >]’ /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:369:36: required from here /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:584:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 584 | n = _level->highestActive(); In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:662:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 662 | n = _level->highestActive(); In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:666:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 666 | n = _level->activeOn(level); In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/preflow.h: In instantiation of ‘void lemon::Preflow::startSecondPhase() [with GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap; TR = lemon::Preflow >::SetFlowMapTraits >]’: /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:885:7: required from ‘void lemon::Preflow::run() [with GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap; TR = lemon::Preflow >::SetFlowMapTraits >]’ /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:115:7: required from ‘void MaxFlowClassConcept::Constraints::constraints() [with MF = lemon::Preflow >; GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = MaxFlowClassConcept >; Type = lemon::Preflow >]’ /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:369:36: required from here /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:800:17: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 800 | while ((n = _level->highestActive()) != INVALID) { | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/preflow.h: In instantiation of ‘void lemon::Preflow::startFirstPhase() [with GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap; TR = lemon::Preflow >::SetFlowMapTraits >]’: /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:884:7: required from ‘void lemon::Preflow::run() [with GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap; TR = lemon::Preflow >::SetFlowMapTraits >]’ /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:115:7: required from ‘void MaxFlowClassConcept::Constraints::constraints() [with MF = lemon::Preflow >; GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = MaxFlowClassConcept >; Type = lemon::Preflow >]’ /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:371:36: required from here /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:584:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 584 | n = _level->highestActive(); In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:662:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 662 | n = _level->highestActive(); In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:666:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 666 | n = _level->activeOn(level); In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/preflow.h: In instantiation of ‘void lemon::Preflow::startSecondPhase() [with GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap; TR = lemon::Preflow >::SetFlowMapTraits >]’: /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:885:7: required from ‘void lemon::Preflow::run() [with GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap; TR = lemon::Preflow >::SetFlowMapTraits >]’ /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:115:7: required from ‘void MaxFlowClassConcept::Constraints::constraints() [with MF = lemon::Preflow >; GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = MaxFlowClassConcept >; Type = lemon::Preflow >]’ /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:371:36: required from here /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:800:17: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 800 | while ((n = _level->highestActive()) != INVALID) { | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:23, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h: In instantiation of ‘void lemon::Elevator::swap(lemon::Elevator::Vit, lemon::Elevator::Vit) [with GR = lemon::concepts::Digraph; Item = lemon::concepts::Digraph::Node; lemon::Elevator::Vit = lemon::concepts::Digraph::Node*]’: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:445:7: required from ‘void lemon::Elevator::initAddItem(Item) [with GR = lemon::concepts::Digraph; Item = lemon::concepts::Digraph::Node]’ /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:435:7: required from ‘void lemon::Preflow::init() [with GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap; TR = lemon::Preflow >::SetFlowMapTraits >]’ /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:113:7: required from ‘void MaxFlowClassConcept::Constraints::constraints() [with MF = lemon::Preflow >; GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = MaxFlowClassConcept >; Type = lemon::Preflow >]’ /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:369:36: required from here /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:94:29: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 94 | _where[ti] = _where[*i=*j]; | ~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:23, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:96:9: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 96 | *j=ti; | ~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:24: /<>/liblemon-1.3.1+dfsg/lemon/edmonds_karp.h: In instantiation of ‘bool lemon::EdmondsKarp::augment() [with GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap; TR = lemon::EdmondsKarp >::SetFlowMapTraits >]’: /<>/liblemon-1.3.1+dfsg/lemon/edmonds_karp.h:464:14: required from ‘void lemon::EdmondsKarp::start() [with GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap; TR = lemon::EdmondsKarp >::SetFlowMapTraits >]’ /<>/liblemon-1.3.1+dfsg/lemon/edmonds_karp.h:477:7: required from ‘void lemon::EdmondsKarp::run() [with GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap; TR = lemon::EdmondsKarp >::SetFlowMapTraits >]’ /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:115:7: required from ‘void MaxFlowClassConcept::Constraints::constraints() [with MF = lemon::EdmondsKarp >; GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = MaxFlowClassConcept >; Type = lemon::EdmondsKarp >]’ /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:375:40: required from here /<>/liblemon-1.3.1+dfsg/lemon/edmonds_karp.h:391:17: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 391 | _queue[0] = _source; | ~~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:24: /<>/liblemon-1.3.1+dfsg/lemon/edmonds_karp.h:402:28: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 402 | _queue[last++] = t; | ~~~~~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:24: /<>/liblemon-1.3.1+dfsg/lemon/edmonds_karp.h:410:28: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 410 | _queue[last++] = t; | ~~~~~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:24: /<>/liblemon-1.3.1+dfsg/lemon/edmonds_karp.h:420:11: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 420 | n = _graph.source(e); In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:24: /<>/liblemon-1.3.1+dfsg/lemon/edmonds_karp.h:422:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 422 | e = (*_pred)[n]; | ~~^~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:24: /<>/liblemon-1.3.1+dfsg/lemon/edmonds_karp.h:426:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 426 | n = _graph.source(e); In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:24: /<>/liblemon-1.3.1+dfsg/lemon/edmonds_karp.h:430:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 430 | n = _graph.target(e); In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:24: /<>/liblemon-1.3.1+dfsg/lemon/edmonds_karp.h:434:11: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 434 | n = _target; | ~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:24: /<>/liblemon-1.3.1+dfsg/lemon/edmonds_karp.h:435:11: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 435 | e = (*_pred)[n]; | ~~^~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:24: /<>/liblemon-1.3.1+dfsg/lemon/edmonds_karp.h:438:11: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 438 | n = _graph.source(e); In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:24: /<>/liblemon-1.3.1+dfsg/lemon/edmonds_karp.h:440:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 440 | e = (*_pred)[n]; | ~~^~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:24: /<>/liblemon-1.3.1+dfsg/lemon/edmonds_karp.h:443:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 443 | n = _graph.source(e); In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:24: /<>/liblemon-1.3.1+dfsg/lemon/edmonds_karp.h:446:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 446 | n = _graph.target(e); In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:24: /<>/liblemon-1.3.1+dfsg/lemon/edmonds_karp.h: In instantiation of ‘bool lemon::EdmondsKarp::augment() [with GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap; TR = lemon::EdmondsKarp >::SetFlowMapTraits >]’: /<>/liblemon-1.3.1+dfsg/lemon/edmonds_karp.h:464:14: required from ‘void lemon::EdmondsKarp::start() [with GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap; TR = lemon::EdmondsKarp >::SetFlowMapTraits >]’ /<>/liblemon-1.3.1+dfsg/lemon/edmonds_karp.h:477:7: required from ‘void lemon::EdmondsKarp::run() [with GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap; TR = lemon::EdmondsKarp >::SetFlowMapTraits >]’ /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:115:7: required from ‘void MaxFlowClassConcept::Constraints::constraints() [with MF = lemon::EdmondsKarp >; GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = MaxFlowClassConcept >; Type = lemon::EdmondsKarp >]’ /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:377:40: required from here /<>/liblemon-1.3.1+dfsg/lemon/edmonds_karp.h:391:17: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 391 | _queue[0] = _source; | ~~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:24: /<>/liblemon-1.3.1+dfsg/lemon/edmonds_karp.h:402:28: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 402 | _queue[last++] = t; | ~~~~~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:24: /<>/liblemon-1.3.1+dfsg/lemon/edmonds_karp.h:410:28: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 410 | _queue[last++] = t; | ~~~~~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:24: /<>/liblemon-1.3.1+dfsg/lemon/edmonds_karp.h:420:11: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 420 | n = _graph.source(e); In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:24: /<>/liblemon-1.3.1+dfsg/lemon/edmonds_karp.h:422:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 422 | e = (*_pred)[n]; | ~~^~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:24: /<>/liblemon-1.3.1+dfsg/lemon/edmonds_karp.h:426:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 426 | n = _graph.source(e); In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:24: /<>/liblemon-1.3.1+dfsg/lemon/edmonds_karp.h:430:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 430 | n = _graph.target(e); In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:24: /<>/liblemon-1.3.1+dfsg/lemon/edmonds_karp.h:434:11: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 434 | n = _target; | ~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:24: /<>/liblemon-1.3.1+dfsg/lemon/edmonds_karp.h:435:11: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 435 | e = (*_pred)[n]; | ~~^~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:24: /<>/liblemon-1.3.1+dfsg/lemon/edmonds_karp.h:438:11: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 438 | n = _graph.source(e); In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:24: /<>/liblemon-1.3.1+dfsg/lemon/edmonds_karp.h:440:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 440 | e = (*_pred)[n]; | ~~^~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:24: /<>/liblemon-1.3.1+dfsg/lemon/edmonds_karp.h:443:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 443 | n = _graph.source(e); In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:24: /<>/liblemon-1.3.1+dfsg/lemon/edmonds_karp.h:446:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 446 | n = _graph.target(e); In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::BaseDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseDigraphComponent; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:477:55: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:93:42: required from ‘void MaxFlowClassConcept::Constraints::constraints() [with MF = lemon::Preflow >; GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = MaxFlowClassConcept >; Type = lemon::Preflow >]’ /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:369:36: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:173:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 173 | n = digraph.source(e); In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:174:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 174 | n = digraph.target(e); In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:175:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 175 | n = digraph.oppositeNode(n, e); In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph; BAS = lemon::concepts::BaseDigraphComponent]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent<>; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:93:42: required from ‘void MaxFlowClassConcept::Constraints::constraints() [with MF = lemon::Preflow >; GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = MaxFlowClassConcept >; Type = lemon::Preflow >]’ /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:369:36: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:999:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 999 | n = digraph.baseNode(iait); In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1000:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 1000 | n = digraph.runningNode(iait); In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1001:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 1001 | n = digraph.baseNode(oait); In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1002:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 1002 | n = digraph.runningNode(oait); In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::IDableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph; BAS = lemon::concepts::BaseDigraphComponent]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IDableDigraphComponent<>; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:479:59: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:93:42: required from ‘void MaxFlowClassConcept::Constraints::constraints() [with MF = lemon::Preflow >; GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = MaxFlowClassConcept >; Type = lemon::Preflow >]’ /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:369:36: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:526:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 526 | node=INVALID; | ~~~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:529:16: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 529 | node = digraph.nodeFromId(nid); In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:531:14: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 531 | arc=INVALID; | ~~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:534:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 534 | arc = digraph.arcFromId(eid); In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:23, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h: In instantiation of ‘void lemon::Elevator::copy(lemon::Elevator::Vit, lemon::Elevator::Vit) [with GR = lemon::concepts::Digraph; Item = lemon::concepts::Digraph::Node; lemon::Elevator::Vit = lemon::concepts::Digraph::Node*]’: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:245:7: required from ‘void lemon::Elevator::liftHighestActive(int) [with GR = lemon::concepts::Digraph; Item = lemon::concepts::Digraph::Node]’ /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:644:15: required from ‘void lemon::Preflow::startFirstPhase() [with GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap; TR = lemon::Preflow >::SetFlowMapTraits >]’ /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:884:7: required from ‘void lemon::Preflow::run() [with GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap; TR = lemon::Preflow >::SetFlowMapTraits >]’ /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:115:7: required from ‘void MaxFlowClassConcept::Constraints::constraints() [with MF = lemon::Preflow >; GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = MaxFlowClassConcept >; Type = lemon::Preflow >]’ /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:369:36: required from here /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:86:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 86 | *p=i; | ~~^~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:23, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h: In instantiation of ‘void lemon::Elevator::copy(Item, lemon::Elevator::Vit) [with GR = lemon::concepts::Digraph; Item = lemon::concepts::Digraph::Node; lemon::Elevator::Vit = lemon::concepts::Digraph::Node*]’: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:251:7: required from ‘void lemon::Elevator::liftHighestActive(int) [with GR = lemon::concepts::Digraph; Item = lemon::concepts::Digraph::Node]’ /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:644:15: required from ‘void lemon::Preflow::startFirstPhase() [with GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap; TR = lemon::Preflow >::SetFlowMapTraits >]’ /<>/liblemon-1.3.1+dfsg/lemon/preflow.h:884:7: required from ‘void lemon::Preflow::run() [with GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap; TR = lemon::Preflow >::SetFlowMapTraits >]’ /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:115:7: required from ‘void MaxFlowClassConcept::Constraints::constraints() [with MF = lemon::Preflow >; GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = MaxFlowClassConcept >; Type = lemon::Preflow >]’ /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:369:36: required from here /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:79:16: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 79 | _where[*p=i] = p; | ~~^~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItem::Constraints<_GraphItem>::constraints() [with _GraphItem = lemon::concepts::Digraph::Node; char sel = 'n']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItem<'n'>; Type = lemon::concepts::Digraph::Node]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:168:45: required from ‘void lemon::concepts::BaseDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseDigraphComponent; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:477:55: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:93:42: required from ‘void MaxFlowClassConcept::Constraints::constraints() [with MF = lemon::Preflow >; GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = MaxFlowClassConcept >; Type = lemon::Preflow >]’ /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:369:36: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:104:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 104 | i1=INVALID; | ~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:19: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:14: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItem::Constraints<_GraphItem>::constraints() [with _GraphItem = lemon::concepts::Digraph::Arc; char sel = 'a']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItem<'a'>; Type = lemon::concepts::Digraph::Arc]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:169:44: required from ‘void lemon::concepts::BaseDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseDigraphComponent; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:477:55: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:93:42: required from ‘void MaxFlowClassConcept::Constraints::constraints() [with MF = lemon::Preflow >; GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = MaxFlowClassConcept >; Type = lemon::Preflow >]’ /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:369:36: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:104:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 104 | i1=INVALID; | ~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:19: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:14: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItemIt::Constraints<_GraphItemIt>::constraints() [with _GraphItemIt = lemon::concepts::Digraph::ArcIt; GR = lemon::concepts::Digraph; Item = lemon::concepts::Digraph::Arc]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItemIt; Type = lemon::concepts::Digraph::ArcIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:988:41: required from ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph; BAS = lemon::concepts::BaseDigraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent<>; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:93:42: required from ‘void MaxFlowClassConcept::Constraints::constraints() [with MF = lemon::Preflow >; GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = MaxFlowClassConcept >; Type = lemon::Preflow >]’ /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:369:36: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:732:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::ArcIt& lemon::concepts::Digraph::ArcIt::operator=(const lemon::concepts::Digraph::ArcIt&)’ is deprecated [-Wdeprecated-copy] 732 | it2 = ++it1; | ~~~~^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:305:9: note: because ‘lemon::concepts::Digraph::ArcIt’ has user-provided ‘lemon::concepts::Digraph::ArcIt::ArcIt(const lemon::concepts::Digraph::ArcIt&)’ 305 | ArcIt(const ArcIt& e) : Arc(e) { } | ^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:733:17: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::ArcIt& lemon::concepts::Digraph::ArcIt::operator=(const lemon::concepts::Digraph::ArcIt&)’ is deprecated [-Wdeprecated-copy] 733 | ++it2 = it1; | ~~~~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:305:9: note: because ‘lemon::concepts::Digraph::ArcIt’ has user-provided ‘lemon::concepts::Digraph::ArcIt::ArcIt(const lemon::concepts::Digraph::ArcIt&)’ 305 | ArcIt(const ArcIt& e) : Arc(e) { } | ^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:737:14: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 737 | bi = it2; | ~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItemIt::Constraints<_GraphItemIt>::constraints() [with _GraphItemIt = lemon::concepts::Digraph::NodeIt; GR = lemon::concepts::Digraph; Item = lemon::concepts::Digraph::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItemIt; Type = lemon::concepts::Digraph::NodeIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:990:42: required from ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph; BAS = lemon::concepts::BaseDigraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent<>; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:93:42: required from ‘void MaxFlowClassConcept::Constraints::constraints() [with MF = lemon::Preflow >; GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = MaxFlowClassConcept >; Type = lemon::Preflow >]’ /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:369:36: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:732:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::NodeIt& lemon::concepts::Digraph::NodeIt::operator=(const lemon::concepts::Digraph::NodeIt&)’ is deprecated [-Wdeprecated-copy] 732 | it2 = ++it1; | ~~~~^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:127:9: note: because ‘lemon::concepts::Digraph::NodeIt’ has user-provided ‘lemon::concepts::Digraph::NodeIt::NodeIt(const lemon::concepts::Digraph::NodeIt&)’ 127 | NodeIt(const NodeIt& n) : Node(n) { } | ^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:733:17: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::NodeIt& lemon::concepts::Digraph::NodeIt::operator=(const lemon::concepts::Digraph::NodeIt&)’ is deprecated [-Wdeprecated-copy] 733 | ++it2 = it1; | ~~~~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:127:9: note: because ‘lemon::concepts::Digraph::NodeIt’ has user-provided ‘lemon::concepts::Digraph::NodeIt::NodeIt(const lemon::concepts::Digraph::NodeIt&)’ 127 | NodeIt(const NodeIt& n) : Node(n) { } | ^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:737:14: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 737 | bi = it2; | ~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphIncIt::Constraints<_GraphIncIt>::constraints() [with _GraphIncIt = lemon::concepts::Digraph::InArcIt; GR = lemon::concepts::Digraph; Item = lemon::concepts::Digraph::Arc; Base = lemon::concepts::Digraph::Node; char sel = 'i']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphIncIt; Type = lemon::concepts::Digraph::InArcIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:992:73: required from ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph; BAS = lemon::concepts::BaseDigraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent<>; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:93:42: required from ‘void MaxFlowClassConcept::Constraints::constraints() [with MF = lemon::Preflow >; GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = MaxFlowClassConcept >; Type = lemon::Preflow >]’ /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:369:36: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:823:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::InArcIt& lemon::concepts::Digraph::InArcIt::operator=(const lemon::concepts::Digraph::InArcIt&)’ is deprecated [-Wdeprecated-copy] 823 | it2 = ++it1; | ~~~~^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:262:9: note: because ‘lemon::concepts::Digraph::InArcIt’ has user-provided ‘lemon::concepts::Digraph::InArcIt::InArcIt(const lemon::concepts::Digraph::InArcIt&)’ 262 | InArcIt(const InArcIt& e) : Arc(e) { } | ^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:824:17: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::InArcIt& lemon::concepts::Digraph::InArcIt::operator=(const lemon::concepts::Digraph::InArcIt&)’ is deprecated [-Wdeprecated-copy] 824 | ++it2 = it1; | ~~~~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:262:9: note: because ‘lemon::concepts::Digraph::InArcIt’ has user-provided ‘lemon::concepts::Digraph::InArcIt::InArcIt(const lemon::concepts::Digraph::InArcIt&)’ 262 | InArcIt(const InArcIt& e) : Arc(e) { } | ^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:827:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 827 | e = it2; | ~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphIncIt::Constraints<_GraphIncIt>::constraints() [with _GraphIncIt = lemon::concepts::Digraph::OutArcIt; GR = lemon::concepts::Digraph; Item = lemon::concepts::Digraph::Arc; Base = lemon::concepts::Digraph::Node; char sel = 'o']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphIncIt; Type = lemon::concepts::Digraph::OutArcIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:994:74: required from ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph; BAS = lemon::concepts::BaseDigraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent<>; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:93:42: required from ‘void MaxFlowClassConcept::Constraints::constraints() [with MF = lemon::Preflow >; GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = MaxFlowClassConcept >; Type = lemon::Preflow >]’ /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:369:36: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:823:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::OutArcIt& lemon::concepts::Digraph::OutArcIt::operator=(const lemon::concepts::Digraph::OutArcIt&)’ is deprecated [-Wdeprecated-copy] 823 | it2 = ++it1; | ~~~~^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:217:9: note: because ‘lemon::concepts::Digraph::OutArcIt’ has user-provided ‘lemon::concepts::Digraph::OutArcIt::OutArcIt(const lemon::concepts::Digraph::OutArcIt&)’ 217 | OutArcIt(const OutArcIt& e) : Arc(e) { } | ^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:824:17: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::OutArcIt& lemon::concepts::Digraph::OutArcIt::operator=(const lemon::concepts::Digraph::OutArcIt&)’ is deprecated [-Wdeprecated-copy] 824 | ++it2 = it1; | ~~~~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:217:9: note: because ‘lemon::concepts::Digraph::OutArcIt’ has user-provided ‘lemon::concepts::Digraph::OutArcIt::OutArcIt(const lemon::concepts::Digraph::OutArcIt&)’ 217 | OutArcIt(const OutArcIt& e) : Arc(e) { } | ^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:827:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 827 | e = it2; | ~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItem::Constraints<_GraphItem>::constraints() [with _GraphItem = lemon::concepts::Digraph::ArcIt; char sel = '0']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItem<>; Type = lemon::concepts::Digraph::ArcIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:724:50: required from ‘void lemon::concepts::GraphItemIt::Constraints<_GraphItemIt>::constraints() [with _GraphItemIt = lemon::concepts::Digraph::ArcIt; GR = lemon::concepts::Digraph; Item = lemon::concepts::Digraph::Arc]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItemIt; Type = lemon::concepts::Digraph::ArcIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:988:41: required from ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph; BAS = lemon::concepts::BaseDigraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent<>; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:93:42: required from ‘void MaxFlowClassConcept::Constraints::constraints() [with MF = lemon::Preflow >; GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = MaxFlowClassConcept >; Type = lemon::Preflow >]’ /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:369:36: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:104:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::ArcIt& lemon::concepts::Digraph::ArcIt::operator=(const lemon::concepts::Digraph::ArcIt&)’ is deprecated [-Wdeprecated-copy] 104 | i1=INVALID; | ~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:305:9: note: because ‘lemon::concepts::Digraph::ArcIt’ has user-provided ‘lemon::concepts::Digraph::ArcIt::ArcIt(const lemon::concepts::Digraph::ArcIt&)’ 305 | ArcIt(const ArcIt& e) : Arc(e) { } | ^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:19: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::ArcIt& lemon::concepts::Digraph::ArcIt::operator=(const lemon::concepts::Digraph::ArcIt&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:305:9: note: because ‘lemon::concepts::Digraph::ArcIt’ has user-provided ‘lemon::concepts::Digraph::ArcIt::ArcIt(const lemon::concepts::Digraph::ArcIt&)’ 305 | ArcIt(const ArcIt& e) : Arc(e) { } | ^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:14: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::ArcIt& lemon::concepts::Digraph::ArcIt::operator=(const lemon::concepts::Digraph::ArcIt&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:305:9: note: because ‘lemon::concepts::Digraph::ArcIt’ has user-provided ‘lemon::concepts::Digraph::ArcIt::ArcIt(const lemon::concepts::Digraph::ArcIt&)’ 305 | ArcIt(const ArcIt& e) : Arc(e) { } | ^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItem::Constraints<_GraphItem>::constraints() [with _GraphItem = lemon::concepts::Digraph::NodeIt; char sel = '0']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItem<>; Type = lemon::concepts::Digraph::NodeIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:724:50: required from ‘void lemon::concepts::GraphItemIt::Constraints<_GraphItemIt>::constraints() [with _GraphItemIt = lemon::concepts::Digraph::NodeIt; GR = lemon::concepts::Digraph; Item = lemon::concepts::Digraph::Node]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItemIt; Type = lemon::concepts::Digraph::NodeIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:990:42: required from ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph; BAS = lemon::concepts::BaseDigraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent<>; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:93:42: required from ‘void MaxFlowClassConcept::Constraints::constraints() [with MF = lemon::Preflow >; GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = MaxFlowClassConcept >; Type = lemon::Preflow >]’ /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:369:36: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:104:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::NodeIt& lemon::concepts::Digraph::NodeIt::operator=(const lemon::concepts::Digraph::NodeIt&)’ is deprecated [-Wdeprecated-copy] 104 | i1=INVALID; | ~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:127:9: note: because ‘lemon::concepts::Digraph::NodeIt’ has user-provided ‘lemon::concepts::Digraph::NodeIt::NodeIt(const lemon::concepts::Digraph::NodeIt&)’ 127 | NodeIt(const NodeIt& n) : Node(n) { } | ^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:19: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::NodeIt& lemon::concepts::Digraph::NodeIt::operator=(const lemon::concepts::Digraph::NodeIt&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:127:9: note: because ‘lemon::concepts::Digraph::NodeIt’ has user-provided ‘lemon::concepts::Digraph::NodeIt::NodeIt(const lemon::concepts::Digraph::NodeIt&)’ 127 | NodeIt(const NodeIt& n) : Node(n) { } | ^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:14: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::NodeIt& lemon::concepts::Digraph::NodeIt::operator=(const lemon::concepts::Digraph::NodeIt&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:127:9: note: because ‘lemon::concepts::Digraph::NodeIt’ has user-provided ‘lemon::concepts::Digraph::NodeIt::NodeIt(const lemon::concepts::Digraph::NodeIt&)’ 127 | NodeIt(const NodeIt& n) : Node(n) { } | ^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItem::Constraints<_GraphItem>::constraints() [with _GraphItem = lemon::concepts::Digraph::InArcIt; char sel = 'i']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItem<'i'>; Type = lemon::concepts::Digraph::InArcIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:815:52: required from ‘void lemon::concepts::GraphIncIt::Constraints<_GraphIncIt>::constraints() [with _GraphIncIt = lemon::concepts::Digraph::InArcIt; GR = lemon::concepts::Digraph; Item = lemon::concepts::Digraph::Arc; Base = lemon::concepts::Digraph::Node; char sel = 'i']’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphIncIt; Type = lemon::concepts::Digraph::InArcIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:992:73: required from ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph; BAS = lemon::concepts::BaseDigraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent<>; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:93:42: required from ‘void MaxFlowClassConcept::Constraints::constraints() [with MF = lemon::Preflow >; GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = MaxFlowClassConcept >; Type = lemon::Preflow >]’ /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:369:36: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:104:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::InArcIt& lemon::concepts::Digraph::InArcIt::operator=(const lemon::concepts::Digraph::InArcIt&)’ is deprecated [-Wdeprecated-copy] 104 | i1=INVALID; | ~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:262:9: note: because ‘lemon::concepts::Digraph::InArcIt’ has user-provided ‘lemon::concepts::Digraph::InArcIt::InArcIt(const lemon::concepts::Digraph::InArcIt&)’ 262 | InArcIt(const InArcIt& e) : Arc(e) { } | ^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:19: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::InArcIt& lemon::concepts::Digraph::InArcIt::operator=(const lemon::concepts::Digraph::InArcIt&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:262:9: note: because ‘lemon::concepts::Digraph::InArcIt’ has user-provided ‘lemon::concepts::Digraph::InArcIt::InArcIt(const lemon::concepts::Digraph::InArcIt&)’ 262 | InArcIt(const InArcIt& e) : Arc(e) { } | ^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:14: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::InArcIt& lemon::concepts::Digraph::InArcIt::operator=(const lemon::concepts::Digraph::InArcIt&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:262:9: note: because ‘lemon::concepts::Digraph::InArcIt’ has user-provided ‘lemon::concepts::Digraph::InArcIt::InArcIt(const lemon::concepts::Digraph::InArcIt&)’ 262 | InArcIt(const InArcIt& e) : Arc(e) { } | ^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItem::Constraints<_GraphItem>::constraints() [with _GraphItem = lemon::concepts::Digraph::OutArcIt; char sel = 'o']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItem<'o'>; Type = lemon::concepts::Digraph::OutArcIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:815:52: required from ‘void lemon::concepts::GraphIncIt::Constraints<_GraphIncIt>::constraints() [with _GraphIncIt = lemon::concepts::Digraph::OutArcIt; GR = lemon::concepts::Digraph; Item = lemon::concepts::Digraph::Arc; Base = lemon::concepts::Digraph::Node; char sel = 'o']’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphIncIt; Type = lemon::concepts::Digraph::OutArcIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:994:74: required from ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph; BAS = lemon::concepts::BaseDigraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent<>; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:93:42: required from ‘void MaxFlowClassConcept::Constraints::constraints() [with MF = lemon::Preflow >; GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = MaxFlowClassConcept >; Type = lemon::Preflow >]’ /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:369:36: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:104:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::OutArcIt& lemon::concepts::Digraph::OutArcIt::operator=(const lemon::concepts::Digraph::OutArcIt&)’ is deprecated [-Wdeprecated-copy] 104 | i1=INVALID; | ~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:217:9: note: because ‘lemon::concepts::Digraph::OutArcIt’ has user-provided ‘lemon::concepts::Digraph::OutArcIt::OutArcIt(const lemon::concepts::Digraph::OutArcIt&)’ 217 | OutArcIt(const OutArcIt& e) : Arc(e) { } | ^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:19: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::OutArcIt& lemon::concepts::Digraph::OutArcIt::operator=(const lemon::concepts::Digraph::OutArcIt&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:217:9: note: because ‘lemon::concepts::Digraph::OutArcIt’ has user-provided ‘lemon::concepts::Digraph::OutArcIt::OutArcIt(const lemon::concepts::Digraph::OutArcIt&)’ 217 | OutArcIt(const OutArcIt& e) : Arc(e) { } | ^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:14: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::OutArcIt& lemon::concepts::Digraph::OutArcIt::operator=(const lemon::concepts::Digraph::OutArcIt&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:217:9: note: because ‘lemon::concepts::Digraph::OutArcIt’ has user-provided ‘lemon::concepts::Digraph::OutArcIt::OutArcIt(const lemon::concepts::Digraph::OutArcIt&)’ 217 | OutArcIt(const OutArcIt& e) : Arc(e) { } | ^~~~~~~~ [ 79%] Linking CXX executable max_flow_test cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/cmake -E cmake_link_script CMakeFiles/max_flow_test.dir/link.txt --verbose=1 /usr/bin/c++ -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -Wl,-Bsymbolic-functions -Wl,-z,relro -Wl,-z,now -rdynamic CMakeFiles/max_flow_test.dir/max_flow_test.cc.o -o max_flow_test -L/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 79%] Built target max_flow_test make -f test/CMakeFiles/maps_test.dir/build.make test/CMakeFiles/maps_test.dir/depend make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<>/liblemon-1.3.1+dfsg /<>/liblemon-1.3.1+dfsg/test /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test/CMakeFiles/maps_test.dir/DependInfo.cmake --color= Scanning dependencies of target maps_test make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' make -f test/CMakeFiles/maps_test.dir/build.make test/CMakeFiles/maps_test.dir/build make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 80%] Building CXX object test/CMakeFiles/maps_test.dir/maps_test.cc.o cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -I/<>/liblemon-1.3.1+dfsg -I/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -o CMakeFiles/maps_test.dir/maps_test.cc.o -c /<>/liblemon-1.3.1+dfsg/test/maps_test.cc /<>/liblemon-1.3.1+dfsg/test/maps_test.cc: In function ‘int main()’: /<>/liblemon-1.3.1+dfsg/test/maps_test.cc:162:24: warning: implicitly-declared ‘lemon::RangeMap::RangeMap(const lemon::RangeMap&)’ is deprecated [-Wdeprecated-copy] 162 | RangeMap map4 = map1; | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/maps_test.cc:24: /<>/liblemon-1.3.1+dfsg/lemon/maps.h:296:15: note: because ‘lemon::RangeMap’ has user-provided ‘lemon::RangeMap& lemon::RangeMap::operator=(const lemon::RangeMap&) [with V = B]’ 296 | RangeMap& operator=(const RangeMap&); | ^~~~~~~~ /<>/liblemon-1.3.1+dfsg/lemon/maps.h: In instantiation of ‘lemon::FunctorToMap::FunctorToMap(const F&) [with F = F; K = A; V = B]’: /<>/liblemon-1.3.1+dfsg/test/maps_test.cc:234:21: required from here /<>/liblemon-1.3.1+dfsg/lemon/maps.h:627:42: warning: implicitly-declared ‘constexpr F::F(const F&)’ is deprecated [-Wdeprecated-copy] 627 | FunctorToMap(const F &f = F()) : _f(f) {} | ^ /<>/liblemon-1.3.1+dfsg/test/maps_test.cc:66:6: note: because ‘F’ has user-provided ‘F& F::operator=(const F&)’ 66 | F& operator=(const F&); | ^~~~~~~~ In file included from /usr/include/c++/9/vector:67, from /<>/liblemon-1.3.1+dfsg/lemon/core.h:22, from /<>/liblemon-1.3.1+dfsg/lemon/concepts/maps.h:22, from /<>/liblemon-1.3.1+dfsg/test/maps_test.cc:23: /usr/include/c++/9/bits/stl_vector.h: In constructor ‘std::vector<_Tp, _Alloc>::vector(_InputIterator, _InputIterator, const allocator_type&) [with _InputIterator = __gnu_cxx::__normal_iterator >; = void; _Tp = double; _Alloc = std::allocator]’: /usr/include/c++/9/bits/stl_vector.h:650:2: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator >’ changed in GCC 7.1 650 | vector(_InputIterator __first, _InputIterator __last, | ^~~~~~ /usr/include/c++/9/bits/stl_vector.h:650:2: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator >’ changed in GCC 7.1 In file included from /usr/include/c++/9/set:60, from /<>/liblemon-1.3.1+dfsg/test/maps_test.cc:20: /usr/include/c++/9/bits/stl_tree.h: In member function ‘std::pair std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_get_insert_hint_unique_pos(std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::const_iterator, const key_type&) [with _Key = double; _Val = std::pair; _KeyOfValue = std::_Select1st >; _Compare = std::less; _Alloc = std::allocator >]’: /usr/include/c++/9/bits/stl_tree.h:2187:5: note: parameter passing for argument of type ‘std::_Rb_tree, std::_Select1st >, std::less, std::allocator > >::const_iterator’ {aka ‘std::_Rb_tree_const_iterator >’} changed in GCC 7.1 2187 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/9/map:61, from /<>/liblemon-1.3.1+dfsg/lemon/maps.h:25, from /<>/liblemon-1.3.1+dfsg/test/maps_test.cc:24: /usr/include/c++/9/bits/stl_map.h: In constructor ‘std::map<_Key, _Tp, _Compare, _Alloc>::map(_InputIterator, _InputIterator) [with _InputIterator = std::_Rb_tree_const_iterator >; _Key = double; _Tp = int; _Compare = std::less; _Alloc = std::allocator >]’: /usr/include/c++/9/bits/stl_map.h:271:2: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator >’ changed in GCC 7.1 271 | map(_InputIterator __first, _InputIterator __last) | ^~~ /usr/include/c++/9/bits/stl_map.h:271:2: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator >’ changed in GCC 7.1 In file included from /usr/include/c++/9/vector:72, from /<>/liblemon-1.3.1+dfsg/lemon/core.h:22, from /<>/liblemon-1.3.1+dfsg/lemon/concepts/maps.h:22, from /<>/liblemon-1.3.1+dfsg/test/maps_test.cc:23: /usr/include/c++/9/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_fill_insert(std::vector<_Tp, _Alloc>::iterator, std::vector<_Tp, _Alloc>::size_type, const value_type&) [with _Tp = double; _Alloc = std::allocator]’: /usr/include/c++/9/bits/vector.tcc:509:5: note: parameter passing for argument of type ‘std::vector::iterator’ {aka ‘__gnu_cxx::__normal_iterator >’} changed in GCC 7.1 509 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/9/vector:67, from /<>/liblemon-1.3.1+dfsg/lemon/core.h:22, from /<>/liblemon-1.3.1+dfsg/lemon/concepts/maps.h:22, from /<>/liblemon-1.3.1+dfsg/test/maps_test.cc:23: /usr/include/c++/9/bits/stl_vector.h: In constructor ‘lemon::UndirectorBase::ArcMapBase::ArcMapBase(const lemon::UndirectorBase&, const V&) [with V = double; DGR = lemon::SmartDigraph]’: /usr/include/c++/9/bits/stl_vector.h:957:4: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator >’ changed in GCC 7.1 957 | _M_fill_insert(end(), __new_size - size(), __x); | ^~~~~~~~~~~~~~ /usr/include/c++/9/bits/stl_vector.h:957:4: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator >’ changed in GCC 7.1 957 | _M_fill_insert(end(), __new_size - size(), __x); | ^~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/maps_test.cc:24: /<>/liblemon-1.3.1+dfsg/lemon/maps.h: In function ‘int main()’: /<>/liblemon-1.3.1+dfsg/lemon/maps.h:271:45: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator >’ changed in GCC 7.1 271 | : _vector(vector.begin(), vector.end()) {} | ^ /<>/liblemon-1.3.1+dfsg/lemon/maps.h:271:45: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator >’ changed in GCC 7.1 271 | : _vector(vector.begin(), vector.end()) {} | ^ /<>/liblemon-1.3.1+dfsg/lemon/maps.h:390:51: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator >’ changed in GCC 7.1 390 | : _map(map.begin(), map.end()), _value(value) {} | ^ /<>/liblemon-1.3.1+dfsg/lemon/maps.h:390:51: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator >’ changed in GCC 7.1 390 | : _map(map.begin(), map.end()), _value(value) {} | ^ /<>/liblemon-1.3.1+dfsg/lemon/maps.h:390:51: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator >’ changed in GCC 7.1 390 | : _map(map.begin(), map.end()), _value(value) {} | ^ /<>/liblemon-1.3.1+dfsg/lemon/maps.h:390:51: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator >’ changed in GCC 7.1 390 | : _map(map.begin(), map.end()), _value(value) {} | ^ [ 81%] Linking CXX executable maps_test cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/cmake -E cmake_link_script CMakeFiles/maps_test.dir/link.txt --verbose=1 /usr/bin/c++ -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -Wl,-Bsymbolic-functions -Wl,-z,relro -Wl,-z,now -rdynamic CMakeFiles/maps_test.dir/maps_test.cc.o -o maps_test -L/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 81%] Built target maps_test make -f test/CMakeFiles/min_cost_arborescence_test.dir/build.make test/CMakeFiles/min_cost_arborescence_test.dir/depend make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<>/liblemon-1.3.1+dfsg /<>/liblemon-1.3.1+dfsg/test /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test/CMakeFiles/min_cost_arborescence_test.dir/DependInfo.cmake --color= Scanning dependencies of target min_cost_arborescence_test make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' make -f test/CMakeFiles/min_cost_arborescence_test.dir/build.make test/CMakeFiles/min_cost_arborescence_test.dir/build make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 83%] Building CXX object test/CMakeFiles/min_cost_arborescence_test.dir/min_cost_arborescence_test.cc.o cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -I/<>/liblemon-1.3.1+dfsg -I/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -o CMakeFiles/min_cost_arborescence_test.dir/min_cost_arborescence_test.cc.o -c /<>/liblemon-1.3.1+dfsg/test/min_cost_arborescence_test.cc /<>/liblemon-1.3.1+dfsg/test/min_cost_arborescence_test.cc: In function ‘void checkMinCostArborescenceCompile()’: /<>/liblemon-1.3.1+dfsg/test/min_cost_arborescence_test.cc:111:34: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 111 | n = mcarb_test.processNextNode(); | ^ In file included from /<>/liblemon-1.3.1+dfsg/test/min_cost_arborescence_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ /<>/liblemon-1.3.1+dfsg/test/min_cost_arborescence_test.cc:117:30: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 117 | e = const_mcarb_test.pred(n); | ^ In file included from /<>/liblemon-1.3.1+dfsg/test/min_cost_arborescence_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_cost_arborescence_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/min_cost_arborescence.h: In instantiation of ‘void lemon::MinCostArborescence::init() [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::MinCostArborescence, lemon::MinCostArborescence >::SetArborescenceMapTraits > >::SetPredMapTraits >]’: /<>/liblemon-1.3.1+dfsg/test/min_cost_arborescence_test.cc:108:19: required from here /<>/liblemon-1.3.1+dfsg/lemon/min_cost_arborescence.h:508:31: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 508 | (*_cost_arcs)[it].arc = INVALID; | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_cost_arborescence_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_cost_arborescence_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/min_cost_arborescence.h: In instantiation of ‘lemon::MinCostArborescence::Node lemon::MinCostArborescence::processNextNode() [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::MinCostArborescence, lemon::MinCostArborescence >::SetArborescenceMapTraits > >::SetPredMapTraits >; lemon::MinCostArborescence::Node = lemon::concepts::Digraph::Node]’: /<>/liblemon-1.3.1+dfsg/test/min_cost_arborescence_test.cc:111:34: required from here /<>/liblemon-1.3.1+dfsg/lemon/min_cost_arborescence.h:557:17: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 557 | arc = contract(source); In file included from /<>/liblemon-1.3.1+dfsg/test/min_cost_arborescence_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_cost_arborescence_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/min_cost_arborescence.h:559:17: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 559 | arc = prepare(source); In file included from /<>/liblemon-1.3.1+dfsg/test/min_cost_arborescence_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_cost_arborescence_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/min_cost_arborescence.h:561:18: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 561 | source = _digraph->source(arc); In file included from /<>/liblemon-1.3.1+dfsg/test/min_cost_arborescence_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_cost_arborescence_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/min_cost_arborescence.h: In instantiation of ‘lemon::MinCostArborescence::Arc lemon::MinCostArborescence::prepare(lemon::MinCostArborescence::Node) [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::MinCostArborescence, lemon::MinCostArborescence >::SetArborescenceMapTraits > >::SetPredMapTraits >; lemon::MinCostArborescence::Arc = lemon::concepts::Digraph::Arc; lemon::MinCostArborescence::Node = lemon::concepts::Digraph::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/min_cost_arborescence.h:553:19: required from ‘lemon::MinCostArborescence::Node lemon::MinCostArborescence::processNextNode() [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::MinCostArborescence, lemon::MinCostArborescence >::SetArborescenceMapTraits > >::SetPredMapTraits >; lemon::MinCostArborescence::Node = lemon::concepts::Digraph::Node]’ /<>/liblemon-1.3.1+dfsg/test/min_cost_arborescence_test.cc:111:34: required from here /<>/liblemon-1.3.1+dfsg/lemon/min_cost_arborescence.h:282:37: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 282 | (*_cost_arcs)[source].arc = arc; | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_cost_arborescence_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_cost_arborescence_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/min_cost_arborescence.h:287:39: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 287 | (*_cost_arcs)[source].arc = arc; | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_cost_arborescence_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_cost_arborescence_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/min_cost_arborescence.h:305:37: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 305 | (*_cost_arcs)[nodes[i]].arc = INVALID; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_cost_arborescence_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_cost_arborescence_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/min_cost_arborescence.h: In instantiation of ‘lemon::MinCostArborescence::Arc lemon::MinCostArborescence::contract(lemon::MinCostArborescence::Node) [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::MinCostArborescence, lemon::MinCostArborescence >::SetArborescenceMapTraits > >::SetPredMapTraits >; lemon::MinCostArborescence::Arc = lemon::concepts::Digraph::Arc; lemon::MinCostArborescence::Node = lemon::concepts::Digraph::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/min_cost_arborescence.h:557:19: required from ‘lemon::MinCostArborescence::Node lemon::MinCostArborescence::processNextNode() [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::MinCostArborescence, lemon::MinCostArborescence >::SetArborescenceMapTraits > >::SetPredMapTraits >; lemon::MinCostArborescence::Node = lemon::concepts::Digraph::Node]’ /<>/liblemon-1.3.1+dfsg/test/min_cost_arborescence_test.cc:111:34: required from here /<>/liblemon-1.3.1+dfsg/lemon/min_cost_arborescence.h:322:39: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 322 | (*_cost_arcs)[source].arc = arc; | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_cost_arborescence_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_cost_arborescence_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/min_cost_arborescence.h:327:41: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 327 | (*_cost_arcs)[source].arc = arc; | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_cost_arborescence_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_cost_arborescence_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/min_cost_arborescence.h:348:37: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 348 | (*_cost_arcs)[nodes[i]].arc = INVALID; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_cost_arborescence_test.cc:27: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /usr/include/c++/9/vector:72, from /<>/liblemon-1.3.1+dfsg/test/min_cost_arborescence_test.cc:21: /usr/include/c++/9/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(std::vector<_Tp, _Alloc>::iterator, _Args&& ...) [with _Args = {const lemon::MinCostArborescence::ArcMap >::DualVariable&}; _Tp = lemon::MinCostArborescence::ArcMap >::DualVariable; _Alloc = std::allocator::ArcMap >::DualVariable>]’: /usr/include/c++/9/bits/vector.tcc:426:7: note: parameter passing for argument of type ‘std::vector::ArcMap >::DualVariable, std::allocator::ArcMap >::DualVariable> >::iterator’ {aka ‘__gnu_cxx::__normal_iterator::ArcMap >::DualVariable*, std::vector::ArcMap >::DualVariable, std::allocator::ArcMap >::DualVariable> > >’} changed in GCC 7.1 426 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/9/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(std::vector<_Tp, _Alloc>::iterator, _Args&& ...) [with _Args = {const lemon::MinCostArborescence::ArcMap >::CostArc&}; _Tp = lemon::MinCostArborescence::ArcMap >::CostArc; _Alloc = std::allocator::ArcMap >::CostArc>]’: /usr/include/c++/9/bits/vector.tcc:426:7: note: parameter passing for argument of type ‘std::vector::ArcMap >::CostArc, std::allocator::ArcMap >::CostArc> >::iterator’ {aka ‘__gnu_cxx::__normal_iterator::ArcMap >::CostArc*, std::vector::ArcMap >::CostArc, std::allocator::ArcMap >::CostArc> > >’} changed in GCC 7.1 In file included from /usr/include/c++/9/vector:67, from /<>/liblemon-1.3.1+dfsg/test/min_cost_arborescence_test.cc:21: /usr/include/c++/9/bits/stl_vector.h: In member function ‘lemon::MinCostArborescence::Arc lemon::MinCostArborescence::contract(lemon::MinCostArborescence::Node) [with GR = lemon::SmartDigraph; CM = lemon::DigraphExtender::ArcMap; TR = lemon::MinCostArborescenceDefaultTraits::ArcMap >]’: /usr/include/c++/9/bits/stl_vector.h:1195:4: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator::ArcMap >::DualVariable*, std::vector::ArcMap >::DualVariable, std::allocator::ArcMap >::DualVariable> > >’ changed in GCC 7.1 1195 | _M_realloc_insert(end(), __x); | ^~~~~~~~~~~~~~~~~ /usr/include/c++/9/bits/stl_vector.h:1195:4: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator::ArcMap >::CostArc*, std::vector::ArcMap >::CostArc, std::allocator::ArcMap >::CostArc> > >’ changed in GCC 7.1 1195 | _M_realloc_insert(end(), __x); | ^~~~~~~~~~~~~~~~~ /usr/include/c++/9/bits/stl_vector.h: In member function ‘lemon::MinCostArborescence::Arc lemon::MinCostArborescence::prepare(lemon::MinCostArborescence::Node) [with GR = lemon::SmartDigraph; CM = lemon::DigraphExtender::ArcMap; TR = lemon::MinCostArborescenceDefaultTraits::ArcMap >]’: /usr/include/c++/9/bits/stl_vector.h:1195:4: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator::ArcMap >::DualVariable*, std::vector::ArcMap >::DualVariable, std::allocator::ArcMap >::DualVariable> > >’ changed in GCC 7.1 1195 | _M_realloc_insert(end(), __x); | ^~~~~~~~~~~~~~~~~ /usr/include/c++/9/bits/stl_vector.h:1195:4: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator::ArcMap >::CostArc*, std::vector::ArcMap >::CostArc, std::allocator::ArcMap >::CostArc> > >’ changed in GCC 7.1 1195 | _M_realloc_insert(end(), __x); | ^~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/9/vector:72, from /<>/liblemon-1.3.1+dfsg/test/min_cost_arborescence_test.cc:21: /usr/include/c++/9/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(std::vector<_Tp, _Alloc>::iterator, _Args&& ...) [with _Args = {const lemon::MinCostArborescence::ArcMap, lemon::MinCostArborescence::ArcMap >::SetArborescenceMapTraits::ArcMap > >::DualVariable&}; _Tp = lemon::MinCostArborescence::ArcMap, lemon::MinCostArborescence::ArcMap >::SetArborescenceMapTraits::ArcMap > >::DualVariable; _Alloc = std::allocator::ArcMap, lemon::MinCostArborescence::ArcMap >::SetArborescenceMapTraits::ArcMap > >::DualVariable>]’: /usr/include/c++/9/bits/vector.tcc:426:7: note: parameter passing for argument of type ‘std::vector::ArcMap, lemon::MinCostArborescence::ArcMap >::SetArborescenceMapTraits::ArcMap > >::DualVariable, std::allocator::ArcMap, lemon::MinCostArborescence::ArcMap >::SetArborescenceMapTraits::ArcMap > >::DualVariable> >::iterator’ {aka ‘__gnu_cxx::__normal_iterator::ArcMap, lemon::MinCostArborescence::ArcMap >::SetArborescenceMapTraits::ArcMap > >::DualVariable*, std::vector::ArcMap, lemon::MinCostArborescence::ArcMap >::SetArborescenceMapTraits::ArcMap > >::DualVariable, std::allocator::ArcMap, lemon::MinCostArborescence::ArcMap >::SetArborescenceMapTraits::ArcMap > >::DualVariable> > >’} changed in GCC 7.1 426 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/9/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(std::vector<_Tp, _Alloc>::iterator, _Args&& ...) [with _Args = {const lemon::MinCostArborescence::ArcMap, lemon::MinCostArborescence::ArcMap >::SetArborescenceMapTraits::ArcMap > >::CostArc&}; _Tp = lemon::MinCostArborescence::ArcMap, lemon::MinCostArborescence::ArcMap >::SetArborescenceMapTraits::ArcMap > >::CostArc; _Alloc = std::allocator::ArcMap, lemon::MinCostArborescence::ArcMap >::SetArborescenceMapTraits::ArcMap > >::CostArc>]’: /usr/include/c++/9/bits/vector.tcc:426:7: note: parameter passing for argument of type ‘std::vector::ArcMap, lemon::MinCostArborescence::ArcMap >::SetArborescenceMapTraits::ArcMap > >::CostArc, std::allocator::ArcMap, lemon::MinCostArborescence::ArcMap >::SetArborescenceMapTraits::ArcMap > >::CostArc> >::iterator’ {aka ‘__gnu_cxx::__normal_iterator::ArcMap, lemon::MinCostArborescence::ArcMap >::SetArborescenceMapTraits::ArcMap > >::CostArc*, std::vector::ArcMap, lemon::MinCostArborescence::ArcMap >::SetArborescenceMapTraits::ArcMap > >::CostArc, std::allocator::ArcMap, lemon::MinCostArborescence::ArcMap >::SetArborescenceMapTraits::ArcMap > >::CostArc> > >’} changed in GCC 7.1 In file included from /usr/include/c++/9/vector:67, from /<>/liblemon-1.3.1+dfsg/test/min_cost_arborescence_test.cc:21: /usr/include/c++/9/bits/stl_vector.h: In member function ‘lemon::MinCostArborescence::Arc lemon::MinCostArborescence::contract(lemon::MinCostArborescence::Node) [with GR = lemon::SmartDigraph; CM = lemon::DigraphExtender::ArcMap; TR = lemon::MinCostArborescence::ArcMap >::SetArborescenceMapTraits::ArcMap >]’: /usr/include/c++/9/bits/stl_vector.h:1195:4: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator::ArcMap, lemon::MinCostArborescence::ArcMap >::SetArborescenceMapTraits::ArcMap > >::DualVariable*, std::vector::ArcMap, lemon::MinCostArborescence::ArcMap >::SetArborescenceMapTraits::ArcMap > >::DualVariable, std::allocator::ArcMap, lemon::MinCostArborescence::ArcMap >::SetArborescenceMapTraits::ArcMap > >::DualVariable> > >’ changed in GCC 7.1 1195 | _M_realloc_insert(end(), __x); | ^~~~~~~~~~~~~~~~~ /usr/include/c++/9/bits/stl_vector.h:1195:4: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator::ArcMap, lemon::MinCostArborescence::ArcMap >::SetArborescenceMapTraits::ArcMap > >::CostArc*, std::vector::ArcMap, lemon::MinCostArborescence::ArcMap >::SetArborescenceMapTraits::ArcMap > >::CostArc, std::allocator::ArcMap, lemon::MinCostArborescence::ArcMap >::SetArborescenceMapTraits::ArcMap > >::CostArc> > >’ changed in GCC 7.1 1195 | _M_realloc_insert(end(), __x); | ^~~~~~~~~~~~~~~~~ /usr/include/c++/9/bits/stl_vector.h: In member function ‘lemon::MinCostArborescence::Arc lemon::MinCostArborescence::prepare(lemon::MinCostArborescence::Node) [with GR = lemon::SmartDigraph; CM = lemon::DigraphExtender::ArcMap; TR = lemon::MinCostArborescence::ArcMap >::SetArborescenceMapTraits::ArcMap >]’: /usr/include/c++/9/bits/stl_vector.h:1195:4: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator::ArcMap, lemon::MinCostArborescence::ArcMap >::SetArborescenceMapTraits::ArcMap > >::DualVariable*, std::vector::ArcMap, lemon::MinCostArborescence::ArcMap >::SetArborescenceMapTraits::ArcMap > >::DualVariable, std::allocator::ArcMap, lemon::MinCostArborescence::ArcMap >::SetArborescenceMapTraits::ArcMap > >::DualVariable> > >’ changed in GCC 7.1 1195 | _M_realloc_insert(end(), __x); | ^~~~~~~~~~~~~~~~~ /usr/include/c++/9/bits/stl_vector.h:1195:4: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator::ArcMap, lemon::MinCostArborescence::ArcMap >::SetArborescenceMapTraits::ArcMap > >::CostArc*, std::vector::ArcMap, lemon::MinCostArborescence::ArcMap >::SetArborescenceMapTraits::ArcMap > >::CostArc, std::allocator::ArcMap, lemon::MinCostArborescence::ArcMap >::SetArborescenceMapTraits::ArcMap > >::CostArc> > >’ changed in GCC 7.1 1195 | _M_realloc_insert(end(), __x); | ^~~~~~~~~~~~~~~~~ [ 84%] Linking CXX executable min_cost_arborescence_test cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/cmake -E cmake_link_script CMakeFiles/min_cost_arborescence_test.dir/link.txt --verbose=1 /usr/bin/c++ -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -Wl,-Bsymbolic-functions -Wl,-z,relro -Wl,-z,now -rdynamic CMakeFiles/min_cost_arborescence_test.dir/min_cost_arborescence_test.cc.o -o min_cost_arborescence_test -L/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 84%] Built target min_cost_arborescence_test make -f test/CMakeFiles/max_cardinality_search_test.dir/build.make test/CMakeFiles/max_cardinality_search_test.dir/depend make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<>/liblemon-1.3.1+dfsg /<>/liblemon-1.3.1+dfsg/test /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test/CMakeFiles/max_cardinality_search_test.dir/DependInfo.cmake --color= Scanning dependencies of target max_cardinality_search_test make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' make -f test/CMakeFiles/max_cardinality_search_test.dir/build.make test/CMakeFiles/max_cardinality_search_test.dir/build make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 85%] Building CXX object test/CMakeFiles/max_cardinality_search_test.dir/max_cardinality_search_test.cc.o cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -I/<>/liblemon-1.3.1+dfsg -I/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -o CMakeFiles/max_cardinality_search_test.dir/max_cardinality_search_test.cc.o -c /<>/liblemon-1.3.1+dfsg/test/max_cardinality_search_test.cc /<>/liblemon-1.3.1+dfsg/test/max_cardinality_search_test.cc: In function ‘void checkMaxCardSearchCompile()’: /<>/liblemon-1.3.1+dfsg/test/max_cardinality_search_test.cc:89:24: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 89 | n = maxcard.nextNode(); | ^ In file included from /<>/liblemon-1.3.1+dfsg/test/max_cardinality_search_test.cc:24: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ [ 86%] Linking CXX executable max_cardinality_search_test cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/cmake -E cmake_link_script CMakeFiles/max_cardinality_search_test.dir/link.txt --verbose=1 /usr/bin/c++ -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -Wl,-Bsymbolic-functions -Wl,-z,relro -Wl,-z,now -rdynamic CMakeFiles/max_cardinality_search_test.dir/max_cardinality_search_test.cc.o -o max_cardinality_search_test -L/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 86%] Built target max_cardinality_search_test make -f test/CMakeFiles/min_cost_flow_test.dir/build.make test/CMakeFiles/min_cost_flow_test.dir/depend make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<>/liblemon-1.3.1+dfsg /<>/liblemon-1.3.1+dfsg/test /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test/CMakeFiles/min_cost_flow_test.dir/DependInfo.cmake --color= Scanning dependencies of target min_cost_flow_test make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' make -f test/CMakeFiles/min_cost_flow_test.dir/build.make test/CMakeFiles/min_cost_flow_test.dir/build make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 87%] Building CXX object test/CMakeFiles/min_cost_flow_test.dir/min_cost_flow_test.cc.o cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -I/<>/liblemon-1.3.1+dfsg -I/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -o CMakeFiles/min_cost_flow_test.dir/min_cost_flow_test.cc.o -c /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::BaseDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseDigraphComponent; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:477:55: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:153:42: required from ‘void McfClassConcept::Constraints::constraints() [with MCF = lemon::NetworkSimplex; GR = lemon::concepts::Digraph; Value = int; Cost = int]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = McfClassConcept; Type = lemon::NetworkSimplex]’ /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:463:40: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:173:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 173 | n = digraph.source(e); In file included from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:174:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 174 | n = digraph.target(e); In file included from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:175:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 175 | n = digraph.oppositeNode(n, e); In file included from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph; BAS = lemon::concepts::BaseDigraphComponent]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent<>; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:153:42: required from ‘void McfClassConcept::Constraints::constraints() [with MCF = lemon::NetworkSimplex; GR = lemon::concepts::Digraph; Value = int; Cost = int]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = McfClassConcept; Type = lemon::NetworkSimplex]’ /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:463:40: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:999:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 999 | n = digraph.baseNode(iait); In file included from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1000:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 1000 | n = digraph.runningNode(iait); In file included from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1001:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 1001 | n = digraph.baseNode(oait); In file included from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1002:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 1002 | n = digraph.runningNode(oait); In file included from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::IDableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph; BAS = lemon::concepts::BaseDigraphComponent]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IDableDigraphComponent<>; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:479:59: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:153:42: required from ‘void McfClassConcept::Constraints::constraints() [with MCF = lemon::NetworkSimplex; GR = lemon::concepts::Digraph; Value = int; Cost = int]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = McfClassConcept; Type = lemon::NetworkSimplex]’ /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:463:40: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:526:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 526 | node=INVALID; | ~~~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:529:16: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 529 | node = digraph.nodeFromId(nid); In file included from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:531:14: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 531 | arc=INVALID; | ~~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:534:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 534 | arc = digraph.arcFromId(eid); In file included from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/network_simplex.h: In instantiation of ‘bool lemon::NetworkSimplex::initialPivots() [with GR = lemon::concepts::Digraph; V = int; C = int]’: /<>/liblemon-1.3.1+dfsg/lemon/network_simplex.h:1595:12: required from ‘lemon::NetworkSimplex::ProblemType lemon::NetworkSimplex::start() [with PivotRuleImpl = lemon::NetworkSimplex::FirstEligiblePivotRule; GR = lemon::concepts::Digraph; V = int; C = int]’ /<>/liblemon-1.3.1+dfsg/lemon/network_simplex.h:1577:48: required from ‘lemon::NetworkSimplex::ProblemType lemon::NetworkSimplex::start(lemon::NetworkSimplex::PivotRule) [with GR = lemon::concepts::Digraph; V = int; C = int]’ /<>/liblemon-1.3.1+dfsg/lemon/network_simplex.h:834:30: required from ‘lemon::NetworkSimplex::ProblemType lemon::NetworkSimplex::run(lemon::NetworkSimplex::PivotRule) [with GR = lemon::concepts::Digraph; V = int; C = int]’ /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:160:9: required from ‘void McfClassConcept::Constraints::constraints() [with MCF = lemon::NetworkSimplex; GR = lemon::concepts::Digraph; Value = int; Cost = int]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = McfClassConcept; Type = lemon::NetworkSimplex]’ /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:463:40: required from here /<>/liblemon-1.3.1+dfsg/lemon/network_simplex.h:1509:29: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 1509 | if (reached[u = _graph.source(a)]) continue; In file included from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/network_simplex.h:1528:25: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 1528 | min_arc = a; | ~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/network_simplex.h:1546:23: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 1546 | min_arc = a; | ~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/network_simplex.h: In instantiation of ‘bool lemon::NetworkSimplex::initialPivots() [with GR = lemon::concepts::Digraph; V = double; C = double]’: /<>/liblemon-1.3.1+dfsg/lemon/network_simplex.h:1595:12: required from ‘lemon::NetworkSimplex::ProblemType lemon::NetworkSimplex::start() [with PivotRuleImpl = lemon::NetworkSimplex::FirstEligiblePivotRule; GR = lemon::concepts::Digraph; V = double; C = double]’ /<>/liblemon-1.3.1+dfsg/lemon/network_simplex.h:1577:48: required from ‘lemon::NetworkSimplex::ProblemType lemon::NetworkSimplex::start(lemon::NetworkSimplex::PivotRule) [with GR = lemon::concepts::Digraph; V = double; C = double]’ /<>/liblemon-1.3.1+dfsg/lemon/network_simplex.h:834:30: required from ‘lemon::NetworkSimplex::ProblemType lemon::NetworkSimplex::run(lemon::NetworkSimplex::PivotRule) [with GR = lemon::concepts::Digraph; V = double; C = double]’ /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:160:9: required from ‘void McfClassConcept::Constraints::constraints() [with MCF = lemon::NetworkSimplex; GR = lemon::concepts::Digraph; Value = double; Cost = double]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = McfClassConcept; Type = lemon::NetworkSimplex]’ /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:465:48: required from here /<>/liblemon-1.3.1+dfsg/lemon/network_simplex.h:1509:29: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 1509 | if (reached[u = _graph.source(a)]) continue; In file included from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/network_simplex.h:1528:25: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 1528 | min_arc = a; | ~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/network_simplex.h:1546:23: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 1546 | min_arc = a; | ~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/network_simplex.h: In instantiation of ‘bool lemon::NetworkSimplex::initialPivots() [with GR = lemon::concepts::Digraph; V = int; C = double]’: /<>/liblemon-1.3.1+dfsg/lemon/network_simplex.h:1595:12: required from ‘lemon::NetworkSimplex::ProblemType lemon::NetworkSimplex::start() [with PivotRuleImpl = lemon::NetworkSimplex::FirstEligiblePivotRule; GR = lemon::concepts::Digraph; V = int; C = double]’ /<>/liblemon-1.3.1+dfsg/lemon/network_simplex.h:1577:48: required from ‘lemon::NetworkSimplex::ProblemType lemon::NetworkSimplex::start(lemon::NetworkSimplex::PivotRule) [with GR = lemon::concepts::Digraph; V = int; C = double]’ /<>/liblemon-1.3.1+dfsg/lemon/network_simplex.h:834:30: required from ‘lemon::NetworkSimplex::ProblemType lemon::NetworkSimplex::run(lemon::NetworkSimplex::PivotRule) [with GR = lemon::concepts::Digraph; V = int; C = double]’ /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:160:9: required from ‘void McfClassConcept::Constraints::constraints() [with MCF = lemon::NetworkSimplex; GR = lemon::concepts::Digraph; Value = int; Cost = double]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = McfClassConcept; Type = lemon::NetworkSimplex]’ /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:467:53: required from here /<>/liblemon-1.3.1+dfsg/lemon/network_simplex.h:1509:29: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 1509 | if (reached[u = _graph.source(a)]) continue; In file included from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/network_simplex.h:1528:25: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 1528 | min_arc = a; | ~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/network_simplex.h:1546:23: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 1546 | min_arc = a; | ~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/cost_scaling.h:34, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/circulation.h: In instantiation of ‘bool lemon::Circulation::start() [with GR = lemon::concepts::Digraph; LM = lemon::ConstMap; UM = lemon::concepts::Digraph::ArcMap; SM = lemon::concepts::Digraph::NodeMap; TR = lemon::CirculationDefaultTraits, lemon::concepts::Digraph::ArcMap, lemon::concepts::Digraph::NodeMap >]’: /<>/liblemon-1.3.1+dfsg/lemon/circulation.h:664:14: required from ‘bool lemon::Circulation::run() [with GR = lemon::concepts::Digraph; LM = lemon::ConstMap; UM = lemon::concepts::Digraph::ArcMap; SM = lemon::concepts::Digraph::NodeMap; TR = lemon::CirculationDefaultTraits, lemon::concepts::Digraph::ArcMap, lemon::concepts::Digraph::NodeMap >]’ /<>/liblemon-1.3.1+dfsg/lemon/cost_scaling.h:861:11: required from ‘lemon::CostScaling::ProblemType lemon::CostScaling::init() [with GR = lemon::concepts::Digraph; V = int; C = int; TR = lemon::CostScalingDefaultTraits]’ /<>/liblemon-1.3.1+dfsg/lemon/cost_scaling.h:512:24: required from ‘lemon::CostScaling::ProblemType lemon::CostScaling::run(lemon::CostScaling::Method, int) [with GR = lemon::concepts::Digraph; V = int; C = int; TR = lemon::CostScalingDefaultTraits]’ /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:160:9: required from ‘void McfClassConcept::Constraints::constraints() [with MCF = lemon::CostScaling; GR = lemon::concepts::Digraph; Value = int; Cost = int]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = McfClassConcept; Type = lemon::CostScaling]’ /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:488:37: required from here /<>/liblemon-1.3.1+dfsg/lemon/circulation.h:576:17: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 576 | while((act=_level->highestActive())!=INVALID) { | ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/cost_scaling.h:34, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/circulation.h: In instantiation of ‘bool lemon::Circulation::start() [with GR = lemon::concepts::Digraph; LM = lemon::ConstMap; UM = lemon::concepts::Digraph::ArcMap; SM = lemon::concepts::Digraph::NodeMap; TR = lemon::CirculationDefaultTraits, lemon::concepts::Digraph::ArcMap, lemon::concepts::Digraph::NodeMap >]’: /<>/liblemon-1.3.1+dfsg/lemon/circulation.h:664:14: required from ‘bool lemon::Circulation::run() [with GR = lemon::concepts::Digraph; LM = lemon::ConstMap; UM = lemon::concepts::Digraph::ArcMap; SM = lemon::concepts::Digraph::NodeMap; TR = lemon::CirculationDefaultTraits, lemon::concepts::Digraph::ArcMap, lemon::concepts::Digraph::NodeMap >]’ /<>/liblemon-1.3.1+dfsg/lemon/cost_scaling.h:861:11: required from ‘lemon::CostScaling::ProblemType lemon::CostScaling::init() [with GR = lemon::concepts::Digraph; V = double; C = double; TR = lemon::CostScalingDefaultTraits]’ /<>/liblemon-1.3.1+dfsg/lemon/cost_scaling.h:512:24: required from ‘lemon::CostScaling::ProblemType lemon::CostScaling::run(lemon::CostScaling::Method, int) [with GR = lemon::concepts::Digraph; V = double; C = double; TR = lemon::CostScalingDefaultTraits]’ /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:160:9: required from ‘void McfClassConcept::Constraints::constraints() [with MCF = lemon::CostScaling; GR = lemon::concepts::Digraph; Value = double; Cost = double]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = McfClassConcept; Type = lemon::CostScaling]’ /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:490:45: required from here /<>/liblemon-1.3.1+dfsg/lemon/circulation.h:576:17: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 576 | while((act=_level->highestActive())!=INVALID) { | ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/circulation.h:23, from /<>/liblemon-1.3.1+dfsg/lemon/cost_scaling.h:34, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h: In instantiation of ‘void lemon::Elevator::initStart() [with GR = lemon::concepts::Digraph; Item = lemon::concepts::Digraph::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/circulation.h:555:7: required from ‘void lemon::Circulation::greedyInit() [with GR = lemon::concepts::Digraph; LM = lemon::ConstMap; UM = lemon::concepts::Digraph::ArcMap; SM = lemon::concepts::Digraph::NodeMap; TR = lemon::CirculationDefaultTraits, lemon::concepts::Digraph::ArcMap, lemon::concepts::Digraph::NodeMap >]’ /<>/liblemon-1.3.1+dfsg/lemon/circulation.h:663:7: required from ‘bool lemon::Circulation::run() [with GR = lemon::concepts::Digraph; LM = lemon::ConstMap; UM = lemon::concepts::Digraph::ArcMap; SM = lemon::concepts::Digraph::NodeMap; TR = lemon::CirculationDefaultTraits, lemon::concepts::Digraph::ArcMap, lemon::concepts::Digraph::NodeMap >]’ /<>/liblemon-1.3.1+dfsg/lemon/cost_scaling.h:861:11: required from ‘lemon::CostScaling::ProblemType lemon::CostScaling::init() [with GR = lemon::concepts::Digraph; V = int; C = int; TR = lemon::CostScalingDefaultTraits]’ /<>/liblemon-1.3.1+dfsg/lemon/cost_scaling.h:512:24: required from ‘lemon::CostScaling::ProblemType lemon::CostScaling::run(lemon::CostScaling::Method, int) [with GR = lemon::concepts::Digraph; V = int; C = int; TR = lemon::CostScalingDefaultTraits]’ /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:160:9: required from ‘void McfClassConcept::Constraints::constraints() [with MCF = lemon::CostScaling; GR = lemon::concepts::Digraph; Value = int; Cost = int]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = McfClassConcept; Type = lemon::CostScaling]’ /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:488:37: required from here /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:435:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 435 | *n=i; | ~~^~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItem::Constraints<_GraphItem>::constraints() [with _GraphItem = lemon::concepts::Digraph::Node; char sel = 'n']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItem<'n'>; Type = lemon::concepts::Digraph::Node]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:168:45: required from ‘void lemon::concepts::BaseDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseDigraphComponent; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:477:55: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:153:42: required from ‘void McfClassConcept::Constraints::constraints() [with MCF = lemon::NetworkSimplex; GR = lemon::concepts::Digraph; Value = int; Cost = int]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = McfClassConcept; Type = lemon::NetworkSimplex]’ /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:463:40: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:104:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 104 | i1=INVALID; | ~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:19: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:14: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItem::Constraints<_GraphItem>::constraints() [with _GraphItem = lemon::concepts::Digraph::Arc; char sel = 'a']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItem<'a'>; Type = lemon::concepts::Digraph::Arc]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:169:44: required from ‘void lemon::concepts::BaseDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseDigraphComponent; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:477:55: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:153:42: required from ‘void McfClassConcept::Constraints::constraints() [with MCF = lemon::NetworkSimplex; GR = lemon::concepts::Digraph; Value = int; Cost = int]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = McfClassConcept; Type = lemon::NetworkSimplex]’ /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:463:40: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:104:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 104 | i1=INVALID; | ~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:19: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:14: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItemIt::Constraints<_GraphItemIt>::constraints() [with _GraphItemIt = lemon::concepts::Digraph::ArcIt; GR = lemon::concepts::Digraph; Item = lemon::concepts::Digraph::Arc]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItemIt; Type = lemon::concepts::Digraph::ArcIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:988:41: required from ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph; BAS = lemon::concepts::BaseDigraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent<>; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:153:42: required from ‘void McfClassConcept::Constraints::constraints() [with MCF = lemon::NetworkSimplex; GR = lemon::concepts::Digraph; Value = int; Cost = int]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = McfClassConcept; Type = lemon::NetworkSimplex]’ /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:463:40: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:732:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::ArcIt& lemon::concepts::Digraph::ArcIt::operator=(const lemon::concepts::Digraph::ArcIt&)’ is deprecated [-Wdeprecated-copy] 732 | it2 = ++it1; | ~~~~^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:305:9: note: because ‘lemon::concepts::Digraph::ArcIt’ has user-provided ‘lemon::concepts::Digraph::ArcIt::ArcIt(const lemon::concepts::Digraph::ArcIt&)’ 305 | ArcIt(const ArcIt& e) : Arc(e) { } | ^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:733:17: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::ArcIt& lemon::concepts::Digraph::ArcIt::operator=(const lemon::concepts::Digraph::ArcIt&)’ is deprecated [-Wdeprecated-copy] 733 | ++it2 = it1; | ~~~~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:305:9: note: because ‘lemon::concepts::Digraph::ArcIt’ has user-provided ‘lemon::concepts::Digraph::ArcIt::ArcIt(const lemon::concepts::Digraph::ArcIt&)’ 305 | ArcIt(const ArcIt& e) : Arc(e) { } | ^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:737:14: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 737 | bi = it2; | ~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItemIt::Constraints<_GraphItemIt>::constraints() [with _GraphItemIt = lemon::concepts::Digraph::NodeIt; GR = lemon::concepts::Digraph; Item = lemon::concepts::Digraph::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItemIt; Type = lemon::concepts::Digraph::NodeIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:990:42: required from ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph; BAS = lemon::concepts::BaseDigraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent<>; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:153:42: required from ‘void McfClassConcept::Constraints::constraints() [with MCF = lemon::NetworkSimplex; GR = lemon::concepts::Digraph; Value = int; Cost = int]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = McfClassConcept; Type = lemon::NetworkSimplex]’ /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:463:40: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:732:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::NodeIt& lemon::concepts::Digraph::NodeIt::operator=(const lemon::concepts::Digraph::NodeIt&)’ is deprecated [-Wdeprecated-copy] 732 | it2 = ++it1; | ~~~~^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:127:9: note: because ‘lemon::concepts::Digraph::NodeIt’ has user-provided ‘lemon::concepts::Digraph::NodeIt::NodeIt(const lemon::concepts::Digraph::NodeIt&)’ 127 | NodeIt(const NodeIt& n) : Node(n) { } | ^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:733:17: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::NodeIt& lemon::concepts::Digraph::NodeIt::operator=(const lemon::concepts::Digraph::NodeIt&)’ is deprecated [-Wdeprecated-copy] 733 | ++it2 = it1; | ~~~~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:127:9: note: because ‘lemon::concepts::Digraph::NodeIt’ has user-provided ‘lemon::concepts::Digraph::NodeIt::NodeIt(const lemon::concepts::Digraph::NodeIt&)’ 127 | NodeIt(const NodeIt& n) : Node(n) { } | ^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:737:14: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 737 | bi = it2; | ~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphIncIt::Constraints<_GraphIncIt>::constraints() [with _GraphIncIt = lemon::concepts::Digraph::InArcIt; GR = lemon::concepts::Digraph; Item = lemon::concepts::Digraph::Arc; Base = lemon::concepts::Digraph::Node; char sel = 'i']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphIncIt; Type = lemon::concepts::Digraph::InArcIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:992:73: required from ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph; BAS = lemon::concepts::BaseDigraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent<>; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:153:42: required from ‘void McfClassConcept::Constraints::constraints() [with MCF = lemon::NetworkSimplex; GR = lemon::concepts::Digraph; Value = int; Cost = int]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = McfClassConcept; Type = lemon::NetworkSimplex]’ /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:463:40: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:823:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::InArcIt& lemon::concepts::Digraph::InArcIt::operator=(const lemon::concepts::Digraph::InArcIt&)’ is deprecated [-Wdeprecated-copy] 823 | it2 = ++it1; | ~~~~^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:262:9: note: because ‘lemon::concepts::Digraph::InArcIt’ has user-provided ‘lemon::concepts::Digraph::InArcIt::InArcIt(const lemon::concepts::Digraph::InArcIt&)’ 262 | InArcIt(const InArcIt& e) : Arc(e) { } | ^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:824:17: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::InArcIt& lemon::concepts::Digraph::InArcIt::operator=(const lemon::concepts::Digraph::InArcIt&)’ is deprecated [-Wdeprecated-copy] 824 | ++it2 = it1; | ~~~~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:262:9: note: because ‘lemon::concepts::Digraph::InArcIt’ has user-provided ‘lemon::concepts::Digraph::InArcIt::InArcIt(const lemon::concepts::Digraph::InArcIt&)’ 262 | InArcIt(const InArcIt& e) : Arc(e) { } | ^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:827:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 827 | e = it2; | ~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphIncIt::Constraints<_GraphIncIt>::constraints() [with _GraphIncIt = lemon::concepts::Digraph::OutArcIt; GR = lemon::concepts::Digraph; Item = lemon::concepts::Digraph::Arc; Base = lemon::concepts::Digraph::Node; char sel = 'o']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphIncIt; Type = lemon::concepts::Digraph::OutArcIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:994:74: required from ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph; BAS = lemon::concepts::BaseDigraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent<>; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:153:42: required from ‘void McfClassConcept::Constraints::constraints() [with MCF = lemon::NetworkSimplex; GR = lemon::concepts::Digraph; Value = int; Cost = int]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = McfClassConcept; Type = lemon::NetworkSimplex]’ /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:463:40: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:823:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::OutArcIt& lemon::concepts::Digraph::OutArcIt::operator=(const lemon::concepts::Digraph::OutArcIt&)’ is deprecated [-Wdeprecated-copy] 823 | it2 = ++it1; | ~~~~^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:217:9: note: because ‘lemon::concepts::Digraph::OutArcIt’ has user-provided ‘lemon::concepts::Digraph::OutArcIt::OutArcIt(const lemon::concepts::Digraph::OutArcIt&)’ 217 | OutArcIt(const OutArcIt& e) : Arc(e) { } | ^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:824:17: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::OutArcIt& lemon::concepts::Digraph::OutArcIt::operator=(const lemon::concepts::Digraph::OutArcIt&)’ is deprecated [-Wdeprecated-copy] 824 | ++it2 = it1; | ~~~~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:217:9: note: because ‘lemon::concepts::Digraph::OutArcIt’ has user-provided ‘lemon::concepts::Digraph::OutArcIt::OutArcIt(const lemon::concepts::Digraph::OutArcIt&)’ 217 | OutArcIt(const OutArcIt& e) : Arc(e) { } | ^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:827:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 827 | e = it2; | ~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/circulation.h:23, from /<>/liblemon-1.3.1+dfsg/lemon/cost_scaling.h:34, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h: In instantiation of ‘void lemon::Elevator::swap(lemon::Elevator::Vit, lemon::Elevator::Vit) [with GR = lemon::concepts::Digraph; Item = lemon::concepts::Digraph::Node; lemon::Elevator::Vit = lemon::concepts::Digraph::Node*]’: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:445:7: required from ‘void lemon::Elevator::initAddItem(Item) [with GR = lemon::concepts::Digraph; Item = lemon::concepts::Digraph::Node]’ /<>/liblemon-1.3.1+dfsg/lemon/circulation.h:557:9: required from ‘void lemon::Circulation::greedyInit() [with GR = lemon::concepts::Digraph; LM = lemon::ConstMap; UM = lemon::concepts::Digraph::ArcMap; SM = lemon::concepts::Digraph::NodeMap; TR = lemon::CirculationDefaultTraits, lemon::concepts::Digraph::ArcMap, lemon::concepts::Digraph::NodeMap >]’ /<>/liblemon-1.3.1+dfsg/lemon/circulation.h:663:7: required from ‘bool lemon::Circulation::run() [with GR = lemon::concepts::Digraph; LM = lemon::ConstMap; UM = lemon::concepts::Digraph::ArcMap; SM = lemon::concepts::Digraph::NodeMap; TR = lemon::CirculationDefaultTraits, lemon::concepts::Digraph::ArcMap, lemon::concepts::Digraph::NodeMap >]’ /<>/liblemon-1.3.1+dfsg/lemon/cost_scaling.h:861:11: required from ‘lemon::CostScaling::ProblemType lemon::CostScaling::init() [with GR = lemon::concepts::Digraph; V = int; C = int; TR = lemon::CostScalingDefaultTraits]’ /<>/liblemon-1.3.1+dfsg/lemon/cost_scaling.h:512:24: required from ‘lemon::CostScaling::ProblemType lemon::CostScaling::run(lemon::CostScaling::Method, int) [with GR = lemon::concepts::Digraph; V = int; C = int; TR = lemon::CostScalingDefaultTraits]’ /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:160:9: required from ‘void McfClassConcept::Constraints::constraints() [with MCF = lemon::CostScaling; GR = lemon::concepts::Digraph; Value = int; Cost = int]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = McfClassConcept; Type = lemon::CostScaling]’ /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:488:37: required from here /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:94:29: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 94 | _where[ti] = _where[*i=*j]; | ~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/circulation.h:23, from /<>/liblemon-1.3.1+dfsg/lemon/cost_scaling.h:34, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:96:9: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 96 | *j=ti; | ~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/circulation.h:23, from /<>/liblemon-1.3.1+dfsg/lemon/cost_scaling.h:34, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h: In instantiation of ‘void lemon::Elevator::copy(lemon::Elevator::Vit, lemon::Elevator::Vit) [with GR = lemon::concepts::Digraph; Item = lemon::concepts::Digraph::Node; lemon::Elevator::Vit = lemon::concepts::Digraph::Node*]’: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:264:7: required from ‘void lemon::Elevator::liftHighestActiveToTop() [with GR = lemon::concepts::Digraph; Item = lemon::concepts::Digraph::Node]’ /<>/liblemon-1.3.1+dfsg/lemon/circulation.h:633:11: required from ‘bool lemon::Circulation::start() [with GR = lemon::concepts::Digraph; LM = lemon::ConstMap; UM = lemon::concepts::Digraph::ArcMap; SM = lemon::concepts::Digraph::NodeMap; TR = lemon::CirculationDefaultTraits, lemon::concepts::Digraph::ArcMap, lemon::concepts::Digraph::NodeMap >]’ /<>/liblemon-1.3.1+dfsg/lemon/circulation.h:664:14: required from ‘bool lemon::Circulation::run() [with GR = lemon::concepts::Digraph; LM = lemon::ConstMap; UM = lemon::concepts::Digraph::ArcMap; SM = lemon::concepts::Digraph::NodeMap; TR = lemon::CirculationDefaultTraits, lemon::concepts::Digraph::ArcMap, lemon::concepts::Digraph::NodeMap >]’ /<>/liblemon-1.3.1+dfsg/lemon/cost_scaling.h:861:11: required from ‘lemon::CostScaling::ProblemType lemon::CostScaling::init() [with GR = lemon::concepts::Digraph; V = int; C = int; TR = lemon::CostScalingDefaultTraits]’ /<>/liblemon-1.3.1+dfsg/lemon/cost_scaling.h:512:24: required from ‘lemon::CostScaling::ProblemType lemon::CostScaling::run(lemon::CostScaling::Method, int) [with GR = lemon::concepts::Digraph; V = int; C = int; TR = lemon::CostScalingDefaultTraits]’ /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:160:9: required from ‘void McfClassConcept::Constraints::constraints() [with MCF = lemon::CostScaling; GR = lemon::concepts::Digraph; Value = int; Cost = int]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = McfClassConcept; Type = lemon::CostScaling]’ /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:488:37: required from here /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:86:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 86 | *p=i; | ~~^~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/circulation.h:23, from /<>/liblemon-1.3.1+dfsg/lemon/cost_scaling.h:34, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h: In instantiation of ‘void lemon::Elevator::copy(Item, lemon::Elevator::Vit) [with GR = lemon::concepts::Digraph; Item = lemon::concepts::Digraph::Node; lemon::Elevator::Vit = lemon::concepts::Digraph::Node*]’: /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:270:7: required from ‘void lemon::Elevator::liftHighestActiveToTop() [with GR = lemon::concepts::Digraph; Item = lemon::concepts::Digraph::Node]’ /<>/liblemon-1.3.1+dfsg/lemon/circulation.h:633:11: required from ‘bool lemon::Circulation::start() [with GR = lemon::concepts::Digraph; LM = lemon::ConstMap; UM = lemon::concepts::Digraph::ArcMap; SM = lemon::concepts::Digraph::NodeMap; TR = lemon::CirculationDefaultTraits, lemon::concepts::Digraph::ArcMap, lemon::concepts::Digraph::NodeMap >]’ /<>/liblemon-1.3.1+dfsg/lemon/circulation.h:664:14: required from ‘bool lemon::Circulation::run() [with GR = lemon::concepts::Digraph; LM = lemon::ConstMap; UM = lemon::concepts::Digraph::ArcMap; SM = lemon::concepts::Digraph::NodeMap; TR = lemon::CirculationDefaultTraits, lemon::concepts::Digraph::ArcMap, lemon::concepts::Digraph::NodeMap >]’ /<>/liblemon-1.3.1+dfsg/lemon/cost_scaling.h:861:11: required from ‘lemon::CostScaling::ProblemType lemon::CostScaling::init() [with GR = lemon::concepts::Digraph; V = int; C = int; TR = lemon::CostScalingDefaultTraits]’ /<>/liblemon-1.3.1+dfsg/lemon/cost_scaling.h:512:24: required from ‘lemon::CostScaling::ProblemType lemon::CostScaling::run(lemon::CostScaling::Method, int) [with GR = lemon::concepts::Digraph; V = int; C = int; TR = lemon::CostScalingDefaultTraits]’ /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:160:9: required from ‘void McfClassConcept::Constraints::constraints() [with MCF = lemon::CostScaling; GR = lemon::concepts::Digraph; Value = int; Cost = int]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = McfClassConcept; Type = lemon::CostScaling]’ /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:488:37: required from here /<>/liblemon-1.3.1+dfsg/lemon/elevator.h:79:16: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 79 | _where[*p=i] = p; | ~~^~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItem::Constraints<_GraphItem>::constraints() [with _GraphItem = lemon::concepts::Digraph::ArcIt; char sel = '0']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItem<>; Type = lemon::concepts::Digraph::ArcIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:724:50: required from ‘void lemon::concepts::GraphItemIt::Constraints<_GraphItemIt>::constraints() [with _GraphItemIt = lemon::concepts::Digraph::ArcIt; GR = lemon::concepts::Digraph; Item = lemon::concepts::Digraph::Arc]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItemIt; Type = lemon::concepts::Digraph::ArcIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:988:41: required from ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph; BAS = lemon::concepts::BaseDigraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent<>; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:153:42: required from ‘void McfClassConcept::Constraints::constraints() [with MCF = lemon::NetworkSimplex; GR = lemon::concepts::Digraph; Value = int; Cost = int]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = McfClassConcept; Type = lemon::NetworkSimplex]’ /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:463:40: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:104:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::ArcIt& lemon::concepts::Digraph::ArcIt::operator=(const lemon::concepts::Digraph::ArcIt&)’ is deprecated [-Wdeprecated-copy] 104 | i1=INVALID; | ~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:305:9: note: because ‘lemon::concepts::Digraph::ArcIt’ has user-provided ‘lemon::concepts::Digraph::ArcIt::ArcIt(const lemon::concepts::Digraph::ArcIt&)’ 305 | ArcIt(const ArcIt& e) : Arc(e) { } | ^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:19: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::ArcIt& lemon::concepts::Digraph::ArcIt::operator=(const lemon::concepts::Digraph::ArcIt&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:305:9: note: because ‘lemon::concepts::Digraph::ArcIt’ has user-provided ‘lemon::concepts::Digraph::ArcIt::ArcIt(const lemon::concepts::Digraph::ArcIt&)’ 305 | ArcIt(const ArcIt& e) : Arc(e) { } | ^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:14: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::ArcIt& lemon::concepts::Digraph::ArcIt::operator=(const lemon::concepts::Digraph::ArcIt&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:305:9: note: because ‘lemon::concepts::Digraph::ArcIt’ has user-provided ‘lemon::concepts::Digraph::ArcIt::ArcIt(const lemon::concepts::Digraph::ArcIt&)’ 305 | ArcIt(const ArcIt& e) : Arc(e) { } | ^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItem::Constraints<_GraphItem>::constraints() [with _GraphItem = lemon::concepts::Digraph::NodeIt; char sel = '0']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItem<>; Type = lemon::concepts::Digraph::NodeIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:724:50: required from ‘void lemon::concepts::GraphItemIt::Constraints<_GraphItemIt>::constraints() [with _GraphItemIt = lemon::concepts::Digraph::NodeIt; GR = lemon::concepts::Digraph; Item = lemon::concepts::Digraph::Node]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItemIt; Type = lemon::concepts::Digraph::NodeIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:990:42: required from ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph; BAS = lemon::concepts::BaseDigraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent<>; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:153:42: required from ‘void McfClassConcept::Constraints::constraints() [with MCF = lemon::NetworkSimplex; GR = lemon::concepts::Digraph; Value = int; Cost = int]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = McfClassConcept; Type = lemon::NetworkSimplex]’ /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:463:40: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:104:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::NodeIt& lemon::concepts::Digraph::NodeIt::operator=(const lemon::concepts::Digraph::NodeIt&)’ is deprecated [-Wdeprecated-copy] 104 | i1=INVALID; | ~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:127:9: note: because ‘lemon::concepts::Digraph::NodeIt’ has user-provided ‘lemon::concepts::Digraph::NodeIt::NodeIt(const lemon::concepts::Digraph::NodeIt&)’ 127 | NodeIt(const NodeIt& n) : Node(n) { } | ^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:19: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::NodeIt& lemon::concepts::Digraph::NodeIt::operator=(const lemon::concepts::Digraph::NodeIt&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:127:9: note: because ‘lemon::concepts::Digraph::NodeIt’ has user-provided ‘lemon::concepts::Digraph::NodeIt::NodeIt(const lemon::concepts::Digraph::NodeIt&)’ 127 | NodeIt(const NodeIt& n) : Node(n) { } | ^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:14: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::NodeIt& lemon::concepts::Digraph::NodeIt::operator=(const lemon::concepts::Digraph::NodeIt&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:127:9: note: because ‘lemon::concepts::Digraph::NodeIt’ has user-provided ‘lemon::concepts::Digraph::NodeIt::NodeIt(const lemon::concepts::Digraph::NodeIt&)’ 127 | NodeIt(const NodeIt& n) : Node(n) { } | ^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItem::Constraints<_GraphItem>::constraints() [with _GraphItem = lemon::concepts::Digraph::InArcIt; char sel = 'i']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItem<'i'>; Type = lemon::concepts::Digraph::InArcIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:815:52: required from ‘void lemon::concepts::GraphIncIt::Constraints<_GraphIncIt>::constraints() [with _GraphIncIt = lemon::concepts::Digraph::InArcIt; GR = lemon::concepts::Digraph; Item = lemon::concepts::Digraph::Arc; Base = lemon::concepts::Digraph::Node; char sel = 'i']’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphIncIt; Type = lemon::concepts::Digraph::InArcIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:992:73: required from ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph; BAS = lemon::concepts::BaseDigraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent<>; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:153:42: required from ‘void McfClassConcept::Constraints::constraints() [with MCF = lemon::NetworkSimplex; GR = lemon::concepts::Digraph; Value = int; Cost = int]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = McfClassConcept; Type = lemon::NetworkSimplex]’ /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:463:40: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:104:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::InArcIt& lemon::concepts::Digraph::InArcIt::operator=(const lemon::concepts::Digraph::InArcIt&)’ is deprecated [-Wdeprecated-copy] 104 | i1=INVALID; | ~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:262:9: note: because ‘lemon::concepts::Digraph::InArcIt’ has user-provided ‘lemon::concepts::Digraph::InArcIt::InArcIt(const lemon::concepts::Digraph::InArcIt&)’ 262 | InArcIt(const InArcIt& e) : Arc(e) { } | ^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:19: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::InArcIt& lemon::concepts::Digraph::InArcIt::operator=(const lemon::concepts::Digraph::InArcIt&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:262:9: note: because ‘lemon::concepts::Digraph::InArcIt’ has user-provided ‘lemon::concepts::Digraph::InArcIt::InArcIt(const lemon::concepts::Digraph::InArcIt&)’ 262 | InArcIt(const InArcIt& e) : Arc(e) { } | ^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:14: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::InArcIt& lemon::concepts::Digraph::InArcIt::operator=(const lemon::concepts::Digraph::InArcIt&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:262:9: note: because ‘lemon::concepts::Digraph::InArcIt’ has user-provided ‘lemon::concepts::Digraph::InArcIt::InArcIt(const lemon::concepts::Digraph::InArcIt&)’ 262 | InArcIt(const InArcIt& e) : Arc(e) { } | ^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItem::Constraints<_GraphItem>::constraints() [with _GraphItem = lemon::concepts::Digraph::OutArcIt; char sel = 'o']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItem<'o'>; Type = lemon::concepts::Digraph::OutArcIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:815:52: required from ‘void lemon::concepts::GraphIncIt::Constraints<_GraphIncIt>::constraints() [with _GraphIncIt = lemon::concepts::Digraph::OutArcIt; GR = lemon::concepts::Digraph; Item = lemon::concepts::Digraph::Arc; Base = lemon::concepts::Digraph::Node; char sel = 'o']’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphIncIt; Type = lemon::concepts::Digraph::OutArcIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:994:74: required from ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph; BAS = lemon::concepts::BaseDigraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent<>; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:153:42: required from ‘void McfClassConcept::Constraints::constraints() [with MCF = lemon::NetworkSimplex; GR = lemon::concepts::Digraph; Value = int; Cost = int]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = McfClassConcept; Type = lemon::NetworkSimplex]’ /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:463:40: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:104:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::OutArcIt& lemon::concepts::Digraph::OutArcIt::operator=(const lemon::concepts::Digraph::OutArcIt&)’ is deprecated [-Wdeprecated-copy] 104 | i1=INVALID; | ~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:217:9: note: because ‘lemon::concepts::Digraph::OutArcIt’ has user-provided ‘lemon::concepts::Digraph::OutArcIt::OutArcIt(const lemon::concepts::Digraph::OutArcIt&)’ 217 | OutArcIt(const OutArcIt& e) : Arc(e) { } | ^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:19: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::OutArcIt& lemon::concepts::Digraph::OutArcIt::operator=(const lemon::concepts::Digraph::OutArcIt&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:217:9: note: because ‘lemon::concepts::Digraph::OutArcIt’ has user-provided ‘lemon::concepts::Digraph::OutArcIt::OutArcIt(const lemon::concepts::Digraph::OutArcIt&)’ 217 | OutArcIt(const OutArcIt& e) : Arc(e) { } | ^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:14: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::OutArcIt& lemon::concepts::Digraph::OutArcIt::operator=(const lemon::concepts::Digraph::OutArcIt&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:217:9: note: because ‘lemon::concepts::Digraph::OutArcIt’ has user-provided ‘lemon::concepts::Digraph::OutArcIt::OutArcIt(const lemon::concepts::Digraph::OutArcIt&)’ 217 | OutArcIt(const OutArcIt& e) : Arc(e) { } | ^~~~~~~~ In file included from /usr/include/c++/9/vector:72, from /<>/liblemon-1.3.1+dfsg/lemon/core.h:22, from /<>/liblemon-1.3.1+dfsg/lemon/list_graph.h:26, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:23: /usr/include/c++/9/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(std::vector<_Tp, _Alloc>::iterator, _Args&& ...) [with _Args = {long long int}; _Tp = long long int; _Alloc = std::allocator]’: /usr/include/c++/9/bits/vector.tcc:426:7: note: parameter passing for argument of type ‘std::vector >::iterator’ {aka ‘__gnu_cxx::__normal_iterator > >’} changed in GCC 7.1 426 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/9/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_fill_insert(std::vector<_Tp, _Alloc>::iterator, std::vector<_Tp, _Alloc>::size_type, const value_type&) [with _Tp = lemon::HartmannOrlinMmc::StaticVectorMap, lemon::HartmannOrlinMmc::StaticVectorMap, lemon::HartmannOrlinMmcDefaultTraits::StaticVectorMap, true> >::SetPathTraits > >::PathData; _Alloc = std::allocator::StaticVectorMap, lemon::HartmannOrlinMmc::StaticVectorMap, lemon::HartmannOrlinMmcDefaultTraits::StaticVectorMap, true> >::SetPathTraits > >::PathData>]’: /usr/include/c++/9/bits/vector.tcc:509:5: note: parameter passing for argument of type ‘std::vector::StaticVectorMap, lemon::HartmannOrlinMmc::StaticVectorMap, lemon::HartmannOrlinMmcDefaultTraits::StaticVectorMap, true> >::SetPathTraits > >::PathData, std::allocator::StaticVectorMap, lemon::HartmannOrlinMmc::StaticVectorMap, lemon::HartmannOrlinMmcDefaultTraits::StaticVectorMap, true> >::SetPathTraits > >::PathData> >::iterator’ {aka ‘__gnu_cxx::__normal_iterator::StaticVectorMap, lemon::HartmannOrlinMmc::StaticVectorMap, lemon::HartmannOrlinMmcDefaultTraits::StaticVectorMap, true> >::SetPathTraits > >::PathData*, std::vector::StaticVectorMap, lemon::HartmannOrlinMmc::StaticVectorMap, lemon::HartmannOrlinMmcDefaultTraits::StaticVectorMap, true> >::SetPathTraits > >::PathData, std::allocator::StaticVectorMap, lemon::HartmannOrlinMmc::StaticVectorMap, lemon::HartmannOrlinMmcDefaultTraits::StaticVectorMap, true> >::SetPathTraits > >::PathData> > >’} changed in GCC 7.1 509 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/9/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_fill_insert(std::vector<_Tp, _Alloc>::iterator, std::vector<_Tp, _Alloc>::size_type, const value_type&) [with _Tp = lemon::HartmannOrlinMmc::StaticVectorMap, lemon::HartmannOrlinMmcDefaultTraits::StaticVectorMap, true> >::PathData; _Alloc = std::allocator::StaticVectorMap, lemon::HartmannOrlinMmcDefaultTraits::StaticVectorMap, true> >::PathData>]’: /usr/include/c++/9/bits/vector.tcc:509:5: note: parameter passing for argument of type ‘std::vector::StaticVectorMap, lemon::HartmannOrlinMmcDefaultTraits::StaticVectorMap, true> >::PathData, std::allocator::StaticVectorMap, lemon::HartmannOrlinMmcDefaultTraits::StaticVectorMap, true> >::PathData> >::iterator’ {aka ‘__gnu_cxx::__normal_iterator::StaticVectorMap, lemon::HartmannOrlinMmcDefaultTraits::StaticVectorMap, true> >::PathData*, std::vector::StaticVectorMap, lemon::HartmannOrlinMmcDefaultTraits::StaticVectorMap, true> >::PathData, std::allocator::StaticVectorMap, lemon::HartmannOrlinMmcDefaultTraits::StaticVectorMap, true> >::PathData> > >’} changed in GCC 7.1 /usr/include/c++/9/bits/vector.tcc: In member function ‘void lemon::CostScaling::start(lemon::CostScaling::Method) [with GR = lemon::ListDigraph; V = int; C = int; TR = lemon::CostScalingDefaultTraits]’: /usr/include/c++/9/bits/vector.tcc:121:4: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator > >’ changed in GCC 7.1 121 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ^~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/9/vector:67, from /<>/liblemon-1.3.1+dfsg/lemon/core.h:22, from /<>/liblemon-1.3.1+dfsg/lemon/list_graph.h:26, from /<>/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:23: /usr/include/c++/9/bits/stl_vector.h: In member function ‘void lemon::CycleCanceling::startCancelAndTighten() [with GR = lemon::ListDigraph; V = int; C = int]’: /usr/include/c++/9/bits/stl_vector.h:957:4: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator::StaticVectorMap, lemon::HartmannOrlinMmcDefaultTraits::StaticVectorMap, true> >::PathData*, std::vector::StaticVectorMap, lemon::HartmannOrlinMmcDefaultTraits::StaticVectorMap, true> >::PathData, std::allocator::StaticVectorMap, lemon::HartmannOrlinMmcDefaultTraits::StaticVectorMap, true> >::PathData> > >’ changed in GCC 7.1 957 | _M_fill_insert(end(), __new_size - size(), __x); | ^~~~~~~~~~~~~~ /usr/include/c++/9/bits/stl_vector.h: In member function ‘void lemon::CycleCanceling::startMinMeanCycleCanceling() [with GR = lemon::ListDigraph; V = int; C = int]’: /usr/include/c++/9/bits/stl_vector.h:957:4: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator::StaticVectorMap, lemon::HartmannOrlinMmc::StaticVectorMap, lemon::HartmannOrlinMmcDefaultTraits::StaticVectorMap, true> >::SetPathTraits > >::PathData*, std::vector::StaticVectorMap, lemon::HartmannOrlinMmc::StaticVectorMap, lemon::HartmannOrlinMmcDefaultTraits::StaticVectorMap, true> >::SetPathTraits > >::PathData, std::allocator::StaticVectorMap, lemon::HartmannOrlinMmc::StaticVectorMap, lemon::HartmannOrlinMmcDefaultTraits::StaticVectorMap, true> >::SetPathTraits > >::PathData> > >’ changed in GCC 7.1 957 | _M_fill_insert(end(), __new_size - size(), __x); | ^~~~~~~~~~~~~~ [ 89%] Linking CXX executable min_cost_flow_test cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/cmake -E cmake_link_script CMakeFiles/min_cost_flow_test.dir/link.txt --verbose=1 /usr/bin/c++ -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -Wl,-Bsymbolic-functions -Wl,-z,relro -Wl,-z,now -rdynamic CMakeFiles/min_cost_flow_test.dir/min_cost_flow_test.cc.o -o min_cost_flow_test -L/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 89%] Built target min_cost_flow_test make -f test/CMakeFiles/max_clique_test.dir/build.make test/CMakeFiles/max_clique_test.dir/depend make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<>/liblemon-1.3.1+dfsg /<>/liblemon-1.3.1+dfsg/test /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test/CMakeFiles/max_clique_test.dir/DependInfo.cmake --color= Scanning dependencies of target max_clique_test make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' make -f test/CMakeFiles/max_clique_test.dir/build.make test/CMakeFiles/max_clique_test.dir/build make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 90%] Building CXX object test/CMakeFiles/max_clique_test.dir/max_clique_test.cc.o cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -I/<>/liblemon-1.3.1+dfsg -I/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -o CMakeFiles/max_clique_test.dir/max_clique_test.cc.o -c /<>/liblemon-1.3.1+dfsg/test/max_clique_test.cc [ 91%] Linking CXX executable max_clique_test cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/cmake -E cmake_link_script CMakeFiles/max_clique_test.dir/link.txt --verbose=1 /usr/bin/c++ -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -Wl,-Bsymbolic-functions -Wl,-z,relro -Wl,-z,now -rdynamic CMakeFiles/max_clique_test.dir/max_clique_test.cc.o -o max_clique_test -L/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 91%] Built target max_clique_test make -f test/CMakeFiles/min_mean_cycle_test.dir/build.make test/CMakeFiles/min_mean_cycle_test.dir/depend make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<>/liblemon-1.3.1+dfsg /<>/liblemon-1.3.1+dfsg/test /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test/CMakeFiles/min_mean_cycle_test.dir/DependInfo.cmake --color= Scanning dependencies of target min_mean_cycle_test make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' make -f test/CMakeFiles/min_mean_cycle_test.dir/build.make test/CMakeFiles/min_mean_cycle_test.dir/build make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 92%] Building CXX object test/CMakeFiles/min_mean_cycle_test.dir/min_mean_cycle_test.cc.o cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -I/<>/liblemon-1.3.1+dfsg -I/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -o CMakeFiles/min_mean_cycle_test.dir/min_mean_cycle_test.cc.o -c /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/karp_mmc.h: In instantiation of ‘bool lemon::KarpMmc::findCycle() [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::KarpMmc, lemon::KarpMmc >::SetPathTraits > >::SetLargeCostTraits]’: /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:86:9: required from ‘void MmcClassConcept::Constraints::constraints() [with MMC = lemon::KarpMmc >; GR = lemon::concepts::Digraph; Cost = int]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = MmcClassConcept; Type = lemon::KarpMmc >]’ /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:153:67: required from here /<>/liblemon-1.3.1+dfsg/lemon/karp_mmc.h:367:11: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 367 | u = _gr.source(_data[u][r].pred); In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/karp_mmc.h:375:17: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 375 | while ((v = _gr.source(e)) != u) { | ~~~^~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/karp_mmc.h:376:11: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 376 | e = _data[v][--r].pred; | ~~^~~~~~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/karp_mmc.h: In instantiation of ‘bool lemon::KarpMmc::findCycle() [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::KarpMmc, lemon::KarpMmc >::SetPathTraits > >::SetLargeCostTraits]’: /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:86:9: required from ‘void MmcClassConcept::Constraints::constraints() [with MMC = lemon::KarpMmc >; GR = lemon::concepts::Digraph; Cost = float]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = MmcClassConcept; Type = lemon::KarpMmc >]’ /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:155:69: required from here /<>/liblemon-1.3.1+dfsg/lemon/karp_mmc.h:367:11: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 367 | u = _gr.source(_data[u][r].pred); In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/karp_mmc.h:375:17: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 375 | while ((v = _gr.source(e)) != u) { | ~~~^~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/karp_mmc.h:376:11: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 376 | e = _data[v][--r].pred; | ~~^~~~~~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/hartmann_orlin_mmc.h: In instantiation of ‘bool lemon::HartmannOrlinMmc::findCycleMean() [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::HartmannOrlinMmc, lemon::HartmannOrlinMmc >::SetPathTraits > >::SetLargeCostTraits]’: /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:85:9: required from ‘void MmcClassConcept::Constraints::constraints() [with MMC = lemon::HartmannOrlinMmc >; GR = lemon::concepts::Digraph; Cost = int]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = MmcClassConcept; Type = lemon::HartmannOrlinMmc >]’ /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:159:76: required from here /<>/liblemon-1.3.1+dfsg/lemon/hartmann_orlin_mmc.h:362:22: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 362 | _best_node = _curr_node; | ~~~~~~~~~~~^~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/hartmann_orlin_mmc.h: In instantiation of ‘bool lemon::HartmannOrlinMmc::findCycle() [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::HartmannOrlinMmc, lemon::HartmannOrlinMmc >::SetPathTraits > >::SetLargeCostTraits]’: /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:86:9: required from ‘void MmcClassConcept::Constraints::constraints() [with MMC = lemon::HartmannOrlinMmc >; GR = lemon::concepts::Digraph; Cost = int]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = MmcClassConcept; Type = lemon::HartmannOrlinMmc >]’ /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:159:76: required from here /<>/liblemon-1.3.1+dfsg/lemon/hartmann_orlin_mmc.h:384:11: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 384 | u = _gr.source(_data[u][r].pred); In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/hartmann_orlin_mmc.h:392:17: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 392 | while ((v = _gr.source(e)) != u) { | ~~~^~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/hartmann_orlin_mmc.h:393:11: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 393 | e = _data[v][--r].pred; | ~~^~~~~~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/hartmann_orlin_mmc.h: In instantiation of ‘bool lemon::HartmannOrlinMmc::findCycleMean() [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::HartmannOrlinMmc, lemon::HartmannOrlinMmc >::SetPathTraits > >::SetLargeCostTraits]’: /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:85:9: required from ‘void MmcClassConcept::Constraints::constraints() [with MMC = lemon::HartmannOrlinMmc >; GR = lemon::concepts::Digraph; Cost = float]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = MmcClassConcept; Type = lemon::HartmannOrlinMmc >]’ /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:161:78: required from here /<>/liblemon-1.3.1+dfsg/lemon/hartmann_orlin_mmc.h:362:22: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 362 | _best_node = _curr_node; | ~~~~~~~~~~~^~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/hartmann_orlin_mmc.h: In instantiation of ‘bool lemon::HartmannOrlinMmc::findCycle() [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::HartmannOrlinMmc, lemon::HartmannOrlinMmc >::SetPathTraits > >::SetLargeCostTraits]’: /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:86:9: required from ‘void MmcClassConcept::Constraints::constraints() [with MMC = lemon::HartmannOrlinMmc >; GR = lemon::concepts::Digraph; Cost = float]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = MmcClassConcept; Type = lemon::HartmannOrlinMmc >]’ /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:161:78: required from here /<>/liblemon-1.3.1+dfsg/lemon/hartmann_orlin_mmc.h:384:11: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 384 | u = _gr.source(_data[u][r].pred); In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/hartmann_orlin_mmc.h:392:17: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 392 | while ((v = _gr.source(e)) != u) { | ~~~^~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/hartmann_orlin_mmc.h:393:11: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 393 | e = _data[v][--r].pred; | ~~^~~~~~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:30: /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h: In instantiation of ‘lemon::HowardMmc::TerminationCause lemon::HowardMmc::findCycleMean(int) [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::HowardMmc, lemon::HowardMmc >::SetPathTraits > >::SetLargeCostTraits]’: /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:85:9: required from ‘void MmcClassConcept::Constraints::constraints() [with MMC = lemon::HowardMmc >; GR = lemon::concepts::Digraph; Cost = int]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = MmcClassConcept; Type = lemon::HowardMmc >]’ /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:165:69: required from here /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:391:22: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 391 | _best_node = _curr_node; | ~~~~~~~~~~~^~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:30: /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h: In instantiation of ‘bool lemon::HowardMmc::findCycle() [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::HowardMmc, lemon::HowardMmc >::SetPathTraits > >::SetLargeCostTraits]’: /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:86:9: required from ‘void MmcClassConcept::Constraints::constraints() [with MMC = lemon::HowardMmc >; GR = lemon::concepts::Digraph; Cost = int]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = MmcClassConcept; Type = lemon::HowardMmc >]’ /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:165:69: required from here /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:416:16: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 416 | (v = _gr.target(_policy[v])) != _best_node; ) { | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:30: /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h: In instantiation of ‘lemon::HowardMmc::TerminationCause lemon::HowardMmc::findCycleMean(int) [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::HowardMmc, lemon::HowardMmc >::SetPathTraits > >::SetLargeCostTraits]’: /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:85:9: required from ‘void MmcClassConcept::Constraints::constraints() [with MMC = lemon::HowardMmc >; GR = lemon::concepts::Digraph; Cost = float]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = MmcClassConcept; Type = lemon::HowardMmc >]’ /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:167:71: required from here /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:391:22: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 391 | _best_node = _curr_node; | ~~~~~~~~~~~^~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:30: /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h: In instantiation of ‘bool lemon::HowardMmc::findCycle() [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::HowardMmc, lemon::HowardMmc >::SetPathTraits > >::SetLargeCostTraits]’: /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:86:9: required from ‘void MmcClassConcept::Constraints::constraints() [with MMC = lemon::HowardMmc >; GR = lemon::concepts::Digraph; Cost = float]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = MmcClassConcept; Type = lemon::HowardMmc >]’ /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:167:71: required from here /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:416:16: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 416 | (v = _gr.target(_policy[v])) != _best_node; ) { | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/karp_mmc.h: In instantiation of ‘void lemon::KarpMmc::init() [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::KarpMmc, lemon::KarpMmc >::SetPathTraits > >::SetLargeCostTraits]’: /<>/liblemon-1.3.1+dfsg/lemon/karp_mmc.h:340:7: required from ‘bool lemon::KarpMmc::findCycleMean() [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::KarpMmc, lemon::KarpMmc >::SetPathTraits > >::SetLargeCostTraits]’ /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:85:9: required from ‘void MmcClassConcept::Constraints::constraints() [with MMC = lemon::KarpMmc >; GR = lemon::concepts::Digraph; Cost = int]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = MmcClassConcept; Type = lemon::KarpMmc >]’ /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:153:67: required from here /<>/liblemon-1.3.1+dfsg/lemon/karp_mmc.h:453:19: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 453 | _cycle_node = INVALID; | ~~~~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/karp_mmc.h: In instantiation of ‘void lemon::KarpMmc::updateMinMean() [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::KarpMmc, lemon::KarpMmc >::SetPathTraits > >::SetLargeCostTraits]’: /<>/liblemon-1.3.1+dfsg/lemon/karp_mmc.h:347:9: required from ‘bool lemon::KarpMmc::findCycleMean() [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::KarpMmc, lemon::KarpMmc >::SetPathTraits > >::SetLargeCostTraits]’ /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:85:9: required from ‘void MmcClassConcept::Constraints::constraints() [with MMC = lemon::KarpMmc >; GR = lemon::concepts::Digraph; Cost = int]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = MmcClassConcept; Type = lemon::KarpMmc >]’ /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:153:67: required from here /<>/liblemon-1.3.1+dfsg/lemon/karp_mmc.h:579:23: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 579 | _cycle_node = u; | ~~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:24: /<>/liblemon-1.3.1+dfsg/lemon/path.h: In instantiation of ‘void lemon::ListPath::addFront(const Arc&) [with GR = lemon::concepts::Digraph; lemon::ListPath::Arc = lemon::concepts::Digraph::Arc]’: /<>/liblemon-1.3.1+dfsg/lemon/karp_mmc.h:371:7: required from ‘bool lemon::KarpMmc::findCycle() [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::KarpMmc, lemon::KarpMmc >::SetPathTraits > >::SetLargeCostTraits]’ /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:86:9: required from ‘void MmcClassConcept::Constraints::constraints() [with MMC = lemon::KarpMmc >; GR = lemon::concepts::Digraph; Cost = int]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = MmcClassConcept; Type = lemon::KarpMmc >]’ /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:153:67: required from here /<>/liblemon-1.3.1+dfsg/lemon/path.h:602:17: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 602 | node->arc = arc; | ~~~~~~~~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/karp_mmc.h: In instantiation of ‘void lemon::KarpMmc::init() [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::KarpMmc, lemon::KarpMmc >::SetPathTraits > >::SetLargeCostTraits]’: /<>/liblemon-1.3.1+dfsg/lemon/karp_mmc.h:340:7: required from ‘bool lemon::KarpMmc::findCycleMean() [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::KarpMmc, lemon::KarpMmc >::SetPathTraits > >::SetLargeCostTraits]’ /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:85:9: required from ‘void MmcClassConcept::Constraints::constraints() [with MMC = lemon::KarpMmc >; GR = lemon::concepts::Digraph; Cost = float]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = MmcClassConcept; Type = lemon::KarpMmc >]’ /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:155:69: required from here /<>/liblemon-1.3.1+dfsg/lemon/karp_mmc.h:453:19: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 453 | _cycle_node = INVALID; | ~~~~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/karp_mmc.h: In instantiation of ‘void lemon::KarpMmc::updateMinMean() [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::KarpMmc, lemon::KarpMmc >::SetPathTraits > >::SetLargeCostTraits]’: /<>/liblemon-1.3.1+dfsg/lemon/karp_mmc.h:347:9: required from ‘bool lemon::KarpMmc::findCycleMean() [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::KarpMmc, lemon::KarpMmc >::SetPathTraits > >::SetLargeCostTraits]’ /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:85:9: required from ‘void MmcClassConcept::Constraints::constraints() [with MMC = lemon::KarpMmc >; GR = lemon::concepts::Digraph; Cost = float]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = MmcClassConcept; Type = lemon::KarpMmc >]’ /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:155:69: required from here /<>/liblemon-1.3.1+dfsg/lemon/karp_mmc.h:579:23: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 579 | _cycle_node = u; | ~~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:30: /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h: In instantiation of ‘bool lemon::HowardMmc::buildPolicyGraph(int) [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::HowardMmc, lemon::HowardMmc >::SetPathTraits > >::SetLargeCostTraits]’: /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:375:14: required from ‘lemon::HowardMmc::TerminationCause lemon::HowardMmc::findCycleMean(int) [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::HowardMmc, lemon::HowardMmc >::SetPathTraits > >::SetLargeCostTraits]’ /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:85:9: required from ‘void MmcClassConcept::Constraints::constraints() [with MMC = lemon::HowardMmc >; GR = lemon::concepts::Digraph; Cost = int]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = MmcClassConcept; Type = lemon::HowardMmc >]’ /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:165:69: required from here /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:537:11: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 537 | v = (*_nodes)[i]; | ~~^~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:30: /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:539:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 539 | e = _in_arcs[v][j]; | ~~^~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:30: /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:540:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 540 | u = _gr.source(e); In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:30: /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:543:24: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 543 | _policy[u] = e; | ~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:30: /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h: In instantiation of ‘void lemon::HowardMmc::findPolicyCycle() [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::HowardMmc, lemon::HowardMmc >::SetPathTraits > >::SetLargeCostTraits]’: /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:381:11: required from ‘lemon::HowardMmc::TerminationCause lemon::HowardMmc::findCycleMean(int) [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::HowardMmc, lemon::HowardMmc >::SetPathTraits > >::SetLargeCostTraits]’ /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:85:9: required from ‘void MmcClassConcept::Constraints::constraints() [with MMC = lemon::HowardMmc >; GR = lemon::concepts::Digraph; Cost = int]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = MmcClassConcept; Type = lemon::HowardMmc >]’ /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:165:69: required from here /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:560:11: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 560 | u = (*_nodes)[i]; | ~~^~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:30: /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:562:33: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 562 | for (; _level[u] < 0; u = _gr.target(_policy[u])) { In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:30: /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:569:18: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 569 | for (v = u; (v = _gr.target(_policy[v])) != u; ) { | ~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:30: /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:569:26: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 569 | for (v = u; (v = _gr.target(_policy[v])) != u; ) { | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:30: /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:578:24: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 578 | _curr_node = u; | ~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:30: /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h: In instantiation of ‘bool lemon::HowardMmc::computeNodeDistances() [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::HowardMmc, lemon::HowardMmc >::SetPathTraits > >::SetLargeCostTraits]’: /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:382:16: required from ‘lemon::HowardMmc::TerminationCause lemon::HowardMmc::findCycleMean(int) [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::HowardMmc, lemon::HowardMmc >::SetPathTraits > >::SetLargeCostTraits]’ /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:85:9: required from ‘void MmcClassConcept::Constraints::constraints() [with MMC = lemon::HowardMmc >; GR = lemon::concepts::Digraph; Cost = int]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = MmcClassConcept; Type = lemon::HowardMmc >]’ /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:165:69: required from here /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:592:17: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 592 | _queue[0] = _curr_node; | ~~~~~~~~~~^~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:30: /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:598:11: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 598 | v = _queue[_qfront++]; | ~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:30: /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:600:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 600 | e = _in_arcs[v][j]; | ~~^~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:30: /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:601:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 601 | u = _gr.source(e); In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:30: /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:605:30: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 605 | _queue[++_qback] = u; | ~~~~~~~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:30: /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:614:11: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 614 | v = _queue[_qfront++]; | ~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:30: /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:616:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 616 | e = _in_arcs[v][j]; | ~~^~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:30: /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:617:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 617 | u = _gr.source(e); In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:30: /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:620:24: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 620 | _policy[u] = e; | ~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:30: /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:622:30: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 622 | _queue[++_qback] = u; | ~~~~~~~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:30: /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:630:11: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 630 | v = (*_nodes)[i]; | ~~^~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:30: /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:632:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 632 | e = _in_arcs[v][j]; | ~~^~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:30: /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:633:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 633 | u = _gr.source(e); In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:30: /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:637:24: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 637 | _policy[u] = e; | ~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:24: /<>/liblemon-1.3.1+dfsg/lemon/path.h: In instantiation of ‘void lemon::ListPath::addBack(const Arc&) [with GR = lemon::concepts::Digraph; lemon::ListPath::Arc = lemon::concepts::Digraph::Arc]’: /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:414:7: required from ‘bool lemon::HowardMmc::findCycle() [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::HowardMmc, lemon::HowardMmc >::SetPathTraits > >::SetLargeCostTraits]’ /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:86:9: required from ‘void MmcClassConcept::Constraints::constraints() [with MMC = lemon::HowardMmc >; GR = lemon::concepts::Digraph; Cost = int]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = MmcClassConcept; Type = lemon::HowardMmc >]’ /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:165:69: required from here /<>/liblemon-1.3.1+dfsg/lemon/path.h:635:17: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 635 | node->arc = arc; | ~~~~~~~~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:30: /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h: In instantiation of ‘bool lemon::HowardMmc::buildPolicyGraph(int) [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::HowardMmc, lemon::HowardMmc >::SetPathTraits > >::SetLargeCostTraits]’: /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:375:14: required from ‘lemon::HowardMmc::TerminationCause lemon::HowardMmc::findCycleMean(int) [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::HowardMmc, lemon::HowardMmc >::SetPathTraits > >::SetLargeCostTraits]’ /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:85:9: required from ‘void MmcClassConcept::Constraints::constraints() [with MMC = lemon::HowardMmc >; GR = lemon::concepts::Digraph; Cost = float]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = MmcClassConcept; Type = lemon::HowardMmc >]’ /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:167:71: required from here /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:537:11: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 537 | v = (*_nodes)[i]; | ~~^~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:30: /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:539:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 539 | e = _in_arcs[v][j]; | ~~^~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:30: /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:540:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 540 | u = _gr.source(e); In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:30: /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:543:24: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 543 | _policy[u] = e; | ~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:30: /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h: In instantiation of ‘void lemon::HowardMmc::findPolicyCycle() [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::HowardMmc, lemon::HowardMmc >::SetPathTraits > >::SetLargeCostTraits]’: /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:381:11: required from ‘lemon::HowardMmc::TerminationCause lemon::HowardMmc::findCycleMean(int) [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::HowardMmc, lemon::HowardMmc >::SetPathTraits > >::SetLargeCostTraits]’ /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:85:9: required from ‘void MmcClassConcept::Constraints::constraints() [with MMC = lemon::HowardMmc >; GR = lemon::concepts::Digraph; Cost = float]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = MmcClassConcept; Type = lemon::HowardMmc >]’ /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:167:71: required from here /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:560:11: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 560 | u = (*_nodes)[i]; | ~~^~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:30: /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:562:33: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 562 | for (; _level[u] < 0; u = _gr.target(_policy[u])) { In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:30: /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:569:18: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 569 | for (v = u; (v = _gr.target(_policy[v])) != u; ) { | ~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:30: /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:569:26: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 569 | for (v = u; (v = _gr.target(_policy[v])) != u; ) { | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:30: /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:578:24: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 578 | _curr_node = u; | ~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:30: /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h: In instantiation of ‘bool lemon::HowardMmc::computeNodeDistances() [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::HowardMmc, lemon::HowardMmc >::SetPathTraits > >::SetLargeCostTraits]’: /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:382:16: required from ‘lemon::HowardMmc::TerminationCause lemon::HowardMmc::findCycleMean(int) [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::HowardMmc, lemon::HowardMmc >::SetPathTraits > >::SetLargeCostTraits]’ /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:85:9: required from ‘void MmcClassConcept::Constraints::constraints() [with MMC = lemon::HowardMmc >; GR = lemon::concepts::Digraph; Cost = float]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = MmcClassConcept; Type = lemon::HowardMmc >]’ /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:167:71: required from here /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:592:17: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 592 | _queue[0] = _curr_node; | ~~~~~~~~~~^~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:30: /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:598:11: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 598 | v = _queue[_qfront++]; | ~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:30: /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:600:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 600 | e = _in_arcs[v][j]; | ~~^~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:30: /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:601:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 601 | u = _gr.source(e); In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:30: /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:605:30: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 605 | _queue[++_qback] = u; | ~~~~~~~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:30: /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:614:11: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 614 | v = _queue[_qfront++]; | ~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:30: /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:616:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 616 | e = _in_arcs[v][j]; | ~~^~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:30: /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:617:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 617 | u = _gr.source(e); In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:30: /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:620:24: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 620 | _policy[u] = e; | ~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:30: /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:622:30: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 622 | _queue[++_qback] = u; | ~~~~~~~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:30: /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:630:11: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 630 | v = (*_nodes)[i]; | ~~^~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:30: /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:632:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 632 | e = _in_arcs[v][j]; | ~~^~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:30: /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:633:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 633 | u = _gr.source(e); In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:30: /<>/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:637:24: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 637 | _policy[u] = e; | ~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/karp_mmc.h: In instantiation of ‘void lemon::KarpMmc::processNextBuildRound(int) [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::KarpMmc, lemon::KarpMmc >::SetPathTraits > >::SetLargeCostTraits]’: /<>/liblemon-1.3.1+dfsg/lemon/karp_mmc.h:510:9: required from ‘void lemon::KarpMmc::processRounds() [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::KarpMmc, lemon::KarpMmc >::SetPathTraits > >::SetLargeCostTraits]’ /<>/liblemon-1.3.1+dfsg/lemon/karp_mmc.h:346:9: required from ‘bool lemon::KarpMmc::findCycleMean() [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::KarpMmc, lemon::KarpMmc >::SetPathTraits > >::SetLargeCostTraits]’ /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:85:9: required from ‘void MmcClassConcept::Constraints::constraints() [with MMC = lemon::KarpMmc >; GR = lemon::concepts::Digraph; Cost = int]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = MmcClassConcept; Type = lemon::KarpMmc >]’ /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:153:67: required from here /<>/liblemon-1.3.1+dfsg/lemon/karp_mmc.h:524:11: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 524 | u = _process[i]; | ~~^~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/karp_mmc.h:526:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 526 | e = _out_arcs[u][j]; | ~~^~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/karp_mmc.h:527:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 527 | v = _gr.target(e); In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/karp_mmc.h: In instantiation of ‘void lemon::KarpMmc::processNextFullRound(int) [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::KarpMmc, lemon::KarpMmc >::SetPathTraits > >::SetLargeCostTraits]’: /<>/liblemon-1.3.1+dfsg/lemon/karp_mmc.h:513:9: required from ‘void lemon::KarpMmc::processRounds() [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::KarpMmc, lemon::KarpMmc >::SetPathTraits > >::SetLargeCostTraits]’ /<>/liblemon-1.3.1+dfsg/lemon/karp_mmc.h:346:9: required from ‘bool lemon::KarpMmc::findCycleMean() [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::KarpMmc, lemon::KarpMmc >::SetPathTraits > >::SetLargeCostTraits]’ /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:85:9: required from ‘void MmcClassConcept::Constraints::constraints() [with MMC = lemon::KarpMmc >; GR = lemon::concepts::Digraph; Cost = int]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = MmcClassConcept; Type = lemon::KarpMmc >]’ /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:153:67: required from here /<>/liblemon-1.3.1+dfsg/lemon/karp_mmc.h:544:11: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 544 | u = (*_nodes)[i]; | ~~^~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/karp_mmc.h:546:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 546 | e = _out_arcs[u][j]; | ~~^~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/karp_mmc.h:547:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 547 | v = _gr.target(e); In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/karp_mmc.h: In instantiation of ‘void lemon::KarpMmc::processNextBuildRound(int) [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::KarpMmc, lemon::KarpMmc >::SetPathTraits > >::SetLargeCostTraits]’: /<>/liblemon-1.3.1+dfsg/lemon/karp_mmc.h:510:9: required from ‘void lemon::KarpMmc::processRounds() [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::KarpMmc, lemon::KarpMmc >::SetPathTraits > >::SetLargeCostTraits]’ /<>/liblemon-1.3.1+dfsg/lemon/karp_mmc.h:346:9: required from ‘bool lemon::KarpMmc::findCycleMean() [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::KarpMmc, lemon::KarpMmc >::SetPathTraits > >::SetLargeCostTraits]’ /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:85:9: required from ‘void MmcClassConcept::Constraints::constraints() [with MMC = lemon::KarpMmc >; GR = lemon::concepts::Digraph; Cost = float]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = MmcClassConcept; Type = lemon::KarpMmc >]’ /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:155:69: required from here /<>/liblemon-1.3.1+dfsg/lemon/karp_mmc.h:524:11: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 524 | u = _process[i]; | ~~^~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/karp_mmc.h:526:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 526 | e = _out_arcs[u][j]; | ~~^~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/karp_mmc.h:527:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 527 | v = _gr.target(e); In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/karp_mmc.h: In instantiation of ‘void lemon::KarpMmc::processNextFullRound(int) [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::KarpMmc, lemon::KarpMmc >::SetPathTraits > >::SetLargeCostTraits]’: /<>/liblemon-1.3.1+dfsg/lemon/karp_mmc.h:513:9: required from ‘void lemon::KarpMmc::processRounds() [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::KarpMmc, lemon::KarpMmc >::SetPathTraits > >::SetLargeCostTraits]’ /<>/liblemon-1.3.1+dfsg/lemon/karp_mmc.h:346:9: required from ‘bool lemon::KarpMmc::findCycleMean() [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::KarpMmc, lemon::KarpMmc >::SetPathTraits > >::SetLargeCostTraits]’ /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:85:9: required from ‘void MmcClassConcept::Constraints::constraints() [with MMC = lemon::KarpMmc >; GR = lemon::concepts::Digraph; Cost = float]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = MmcClassConcept; Type = lemon::KarpMmc >]’ /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:155:69: required from here /<>/liblemon-1.3.1+dfsg/lemon/karp_mmc.h:544:11: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 544 | u = (*_nodes)[i]; | ~~^~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/karp_mmc.h:546:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 546 | e = _out_arcs[u][j]; | ~~^~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/karp_mmc.h:547:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 547 | v = _gr.target(e); In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/hartmann_orlin_mmc.h: In instantiation of ‘void lemon::HartmannOrlinMmc::processNextBuildRound(int) [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::HartmannOrlinMmc, lemon::HartmannOrlinMmc >::SetPathTraits > >::SetLargeCostTraits]’: /<>/liblemon-1.3.1+dfsg/lemon/hartmann_orlin_mmc.h:530:9: required from ‘void lemon::HartmannOrlinMmc::processRounds() [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::HartmannOrlinMmc, lemon::HartmannOrlinMmc >::SetPathTraits > >::SetLargeCostTraits]’ /<>/liblemon-1.3.1+dfsg/lemon/hartmann_orlin_mmc.h:354:9: required from ‘bool lemon::HartmannOrlinMmc::findCycleMean() [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::HartmannOrlinMmc, lemon::HartmannOrlinMmc >::SetPathTraits > >::SetLargeCostTraits]’ /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:85:9: required from ‘void MmcClassConcept::Constraints::constraints() [with MMC = lemon::HartmannOrlinMmc >; GR = lemon::concepts::Digraph; Cost = int]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = MmcClassConcept; Type = lemon::HartmannOrlinMmc >]’ /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:159:76: required from here /<>/liblemon-1.3.1+dfsg/lemon/hartmann_orlin_mmc.h:552:11: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 552 | u = _process[i]; | ~~^~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/hartmann_orlin_mmc.h:554:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 554 | e = _out_arcs[u][j]; | ~~^~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/hartmann_orlin_mmc.h:555:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 555 | v = _gr.target(e); In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/hartmann_orlin_mmc.h: In instantiation of ‘bool lemon::HartmannOrlinMmc::checkTermination(int) [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::HartmannOrlinMmc, lemon::HartmannOrlinMmc >::SetPathTraits > >::SetLargeCostTraits]’: /<>/liblemon-1.3.1+dfsg/lemon/hartmann_orlin_mmc.h:532:23: required from ‘void lemon::HartmannOrlinMmc::processRounds() [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::HartmannOrlinMmc, lemon::HartmannOrlinMmc >::SetPathTraits > >::SetLargeCostTraits]’ /<>/liblemon-1.3.1+dfsg/lemon/hartmann_orlin_mmc.h:354:9: required from ‘bool lemon::HartmannOrlinMmc::findCycleMean() [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::HartmannOrlinMmc, lemon::HartmannOrlinMmc >::SetPathTraits > >::SetLargeCostTraits]’ /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:85:9: required from ‘void MmcClassConcept::Constraints::constraints() [with MMC = lemon::HartmannOrlinMmc >; GR = lemon::concepts::Digraph; Cost = int]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = MmcClassConcept; Type = lemon::HartmannOrlinMmc >]’ /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:159:76: required from here /<>/liblemon-1.3.1+dfsg/lemon/hartmann_orlin_mmc.h:597:11: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 597 | u = (*_nodes)[i]; | ~~^~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/hartmann_orlin_mmc.h:607:26: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 607 | _curr_node = u; | ~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/hartmann_orlin_mmc.h:614:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 614 | u = _gr.source(_data[u][j].pred); In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/hartmann_orlin_mmc.h:624:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 624 | u = (*_nodes)[i]; | ~~^~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/hartmann_orlin_mmc.h: In instantiation of ‘void lemon::HartmannOrlinMmc::processNextFullRound(int) [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::HartmannOrlinMmc, lemon::HartmannOrlinMmc >::SetPathTraits > >::SetLargeCostTraits]’: /<>/liblemon-1.3.1+dfsg/lemon/hartmann_orlin_mmc.h:537:9: required from ‘void lemon::HartmannOrlinMmc::processRounds() [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::HartmannOrlinMmc, lemon::HartmannOrlinMmc >::SetPathTraits > >::SetLargeCostTraits]’ /<>/liblemon-1.3.1+dfsg/lemon/hartmann_orlin_mmc.h:354:9: required from ‘bool lemon::HartmannOrlinMmc::findCycleMean() [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::HartmannOrlinMmc, lemon::HartmannOrlinMmc >::SetPathTraits > >::SetLargeCostTraits]’ /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:85:9: required from ‘void MmcClassConcept::Constraints::constraints() [with MMC = lemon::HartmannOrlinMmc >; GR = lemon::concepts::Digraph; Cost = int]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = MmcClassConcept; Type = lemon::HartmannOrlinMmc >]’ /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:159:76: required from here /<>/liblemon-1.3.1+dfsg/lemon/hartmann_orlin_mmc.h:572:11: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 572 | u = (*_nodes)[i]; | ~~^~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/hartmann_orlin_mmc.h:574:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 574 | e = _out_arcs[u][j]; | ~~^~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/hartmann_orlin_mmc.h:575:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 575 | v = _gr.target(e); In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/hartmann_orlin_mmc.h: In instantiation of ‘void lemon::HartmannOrlinMmc::processNextBuildRound(int) [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::HartmannOrlinMmc, lemon::HartmannOrlinMmc >::SetPathTraits > >::SetLargeCostTraits]’: /<>/liblemon-1.3.1+dfsg/lemon/hartmann_orlin_mmc.h:530:9: required from ‘void lemon::HartmannOrlinMmc::processRounds() [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::HartmannOrlinMmc, lemon::HartmannOrlinMmc >::SetPathTraits > >::SetLargeCostTraits]’ /<>/liblemon-1.3.1+dfsg/lemon/hartmann_orlin_mmc.h:354:9: required from ‘bool lemon::HartmannOrlinMmc::findCycleMean() [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::HartmannOrlinMmc, lemon::HartmannOrlinMmc >::SetPathTraits > >::SetLargeCostTraits]’ /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:85:9: required from ‘void MmcClassConcept::Constraints::constraints() [with MMC = lemon::HartmannOrlinMmc >; GR = lemon::concepts::Digraph; Cost = float]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = MmcClassConcept; Type = lemon::HartmannOrlinMmc >]’ /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:161:78: required from here /<>/liblemon-1.3.1+dfsg/lemon/hartmann_orlin_mmc.h:552:11: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 552 | u = _process[i]; | ~~^~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/hartmann_orlin_mmc.h:554:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 554 | e = _out_arcs[u][j]; | ~~^~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/hartmann_orlin_mmc.h:555:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 555 | v = _gr.target(e); In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/hartmann_orlin_mmc.h: In instantiation of ‘bool lemon::HartmannOrlinMmc::checkTermination(int) [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::HartmannOrlinMmc, lemon::HartmannOrlinMmc >::SetPathTraits > >::SetLargeCostTraits]’: /<>/liblemon-1.3.1+dfsg/lemon/hartmann_orlin_mmc.h:532:23: required from ‘void lemon::HartmannOrlinMmc::processRounds() [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::HartmannOrlinMmc, lemon::HartmannOrlinMmc >::SetPathTraits > >::SetLargeCostTraits]’ /<>/liblemon-1.3.1+dfsg/lemon/hartmann_orlin_mmc.h:354:9: required from ‘bool lemon::HartmannOrlinMmc::findCycleMean() [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::HartmannOrlinMmc, lemon::HartmannOrlinMmc >::SetPathTraits > >::SetLargeCostTraits]’ /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:85:9: required from ‘void MmcClassConcept::Constraints::constraints() [with MMC = lemon::HartmannOrlinMmc >; GR = lemon::concepts::Digraph; Cost = float]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = MmcClassConcept; Type = lemon::HartmannOrlinMmc >]’ /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:161:78: required from here /<>/liblemon-1.3.1+dfsg/lemon/hartmann_orlin_mmc.h:597:11: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 597 | u = (*_nodes)[i]; | ~~^~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/hartmann_orlin_mmc.h:607:26: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 607 | _curr_node = u; | ~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/hartmann_orlin_mmc.h:614:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 614 | u = _gr.source(_data[u][j].pred); In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/hartmann_orlin_mmc.h:624:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 624 | u = (*_nodes)[i]; | ~~^~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/hartmann_orlin_mmc.h: In instantiation of ‘void lemon::HartmannOrlinMmc::processNextFullRound(int) [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::HartmannOrlinMmc, lemon::HartmannOrlinMmc >::SetPathTraits > >::SetLargeCostTraits]’: /<>/liblemon-1.3.1+dfsg/lemon/hartmann_orlin_mmc.h:537:9: required from ‘void lemon::HartmannOrlinMmc::processRounds() [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::HartmannOrlinMmc, lemon::HartmannOrlinMmc >::SetPathTraits > >::SetLargeCostTraits]’ /<>/liblemon-1.3.1+dfsg/lemon/hartmann_orlin_mmc.h:354:9: required from ‘bool lemon::HartmannOrlinMmc::findCycleMean() [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::HartmannOrlinMmc, lemon::HartmannOrlinMmc >::SetPathTraits > >::SetLargeCostTraits]’ /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:85:9: required from ‘void MmcClassConcept::Constraints::constraints() [with MMC = lemon::HartmannOrlinMmc >; GR = lemon::concepts::Digraph; Cost = float]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = MmcClassConcept; Type = lemon::HartmannOrlinMmc >]’ /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:161:78: required from here /<>/liblemon-1.3.1+dfsg/lemon/hartmann_orlin_mmc.h:572:11: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 572 | u = (*_nodes)[i]; | ~~^~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/hartmann_orlin_mmc.h:574:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 574 | e = _out_arcs[u][j]; | ~~^~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:29: /<>/liblemon-1.3.1+dfsg/lemon/hartmann_orlin_mmc.h:575:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 575 | v = _gr.target(e); In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:22, from /<>/liblemon-1.3.1+dfsg/lemon/karp_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/dfs.h: In instantiation of ‘void lemon::DfsVisit::addSource(lemon::DfsVisit::Node) [with GR = lemon::concepts::Digraph; VS = lemon::_connectivity_bits::LeaveOrderVisitor > > >; TR = lemon::DfsVisitDefaultTraits; lemon::DfsVisit::Node = lemon::concepts::Digraph::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:426:9: required from ‘int lemon::stronglyConnectedComponents(const Digraph&, NodeMap&) [with Digraph = lemon::concepts::Digraph; NodeMap = lemon::concepts::Digraph::NodeMap]’ /<>/liblemon-1.3.1+dfsg/lemon/karp_mmc.h:461:46: required from ‘void lemon::KarpMmc::findComponents() [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::KarpMmc, lemon::KarpMmc >::SetPathTraits > >::SetLargeCostTraits]’ /<>/liblemon-1.3.1+dfsg/lemon/karp_mmc.h:341:7: required from ‘bool lemon::KarpMmc::findCycleMean() [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::KarpMmc, lemon::KarpMmc >::SetPathTraits > >::SetLargeCostTraits]’ /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:85:9: required from ‘void MmcClassConcept::Constraints::constraints() [with MMC = lemon::KarpMmc >; GR = lemon::concepts::Digraph; Cost = int]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = MmcClassConcept; Type = lemon::KarpMmc >]’ /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:153:67: required from here /<>/liblemon-1.3.1+dfsg/lemon/dfs.h:1414:35: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 1414 | _stack[++_stack_head] = e; | ~~~~~~~~~~~~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:22, from /<>/liblemon-1.3.1+dfsg/lemon/karp_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/dfs.h: In instantiation of ‘void lemon::DfsVisit::addSource(lemon::DfsVisit::Node) [with GR = lemon::ReverseDigraph; VS = lemon::_connectivity_bits::FillMapVisitor, lemon::concepts::Digraph::NodeMap >; TR = lemon::DfsVisitDefaultTraits >; lemon::DfsVisit::Node = lemon::concepts::Digraph::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:446:9: required from ‘int lemon::stronglyConnectedComponents(const Digraph&, NodeMap&) [with Digraph = lemon::concepts::Digraph; NodeMap = lemon::concepts::Digraph::NodeMap]’ /<>/liblemon-1.3.1+dfsg/lemon/karp_mmc.h:461:46: required from ‘void lemon::KarpMmc::findComponents() [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::KarpMmc, lemon::KarpMmc >::SetPathTraits > >::SetLargeCostTraits]’ /<>/liblemon-1.3.1+dfsg/lemon/karp_mmc.h:341:7: required from ‘bool lemon::KarpMmc::findCycleMean() [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::KarpMmc, lemon::KarpMmc >::SetPathTraits > >::SetLargeCostTraits]’ /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:85:9: required from ‘void MmcClassConcept::Constraints::constraints() [with MMC = lemon::KarpMmc >; GR = lemon::concepts::Digraph; Cost = int]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = MmcClassConcept; Type = lemon::KarpMmc >]’ /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:153:67: required from here /<>/liblemon-1.3.1+dfsg/lemon/dfs.h:1414:35: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 1414 | _stack[++_stack_head] = e; | ~~~~~~~~~~~~~~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/karp_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h: In instantiation of ‘void lemon::_connectivity_bits::LeaveOrderVisitor::leave(const Node&) [with Digraph = lemon::concepts::Digraph; Iterator = __gnu_cxx::__normal_iterator > >; lemon::_connectivity_bits::LeaveOrderVisitor::Node = lemon::concepts::Digraph::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/dfs.h:1416:13: required from ‘void lemon::DfsVisit::addSource(lemon::DfsVisit::Node) [with GR = lemon::concepts::Digraph; VS = lemon::_connectivity_bits::LeaveOrderVisitor > > >; TR = lemon::DfsVisitDefaultTraits; lemon::DfsVisit::Node = lemon::concepts::Digraph::Node]’ /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:426:9: required from ‘int lemon::stronglyConnectedComponents(const Digraph&, NodeMap&) [with Digraph = lemon::concepts::Digraph; NodeMap = lemon::concepts::Digraph::NodeMap]’ /<>/liblemon-1.3.1+dfsg/lemon/karp_mmc.h:461:46: required from ‘void lemon::KarpMmc::findComponents() [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::KarpMmc, lemon::KarpMmc >::SetPathTraits > >::SetLargeCostTraits]’ /<>/liblemon-1.3.1+dfsg/lemon/karp_mmc.h:341:7: required from ‘bool lemon::KarpMmc::findCycleMean() [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::KarpMmc, lemon::KarpMmc >::SetPathTraits > >::SetLargeCostTraits]’ /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:85:9: required from ‘void MmcClassConcept::Constraints::constraints() [with MMC = lemon::KarpMmc >; GR = lemon::concepts::Digraph; Cost = int]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = MmcClassConcept; Type = lemon::KarpMmc >]’ /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:153:67: required from here /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:187:18: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 187 | *(_it++) = node; | ~~~~~~~~~^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:22, from /<>/liblemon-1.3.1+dfsg/lemon/karp_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/dfs.h: In instantiation of ‘lemon::DfsVisit::Arc lemon::DfsVisit::processNextArc() [with GR = lemon::concepts::Digraph; VS = lemon::_connectivity_bits::LeaveOrderVisitor > > >; TR = lemon::DfsVisitDefaultTraits; lemon::DfsVisit::Arc = lemon::concepts::Digraph::Arc]’: /<>/liblemon-1.3.1+dfsg/lemon/dfs.h:1499:31: required from ‘void lemon::DfsVisit::start() [with GR = lemon::concepts::Digraph; VS = lemon::_connectivity_bits::LeaveOrderVisitor > > >; TR = lemon::DfsVisitDefaultTraits]’ /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:427:9: required from ‘int lemon::stronglyConnectedComponents(const Digraph&, NodeMap&) [with Digraph = lemon::concepts::Digraph; NodeMap = lemon::concepts::Digraph::NodeMap]’ /<>/liblemon-1.3.1+dfsg/lemon/karp_mmc.h:461:46: required from ‘void lemon::KarpMmc::findComponents() [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::KarpMmc, lemon::KarpMmc >::SetPathTraits > >::SetLargeCostTraits]’ /<>/liblemon-1.3.1+dfsg/lemon/karp_mmc.h:341:7: required from ‘bool lemon::KarpMmc::findCycleMean() [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::KarpMmc, lemon::KarpMmc >::SetPathTraits > >::SetLargeCostTraits]’ /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:85:9: required from ‘void MmcClassConcept::Constraints::constraints() [with MMC = lemon::KarpMmc >; GR = lemon::concepts::Digraph; Cost = int]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = MmcClassConcept; Type = lemon::KarpMmc >]’ /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:153:67: required from here /<>/liblemon-1.3.1+dfsg/lemon/dfs.h:1439:11: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 1439 | m = _digraph->source(e); In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:22, from /<>/liblemon-1.3.1+dfsg/lemon/karp_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/dfs.h:1447:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 1447 | m = _digraph->source(_stack[_stack_head]); In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:22, from /<>/liblemon-1.3.1+dfsg/lemon/karp_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/dfs.h: In instantiation of ‘lemon::DfsVisit::Arc lemon::DfsVisit::processNextArc() [with GR = lemon::ReverseDigraph; VS = lemon::_connectivity_bits::FillMapVisitor, lemon::concepts::Digraph::NodeMap >; TR = lemon::DfsVisitDefaultTraits >; lemon::DfsVisit::Arc = lemon::concepts::Digraph::Arc]’: /<>/liblemon-1.3.1+dfsg/lemon/dfs.h:1499:31: required from ‘void lemon::DfsVisit::start() [with GR = lemon::ReverseDigraph; VS = lemon::_connectivity_bits::FillMapVisitor, lemon::concepts::Digraph::NodeMap >; TR = lemon::DfsVisitDefaultTraits >]’ /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:447:9: required from ‘int lemon::stronglyConnectedComponents(const Digraph&, NodeMap&) [with Digraph = lemon::concepts::Digraph; NodeMap = lemon::concepts::Digraph::NodeMap]’ /<>/liblemon-1.3.1+dfsg/lemon/karp_mmc.h:461:46: required from ‘void lemon::KarpMmc::findComponents() [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::KarpMmc, lemon::KarpMmc >::SetPathTraits > >::SetLargeCostTraits]’ /<>/liblemon-1.3.1+dfsg/lemon/karp_mmc.h:341:7: required from ‘bool lemon::KarpMmc::findCycleMean() [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::KarpMmc, lemon::KarpMmc >::SetPathTraits > >::SetLargeCostTraits]’ /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:85:9: required from ‘void MmcClassConcept::Constraints::constraints() [with MMC = lemon::KarpMmc >; GR = lemon::concepts::Digraph; Cost = int]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = MmcClassConcept; Type = lemon::KarpMmc >]’ /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:153:67: required from here /<>/liblemon-1.3.1+dfsg/lemon/dfs.h:1439:11: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 1439 | m = _digraph->source(e); In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:22, from /<>/liblemon-1.3.1+dfsg/lemon/karp_mmc.h:32, from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:28: /<>/liblemon-1.3.1+dfsg/lemon/dfs.h:1447:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 1447 | m = _digraph->source(_stack[_stack_head]); In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::BaseDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseDigraphComponent; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:477:55: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:408:45: required from ‘int lemon::stronglyConnectedComponents(const Digraph&, NodeMap&) [with Digraph = lemon::concepts::Digraph; NodeMap = lemon::concepts::Digraph::NodeMap]’ /<>/liblemon-1.3.1+dfsg/lemon/karp_mmc.h:461:46: required from ‘void lemon::KarpMmc::findComponents() [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::KarpMmc, lemon::KarpMmc >::SetPathTraits > >::SetLargeCostTraits]’ /<>/liblemon-1.3.1+dfsg/lemon/karp_mmc.h:341:7: required from ‘bool lemon::KarpMmc::findCycleMean() [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::KarpMmc, lemon::KarpMmc >::SetPathTraits > >::SetLargeCostTraits]’ /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:85:9: required from ‘void MmcClassConcept::Constraints::constraints() [with MMC = lemon::KarpMmc >; GR = lemon::concepts::Digraph; Cost = int]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = MmcClassConcept; Type = lemon::KarpMmc >]’ /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:153:67: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:173:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 173 | n = digraph.source(e); In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:174:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 174 | n = digraph.target(e); In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:175:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 175 | n = digraph.oppositeNode(n, e); In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph; BAS = lemon::concepts::BaseDigraphComponent]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent<>; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:408:45: required from ‘int lemon::stronglyConnectedComponents(const Digraph&, NodeMap&) [with Digraph = lemon::concepts::Digraph; NodeMap = lemon::concepts::Digraph::NodeMap]’ /<>/liblemon-1.3.1+dfsg/lemon/karp_mmc.h:461:46: required from ‘void lemon::KarpMmc::findComponents() [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::KarpMmc, lemon::KarpMmc >::SetPathTraits > >::SetLargeCostTraits]’ /<>/liblemon-1.3.1+dfsg/lemon/karp_mmc.h:341:7: required from ‘bool lemon::KarpMmc::findCycleMean() [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::KarpMmc, lemon::KarpMmc >::SetPathTraits > >::SetLargeCostTraits]’ /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:85:9: required from ‘void MmcClassConcept::Constraints::constraints() [with MMC = lemon::KarpMmc >; GR = lemon::concepts::Digraph; Cost = int]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = MmcClassConcept; Type = lemon::KarpMmc >]’ /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:153:67: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:999:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 999 | n = digraph.baseNode(iait); In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1000:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 1000 | n = digraph.runningNode(iait); In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1001:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 1001 | n = digraph.baseNode(oait); In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:1002:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 1002 | n = digraph.runningNode(oait); In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::IDableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph; BAS = lemon::concepts::BaseDigraphComponent]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IDableDigraphComponent<>; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:479:59: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:408:45: required from ‘int lemon::stronglyConnectedComponents(const Digraph&, NodeMap&) [with Digraph = lemon::concepts::Digraph; NodeMap = lemon::concepts::Digraph::NodeMap]’ /<>/liblemon-1.3.1+dfsg/lemon/karp_mmc.h:461:46: required from ‘void lemon::KarpMmc::findComponents() [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::KarpMmc, lemon::KarpMmc >::SetPathTraits > >::SetLargeCostTraits]’ /<>/liblemon-1.3.1+dfsg/lemon/karp_mmc.h:341:7: required from ‘bool lemon::KarpMmc::findCycleMean() [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::KarpMmc, lemon::KarpMmc >::SetPathTraits > >::SetLargeCostTraits]’ /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:85:9: required from ‘void MmcClassConcept::Constraints::constraints() [with MMC = lemon::KarpMmc >; GR = lemon::concepts::Digraph; Cost = int]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = MmcClassConcept; Type = lemon::KarpMmc >]’ /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:153:67: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:526:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 526 | node=INVALID; | ~~~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:529:16: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 529 | node = digraph.nodeFromId(nid); In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:531:14: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 531 | arc=INVALID; | ~~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:534:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 534 | arc = digraph.arcFromId(eid); In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItem::Constraints<_GraphItem>::constraints() [with _GraphItem = lemon::concepts::Digraph::Node; char sel = 'n']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItem<'n'>; Type = lemon::concepts::Digraph::Node]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:168:45: required from ‘void lemon::concepts::BaseDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseDigraphComponent; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:477:55: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:408:45: required from ‘int lemon::stronglyConnectedComponents(const Digraph&, NodeMap&) [with Digraph = lemon::concepts::Digraph; NodeMap = lemon::concepts::Digraph::NodeMap]’ /<>/liblemon-1.3.1+dfsg/lemon/karp_mmc.h:461:46: required from ‘void lemon::KarpMmc::findComponents() [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::KarpMmc, lemon::KarpMmc >::SetPathTraits > >::SetLargeCostTraits]’ /<>/liblemon-1.3.1+dfsg/lemon/karp_mmc.h:341:7: required from ‘bool lemon::KarpMmc::findCycleMean() [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::KarpMmc, lemon::KarpMmc >::SetPathTraits > >::SetLargeCostTraits]’ /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:85:9: required from ‘void MmcClassConcept::Constraints::constraints() [with MMC = lemon::KarpMmc >; GR = lemon::concepts::Digraph; Cost = int]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = MmcClassConcept; Type = lemon::KarpMmc >]’ /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:153:67: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:104:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 104 | i1=INVALID; | ~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:19: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:14: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItem::Constraints<_GraphItem>::constraints() [with _GraphItem = lemon::concepts::Digraph::Arc; char sel = 'a']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItem<'a'>; Type = lemon::concepts::Digraph::Arc]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:169:44: required from ‘void lemon::concepts::BaseDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::BaseDigraphComponent; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:477:55: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:408:45: required from ‘int lemon::stronglyConnectedComponents(const Digraph&, NodeMap&) [with Digraph = lemon::concepts::Digraph; NodeMap = lemon::concepts::Digraph::NodeMap]’ /<>/liblemon-1.3.1+dfsg/lemon/karp_mmc.h:461:46: required from ‘void lemon::KarpMmc::findComponents() [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::KarpMmc, lemon::KarpMmc >::SetPathTraits > >::SetLargeCostTraits]’ /<>/liblemon-1.3.1+dfsg/lemon/karp_mmc.h:341:7: required from ‘bool lemon::KarpMmc::findCycleMean() [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::KarpMmc, lemon::KarpMmc >::SetPathTraits > >::SetLargeCostTraits]’ /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:85:9: required from ‘void MmcClassConcept::Constraints::constraints() [with MMC = lemon::KarpMmc >; GR = lemon::concepts::Digraph; Cost = int]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = MmcClassConcept; Type = lemon::KarpMmc >]’ /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:153:67: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:104:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 104 | i1=INVALID; | ~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:19: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:14: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItemIt::Constraints<_GraphItemIt>::constraints() [with _GraphItemIt = lemon::concepts::Digraph::ArcIt; GR = lemon::concepts::Digraph; Item = lemon::concepts::Digraph::Arc]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItemIt; Type = lemon::concepts::Digraph::ArcIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:988:41: required from ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph; BAS = lemon::concepts::BaseDigraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent<>; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:408:45: required from ‘int lemon::stronglyConnectedComponents(const Digraph&, NodeMap&) [with Digraph = lemon::concepts::Digraph; NodeMap = lemon::concepts::Digraph::NodeMap]’ /<>/liblemon-1.3.1+dfsg/lemon/karp_mmc.h:461:46: required from ‘void lemon::KarpMmc::findComponents() [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::KarpMmc, lemon::KarpMmc >::SetPathTraits > >::SetLargeCostTraits]’ /<>/liblemon-1.3.1+dfsg/lemon/karp_mmc.h:341:7: required from ‘bool lemon::KarpMmc::findCycleMean() [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::KarpMmc, lemon::KarpMmc >::SetPathTraits > >::SetLargeCostTraits]’ /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:85:9: required from ‘void MmcClassConcept::Constraints::constraints() [with MMC = lemon::KarpMmc >; GR = lemon::concepts::Digraph; Cost = int]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = MmcClassConcept; Type = lemon::KarpMmc >]’ /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:153:67: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:732:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::ArcIt& lemon::concepts::Digraph::ArcIt::operator=(const lemon::concepts::Digraph::ArcIt&)’ is deprecated [-Wdeprecated-copy] 732 | it2 = ++it1; | ~~~~^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:305:9: note: because ‘lemon::concepts::Digraph::ArcIt’ has user-provided ‘lemon::concepts::Digraph::ArcIt::ArcIt(const lemon::concepts::Digraph::ArcIt&)’ 305 | ArcIt(const ArcIt& e) : Arc(e) { } | ^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:733:17: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::ArcIt& lemon::concepts::Digraph::ArcIt::operator=(const lemon::concepts::Digraph::ArcIt&)’ is deprecated [-Wdeprecated-copy] 733 | ++it2 = it1; | ~~~~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:305:9: note: because ‘lemon::concepts::Digraph::ArcIt’ has user-provided ‘lemon::concepts::Digraph::ArcIt::ArcIt(const lemon::concepts::Digraph::ArcIt&)’ 305 | ArcIt(const ArcIt& e) : Arc(e) { } | ^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:737:14: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 737 | bi = it2; | ~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItemIt::Constraints<_GraphItemIt>::constraints() [with _GraphItemIt = lemon::concepts::Digraph::NodeIt; GR = lemon::concepts::Digraph; Item = lemon::concepts::Digraph::Node]’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItemIt; Type = lemon::concepts::Digraph::NodeIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:990:42: required from ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph; BAS = lemon::concepts::BaseDigraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent<>; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:408:45: required from ‘int lemon::stronglyConnectedComponents(const Digraph&, NodeMap&) [with Digraph = lemon::concepts::Digraph; NodeMap = lemon::concepts::Digraph::NodeMap]’ /<>/liblemon-1.3.1+dfsg/lemon/karp_mmc.h:461:46: required from ‘void lemon::KarpMmc::findComponents() [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::KarpMmc, lemon::KarpMmc >::SetPathTraits > >::SetLargeCostTraits]’ /<>/liblemon-1.3.1+dfsg/lemon/karp_mmc.h:341:7: required from ‘bool lemon::KarpMmc::findCycleMean() [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::KarpMmc, lemon::KarpMmc >::SetPathTraits > >::SetLargeCostTraits]’ /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:85:9: required from ‘void MmcClassConcept::Constraints::constraints() [with MMC = lemon::KarpMmc >; GR = lemon::concepts::Digraph; Cost = int]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = MmcClassConcept; Type = lemon::KarpMmc >]’ /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:153:67: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:732:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::NodeIt& lemon::concepts::Digraph::NodeIt::operator=(const lemon::concepts::Digraph::NodeIt&)’ is deprecated [-Wdeprecated-copy] 732 | it2 = ++it1; | ~~~~^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:127:9: note: because ‘lemon::concepts::Digraph::NodeIt’ has user-provided ‘lemon::concepts::Digraph::NodeIt::NodeIt(const lemon::concepts::Digraph::NodeIt&)’ 127 | NodeIt(const NodeIt& n) : Node(n) { } | ^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:733:17: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::NodeIt& lemon::concepts::Digraph::NodeIt::operator=(const lemon::concepts::Digraph::NodeIt&)’ is deprecated [-Wdeprecated-copy] 733 | ++it2 = it1; | ~~~~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:127:9: note: because ‘lemon::concepts::Digraph::NodeIt’ has user-provided ‘lemon::concepts::Digraph::NodeIt::NodeIt(const lemon::concepts::Digraph::NodeIt&)’ 127 | NodeIt(const NodeIt& n) : Node(n) { } | ^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:737:14: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 737 | bi = it2; | ~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphIncIt::Constraints<_GraphIncIt>::constraints() [with _GraphIncIt = lemon::concepts::Digraph::InArcIt; GR = lemon::concepts::Digraph; Item = lemon::concepts::Digraph::Arc; Base = lemon::concepts::Digraph::Node; char sel = 'i']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphIncIt; Type = lemon::concepts::Digraph::InArcIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:992:73: required from ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph; BAS = lemon::concepts::BaseDigraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent<>; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:408:45: required from ‘int lemon::stronglyConnectedComponents(const Digraph&, NodeMap&) [with Digraph = lemon::concepts::Digraph; NodeMap = lemon::concepts::Digraph::NodeMap]’ /<>/liblemon-1.3.1+dfsg/lemon/karp_mmc.h:461:46: required from ‘void lemon::KarpMmc::findComponents() [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::KarpMmc, lemon::KarpMmc >::SetPathTraits > >::SetLargeCostTraits]’ /<>/liblemon-1.3.1+dfsg/lemon/karp_mmc.h:341:7: required from ‘bool lemon::KarpMmc::findCycleMean() [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::KarpMmc, lemon::KarpMmc >::SetPathTraits > >::SetLargeCostTraits]’ /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:85:9: required from ‘void MmcClassConcept::Constraints::constraints() [with MMC = lemon::KarpMmc >; GR = lemon::concepts::Digraph; Cost = int]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = MmcClassConcept; Type = lemon::KarpMmc >]’ /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:153:67: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:823:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::InArcIt& lemon::concepts::Digraph::InArcIt::operator=(const lemon::concepts::Digraph::InArcIt&)’ is deprecated [-Wdeprecated-copy] 823 | it2 = ++it1; | ~~~~^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:262:9: note: because ‘lemon::concepts::Digraph::InArcIt’ has user-provided ‘lemon::concepts::Digraph::InArcIt::InArcIt(const lemon::concepts::Digraph::InArcIt&)’ 262 | InArcIt(const InArcIt& e) : Arc(e) { } | ^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:824:17: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::InArcIt& lemon::concepts::Digraph::InArcIt::operator=(const lemon::concepts::Digraph::InArcIt&)’ is deprecated [-Wdeprecated-copy] 824 | ++it2 = it1; | ~~~~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:262:9: note: because ‘lemon::concepts::Digraph::InArcIt’ has user-provided ‘lemon::concepts::Digraph::InArcIt::InArcIt(const lemon::concepts::Digraph::InArcIt&)’ 262 | InArcIt(const InArcIt& e) : Arc(e) { } | ^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:827:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 827 | e = it2; | ~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphIncIt::Constraints<_GraphIncIt>::constraints() [with _GraphIncIt = lemon::concepts::Digraph::OutArcIt; GR = lemon::concepts::Digraph; Item = lemon::concepts::Digraph::Arc; Base = lemon::concepts::Digraph::Node; char sel = 'o']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphIncIt; Type = lemon::concepts::Digraph::OutArcIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:994:74: required from ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph; BAS = lemon::concepts::BaseDigraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent<>; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: required from ‘void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Digraph; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:408:45: required from ‘int lemon::stronglyConnectedComponents(const Digraph&, NodeMap&) [with Digraph = lemon::concepts::Digraph; NodeMap = lemon::concepts::Digraph::NodeMap]’ /<>/liblemon-1.3.1+dfsg/lemon/karp_mmc.h:461:46: required from ‘void lemon::KarpMmc::findComponents() [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::KarpMmc, lemon::KarpMmc >::SetPathTraits > >::SetLargeCostTraits]’ /<>/liblemon-1.3.1+dfsg/lemon/karp_mmc.h:341:7: required from ‘bool lemon::KarpMmc::findCycleMean() [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::KarpMmc, lemon::KarpMmc >::SetPathTraits > >::SetLargeCostTraits]’ /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:85:9: required from ‘void MmcClassConcept::Constraints::constraints() [with MMC = lemon::KarpMmc >; GR = lemon::concepts::Digraph; Cost = int]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = MmcClassConcept; Type = lemon::KarpMmc >]’ /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:153:67: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:823:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::OutArcIt& lemon::concepts::Digraph::OutArcIt::operator=(const lemon::concepts::Digraph::OutArcIt&)’ is deprecated [-Wdeprecated-copy] 823 | it2 = ++it1; | ~~~~^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:217:9: note: because ‘lemon::concepts::Digraph::OutArcIt’ has user-provided ‘lemon::concepts::Digraph::OutArcIt::OutArcIt(const lemon::concepts::Digraph::OutArcIt&)’ 217 | OutArcIt(const OutArcIt& e) : Arc(e) { } | ^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:824:17: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::OutArcIt& lemon::concepts::Digraph::OutArcIt::operator=(const lemon::concepts::Digraph::OutArcIt&)’ is deprecated [-Wdeprecated-copy] 824 | ++it2 = it1; | ~~~~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:217:9: note: because ‘lemon::concepts::Digraph::OutArcIt’ has user-provided ‘lemon::concepts::Digraph::OutArcIt::OutArcIt(const lemon::concepts::Digraph::OutArcIt&)’ 217 | OutArcIt(const OutArcIt& e) : Arc(e) { } | ^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:827:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 827 | e = it2; | ~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItem::Constraints<_GraphItem>::constraints() [with _GraphItem = lemon::concepts::Digraph::ArcIt; char sel = '0']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItem<>; Type = lemon::concepts::Digraph::ArcIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:724:50: required from ‘void lemon::concepts::GraphItemIt::Constraints<_GraphItemIt>::constraints() [with _GraphItemIt = lemon::concepts::Digraph::ArcIt; GR = lemon::concepts::Digraph; Item = lemon::concepts::Digraph::Arc]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItemIt; Type = lemon::concepts::Digraph::ArcIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:988:41: required from ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph; BAS = lemon::concepts::BaseDigraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent<>; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:408:45: required from ‘int lemon::stronglyConnectedComponents(const Digraph&, NodeMap&) [with Digraph = lemon::concepts::Digraph; NodeMap = lemon::concepts::Digraph::NodeMap]’ /<>/liblemon-1.3.1+dfsg/lemon/karp_mmc.h:461:46: required from ‘void lemon::KarpMmc::findComponents() [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::KarpMmc, lemon::KarpMmc >::SetPathTraits > >::SetLargeCostTraits]’ /<>/liblemon-1.3.1+dfsg/lemon/karp_mmc.h:341:7: required from ‘bool lemon::KarpMmc::findCycleMean() [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::KarpMmc, lemon::KarpMmc >::SetPathTraits > >::SetLargeCostTraits]’ /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:85:9: required from ‘void MmcClassConcept::Constraints::constraints() [with MMC = lemon::KarpMmc >; GR = lemon::concepts::Digraph; Cost = int]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = MmcClassConcept; Type = lemon::KarpMmc >]’ /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:153:67: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:104:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::ArcIt& lemon::concepts::Digraph::ArcIt::operator=(const lemon::concepts::Digraph::ArcIt&)’ is deprecated [-Wdeprecated-copy] 104 | i1=INVALID; | ~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:305:9: note: because ‘lemon::concepts::Digraph::ArcIt’ has user-provided ‘lemon::concepts::Digraph::ArcIt::ArcIt(const lemon::concepts::Digraph::ArcIt&)’ 305 | ArcIt(const ArcIt& e) : Arc(e) { } | ^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:19: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::ArcIt& lemon::concepts::Digraph::ArcIt::operator=(const lemon::concepts::Digraph::ArcIt&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:305:9: note: because ‘lemon::concepts::Digraph::ArcIt’ has user-provided ‘lemon::concepts::Digraph::ArcIt::ArcIt(const lemon::concepts::Digraph::ArcIt&)’ 305 | ArcIt(const ArcIt& e) : Arc(e) { } | ^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:14: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::ArcIt& lemon::concepts::Digraph::ArcIt::operator=(const lemon::concepts::Digraph::ArcIt&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:305:9: note: because ‘lemon::concepts::Digraph::ArcIt’ has user-provided ‘lemon::concepts::Digraph::ArcIt::ArcIt(const lemon::concepts::Digraph::ArcIt&)’ 305 | ArcIt(const ArcIt& e) : Arc(e) { } | ^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItem::Constraints<_GraphItem>::constraints() [with _GraphItem = lemon::concepts::Digraph::NodeIt; char sel = '0']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItem<>; Type = lemon::concepts::Digraph::NodeIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:724:50: required from ‘void lemon::concepts::GraphItemIt::Constraints<_GraphItemIt>::constraints() [with _GraphItemIt = lemon::concepts::Digraph::NodeIt; GR = lemon::concepts::Digraph; Item = lemon::concepts::Digraph::Node]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItemIt; Type = lemon::concepts::Digraph::NodeIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:990:42: required from ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph; BAS = lemon::concepts::BaseDigraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent<>; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:408:45: required from ‘int lemon::stronglyConnectedComponents(const Digraph&, NodeMap&) [with Digraph = lemon::concepts::Digraph; NodeMap = lemon::concepts::Digraph::NodeMap]’ /<>/liblemon-1.3.1+dfsg/lemon/karp_mmc.h:461:46: required from ‘void lemon::KarpMmc::findComponents() [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::KarpMmc, lemon::KarpMmc >::SetPathTraits > >::SetLargeCostTraits]’ /<>/liblemon-1.3.1+dfsg/lemon/karp_mmc.h:341:7: required from ‘bool lemon::KarpMmc::findCycleMean() [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::KarpMmc, lemon::KarpMmc >::SetPathTraits > >::SetLargeCostTraits]’ /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:85:9: required from ‘void MmcClassConcept::Constraints::constraints() [with MMC = lemon::KarpMmc >; GR = lemon::concepts::Digraph; Cost = int]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = MmcClassConcept; Type = lemon::KarpMmc >]’ /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:153:67: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:104:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::NodeIt& lemon::concepts::Digraph::NodeIt::operator=(const lemon::concepts::Digraph::NodeIt&)’ is deprecated [-Wdeprecated-copy] 104 | i1=INVALID; | ~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:127:9: note: because ‘lemon::concepts::Digraph::NodeIt’ has user-provided ‘lemon::concepts::Digraph::NodeIt::NodeIt(const lemon::concepts::Digraph::NodeIt&)’ 127 | NodeIt(const NodeIt& n) : Node(n) { } | ^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:19: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::NodeIt& lemon::concepts::Digraph::NodeIt::operator=(const lemon::concepts::Digraph::NodeIt&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:127:9: note: because ‘lemon::concepts::Digraph::NodeIt’ has user-provided ‘lemon::concepts::Digraph::NodeIt::NodeIt(const lemon::concepts::Digraph::NodeIt&)’ 127 | NodeIt(const NodeIt& n) : Node(n) { } | ^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:14: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::NodeIt& lemon::concepts::Digraph::NodeIt::operator=(const lemon::concepts::Digraph::NodeIt&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:127:9: note: because ‘lemon::concepts::Digraph::NodeIt’ has user-provided ‘lemon::concepts::Digraph::NodeIt::NodeIt(const lemon::concepts::Digraph::NodeIt&)’ 127 | NodeIt(const NodeIt& n) : Node(n) { } | ^~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItem::Constraints<_GraphItem>::constraints() [with _GraphItem = lemon::concepts::Digraph::InArcIt; char sel = 'i']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItem<'i'>; Type = lemon::concepts::Digraph::InArcIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:815:52: required from ‘void lemon::concepts::GraphIncIt::Constraints<_GraphIncIt>::constraints() [with _GraphIncIt = lemon::concepts::Digraph::InArcIt; GR = lemon::concepts::Digraph; Item = lemon::concepts::Digraph::Arc; Base = lemon::concepts::Digraph::Node; char sel = 'i']’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphIncIt; Type = lemon::concepts::Digraph::InArcIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:992:73: required from ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph; BAS = lemon::concepts::BaseDigraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent<>; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:408:45: required from ‘int lemon::stronglyConnectedComponents(const Digraph&, NodeMap&) [with Digraph = lemon::concepts::Digraph; NodeMap = lemon::concepts::Digraph::NodeMap]’ /<>/liblemon-1.3.1+dfsg/lemon/karp_mmc.h:461:46: required from ‘void lemon::KarpMmc::findComponents() [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::KarpMmc, lemon::KarpMmc >::SetPathTraits > >::SetLargeCostTraits]’ /<>/liblemon-1.3.1+dfsg/lemon/karp_mmc.h:341:7: required from ‘bool lemon::KarpMmc::findCycleMean() [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::KarpMmc, lemon::KarpMmc >::SetPathTraits > >::SetLargeCostTraits]’ /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:85:9: required from ‘void MmcClassConcept::Constraints::constraints() [with MMC = lemon::KarpMmc >; GR = lemon::concepts::Digraph; Cost = int]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = MmcClassConcept; Type = lemon::KarpMmc >]’ /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:153:67: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:104:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::InArcIt& lemon::concepts::Digraph::InArcIt::operator=(const lemon::concepts::Digraph::InArcIt&)’ is deprecated [-Wdeprecated-copy] 104 | i1=INVALID; | ~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:262:9: note: because ‘lemon::concepts::Digraph::InArcIt’ has user-provided ‘lemon::concepts::Digraph::InArcIt::InArcIt(const lemon::concepts::Digraph::InArcIt&)’ 262 | InArcIt(const InArcIt& e) : Arc(e) { } | ^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:19: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::InArcIt& lemon::concepts::Digraph::InArcIt::operator=(const lemon::concepts::Digraph::InArcIt&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:262:9: note: because ‘lemon::concepts::Digraph::InArcIt’ has user-provided ‘lemon::concepts::Digraph::InArcIt::InArcIt(const lemon::concepts::Digraph::InArcIt&)’ 262 | InArcIt(const InArcIt& e) : Arc(e) { } | ^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:14: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::InArcIt& lemon::concepts::Digraph::InArcIt::operator=(const lemon::concepts::Digraph::InArcIt&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:262:9: note: because ‘lemon::concepts::Digraph::InArcIt’ has user-provided ‘lemon::concepts::Digraph::InArcIt::InArcIt(const lemon::concepts::Digraph::InArcIt&)’ 262 | InArcIt(const InArcIt& e) : Arc(e) { } | ^~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of ‘void lemon::concepts::GraphItem::Constraints<_GraphItem>::constraints() [with _GraphItem = lemon::concepts::Digraph::OutArcIt; char sel = 'o']’: /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphItem<'o'>; Type = lemon::concepts::Digraph::OutArcIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:815:52: required from ‘void lemon::concepts::GraphIncIt::Constraints<_GraphIncIt>::constraints() [with _GraphIncIt = lemon::concepts::Digraph::OutArcIt; GR = lemon::concepts::Digraph; Item = lemon::concepts::Digraph::Arc; Base = lemon::concepts::Digraph::Node; char sel = 'o']’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::GraphIncIt; Type = lemon::concepts::Digraph::OutArcIt]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:994:74: required from ‘void lemon::concepts::IterableDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::concepts::Digraph; BAS = lemon::concepts::BaseDigraphComponent]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::IterableDigraphComponent<>; Type = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /<>/liblemon-1.3.1+dfsg/lemon/connectivity.h:408:45: required from ‘int lemon::stronglyConnectedComponents(const Digraph&, NodeMap&) [with Digraph = lemon::concepts::Digraph; NodeMap = lemon::concepts::Digraph::NodeMap]’ /<>/liblemon-1.3.1+dfsg/lemon/karp_mmc.h:461:46: required from ‘void lemon::KarpMmc::findComponents() [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::KarpMmc, lemon::KarpMmc >::SetPathTraits > >::SetLargeCostTraits]’ /<>/liblemon-1.3.1+dfsg/lemon/karp_mmc.h:341:7: required from ‘bool lemon::KarpMmc::findCycleMean() [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::KarpMmc, lemon::KarpMmc >::SetPathTraits > >::SetLargeCostTraits]’ /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:85:9: required from ‘void MmcClassConcept::Constraints::constraints() [with MMC = lemon::KarpMmc >; GR = lemon::concepts::Digraph; Cost = int]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = MmcClassConcept; Type = lemon::KarpMmc >]’ /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:153:67: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:104:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::OutArcIt& lemon::concepts::Digraph::OutArcIt::operator=(const lemon::concepts::Digraph::OutArcIt&)’ is deprecated [-Wdeprecated-copy] 104 | i1=INVALID; | ~~^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:217:9: note: because ‘lemon::concepts::Digraph::OutArcIt’ has user-provided ‘lemon::concepts::Digraph::OutArcIt::OutArcIt(const lemon::concepts::Digraph::OutArcIt&)’ 217 | OutArcIt(const OutArcIt& e) : Arc(e) { } | ^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:19: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::OutArcIt& lemon::concepts::Digraph::OutArcIt::operator=(const lemon::concepts::Digraph::OutArcIt&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:217:9: note: because ‘lemon::concepts::Digraph::OutArcIt’ has user-provided ‘lemon::concepts::Digraph::OutArcIt::OutArcIt(const lemon::concepts::Digraph::OutArcIt&)’ 217 | OutArcIt(const OutArcIt& e) : Arc(e) { } | ^~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:108:14: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::OutArcIt& lemon::concepts::Digraph::OutArcIt::operator=(const lemon::concepts::Digraph::OutArcIt&)’ is deprecated [-Wdeprecated-copy] 108 | i1 = i2 = i3; | ~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:217:9: note: because ‘lemon::concepts::Digraph::OutArcIt’ has user-provided ‘lemon::concepts::Digraph::OutArcIt::OutArcIt(const lemon::concepts::Digraph::OutArcIt&)’ 217 | OutArcIt(const OutArcIt& e) : Arc(e) { } | ^~~~~~~~ In file included from /usr/include/c++/9/vector:72, from /<>/liblemon-1.3.1+dfsg/lemon/smart_graph.h:26, from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:22: /usr/include/c++/9/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_fill_insert(std::vector<_Tp, _Alloc>::iterator, std::vector<_Tp, _Alloc>::size_type, const value_type&) [with _Tp = lemon::KarpMmc::ArcMap >::PathData; _Alloc = std::allocator::ArcMap >::PathData>]’: /usr/include/c++/9/bits/vector.tcc:509:5: note: parameter passing for argument of type ‘std::vector::ArcMap >::PathData, std::allocator::ArcMap >::PathData> >::iterator’ {aka ‘__gnu_cxx::__normal_iterator::ArcMap >::PathData*, std::vector::ArcMap >::PathData, std::allocator::ArcMap >::PathData> > >’} changed in GCC 7.1 509 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/9/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_fill_insert(std::vector<_Tp, _Alloc>::iterator, std::vector<_Tp, _Alloc>::size_type, const value_type&) [with _Tp = lemon::HartmannOrlinMmc::ArcMap >::PathData; _Alloc = std::allocator::ArcMap >::PathData>]’: /usr/include/c++/9/bits/vector.tcc:509:5: note: parameter passing for argument of type ‘std::vector::ArcMap >::PathData, std::allocator::ArcMap >::PathData> >::iterator’ {aka ‘__gnu_cxx::__normal_iterator::ArcMap >::PathData*, std::vector::ArcMap >::PathData, std::allocator::ArcMap >::PathData> > >’} changed in GCC 7.1 In file included from /usr/include/c++/9/vector:67, from /<>/liblemon-1.3.1+dfsg/lemon/smart_graph.h:26, from /<>/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:22: /usr/include/c++/9/bits/stl_vector.h: In member function ‘bool lemon::KarpMmc::findCycleMean() [with GR = lemon::SmartDigraph; CM = lemon::DigraphExtender::ArcMap; TR = lemon::KarpMmcDefaultTraits::ArcMap, true>]’: /usr/include/c++/9/bits/stl_vector.h:957:4: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator::ArcMap >::PathData*, std::vector::ArcMap >::PathData, std::allocator::ArcMap >::PathData> > >’ changed in GCC 7.1 957 | _M_fill_insert(end(), __new_size - size(), __x); | ^~~~~~~~~~~~~~ /usr/include/c++/9/bits/stl_vector.h: In function ‘void checkMmcAlg(const lemon::SmartDigraph&, const lemon::DigraphExtender::ArcMap&, const lemon::DigraphExtender::ArcMap&, int, int) [with MMC = lemon::HartmannOrlinMmc::ArcMap >]’: /usr/include/c++/9/bits/stl_vector.h:957:4: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator::ArcMap >::PathData*, std::vector::ArcMap >::PathData, std::allocator::ArcMap >::PathData> > >’ changed in GCC 7.1 957 | _M_fill_insert(end(), __new_size - size(), __x); | ^~~~~~~~~~~~~~ [ 93%] Linking CXX executable min_mean_cycle_test cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/cmake -E cmake_link_script CMakeFiles/min_mean_cycle_test.dir/link.txt --verbose=1 /usr/bin/c++ -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -Wl,-Bsymbolic-functions -Wl,-z,relro -Wl,-z,now -rdynamic CMakeFiles/min_mean_cycle_test.dir/min_mean_cycle_test.cc.o -o min_mean_cycle_test -L/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 93%] Built target min_mean_cycle_test make -f test/CMakeFiles/path_test.dir/build.make test/CMakeFiles/path_test.dir/depend make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<>/liblemon-1.3.1+dfsg /<>/liblemon-1.3.1+dfsg/test /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test/CMakeFiles/path_test.dir/DependInfo.cmake --color= Scanning dependencies of target path_test make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' make -f test/CMakeFiles/path_test.dir/build.make test/CMakeFiles/path_test.dir/build make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 95%] Building CXX object test/CMakeFiles/path_test.dir/path_test.cc.o cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -I/<>/liblemon-1.3.1+dfsg -I/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -o CMakeFiles/path_test.dir/path_test.cc.o -c /<>/liblemon-1.3.1+dfsg/test/path_test.cc In file included from /<>/liblemon-1.3.1+dfsg/test/path_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/path.h: In instantiation of ‘void lemon::SimplePath::build(const CPath&) [with CPath = lemon::concepts::Path; GR = lemon::concepts::Digraph]’: /<>/liblemon-1.3.1+dfsg/lemon/path.h:998:9: required from ‘static void lemon::_path_bits::PathCopySelectorForward::copy(const From&, To&) [with From = lemon::concepts::Path; To = lemon::SimplePath]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:1026:48: required from ‘static void lemon::_path_bits::PathCopySelector::copy(const From&, To&) [with From = lemon::concepts::Path; To = lemon::SimplePath; bool revEnable = false]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:1046:49: required from ‘void lemon::pathCopy(const From&, To&) [with From = lemon::concepts::Path; To = lemon::SimplePath]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:280:15: required from ‘lemon::SimplePath::SimplePath(const CPath&) [with CPath = lemon::concepts::Path; GR = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/path.h:122:20: required from ‘void lemon::concepts::Path::Constraints<_Path>::constraints() [with _Path = lemon::SimplePath; GR = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Path; Type = lemon::SimplePath]’ /<>/liblemon-1.3.1+dfsg/test/path_test.cc:38:52: required from ‘void checkConcepts() [with GR = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/test/path_test.cc:45:36: required from here /<>/liblemon-1.3.1+dfsg/lemon/path.h:396:21: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 396 | data[index] = it;; | ~~~~~~~~~~~~^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/path_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/path_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/path.h: In instantiation of ‘void lemon::StaticPath::build(const CPath&) [with CPath = lemon::concepts::Path; GR = lemon::concepts::Digraph]’: /<>/liblemon-1.3.1+dfsg/lemon/path.h:998:9: required from ‘static void lemon::_path_bits::PathCopySelectorForward::copy(const From&, To&) [with From = lemon::concepts::Path; To = lemon::StaticPath]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:1026:48: required from ‘static void lemon::_path_bits::PathCopySelector::copy(const From&, To&) [with From = lemon::concepts::Path; To = lemon::StaticPath; bool revEnable = false]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:1046:49: required from ‘void lemon::pathCopy(const From&, To&) [with From = lemon::concepts::Path; To = lemon::StaticPath]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:811:15: required from ‘lemon::StaticPath::StaticPath(const CPath&) [with CPath = lemon::concepts::Path; GR = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/path.h:122:20: required from ‘void lemon::concepts::Path::Constraints<_Path>::constraints() [with _Path = lemon::StaticPath; GR = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Path; Type = lemon::StaticPath]’ /<>/liblemon-1.3.1+dfsg/test/path_test.cc:39:52: required from ‘void checkConcepts() [with GR = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/test/path_test.cc:45:36: required from here /<>/liblemon-1.3.1+dfsg/lemon/path.h:930:21: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 930 | arcs[index] = it; | ~~~~~~~~~~~~^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/path_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/path_test.cc:26: /<>/liblemon-1.3.1+dfsg/lemon/path.h: In instantiation of ‘void lemon::ListPath::addBack(const Arc&) [with GR = lemon::concepts::Digraph; lemon::ListPath::Arc = lemon::concepts::Digraph::Arc]’: /<>/liblemon-1.3.1+dfsg/lemon/path.h:758:9: required from ‘void lemon::ListPath::build(const CPath&) [with CPath = lemon::concepts::Path; GR = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:998:9: required from ‘static void lemon::_path_bits::PathCopySelectorForward::copy(const From&, To&) [with From = lemon::concepts::Path; To = lemon::ListPath]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:1026:48: required from ‘static void lemon::_path_bits::PathCopySelector::copy(const From&, To&) [with From = lemon::concepts::Path; To = lemon::ListPath; bool revEnable = false]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:1046:49: required from ‘void lemon::pathCopy(const From&, To&) [with From = lemon::concepts::Path; To = lemon::ListPath]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:472:15: required from ‘lemon::ListPath::ListPath(const CPath&) [with CPath = lemon::concepts::Path; GR = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concepts/path.h:122:20: required from ‘void lemon::concepts::Path::Constraints<_Path>::constraints() [with _Path = lemon::ListPath; GR = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from ‘void lemon::checkConcept() [with Concept = lemon::concepts::Path; Type = lemon::ListPath]’ /<>/liblemon-1.3.1+dfsg/test/path_test.cc:40:50: required from ‘void checkConcepts() [with GR = lemon::concepts::Digraph]’ /<>/liblemon-1.3.1+dfsg/test/path_test.cc:45:36: required from here /<>/liblemon-1.3.1+dfsg/lemon/path.h:635:17: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 635 | node->arc = arc; | ~~~~~~~~~~^~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/path_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ [ 96%] Linking CXX executable path_test cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/cmake -E cmake_link_script CMakeFiles/path_test.dir/link.txt --verbose=1 /usr/bin/c++ -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -Wl,-Bsymbolic-functions -Wl,-z,relro -Wl,-z,now -rdynamic CMakeFiles/path_test.dir/path_test.cc.o -o path_test -L/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 96%] Built target path_test make -f test/CMakeFiles/suurballe_test.dir/build.make test/CMakeFiles/suurballe_test.dir/depend make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<>/liblemon-1.3.1+dfsg /<>/liblemon-1.3.1+dfsg/test /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test/CMakeFiles/suurballe_test.dir/DependInfo.cmake --color= Scanning dependencies of target suurballe_test make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' make -f test/CMakeFiles/suurballe_test.dir/build.make test/CMakeFiles/suurballe_test.dir/build make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 97%] Building CXX object test/CMakeFiles/suurballe_test.dir/suurballe_test.cc.o cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -I/<>/liblemon-1.3.1+dfsg -I/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -o CMakeFiles/suurballe_test.dir/suurballe_test.cc.o -c /<>/liblemon-1.3.1+dfsg/test/suurballe_test.cc In file included from /<>/liblemon-1.3.1+dfsg/test/suurballe_test.cc:24: /<>/liblemon-1.3.1+dfsg/lemon/suurballe.h: In instantiation of ‘void lemon::Suurballe::init(const Node&) [with GR = lemon::concepts::Digraph; LEN = lemon::concepts::ReadMap; TR = lemon::Suurballe, lemon::Suurballe, lemon::Suurballe, lemon::Suurballe >::SetFlowMapTraits > >::SetPotentialMapTraits > >::SetPathTraits > >::SetHeapTraits >, lemon::concepts::Digraph::NodeMap >; lemon::Suurballe::Node = lemon::concepts::Digraph::Node]’: /<>/liblemon-1.3.1+dfsg/test/suurballe_test.cc:110:20: required from here /<>/liblemon-1.3.1+dfsg/lemon/suurballe.h:515:10: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 515 | _s = s; | ~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/suurballe_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/suurballe_test.cc:24: /<>/liblemon-1.3.1+dfsg/lemon/suurballe.h: In instantiation of ‘int lemon::Suurballe::findFlow(const Node&, int) [with GR = lemon::concepts::Digraph; LEN = lemon::concepts::ReadMap; TR = lemon::Suurballe, lemon::Suurballe, lemon::Suurballe, lemon::Suurballe >::SetFlowMapTraits > >::SetPotentialMapTraits > >::SetPathTraits > >::SetHeapTraits >, lemon::concepts::Digraph::NodeMap >; lemon::Suurballe::Node = lemon::concepts::Digraph::Node]’: /<>/liblemon-1.3.1+dfsg/test/suurballe_test.cc:114:28: required from here /<>/liblemon-1.3.1+dfsg/lemon/suurballe.h:600:10: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 600 | _t = t; | ~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/suurballe_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/suurballe_test.cc:24: /<>/liblemon-1.3.1+dfsg/lemon/suurballe.h:613:19: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 613 | while ((e = (*_init_pred)[u]) != INVALID) { | ~~~^~~~~~~~~~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/suurballe_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/suurballe_test.cc:24: /<>/liblemon-1.3.1+dfsg/lemon/suurballe.h:615:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 615 | u = _graph.source(e); In file included from /<>/liblemon-1.3.1+dfsg/test/suurballe_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/suurballe_test.cc:24: /<>/liblemon-1.3.1+dfsg/lemon/suurballe.h:634:19: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 634 | while ((e = _pred[u]) != INVALID) { | ~~~^~~~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/suurballe_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/suurballe_test.cc:24: /<>/liblemon-1.3.1+dfsg/lemon/suurballe.h:637:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 637 | u = _graph.source(e); In file included from /<>/liblemon-1.3.1+dfsg/test/suurballe_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/suurballe_test.cc:24: /<>/liblemon-1.3.1+dfsg/lemon/suurballe.h:640:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 640 | u = _graph.target(e); In file included from /<>/liblemon-1.3.1+dfsg/test/suurballe_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/suurballe_test.cc:24: /<>/liblemon-1.3.1+dfsg/lemon/suurballe.h: In instantiation of ‘void lemon::Suurballe::findPaths() [with GR = lemon::concepts::Digraph; LEN = lemon::concepts::ReadMap; TR = lemon::Suurballe, lemon::Suurballe, lemon::Suurballe, lemon::Suurballe >::SetFlowMapTraits > >::SetPotentialMapTraits > >::SetPathTraits > >::SetHeapTraits >, lemon::concepts::Digraph::NodeMap >]’: /<>/liblemon-1.3.1+dfsg/test/suurballe_test.cc:116:24: required from here /<>/liblemon-1.3.1+dfsg/lemon/suurballe.h:665:13: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 665 | n = _graph.target(e); In file included from /<>/liblemon-1.3.1+dfsg/test/suurballe_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/suurballe_test.cc:24: /<>/liblemon-1.3.1+dfsg/lemon/suurballe.h: In instantiation of ‘bool lemon::Suurballe::ResidualDijkstra::startFirst() [with GR = lemon::concepts::Digraph; LEN = lemon::concepts::ReadMap; TR = lemon::Suurballe, lemon::Suurballe, lemon::Suurballe, lemon::Suurballe >::SetFlowMapTraits > >::SetPotentialMapTraits > >::SetPathTraits > >::SetHeapTraits >, lemon::concepts::Digraph::NodeMap >]’: /<>/liblemon-1.3.1+dfsg/lemon/suurballe.h:176:27: required from ‘bool lemon::Suurballe::ResidualDijkstra::run(int) [with GR = lemon::concepts::Digraph; LEN = lemon::concepts::ReadMap; TR = lemon::Suurballe, lemon::Suurballe, lemon::Suurballe, lemon::Suurballe >::SetFlowMapTraits > >::SetPotentialMapTraits > >::SetPathTraits > >::SetHeapTraits >, lemon::concepts::Digraph::NodeMap >]’ /<>/liblemon-1.3.1+dfsg/lemon/suurballe.h:628:13: required from ‘int lemon::Suurballe::findFlow(const Node&, int) [with GR = lemon::concepts::Digraph; LEN = lemon::concepts::ReadMap; TR = lemon::Suurballe, lemon::Suurballe, lemon::Suurballe, lemon::Suurballe >::SetFlowMapTraits > >::SetPotentialMapTraits > >::SetPathTraits > >::SetHeapTraits >, lemon::concepts::Digraph::NodeMap >; lemon::Suurballe::Node = lemon::concepts::Digraph::Node]’ /<>/liblemon-1.3.1+dfsg/test/suurballe_test.cc:114:28: required from here /<>/liblemon-1.3.1+dfsg/lemon/suurballe.h:187:19: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 187 | _pred[_s] = INVALID; | ~~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/suurballe_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/suurballe_test.cc:24: /<>/liblemon-1.3.1+dfsg/lemon/suurballe.h:200:15: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 200 | v = _graph.target(e); In file included from /<>/liblemon-1.3.1+dfsg/test/suurballe_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/suurballe_test.cc:24: /<>/liblemon-1.3.1+dfsg/lemon/suurballe.h:204:26: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 204 | _pred[v] = e; | ~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/suurballe_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/suurballe_test.cc:24: /<>/liblemon-1.3.1+dfsg/lemon/suurballe.h:210:28: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 210 | _pred[v] = e; | ~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/suurballe_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/suurballe_test.cc:24: /<>/liblemon-1.3.1+dfsg/lemon/suurballe.h: In instantiation of ‘bool lemon::Suurballe::ResidualDijkstra::start() [with GR = lemon::concepts::Digraph; LEN = lemon::concepts::ReadMap; TR = lemon::Suurballe, lemon::Suurballe, lemon::Suurballe, lemon::Suurballe >::SetFlowMapTraits > >::SetPotentialMapTraits > >::SetPathTraits > >::SetHeapTraits >, lemon::concepts::Digraph::NodeMap >]’: /<>/liblemon-1.3.1+dfsg/lemon/suurballe.h:176:42: required from ‘bool lemon::Suurballe::ResidualDijkstra::run(int) [with GR = lemon::concepts::Digraph; LEN = lemon::concepts::ReadMap; TR = lemon::Suurballe, lemon::Suurballe, lemon::Suurballe, lemon::Suurballe >::SetFlowMapTraits > >::SetPotentialMapTraits > >::SetPathTraits > >::SetHeapTraits >, lemon::concepts::Digraph::NodeMap >]’ /<>/liblemon-1.3.1+dfsg/lemon/suurballe.h:628:13: required from ‘int lemon::Suurballe::findFlow(const Node&, int) [with GR = lemon::concepts::Digraph; LEN = lemon::concepts::ReadMap; TR = lemon::Suurballe, lemon::Suurballe, lemon::Suurballe, lemon::Suurballe >::SetFlowMapTraits > >::SetPotentialMapTraits > >::SetPathTraits > >::SetHeapTraits >, lemon::concepts::Digraph::NodeMap >; lemon::Suurballe::Node = lemon::concepts::Digraph::Node]’ /<>/liblemon-1.3.1+dfsg/test/suurballe_test.cc:114:28: required from here /<>/liblemon-1.3.1+dfsg/lemon/suurballe.h:232:19: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 232 | _pred[_s] = INVALID; | ~~~~~~~~~~^~~~~~~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/suurballe_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/suurballe_test.cc:24: /<>/liblemon-1.3.1+dfsg/lemon/suurballe.h:246:17: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 246 | v = _graph.target(e); In file included from /<>/liblemon-1.3.1+dfsg/test/suurballe_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/suurballe_test.cc:24: /<>/liblemon-1.3.1+dfsg/lemon/suurballe.h:250:28: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 250 | _pred[v] = e; | ~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/suurballe_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/suurballe_test.cc:24: /<>/liblemon-1.3.1+dfsg/lemon/suurballe.h:256:30: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 256 | _pred[v] = e; | ~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/suurballe_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/suurballe_test.cc:24: /<>/liblemon-1.3.1+dfsg/lemon/suurballe.h:268:17: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Node& lemon::concepts::Digraph::Node::operator=(const lemon::concepts::Digraph::Node&)’ is deprecated [-Wdeprecated-copy] 268 | v = _graph.source(e); In file included from /<>/liblemon-1.3.1+dfsg/test/suurballe_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because ‘lemon::concepts::Digraph::Node’ has user-provided ‘lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)’ 77 | Node(const Node&) { } | ^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/suurballe_test.cc:24: /<>/liblemon-1.3.1+dfsg/lemon/suurballe.h:272:28: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 272 | _pred[v] = e; | ~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/suurballe_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/suurballe_test.cc:24: /<>/liblemon-1.3.1+dfsg/lemon/suurballe.h:278:30: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 278 | _pred[v] = e; | ~~~~~~~~~^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/suurballe_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/lemon/bits/map_extender.h:27, from /<>/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:24, from /<>/liblemon-1.3.1+dfsg/lemon/list_graph.h:28, from /<>/liblemon-1.3.1+dfsg/test/suurballe_test.cc:21: /<>/liblemon-1.3.1+dfsg/lemon/concepts/maps.h: In instantiation of ‘void lemon::concepts::ReferenceMap::set(const Key&, const Value&) [with K = lemon::concepts::Digraph::Node; T = lemon::concepts::Digraph::Arc; R = lemon::concepts::Digraph::Arc&; CR = const lemon::concepts::Digraph::Arc&; lemon::concepts::ReferenceMap::Key = lemon::concepts::Digraph::Node; lemon::concepts::ReferenceMap::Value = lemon::concepts::Digraph::Arc]’: /<>/liblemon-1.3.1+dfsg/lemon/dijkstra.h:612:9: required from ‘void lemon::Dijkstra::init() [with GR = lemon::concepts::Digraph; LEN = lemon::concepts::ReadMap; TR = lemon::Dijkstra, lemon::Dijkstra, lemon::Dijkstra, lemon::DijkstraDefaultTraits > >::SetStandardHeapTraits >, lemon::concepts::Digraph::NodeMap > >::SetDistMapTraits > >::SetPredMapTraits >]’ /<>/liblemon-1.3.1+dfsg/lemon/dijkstra.h:782:7: required from ‘void lemon::Dijkstra::run(lemon::Dijkstra::Node) [with GR = lemon::concepts::Digraph; LEN = lemon::concepts::ReadMap; TR = lemon::Dijkstra, lemon::Dijkstra, lemon::Dijkstra, lemon::DijkstraDefaultTraits > >::SetStandardHeapTraits >, lemon::concepts::Digraph::NodeMap > >::SetDistMapTraits > >::SetPredMapTraits >; lemon::Dijkstra::Node = lemon::concepts::Digraph::Node]’ /<>/liblemon-1.3.1+dfsg/lemon/suurballe.h:557:7: required from ‘void lemon::Suurballe::fullInit(const Node&) [with GR = lemon::concepts::Digraph; LEN = lemon::concepts::ReadMap; TR = lemon::Suurballe, lemon::Suurballe, lemon::Suurballe, lemon::Suurballe >::SetFlowMapTraits > >::SetPotentialMapTraits > >::SetPathTraits > >::SetHeapTraits >, lemon::concepts::Digraph::NodeMap >; lemon::Suurballe::Node = lemon::concepts::Digraph::Node]’ /<>/liblemon-1.3.1+dfsg/test/suurballe_test.cc:111:24: required from here /<>/liblemon-1.3.1+dfsg/lemon/concepts/maps.h:186:60: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 186 | void set(const Key &k,const Value &t) { operator[](k)=t; } In file included from /<>/liblemon-1.3.1+dfsg/test/suurballe_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ In file included from /<>/liblemon-1.3.1+dfsg/test/suurballe_test.cc:23: /<>/liblemon-1.3.1+dfsg/lemon/path.h: In instantiation of ‘void lemon::SimplePath::build(const CPath&) [with CPath = lemon::SimplePath; GR = lemon::concepts::Digraph]’: /<>/liblemon-1.3.1+dfsg/lemon/path.h:998:9: required from ‘static void lemon::_path_bits::PathCopySelectorForward::copy(const From&, To&) [with From = lemon::SimplePath; To = lemon::SimplePath]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:1026:48: required from ‘static void lemon::_path_bits::PathCopySelector::copy(const From&, To&) [with From = lemon::SimplePath; To = lemon::SimplePath; bool revEnable = false]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:1046:49: required from ‘void lemon::pathCopy(const From&, To&) [with From = lemon::SimplePath; To = lemon::SimplePath]’ /<>/liblemon-1.3.1+dfsg/lemon/path.h:271:15: required from ‘lemon::SimplePath::SimplePath(const lemon::SimplePath&) [with GR = lemon::concepts::Digraph]’ /usr/include/c++/9/bits/stl_construct.h:75:7: required from ‘void std::_Construct(_T1*, _Args&& ...) [with _T1 = lemon::SimplePath; _Args = {const lemon::SimplePath&}]’ /usr/include/c++/9/bits/stl_uninitialized.h:83:18: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/include/c++/9/bits/stl_uninitialized.h:307:37: required from ‘_ForwardIterator std::__uninitialized_copy_a(_InputIterator, _InputIterator, _ForwardIterator, std::allocator<_Tp>&) [with _InputIterator = const lemon::SimplePath*; _ForwardIterator = lemon::SimplePath*; _Tp = lemon::SimplePath]’ /usr/include/c++/9/bits/stl_uninitialized.h:329:2: required from ‘_ForwardIterator std::__uninitialized_move_if_noexcept_a(_InputIterator, _InputIterator, _ForwardIterator, _Allocator&) [with _InputIterator = lemon::SimplePath*; _ForwardIterator = lemon::SimplePath*; _Allocator = std::allocator >]’ /usr/include/c++/9/bits/vector.tcc:659:48: required from ‘void std::vector<_Tp, _Alloc>::_M_default_append(std::vector<_Tp, _Alloc>::size_type) [with _Tp = lemon::SimplePath; _Alloc = std::allocator >; std::vector<_Tp, _Alloc>::size_type = unsigned int]’ /usr/include/c++/9/bits/stl_vector.h:937:4: required from ‘void std::vector<_Tp, _Alloc>::resize(std::vector<_Tp, _Alloc>::size_type) [with _Tp = lemon::SimplePath; _Alloc = std::allocator >; std::vector<_Tp, _Alloc>::size_type = unsigned int]’ /<>/liblemon-1.3.1+dfsg/lemon/suurballe.h:659:7: required from ‘void lemon::Suurballe::findPaths() [with GR = lemon::concepts::Digraph; LEN = lemon::concepts::ReadMap; TR = lemon::Suurballe, lemon::Suurballe, lemon::Suurballe, lemon::Suurballe >::SetFlowMapTraits > >::SetPotentialMapTraits > >::SetPathTraits > >::SetHeapTraits >, lemon::concepts::Digraph::NodeMap >]’ /<>/liblemon-1.3.1+dfsg/test/suurballe_test.cc:116:24: required from here /<>/liblemon-1.3.1+dfsg/lemon/path.h:396:21: warning: implicitly-declared ‘constexpr lemon::concepts::Digraph::Arc& lemon::concepts::Digraph::Arc::operator=(const lemon::concepts::Digraph::Arc&)’ is deprecated [-Wdeprecated-copy] 396 | data[index] = it;; | ~~~~~~~~~~~~^~~~ In file included from /<>/liblemon-1.3.1+dfsg/test/suurballe_test.cc:25: /<>/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:167:9: note: because ‘lemon::concepts::Digraph::Arc’ has user-provided ‘lemon::concepts::Digraph::Arc::Arc(const lemon::concepts::Digraph::Arc&)’ 167 | Arc(const Arc&) { } | ^~~ [ 97%] Linking CXX executable suurballe_test cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/cmake -E cmake_link_script CMakeFiles/suurballe_test.dir/link.txt --verbose=1 /usr/bin/c++ -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -Wl,-Bsymbolic-functions -Wl,-z,relro -Wl,-z,now -rdynamic CMakeFiles/suurballe_test.dir/suurballe_test.cc.o -o suurballe_test -L/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 97%] Built target suurballe_test make -f test/CMakeFiles/unionfind_test.dir/build.make test/CMakeFiles/unionfind_test.dir/depend make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<>/liblemon-1.3.1+dfsg /<>/liblemon-1.3.1+dfsg/test /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test/CMakeFiles/unionfind_test.dir/DependInfo.cmake --color= Scanning dependencies of target unionfind_test make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' make -f test/CMakeFiles/unionfind_test.dir/build.make test/CMakeFiles/unionfind_test.dir/build make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 98%] Building CXX object test/CMakeFiles/unionfind_test.dir/unionfind_test.cc.o cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -I/<>/liblemon-1.3.1+dfsg -I/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -o CMakeFiles/unionfind_test.dir/unionfind_test.cc.o -c /<>/liblemon-1.3.1+dfsg/test/unionfind_test.cc [100%] Linking CXX executable unionfind_test cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/cmake -E cmake_link_script CMakeFiles/unionfind_test.dir/link.txt --verbose=1 /usr/bin/c++ -g -O2 -fdebug-prefix-map=/<>/liblemon-1.3.1+dfsg=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas -Wl,-Bsymbolic-functions -Wl,-z,relro -Wl,-z,now -rdynamic CMakeFiles/unionfind_test.dir/unionfind_test.cc.o -o unionfind_test -L/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [100%] Built target unionfind_test make -f CMakeFiles/check.dir/build.make CMakeFiles/check.dir/depend make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<>/liblemon-1.3.1+dfsg /<>/liblemon-1.3.1+dfsg /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/CMakeFiles/check.dir/DependInfo.cmake --color= Scanning dependencies of target check make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' make -f CMakeFiles/check.dir/build.make CMakeFiles/check.dir/build make[5]: Entering directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' /usr/bin/ctest Test project /<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf Start 1: lp_test 1/44 Test #1: lp_test .......................... Passed 0.01 sec Start 2: mip_test 2/44 Test #2: mip_test ......................... Passed 0.01 sec Start 3: adaptors_test 3/44 Test #3: adaptors_test .................... Passed 0.01 sec Start 4: arc_look_up_test 4/44 Test #4: arc_look_up_test ................. Passed 0.00 sec Start 5: bellman_ford_test 5/44 Test #5: bellman_ford_test ................ Passed 0.00 sec Start 6: bfs_test 6/44 Test #6: bfs_test ......................... Passed 0.00 sec Start 7: bpgraph_test 7/44 Test #7: bpgraph_test ..................... Passed 0.01 sec Start 8: circulation_test 8/44 Test #8: circulation_test ................. Passed 0.01 sec Start 9: connectivity_test 9/44 Test #9: connectivity_test ................ Passed 0.01 sec Start 10: counter_test 10/44 Test #10: counter_test ..................... Passed 0.00 sec Start 11: dfs_test 11/44 Test #11: dfs_test ......................... Passed 0.01 sec Start 12: digraph_test 12/44 Test #12: digraph_test ..................... Passed 0.00 sec Start 13: dijkstra_test 13/44 Test #13: dijkstra_test .................... Passed 0.00 sec Start 14: dim_test 14/44 Test #14: dim_test ......................... Passed 0.00 sec Start 15: edge_set_test 15/44 Test #15: edge_set_test .................... Passed 0.00 sec Start 16: error_test 16/44 Test #16: error_test ....................... Passed 0.00 sec Start 17: euler_test 17/44 Test #17: euler_test ....................... Passed 0.00 sec Start 18: fractional_matching_test 18/44 Test #18: fractional_matching_test ......... Passed 0.01 sec Start 19: gomory_hu_test 19/44 Test #19: gomory_hu_test ................... Passed 0.00 sec Start 20: graph_copy_test 20/44 Test #20: graph_copy_test .................. Passed 0.01 sec Start 21: graph_test 21/44 Test #21: graph_test ....................... Passed 0.01 sec Start 22: graph_utils_test 22/44 Test #22: graph_utils_test ................. Passed 0.01 sec Start 23: hao_orlin_test 23/44 Test #23: hao_orlin_test ................... Passed 0.01 sec Start 24: heap_test 24/44 Test #24: heap_test ........................ Passed 0.01 sec Start 25: kruskal_test 25/44 Test #25: kruskal_test ..................... Passed 0.00 sec Start 26: lgf_reader_writer_test 26/44 Test #26: lgf_reader_writer_test ...........Child aborted***Exception: 0.40 sec Start 27: lgf_test 27/44 Test #27: lgf_test ......................... Passed 0.01 sec Start 28: maps_test 28/44 Test #28: maps_test ........................ Passed 0.00 sec Start 29: matching_test 29/44 Test #29: matching_test .................... Passed 0.01 sec Start 30: max_cardinality_search_test 30/44 Test #30: max_cardinality_search_test ...... Passed 0.00 sec Start 31: max_clique_test 31/44 Test #31: max_clique_test .................. Passed 0.01 sec Start 32: max_flow_test 32/44 Test #32: max_flow_test .................... Passed 0.01 sec Start 33: min_cost_arborescence_test 33/44 Test #33: min_cost_arborescence_test ....... Passed 0.00 sec Start 34: min_cost_flow_test 34/44 Test #34: min_cost_flow_test ............... Passed 0.01 sec Start 35: min_mean_cycle_test 35/44 Test #35: min_mean_cycle_test .............. Passed 0.01 sec Start 36: nagamochi_ibaraki_test 36/44 Test #36: nagamochi_ibaraki_test ........... Passed 0.00 sec Start 37: path_test 37/44 Test #37: path_test ........................ Passed 0.00 sec Start 38: planarity_test 38/44 Test #38: planarity_test ................... Passed 0.00 sec Start 39: radix_sort_test 39/44 Test #39: radix_sort_test .................. Passed 0.11 sec Start 40: random_test 40/44 Test #40: random_test ...................... Passed 0.01 sec Start 41: suurballe_test 41/44 Test #41: suurballe_test ................... Passed 0.00 sec Start 42: time_measure_test 42/44 Test #42: time_measure_test ................ Passed 0.41 sec Start 43: tsp_test 43/44 Test #43: tsp_test ......................... Passed 0.01 sec Start 44: unionfind_test 44/44 Test #44: unionfind_test ................... Passed 0.00 sec 98% tests passed, 1 tests failed out of 44 Total Test time (real) = 1.17 sec The following tests FAILED: 26 - lgf_reader_writer_test (Child aborted) Errors while running CTest make[5]: *** [CMakeFiles/check.dir/build.make:60: CMakeFiles/check] Error 8 make[5]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' make[4]: *** [CMakeFiles/Makefile2:129: CMakeFiles/check.dir/all] Error 2 make[4]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' make[3]: *** [CMakeFiles/Makefile2:136: CMakeFiles/check.dir/rule] Error 2 make[3]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' make[2]: *** [Makefile:200: check] Error 2 make[2]: Leaving directory '/<>/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' make[1]: *** [debian/rules:17: override_dh_auto_test] Error 2 make[1]: Leaving directory '/<>/liblemon-1.3.1+dfsg' make: *** [debian/rules:10: build-arch] Error 2 dpkg-buildpackage: error: debian/rules build-arch subprocess returned exit status 2 -------------------------------------------------------------------------------- Build finished at 20200105-1413 Finished -------- E: Build failure (dpkg-buildpackage died) +------------------------------------------------------------------------------+ | Cleanup | +------------------------------------------------------------------------------+ Purging /<> Not removing build depends: as requested +------------------------------------------------------------------------------+ | Summary | +------------------------------------------------------------------------------+ Build Architecture: armhf Build-Space: 459388 Build-Time: 1417 Distribution: focal Fail-Stage: build Host Architecture: armhf Install-Time: 50 Job: liblemon_1.3.1+dfsg-2.dsc Machine Architecture: arm64 Package: liblemon Package-Time: 1468 Source-Version: 1.3.1+dfsg-2 Space: 459388 Status: attempted Version: 1.3.1+dfsg-2 -------------------------------------------------------------------------------- Finished at 20200105-1413 Build needed 00:24:28, 459388k disc space RUN: /usr/share/launchpad-buildd/bin/in-target scan-for-processes --backend=chroot --series=focal --arch=armhf PACKAGEBUILD-18319570 Scanning for processes to kill in build PACKAGEBUILD-18319570