Sat Apr 13 04:42:08 UTC 2024 I: starting to build liblemon/trixie/armhf on jenkins on '2024-04-13 04:41' Sat Apr 13 04:42:08 UTC 2024 I: The jenkins build log is/was available at https://jenkins.debian.net/userContent/reproducible/debian/build_service/armhf_10/2071/console.log Sat Apr 13 04:42:08 UTC 2024 I: Downloading source for trixie/liblemon=1.3.1+dfsg-6 --2024-04-13 04:42:08-- http://deb.debian.org/debian/pool/main/libl/liblemon/liblemon_1.3.1%2bdfsg-6.dsc Connecting to 78.137.99.97:3128... connected. Proxy request sent, awaiting response... 200 OK Length: 2244 (2.2K) [text/prs.lines.tag] Saving to: ‘liblemon_1.3.1+dfsg-6.dsc’ 0K .. 100% 219M=0s 2024-04-13 04:42:08 (219 MB/s) - ‘liblemon_1.3.1+dfsg-6.dsc’ saved [2244/2244] Sat Apr 13 04:42:09 UTC 2024 I: liblemon_1.3.1+dfsg-6.dsc -----BEGIN PGP SIGNED MESSAGE----- Hash: SHA256 Format: 3.0 (quilt) Source: liblemon Binary: liblemon1.3.1, liblemon-dev, liblemon-utils, liblemon-doc Architecture: any all Version: 1.3.1+dfsg-6 Maintainer: Debian Med Packaging Team Uploaders: Andreas Tille Homepage: https://lemon.cs.elte.hu/trac/lemon Standards-Version: 4.6.1 Vcs-Browser: https://salsa.debian.org/med-team/liblemon Vcs-Git: https://salsa.debian.org/med-team/liblemon.git Build-Depends: debhelper-compat (= 13), cmake, d-shlibs, libglpk-dev, python3, doxygen, graphviz, libjs-mathjax, ghostscript Package-List: liblemon-dev deb libdevel optional arch=any liblemon-doc deb doc optional arch=all liblemon-utils deb science optional arch=any liblemon1.3.1 deb libs optional arch=any Checksums-Sha1: d5ff3ffad56304a81a5074fafd83aed936875323 435716 liblemon_1.3.1+dfsg.orig.tar.xz 60da651d910aab012808df72a53816063078ca63 6460 liblemon_1.3.1+dfsg-6.debian.tar.xz Checksums-Sha256: 367b992467e4da06d5f8d2a664969ec39682723694469cba652ac55e8bd02f0a 435716 liblemon_1.3.1+dfsg.orig.tar.xz 5df8854d85ecd2a958c063365834544052a2be5a46f344fa000276974222c579 6460 liblemon_1.3.1+dfsg-6.debian.tar.xz Files: 2f6f98c65e2bd4ab218b7625f0eaaa06 435716 liblemon_1.3.1+dfsg.orig.tar.xz 830abfac6f76e76760f78d0eb9524913 6460 liblemon_1.3.1+dfsg-6.debian.tar.xz -----BEGIN PGP SIGNATURE----- iQJFBAEBCAAvFiEE8fAHMgoDVUHwpmPKV4oElNHGRtEFAmLe5IoRHHRpbGxlQGRl Ymlhbi5vcmcACgkQV4oElNHGRtGCTw/9GEQXqlpC//GWuXku37NbYTMQOEMLZFKY 0NxWaVglQg2Nb8zJzZd6nF3GWrnEc0+119UeWhd7NdhGtWU/5dE1q/9R5fZkg+YC IQr/t1l+1YLw9WDm4Wrz0TXwWyAYR4FITkRyw5YUndYKzPtaJqzgvrYL2V9Nhvhq 7RD5WGH+9Ob65UyQMYsaZ3c/RZDHEogGlvme3/riSkpzlMaZWQXEcxYE2gL+o3Ds nuhpHtLR9zB68xab3BLlS2VEOLEKEyQ5cIU/69IwXxp1Yt3ti1LMBjuJprto3iPp QCjG/Q5qZY+vmwKtDyNNdQwZoj2M1pCcgL0Wxl5LrYQ7lDWZuJ78VqmLIOl9v9rQ OS/gQDXyiFTONErcWUoTcJfTiw2AqjYaA4WkrUQskNFH8plOl0JM/P4AWVZq8Fwp jsbnvoybu+4/ypsYY4N6XQb1Hr/GjoB6T5z6VKMYNuYFsfAhRciawyhpwS5hF33+ 2Uxc/kIBmRgt/SnchIxK59ik6I15BEn/74o2+T8gDmP3GRb7QshLQs5BcUIQBHiP zqfaZihecRF0tXJGvGNUZf09gvTuLZX46EAvh4CrY3VGCKtOPy27w+01uFFxiEfK GdIrNgBkfNyzYVxl5jd43NRZDBATwqOTeVbJV1gSIUEZNjdzVsaCy0x01So2ThN2 sHRkm+s49zc= =Ya7s -----END PGP SIGNATURE----- Sat Apr 13 04:42:09 UTC 2024 I: Checking whether the package is not for us Sat Apr 13 04:42:09 UTC 2024 I: Starting 1st build on remote node wbq0-armhf-rb.debian.net. Sat Apr 13 04:42:09 UTC 2024 I: Preparing to do remote build '1' on wbq0-armhf-rb.debian.net. Sat Apr 13 05:59:06 UTC 2024 I: Deleting $TMPDIR on wbq0-armhf-rb.debian.net. I: pbuilder: network access will be disabled during build I: Current time: Fri Apr 12 16:42:18 -12 2024 I: pbuilder-time-stamp: 1712983338 I: Building the build Environment I: extracting base tarball [/var/cache/pbuilder/trixie-reproducible-base.tgz] I: copying local configuration W: --override-config is not set; not updating apt.conf Read the manpage for details. I: mounting /proc filesystem I: mounting /sys filesystem I: creating /{dev,run}/shm I: mounting /dev/pts filesystem I: redirecting /dev/ptmx to /dev/pts/ptmx I: policy-rc.d already exists I: Copying source file I: copying [liblemon_1.3.1+dfsg-6.dsc] I: copying [./liblemon_1.3.1+dfsg.orig.tar.xz] I: copying [./liblemon_1.3.1+dfsg-6.debian.tar.xz] I: Extracting source gpgv: Signature made Mon Jul 25 18:44:26 2022 gpgv: using RSA key F1F007320A035541F0A663CA578A0494D1C646D1 gpgv: issuer "tille@debian.org" gpgv: Can't check signature: No public key dpkg-source: warning: cannot verify inline signature for ./liblemon_1.3.1+dfsg-6.dsc: no acceptable signature found 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-6.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 dpkg-source: info: applying dummy-test-check.diff dpkg-source: info: applying pkg-config.patch I: Not using root during the build. I: Installing the build-deps I: user script /srv/workspace/pbuilder/25566/tmp/hooks/D02_print_environment starting I: set BUILDDIR='/build/reproducible-path' BUILDUSERGECOS='first user,first room,first work-phone,first home-phone,first other' BUILDUSERNAME='pbuilder1' BUILD_ARCH='armhf' DEBIAN_FRONTEND='noninteractive' DEB_BUILD_OPTIONS='buildinfo=+all reproducible=+all parallel=3 ' DISTRIBUTION='trixie' HOME='/root' HOST_ARCH='armhf' IFS=' ' INVOCATION_ID='a3db2043650a4e1596b75b6939ea492e' LANG='C' LANGUAGE='en_US:en' LC_ALL='C' MAIL='/var/mail/root' OPTIND='1' PATH='/usr/sbin:/usr/bin:/sbin:/bin:/usr/games' PBCURRENTCOMMANDLINEOPERATION='build' PBUILDER_OPERATION='build' PBUILDER_PKGDATADIR='/usr/share/pbuilder' PBUILDER_PKGLIBDIR='/usr/lib/pbuilder' PBUILDER_SYSCONFDIR='/etc' PPID='25566' PS1='# ' PS2='> ' PS4='+ ' PWD='/' SHELL='/bin/bash' SHLVL='2' SUDO_COMMAND='/usr/bin/timeout -k 18.1h 18h /usr/bin/ionice -c 3 /usr/bin/nice /usr/sbin/pbuilder --build --configfile /srv/reproducible-results/rbuild-debian/r-b-build.L0MwzBhL/pbuilderrc_17iB --distribution trixie --hookdir /etc/pbuilder/first-build-hooks --debbuildopts -b --basetgz /var/cache/pbuilder/trixie-reproducible-base.tgz --buildresult /srv/reproducible-results/rbuild-debian/r-b-build.L0MwzBhL/b1 --logfile b1/build.log liblemon_1.3.1+dfsg-6.dsc' SUDO_GID='113' SUDO_UID='107' SUDO_USER='jenkins' TERM='unknown' TZ='/usr/share/zoneinfo/Etc/GMT+12' USER='root' _='/usr/bin/systemd-run' http_proxy='http://10.0.0.15:3142/' I: uname -a Linux wbq0 6.1.0-18-armmp #1 SMP Debian 6.1.76-1 (2024-02-01) armv7l GNU/Linux I: ls -l /bin lrwxrwxrwx 1 root root 7 Apr 12 11:26 /bin -> usr/bin I: user script /srv/workspace/pbuilder/25566/tmp/hooks/D02_print_environment finished -> Attempting to satisfy build-dependencies -> Creating pbuilder-satisfydepends-dummy package Package: pbuilder-satisfydepends-dummy Version: 0.invalid.0 Architecture: armhf Maintainer: Debian Pbuilder Team Description: Dummy package to satisfy dependencies with aptitude - created by pbuilder This package was created automatically by pbuilder to satisfy the build-dependencies of the package being currently built. Depends: debhelper-compat (= 13), cmake, d-shlibs, libglpk-dev, python3, doxygen, graphviz, libjs-mathjax, ghostscript dpkg-deb: building package 'pbuilder-satisfydepends-dummy' in '/tmp/satisfydepends-aptitude/pbuilder-satisfydepends-dummy.deb'. Selecting previously unselected package pbuilder-satisfydepends-dummy. (Reading database ... 19635 files and directories currently installed.) Preparing to unpack .../pbuilder-satisfydepends-dummy.deb ... Unpacking pbuilder-satisfydepends-dummy (0.invalid.0) ... dpkg: pbuilder-satisfydepends-dummy: dependency problems, but configuring anyway as you requested: pbuilder-satisfydepends-dummy depends on debhelper-compat (= 13); however: Package debhelper-compat is not installed. pbuilder-satisfydepends-dummy depends on cmake; however: Package cmake is not installed. pbuilder-satisfydepends-dummy depends on d-shlibs; however: Package d-shlibs is not installed. pbuilder-satisfydepends-dummy depends on libglpk-dev; however: Package libglpk-dev is not installed. pbuilder-satisfydepends-dummy depends on python3; however: Package python3 is not installed. pbuilder-satisfydepends-dummy depends on doxygen; however: Package doxygen is not installed. pbuilder-satisfydepends-dummy depends on graphviz; however: Package graphviz is not installed. pbuilder-satisfydepends-dummy depends on libjs-mathjax; however: Package libjs-mathjax is not installed. pbuilder-satisfydepends-dummy depends on ghostscript; however: Package ghostscript is not installed. Setting up pbuilder-satisfydepends-dummy (0.invalid.0) ... Reading package lists... Building dependency tree... Reading state information... Initializing package states... Writing extended state information... Building tag database... pbuilder-satisfydepends-dummy is already installed at the requested version (0.invalid.0) pbuilder-satisfydepends-dummy is already installed at the requested version (0.invalid.0) The following NEW packages will be installed: autoconf{a} automake{a} autopoint{a} autotools-dev{a} bsdextrautils{a} cmake{a} cmake-data{a} d-shlibs{a} debhelper{a} dh-autoreconf{a} dh-strip-nondeterminism{a} doxygen{a} dwz{a} file{a} fontconfig{a} fontconfig-config{a} fonts-dejavu-core{a} fonts-dejavu-mono{a} fonts-mathjax{a} fonts-urw-base35{a} gettext{a} gettext-base{a} ghostscript{a} graphviz{a} groff-base{a} intltool-debian{a} libabsl20220623{a} libamd3{a} libaom3{a} libarchive-zip-perl{a} libarchive13{a} libavahi-client3{a} libavahi-common-data{a} libavahi-common3{a} libavif16{a} libblas-dev{a} libblas3{a} libbrotli1{a} libbsd0{a} libbtf2{a} libcairo2{a} libcamd3{a} libccolamd3{a} libcdt5{a} libcgraph6{a} libcholmod5{a} libclang-cpp16{a} libclang1-16{a} libcolamd3{a} libcups2{a} libcurl4{a} libcxsparse4{a} libdatrie1{a} libdav1d7{a} libdbus-1-3{a} libde265-0{a} libdebhelper-perl{a} libdeflate0{a} libedit2{a} libelf1{a} libexpat1{a} libfile-stripnondeterminism-perl{a} libfmt9{a} libfontconfig1{a} libfontenc1{a} libfreetype6{a} libfribidi0{a} libgav1-1{a} libgd3{a} libgfortran5{a} libglib2.0-0{a} libglpk-dev{a} libglpk40{a} libgmp-dev{a} libgmpxx4ldbl{a} libgraphite2-3{a} libgs-common{a} libgs10{a} libgs10-common{a} libgts-0.7-5{a} libgvc6{a} libgvpr2{a} libharfbuzz0b{a} libheif-plugin-dav1d{a} libheif-plugin-libde265{a} libheif1{a} libice6{a} libicu72{a} libidn12{a} libijs-0.35{a} libjbig0{a} libjbig2dec0{a} libjpeg62-turbo{a} libjs-mathjax{a} libjsoncpp25{a} libklu2{a} liblab-gamut1{a} liblapack-dev{a} liblapack3{a} liblcms2-2{a} libldap-2.5-0{a} libldl3{a} liblerc4{a} libllvm16{a} libltdl7{a} libmagic-mgc{a} libmagic1{a} libnghttp2-14{a} libopenjp2-7{a} libpango-1.0-0{a} libpangocairo-1.0-0{a} libpangoft2-1.0-0{a} libpaper1{a} libparu0{a} libpathplan4{a} libpipeline1{a} libpixman-1-0{a} libpng16-16{a} libproc2-0{a} libpsl5{a} libpython3-stdlib{a} libpython3.11-minimal{a} libpython3.11-stdlib{a} librav1e0{a} librbio4{a} libreadline8{a} librhash0{a} librtmp1{a} libsasl2-2{a} libsasl2-modules-db{a} libsharpyuv0{a} libsm6{a} libspex2{a} libspqr4{a} libssh2-1{a} libsub-override-perl{a} libsuitesparse-dev{a} libsuitesparse-mongoose3{a} libsuitesparseconfig7{a} libsvtav1enc1d1{a} libthai-data{a} libthai0{a} libtiff6{a} libtool{a} libuchardet0{a} libumfpack6{a} libuv1{a} libwebp7{a} libx11-6{a} libx11-data{a} libxau6{a} libxaw7{a} libxcb-render0{a} libxcb-shm0{a} libxcb1{a} libxdmcp6{a} libxext6{a} libxml2{a} libxmu6{a} libxpm4{a} libxrender1{a} libxt6{a} libyuv0{a} libz3-4{a} m4{a} man-db{a} media-types{a} netbase{a} po-debconf{a} poppler-data{a} procps{a} python3{a} python3-minimal{a} python3.11{a} python3.11-minimal{a} readline-common{a} sensible-utils{a} tzdata{a} ucf{a} x11-common{a} xfonts-encodings{a} xfonts-utils{a} zlib1g-dev{a} The following packages are RECOMMENDED but will NOT be installed: ca-certificates curl dbus fonts-droid-fallback fonts-liberation2 libarchive-cpio-perl libglib2.0-data libgraphblas-dev libgts-bin libheif-plugin-aomenc libheif-plugin-x265 libldap-common libltdl-dev libmail-sendmail-perl libpaper-utils libsasl2-modules lynx psmisc publicsuffix shared-mime-info wget xdg-user-dirs 0 packages upgraded, 183 newly installed, 0 to remove and 0 not upgraded. Need to get 134 MB of archives. After unpacking 523 MB will be used. Writing extended state information... Get: 1 http://deb.debian.org/debian trixie/main armhf poppler-data all 0.4.12-1 [1601 kB] Get: 2 http://deb.debian.org/debian trixie/main armhf libpython3.11-minimal armhf 3.11.8-1 [802 kB] Get: 3 http://deb.debian.org/debian trixie/main armhf libexpat1 armhf 2.5.0-2+b2 [80.2 kB] Get: 4 http://deb.debian.org/debian trixie/main armhf python3.11-minimal armhf 3.11.8-1 [1707 kB] Get: 5 http://deb.debian.org/debian trixie/main armhf python3-minimal armhf 3.11.6-1 [26.2 kB] Get: 6 http://deb.debian.org/debian trixie/main armhf media-types all 10.1.0 [26.9 kB] Get: 7 http://deb.debian.org/debian trixie/main armhf netbase all 6.4 [12.8 kB] Get: 8 http://deb.debian.org/debian trixie/main armhf tzdata all 2024a-1 [255 kB] Get: 9 http://deb.debian.org/debian trixie/main armhf readline-common all 8.2-3 [69.1 kB] Get: 10 http://deb.debian.org/debian trixie/main armhf libreadline8 armhf 8.2-3+b1 [144 kB] Get: 11 http://deb.debian.org/debian trixie/main armhf libpython3.11-stdlib armhf 3.11.8-1 [1709 kB] Get: 12 http://deb.debian.org/debian trixie/main armhf python3.11 armhf 3.11.8-1 [597 kB] Get: 13 http://deb.debian.org/debian trixie/main armhf libpython3-stdlib armhf 3.11.6-1 [9224 B] Get: 14 http://deb.debian.org/debian trixie/main armhf python3 armhf 3.11.6-1 [26.2 kB] Get: 15 http://deb.debian.org/debian trixie/main armhf libproc2-0 armhf 2:4.0.4-4 [55.7 kB] Get: 16 http://deb.debian.org/debian trixie/main armhf procps armhf 2:4.0.4-4 [864 kB] Get: 17 http://deb.debian.org/debian trixie/main armhf sensible-utils all 0.0.22 [22.4 kB] Get: 18 http://deb.debian.org/debian trixie/main armhf libmagic-mgc armhf 1:5.45-2+b1 [314 kB] Get: 19 http://deb.debian.org/debian trixie/main armhf libmagic1 armhf 1:5.45-2+b1 [97.9 kB] Get: 20 http://deb.debian.org/debian trixie/main armhf file armhf 1:5.45-2+b1 [42.2 kB] Get: 21 http://deb.debian.org/debian trixie/main armhf gettext-base armhf 0.21-14+b1 [157 kB] Get: 22 http://deb.debian.org/debian trixie/main armhf libuchardet0 armhf 0.0.8-1+b1 [65.7 kB] Get: 23 http://deb.debian.org/debian trixie/main armhf groff-base armhf 1.23.0-3 [1088 kB] Get: 24 http://deb.debian.org/debian trixie/main armhf bsdextrautils armhf 2.39.3-6 [81.2 kB] Get: 25 http://deb.debian.org/debian trixie/main armhf libpipeline1 armhf 1.5.7-2 [33.3 kB] Get: 26 http://deb.debian.org/debian trixie/main armhf man-db armhf 2.12.0-3 [1367 kB] Get: 27 http://deb.debian.org/debian trixie/main armhf ucf all 3.0043+nmu1 [55.2 kB] Get: 28 http://deb.debian.org/debian trixie/main armhf m4 armhf 1.4.19-4 [264 kB] Get: 29 http://deb.debian.org/debian trixie/main armhf autoconf all 2.71-3 [332 kB] Get: 30 http://deb.debian.org/debian trixie/main armhf autotools-dev all 20220109.1 [51.6 kB] Get: 31 http://deb.debian.org/debian trixie/main armhf automake all 1:1.16.5-1.3 [823 kB] Get: 32 http://deb.debian.org/debian trixie/main armhf autopoint all 0.21-14 [496 kB] Get: 33 http://deb.debian.org/debian trixie/main armhf libicu72 armhf 72.1-4+b1 [9070 kB] Get: 34 http://deb.debian.org/debian trixie/main armhf libxml2 armhf 2.9.14+dfsg-1.3+b2 [599 kB] Get: 35 http://deb.debian.org/debian trixie/main armhf libarchive13 armhf 3.7.2-1 [301 kB] Get: 36 http://deb.debian.org/debian trixie/main armhf libbrotli1 armhf 1.1.0-2+b3 [284 kB] Get: 37 http://deb.debian.org/debian trixie/main armhf libsasl2-modules-db armhf 2.1.28+dfsg1-4+b1 [18.2 kB] Get: 38 http://deb.debian.org/debian trixie/main armhf libsasl2-2 armhf 2.1.28+dfsg1-4+b1 [50.1 kB] Get: 39 http://deb.debian.org/debian trixie/main armhf libldap-2.5-0 armhf 2.5.13+dfsg-5+b3 [158 kB] Get: 40 http://deb.debian.org/debian trixie/main armhf libnghttp2-14 armhf 1.59.0-1 [62.0 kB] Get: 41 http://deb.debian.org/debian trixie/main armhf libpsl5 armhf 0.21.2-1+b1 [57.8 kB] Get: 42 http://deb.debian.org/debian trixie/main armhf librtmp1 armhf 2.4+20151223.gitfa8646d.1-2+b2 [55.2 kB] Get: 43 http://deb.debian.org/debian trixie/main armhf libssh2-1 armhf 1.11.0-4 [197 kB] Get: 44 http://deb.debian.org/debian trixie/main armhf libcurl4 armhf 8.5.0-2 [383 kB] Get: 45 http://deb.debian.org/debian trixie/main armhf libjsoncpp25 armhf 1.9.5-6+b2 [69.9 kB] Get: 46 http://deb.debian.org/debian trixie/main armhf librhash0 armhf 1.4.3-3+b1 [143 kB] Get: 47 http://deb.debian.org/debian trixie/main armhf libuv1 armhf 1.48.0-1 [133 kB] Get: 48 http://deb.debian.org/debian trixie/main armhf cmake-data all 3.28.3-1 [2128 kB] Get: 49 http://deb.debian.org/debian trixie/main armhf cmake armhf 3.28.3-1 [5109 kB] Get: 50 http://deb.debian.org/debian trixie/main armhf d-shlibs all 0.106 [10.9 kB] Get: 51 http://deb.debian.org/debian trixie/main armhf libdebhelper-perl all 13.15.3 [88.0 kB] Get: 52 http://deb.debian.org/debian trixie/main armhf libtool all 2.4.7-7 [517 kB] Get: 53 http://deb.debian.org/debian trixie/main armhf dh-autoreconf all 20 [17.1 kB] Get: 54 http://deb.debian.org/debian trixie/main armhf libarchive-zip-perl all 1.68-1 [104 kB] Get: 55 http://deb.debian.org/debian trixie/main armhf libsub-override-perl all 0.10-1 [10.6 kB] Get: 56 http://deb.debian.org/debian trixie/main armhf libfile-stripnondeterminism-perl all 1.13.1-1 [19.4 kB] Get: 57 http://deb.debian.org/debian trixie/main armhf dh-strip-nondeterminism all 1.13.1-1 [8620 B] Get: 58 http://deb.debian.org/debian trixie/main armhf libelf1 armhf 0.190-1+b1 [171 kB] Get: 59 http://deb.debian.org/debian trixie/main armhf dwz armhf 0.15-1 [101 kB] Get: 60 http://deb.debian.org/debian trixie/main armhf gettext armhf 0.21-14+b1 [1230 kB] Get: 61 http://deb.debian.org/debian trixie/main armhf intltool-debian all 0.35.0+20060710.6 [22.9 kB] Get: 62 http://deb.debian.org/debian trixie/main armhf po-debconf all 1.0.21+nmu1 [248 kB] Get: 63 http://deb.debian.org/debian trixie/main armhf debhelper all 13.15.3 [901 kB] Get: 64 http://deb.debian.org/debian trixie/main armhf libbsd0 armhf 0.12.2-1 [127 kB] Get: 65 http://deb.debian.org/debian trixie/main armhf libedit2 armhf 3.1-20230828-1 [76.8 kB] Get: 66 http://deb.debian.org/debian trixie/main armhf libz3-4 armhf 4.8.12-3.1+b2 [6324 kB] Get: 67 http://deb.debian.org/debian trixie/main armhf libllvm16 armhf 1:16.0.6-20 [20.6 MB] Get: 68 http://deb.debian.org/debian trixie/main armhf libclang-cpp16 armhf 1:16.0.6-20 [9875 kB] Get: 69 http://deb.debian.org/debian trixie/main armhf libclang1-16 armhf 1:16.0.6-20 [5545 kB] Get: 70 http://deb.debian.org/debian trixie/main armhf libfmt9 armhf 9.1.0+ds1-2 [105 kB] Get: 71 http://deb.debian.org/debian trixie/main armhf doxygen armhf 1.9.8+ds-2 [4458 kB] Get: 72 http://deb.debian.org/debian trixie/main armhf libpng16-16 armhf 1.6.43-1 [262 kB] Get: 73 http://deb.debian.org/debian trixie/main armhf libfreetype6 armhf 2.13.2+dfsg-1+b1 [371 kB] Get: 74 http://deb.debian.org/debian trixie/main armhf fonts-dejavu-mono all 2.37-8 [489 kB] Get: 75 http://deb.debian.org/debian trixie/main armhf fonts-dejavu-core all 2.37-8 [840 kB] Get: 76 http://deb.debian.org/debian trixie/main armhf libfontenc1 armhf 1:1.1.8-1 [20.6 kB] Get: 77 http://deb.debian.org/debian trixie/main armhf x11-common all 1:7.7+23 [252 kB] Get: 78 http://deb.debian.org/debian trixie/main armhf xfonts-encodings all 1:1.0.4-2.2 [577 kB] Get: 79 http://deb.debian.org/debian trixie/main armhf xfonts-utils armhf 1:7.7+6 [84.5 kB] Get: 80 http://deb.debian.org/debian trixie/main armhf fonts-urw-base35 all 20200910-8 [10.8 MB] Get: 81 http://deb.debian.org/debian trixie/main armhf fontconfig-config armhf 2.15.0-1.1 [317 kB] Get: 82 http://deb.debian.org/debian trixie/main armhf libfontconfig1 armhf 2.15.0-1.1 [370 kB] Get: 83 http://deb.debian.org/debian trixie/main armhf fontconfig armhf 2.15.0-1.1 [461 kB] Get: 84 http://deb.debian.org/debian trixie/main armhf fonts-mathjax all 2.7.9+dfsg-1 [2210 kB] Get: 85 http://deb.debian.org/debian trixie/main armhf libgs-common all 10.02.1~dfsg-3 [147 kB] Get: 86 http://deb.debian.org/debian trixie/main armhf libgs10-common all 10.02.1~dfsg-3 [474 kB] Get: 87 http://deb.debian.org/debian trixie/main armhf libavahi-common-data armhf 0.8-13+b1 [111 kB] Get: 88 http://deb.debian.org/debian trixie/main armhf libavahi-common3 armhf 0.8-13+b1 [40.1 kB] Get: 89 http://deb.debian.org/debian trixie/main armhf libdbus-1-3 armhf 1.14.10-4 [180 kB] Get: 90 http://deb.debian.org/debian trixie/main armhf libavahi-client3 armhf 0.8-13+b1 [43.4 kB] Get: 91 http://deb.debian.org/debian trixie/main armhf libcups2 armhf 2.4.7-1+b1 [212 kB] Get: 92 http://deb.debian.org/debian trixie/main armhf libidn12 armhf 1.42-2 [77.7 kB] Get: 93 http://deb.debian.org/debian trixie/main armhf libijs-0.35 armhf 0.35-15.1+b1 [13.4 kB] Get: 94 http://deb.debian.org/debian trixie/main armhf libjbig2dec0 armhf 0.20-1+b1 [56.1 kB] Get: 95 http://deb.debian.org/debian trixie/main armhf libjpeg62-turbo armhf 1:2.1.5-2+b2 [143 kB] Get: 96 http://deb.debian.org/debian trixie/main armhf liblcms2-2 armhf 2.14-2+b1 [126 kB] Get: 97 http://deb.debian.org/debian trixie/main armhf libopenjp2-7 armhf 2.5.0-2+b2 [170 kB] Get: 98 http://deb.debian.org/debian trixie/main armhf libpaper1 armhf 1.1.29 [11.9 kB] Get: 99 http://deb.debian.org/debian trixie/main armhf libdeflate0 armhf 1.20-1 [35.9 kB] Get: 100 http://deb.debian.org/debian trixie/main armhf libjbig0 armhf 2.1-6.1+b1 [27.3 kB] Get: 101 http://deb.debian.org/debian trixie/main armhf liblerc4 armhf 4.0.0+ds-4+b1 [137 kB] Get: 102 http://deb.debian.org/debian trixie/main armhf libsharpyuv0 armhf 1.3.2-0.4 [105 kB] Get: 103 http://deb.debian.org/debian trixie/main armhf libwebp7 armhf 1.3.2-0.4 [261 kB] Get: 104 http://deb.debian.org/debian trixie/main armhf libtiff6 armhf 4.5.1+git230720-4 [301 kB] Get: 105 http://deb.debian.org/debian trixie/main armhf libxau6 armhf 1:1.0.9-1 [19.0 kB] Get: 106 http://deb.debian.org/debian trixie/main armhf libxdmcp6 armhf 1:1.1.2-3 [24.9 kB] Get: 107 http://deb.debian.org/debian trixie/main armhf libxcb1 armhf 1.15-1 [140 kB] Get: 108 http://deb.debian.org/debian trixie/main armhf libx11-data all 2:1.8.7-1 [328 kB] Get: 109 http://deb.debian.org/debian trixie/main armhf libx11-6 armhf 2:1.8.7-1 [735 kB] Get: 110 http://deb.debian.org/debian trixie/main armhf libice6 armhf 2:1.0.10-1 [51.9 kB] Get: 111 http://deb.debian.org/debian trixie/main armhf libsm6 armhf 2:1.2.3-1 [33.0 kB] Get: 112 http://deb.debian.org/debian trixie/main armhf libxt6 armhf 1:1.2.1-1.1 [157 kB] Get: 113 http://deb.debian.org/debian trixie/main armhf libgs10 armhf 10.02.1~dfsg-3 [2134 kB] Get: 114 http://deb.debian.org/debian trixie/main armhf ghostscript armhf 10.02.1~dfsg-3 [49.6 kB] Get: 115 http://deb.debian.org/debian trixie/main armhf libcdt5 armhf 2.42.2-8 [37.0 kB] Get: 116 http://deb.debian.org/debian trixie/main armhf libcgraph6 armhf 2.42.2-8 [56.0 kB] Get: 117 http://deb.debian.org/debian trixie/main armhf libaom3 armhf 3.8.2-2 [1526 kB] Get: 118 http://deb.debian.org/debian trixie/main armhf libdav1d7 armhf 1.4.1-1 [262 kB] Get: 119 http://deb.debian.org/debian trixie/main armhf libabsl20220623 armhf 20220623.1-3 [361 kB] Get: 120 http://deb.debian.org/debian trixie/main armhf libgav1-1 armhf 0.18.0-1+b1 [284 kB] Get: 121 http://deb.debian.org/debian trixie/main armhf librav1e0 armhf 0.7.1-2 [546 kB] Get: 122 http://deb.debian.org/debian trixie/main armhf libsvtav1enc1d1 armhf 1.7.0+dfsg-2+b1 [936 kB] Get: 123 http://deb.debian.org/debian trixie/main armhf libyuv0 armhf 0.0~git202401110.af6ac82-1 [85.1 kB] Get: 124 http://deb.debian.org/debian trixie/main armhf libavif16 armhf 1.0.4-1 [95.0 kB] Get: 125 http://deb.debian.org/debian trixie/main armhf libheif-plugin-dav1d armhf 1.17.6-1 [9252 B] Get: 126 http://deb.debian.org/debian trixie/main armhf libde265-0 armhf 1.0.15-1 [145 kB] Get: 127 http://deb.debian.org/debian trixie/main armhf libheif-plugin-libde265 armhf 1.17.6-1 [12.0 kB] Get: 128 http://deb.debian.org/debian trixie/main armhf libheif1 armhf 1.17.6-1 [242 kB] Get: 129 http://deb.debian.org/debian trixie/main armhf libxpm4 armhf 1:3.5.17-1 [49.5 kB] Get: 130 http://deb.debian.org/debian trixie/main armhf libgd3 armhf 2.3.3-9+b1 [103 kB] Get: 131 http://deb.debian.org/debian trixie/main armhf libglib2.0-0 armhf 2.78.4-1 [1281 kB] Get: 132 http://deb.debian.org/debian trixie/main armhf libgts-0.7-5 armhf 0.7.6+darcs121130-5+b1 [137 kB] Get: 133 http://deb.debian.org/debian trixie/main armhf libpixman-1-0 armhf 0.42.2-1+b1 [476 kB] Get: 134 http://deb.debian.org/debian trixie/main armhf libxcb-render0 armhf 1.15-1 [114 kB] Get: 135 http://deb.debian.org/debian trixie/main armhf libxcb-shm0 armhf 1.15-1 [106 kB] Get: 136 http://deb.debian.org/debian trixie/main armhf libxext6 armhf 2:1.3.4-1+b1 [47.8 kB] Get: 137 http://deb.debian.org/debian trixie/main armhf libxrender1 armhf 1:0.9.10-1.1 [30.1 kB] Get: 138 http://deb.debian.org/debian trixie/main armhf libcairo2 armhf 1.18.0-1+b1 [441 kB] Get: 139 http://deb.debian.org/debian trixie/main armhf libltdl7 armhf 2.4.7-7 [390 kB] Get: 140 http://deb.debian.org/debian trixie/main armhf libfribidi0 armhf 1.0.13-3+b1 [69.4 kB] Get: 141 http://deb.debian.org/debian trixie/main armhf libgraphite2-3 armhf 1.3.14-2 [63.2 kB] Get: 142 http://deb.debian.org/debian trixie/main armhf libharfbuzz0b armhf 8.3.0-2 [2155 kB] Get: 143 http://deb.debian.org/debian trixie/main armhf libthai-data all 0.1.29-2 [168 kB] Get: 144 http://deb.debian.org/debian trixie/main armhf libdatrie1 armhf 0.2.13-3 [34.4 kB] Get: 145 http://deb.debian.org/debian trixie/main armhf libthai0 armhf 0.1.29-2 [45.8 kB] Get: 146 http://deb.debian.org/debian trixie/main armhf libpango-1.0-0 armhf 1.52.0+ds-1 [192 kB] Get: 147 http://deb.debian.org/debian trixie/main armhf libpangoft2-1.0-0 armhf 1.52.0+ds-1 [41.8 kB] Get: 148 http://deb.debian.org/debian trixie/main armhf libpangocairo-1.0-0 armhf 1.52.0+ds-1 [31.2 kB] Get: 149 http://deb.debian.org/debian trixie/main armhf libpathplan4 armhf 2.42.2-8 [39.3 kB] Get: 150 http://deb.debian.org/debian trixie/main armhf libgvc6 armhf 2.42.2-8 [578 kB] Get: 151 http://deb.debian.org/debian trixie/main armhf libgvpr2 armhf 2.42.2-8 [164 kB] Get: 152 http://deb.debian.org/debian trixie/main armhf liblab-gamut1 armhf 2.42.2-8 [198 kB] Get: 153 http://deb.debian.org/debian trixie/main armhf libxmu6 armhf 2:1.1.3-3 [52.6 kB] Get: 154 http://deb.debian.org/debian trixie/main armhf libxaw7 armhf 2:1.0.14-1 [167 kB] Get: 155 http://deb.debian.org/debian trixie/main armhf graphviz armhf 2.42.2-8 [497 kB] Get: 156 http://deb.debian.org/debian trixie/main armhf libsuitesparseconfig7 armhf 1:7.6.1+dfsg-1 [21.6 kB] Get: 157 http://deb.debian.org/debian trixie/main armhf libamd3 armhf 1:7.6.1+dfsg-1 [39.1 kB] Get: 158 http://deb.debian.org/debian trixie/main armhf libblas3 armhf 3.12.0-3 [108 kB] Get: 159 http://deb.debian.org/debian trixie/main armhf libblas-dev armhf 3.12.0-3 [119 kB] Get: 160 http://deb.debian.org/debian trixie/main armhf libbtf2 armhf 1:7.6.1+dfsg-1 [24.0 kB] Get: 161 http://deb.debian.org/debian trixie/main armhf libcamd3 armhf 1:7.6.1+dfsg-1 [37.3 kB] Get: 162 http://deb.debian.org/debian trixie/main armhf libccolamd3 armhf 1:7.6.1+dfsg-1 [39.4 kB] Get: 163 http://deb.debian.org/debian trixie/main armhf libcolamd3 armhf 1:7.6.1+dfsg-1 [31.8 kB] Get: 164 http://deb.debian.org/debian trixie/main armhf libgfortran5 armhf 14-20240201-3 [263 kB] Get: 165 http://deb.debian.org/debian trixie/main armhf liblapack3 armhf 3.12.0-3 [1803 kB] Get: 166 http://deb.debian.org/debian trixie/main armhf libcholmod5 armhf 1:7.6.1+dfsg-1 [607 kB] Get: 167 http://deb.debian.org/debian trixie/main armhf libcxsparse4 armhf 1:7.6.1+dfsg-1 [78.8 kB] Get: 168 http://deb.debian.org/debian trixie/main armhf libglpk40 armhf 5.0-1+b1 [330 kB] Get: 169 http://deb.debian.org/debian trixie/main armhf libgmpxx4ldbl armhf 2:6.3.0+dfsg-2+b1 [328 kB] Get: 170 http://deb.debian.org/debian trixie/main armhf libgmp-dev armhf 2:6.3.0+dfsg-2+b1 [591 kB] Get: 171 http://deb.debian.org/debian trixie/main armhf zlib1g-dev armhf 1:1.3.dfsg-3+b1 [904 kB] Get: 172 http://deb.debian.org/debian trixie/main armhf libklu2 armhf 1:7.6.1+dfsg-1 [81.8 kB] Get: 173 http://deb.debian.org/debian trixie/main armhf libldl3 armhf 1:7.6.1+dfsg-1 [22.6 kB] Get: 174 http://deb.debian.org/debian trixie/main armhf libsuitesparse-mongoose3 armhf 1:7.6.1+dfsg-1 [45.9 kB] Get: 175 http://deb.debian.org/debian trixie/main armhf libumfpack6 armhf 1:7.6.1+dfsg-1 [267 kB] Get: 176 http://deb.debian.org/debian trixie/main armhf librbio4 armhf 1:7.6.1+dfsg-1 [38.9 kB] Get: 177 http://deb.debian.org/debian trixie/main armhf libspqr4 armhf 1:7.6.1+dfsg-1 [128 kB] Get: 178 http://deb.debian.org/debian trixie/main armhf libspex2 armhf 1:7.6.1+dfsg-1 [46.1 kB] Get: 179 http://deb.debian.org/debian trixie/main armhf libparu0 armhf 1:7.6.1+dfsg-1 [61.8 kB] Get: 180 http://deb.debian.org/debian trixie/main armhf liblapack-dev armhf 3.12.0-3 [1903 kB] Get: 181 http://deb.debian.org/debian trixie/main armhf libsuitesparse-dev armhf 1:7.6.1+dfsg-1 [1424 kB] Get: 182 http://deb.debian.org/debian trixie/main armhf libglpk-dev armhf 5.0-1+b1 [404 kB] Get: 183 http://deb.debian.org/debian trixie/main armhf libjs-mathjax all 2.7.9+dfsg-1 [5667 kB] Fetched 134 MB in 14s (9491 kB/s) debconf: delaying package configuration, since apt-utils is not installed Selecting previously unselected package poppler-data. (Reading database ... (Reading database ... 5% (Reading database ... 10% (Reading database ... 15% (Reading database ... 20% (Reading database ... 25% (Reading database ... 30% (Reading database ... 35% (Reading database ... 40% (Reading database ... 45% (Reading database ... 50% (Reading database ... 55% (Reading database ... 60% (Reading database ... 65% (Reading database ... 70% (Reading database ... 75% (Reading database ... 80% (Reading database ... 85% (Reading database ... 90% (Reading database ... 95% (Reading database ... 100% (Reading database ... 19635 files and directories currently installed.) Preparing to unpack .../poppler-data_0.4.12-1_all.deb ... Unpacking poppler-data (0.4.12-1) ... Selecting previously unselected package libpython3.11-minimal:armhf. Preparing to unpack .../libpython3.11-minimal_3.11.8-1_armhf.deb ... Unpacking libpython3.11-minimal:armhf (3.11.8-1) ... Selecting previously unselected package libexpat1:armhf. Preparing to unpack .../libexpat1_2.5.0-2+b2_armhf.deb ... Unpacking libexpat1:armhf (2.5.0-2+b2) ... Selecting previously unselected package python3.11-minimal. Preparing to unpack .../python3.11-minimal_3.11.8-1_armhf.deb ... Unpacking python3.11-minimal (3.11.8-1) ... Setting up libpython3.11-minimal:armhf (3.11.8-1) ... Setting up libexpat1:armhf (2.5.0-2+b2) ... Setting up python3.11-minimal (3.11.8-1) ... Selecting previously unselected package python3-minimal. (Reading database ... (Reading database ... 5% (Reading database ... 10% (Reading database ... 15% (Reading database ... 20% (Reading database ... 25% (Reading database ... 30% (Reading database ... 35% (Reading database ... 40% (Reading database ... 45% (Reading database ... 50% (Reading database ... 55% (Reading database ... 60% (Reading database ... 65% (Reading database ... 70% (Reading database ... 75% (Reading database ... 80% (Reading database ... 85% (Reading database ... 90% (Reading database ... 95% (Reading database ... 100% (Reading database ... 20486 files and directories currently installed.) Preparing to unpack .../0-python3-minimal_3.11.6-1_armhf.deb ... Unpacking python3-minimal (3.11.6-1) ... Selecting previously unselected package media-types. Preparing to unpack .../1-media-types_10.1.0_all.deb ... Unpacking media-types (10.1.0) ... Selecting previously unselected package netbase. Preparing to unpack .../2-netbase_6.4_all.deb ... Unpacking netbase (6.4) ... Selecting previously unselected package tzdata. Preparing to unpack .../3-tzdata_2024a-1_all.deb ... Unpacking tzdata (2024a-1) ... Selecting previously unselected package readline-common. Preparing to unpack .../4-readline-common_8.2-3_all.deb ... Unpacking readline-common (8.2-3) ... Selecting previously unselected package libreadline8:armhf. Preparing to unpack .../5-libreadline8_8.2-3+b1_armhf.deb ... Unpacking libreadline8:armhf (8.2-3+b1) ... Selecting previously unselected package libpython3.11-stdlib:armhf. Preparing to unpack .../6-libpython3.11-stdlib_3.11.8-1_armhf.deb ... Unpacking libpython3.11-stdlib:armhf (3.11.8-1) ... Selecting previously unselected package python3.11. Preparing to unpack .../7-python3.11_3.11.8-1_armhf.deb ... Unpacking python3.11 (3.11.8-1) ... Selecting previously unselected package libpython3-stdlib:armhf. Preparing to unpack .../8-libpython3-stdlib_3.11.6-1_armhf.deb ... Unpacking libpython3-stdlib:armhf (3.11.6-1) ... Setting up python3-minimal (3.11.6-1) ... Selecting previously unselected package python3. (Reading database ... (Reading database ... 5% (Reading database ... 10% (Reading database ... 15% (Reading database ... 20% (Reading database ... 25% (Reading database ... 30% (Reading database ... 35% (Reading database ... 40% (Reading database ... 45% (Reading database ... 50% (Reading database ... 55% (Reading database ... 60% (Reading database ... 65% (Reading database ... 70% (Reading database ... 75% (Reading database ... 80% (Reading database ... 85% (Reading database ... 90% (Reading database ... 95% (Reading database ... 100% (Reading database ... 21474 files and directories currently installed.) Preparing to unpack .../000-python3_3.11.6-1_armhf.deb ... Unpacking python3 (3.11.6-1) ... Selecting previously unselected package libproc2-0:armhf. Preparing to unpack .../001-libproc2-0_2%3a4.0.4-4_armhf.deb ... Unpacking libproc2-0:armhf (2:4.0.4-4) ... Selecting previously unselected package procps. Preparing to unpack .../002-procps_2%3a4.0.4-4_armhf.deb ... Unpacking procps (2:4.0.4-4) ... Selecting previously unselected package sensible-utils. Preparing to unpack .../003-sensible-utils_0.0.22_all.deb ... Unpacking sensible-utils (0.0.22) ... Selecting previously unselected package libmagic-mgc. Preparing to unpack .../004-libmagic-mgc_1%3a5.45-2+b1_armhf.deb ... Unpacking libmagic-mgc (1:5.45-2+b1) ... Selecting previously unselected package libmagic1:armhf. Preparing to unpack .../005-libmagic1_1%3a5.45-2+b1_armhf.deb ... Unpacking libmagic1:armhf (1:5.45-2+b1) ... Selecting previously unselected package file. Preparing to unpack .../006-file_1%3a5.45-2+b1_armhf.deb ... Unpacking file (1:5.45-2+b1) ... Selecting previously unselected package gettext-base. Preparing to unpack .../007-gettext-base_0.21-14+b1_armhf.deb ... Unpacking gettext-base (0.21-14+b1) ... Selecting previously unselected package libuchardet0:armhf. Preparing to unpack .../008-libuchardet0_0.0.8-1+b1_armhf.deb ... Unpacking libuchardet0:armhf (0.0.8-1+b1) ... Selecting previously unselected package groff-base. Preparing to unpack .../009-groff-base_1.23.0-3_armhf.deb ... Unpacking groff-base (1.23.0-3) ... Selecting previously unselected package bsdextrautils. Preparing to unpack .../010-bsdextrautils_2.39.3-6_armhf.deb ... Unpacking bsdextrautils (2.39.3-6) ... Selecting previously unselected package libpipeline1:armhf. Preparing to unpack .../011-libpipeline1_1.5.7-2_armhf.deb ... Unpacking libpipeline1:armhf (1.5.7-2) ... Selecting previously unselected package man-db. Preparing to unpack .../012-man-db_2.12.0-3_armhf.deb ... Unpacking man-db (2.12.0-3) ... Selecting previously unselected package ucf. Preparing to unpack .../013-ucf_3.0043+nmu1_all.deb ... Moving old data out of the way Unpacking ucf (3.0043+nmu1) ... Selecting previously unselected package m4. Preparing to unpack .../014-m4_1.4.19-4_armhf.deb ... Unpacking m4 (1.4.19-4) ... Selecting previously unselected package autoconf. Preparing to unpack .../015-autoconf_2.71-3_all.deb ... Unpacking autoconf (2.71-3) ... Selecting previously unselected package autotools-dev. Preparing to unpack .../016-autotools-dev_20220109.1_all.deb ... Unpacking autotools-dev (20220109.1) ... Selecting previously unselected package automake. Preparing to unpack .../017-automake_1%3a1.16.5-1.3_all.deb ... Unpacking automake (1:1.16.5-1.3) ... Selecting previously unselected package autopoint. Preparing to unpack .../018-autopoint_0.21-14_all.deb ... Unpacking autopoint (0.21-14) ... Selecting previously unselected package libicu72:armhf. Preparing to unpack .../019-libicu72_72.1-4+b1_armhf.deb ... Unpacking libicu72:armhf (72.1-4+b1) ... Selecting previously unselected package libxml2:armhf. Preparing to unpack .../020-libxml2_2.9.14+dfsg-1.3+b2_armhf.deb ... Unpacking libxml2:armhf (2.9.14+dfsg-1.3+b2) ... Selecting previously unselected package libarchive13:armhf. Preparing to unpack .../021-libarchive13_3.7.2-1_armhf.deb ... Unpacking libarchive13:armhf (3.7.2-1) ... Selecting previously unselected package libbrotli1:armhf. Preparing to unpack .../022-libbrotli1_1.1.0-2+b3_armhf.deb ... Unpacking libbrotli1:armhf (1.1.0-2+b3) ... Selecting previously unselected package libsasl2-modules-db:armhf. Preparing to unpack .../023-libsasl2-modules-db_2.1.28+dfsg1-4+b1_armhf.deb ... Unpacking libsasl2-modules-db:armhf (2.1.28+dfsg1-4+b1) ... Selecting previously unselected package libsasl2-2:armhf. Preparing to unpack .../024-libsasl2-2_2.1.28+dfsg1-4+b1_armhf.deb ... Unpacking libsasl2-2:armhf (2.1.28+dfsg1-4+b1) ... Selecting previously unselected package libldap-2.5-0:armhf. Preparing to unpack .../025-libldap-2.5-0_2.5.13+dfsg-5+b3_armhf.deb ... Unpacking libldap-2.5-0:armhf (2.5.13+dfsg-5+b3) ... Selecting previously unselected package libnghttp2-14:armhf. Preparing to unpack .../026-libnghttp2-14_1.59.0-1_armhf.deb ... Unpacking libnghttp2-14:armhf (1.59.0-1) ... Selecting previously unselected package libpsl5:armhf. Preparing to unpack .../027-libpsl5_0.21.2-1+b1_armhf.deb ... Unpacking libpsl5:armhf (0.21.2-1+b1) ... Selecting previously unselected package librtmp1:armhf. Preparing to unpack .../028-librtmp1_2.4+20151223.gitfa8646d.1-2+b2_armhf.deb ... Unpacking librtmp1:armhf (2.4+20151223.gitfa8646d.1-2+b2) ... Selecting previously unselected package libssh2-1:armhf. Preparing to unpack .../029-libssh2-1_1.11.0-4_armhf.deb ... Unpacking libssh2-1:armhf (1.11.0-4) ... Selecting previously unselected package libcurl4:armhf. Preparing to unpack .../030-libcurl4_8.5.0-2_armhf.deb ... Unpacking libcurl4:armhf (8.5.0-2) ... Selecting previously unselected package libjsoncpp25:armhf. Preparing to unpack .../031-libjsoncpp25_1.9.5-6+b2_armhf.deb ... Unpacking libjsoncpp25:armhf (1.9.5-6+b2) ... Selecting previously unselected package librhash0:armhf. Preparing to unpack .../032-librhash0_1.4.3-3+b1_armhf.deb ... Unpacking librhash0:armhf (1.4.3-3+b1) ... Selecting previously unselected package libuv1:armhf. Preparing to unpack .../033-libuv1_1.48.0-1_armhf.deb ... Unpacking libuv1:armhf (1.48.0-1) ... Selecting previously unselected package cmake-data. Preparing to unpack .../034-cmake-data_3.28.3-1_all.deb ... Unpacking cmake-data (3.28.3-1) ... Selecting previously unselected package cmake. Preparing to unpack .../035-cmake_3.28.3-1_armhf.deb ... Unpacking cmake (3.28.3-1) ... Selecting previously unselected package d-shlibs. Preparing to unpack .../036-d-shlibs_0.106_all.deb ... Unpacking d-shlibs (0.106) ... Selecting previously unselected package libdebhelper-perl. Preparing to unpack .../037-libdebhelper-perl_13.15.3_all.deb ... Unpacking libdebhelper-perl (13.15.3) ... Selecting previously unselected package libtool. Preparing to unpack .../038-libtool_2.4.7-7_all.deb ... Unpacking libtool (2.4.7-7) ... Selecting previously unselected package dh-autoreconf. Preparing to unpack .../039-dh-autoreconf_20_all.deb ... Unpacking dh-autoreconf (20) ... Selecting previously unselected package libarchive-zip-perl. Preparing to unpack .../040-libarchive-zip-perl_1.68-1_all.deb ... Unpacking libarchive-zip-perl (1.68-1) ... Selecting previously unselected package libsub-override-perl. Preparing to unpack .../041-libsub-override-perl_0.10-1_all.deb ... Unpacking libsub-override-perl (0.10-1) ... Selecting previously unselected package libfile-stripnondeterminism-perl. Preparing to unpack .../042-libfile-stripnondeterminism-perl_1.13.1-1_all.deb ... Unpacking libfile-stripnondeterminism-perl (1.13.1-1) ... Selecting previously unselected package dh-strip-nondeterminism. Preparing to unpack .../043-dh-strip-nondeterminism_1.13.1-1_all.deb ... Unpacking dh-strip-nondeterminism (1.13.1-1) ... Selecting previously unselected package libelf1:armhf. Preparing to unpack .../044-libelf1_0.190-1+b1_armhf.deb ... Unpacking libelf1:armhf (0.190-1+b1) ... Selecting previously unselected package dwz. Preparing to unpack .../045-dwz_0.15-1_armhf.deb ... Unpacking dwz (0.15-1) ... Selecting previously unselected package gettext. Preparing to unpack .../046-gettext_0.21-14+b1_armhf.deb ... Unpacking gettext (0.21-14+b1) ... Selecting previously unselected package intltool-debian. Preparing to unpack .../047-intltool-debian_0.35.0+20060710.6_all.deb ... Unpacking intltool-debian (0.35.0+20060710.6) ... Selecting previously unselected package po-debconf. Preparing to unpack .../048-po-debconf_1.0.21+nmu1_all.deb ... Unpacking po-debconf (1.0.21+nmu1) ... Selecting previously unselected package debhelper. Preparing to unpack .../049-debhelper_13.15.3_all.deb ... Unpacking debhelper (13.15.3) ... Selecting previously unselected package libbsd0:armhf. Preparing to unpack .../050-libbsd0_0.12.2-1_armhf.deb ... Unpacking libbsd0:armhf (0.12.2-1) ... Selecting previously unselected package libedit2:armhf. Preparing to unpack .../051-libedit2_3.1-20230828-1_armhf.deb ... Unpacking libedit2:armhf (3.1-20230828-1) ... Selecting previously unselected package libz3-4:armhf. Preparing to unpack .../052-libz3-4_4.8.12-3.1+b2_armhf.deb ... Unpacking libz3-4:armhf (4.8.12-3.1+b2) ... Selecting previously unselected package libllvm16:armhf. Preparing to unpack .../053-libllvm16_1%3a16.0.6-20_armhf.deb ... Unpacking libllvm16:armhf (1:16.0.6-20) ... Selecting previously unselected package libclang-cpp16. Preparing to unpack .../054-libclang-cpp16_1%3a16.0.6-20_armhf.deb ... Unpacking libclang-cpp16 (1:16.0.6-20) ... Selecting previously unselected package libclang1-16. Preparing to unpack .../055-libclang1-16_1%3a16.0.6-20_armhf.deb ... Unpacking libclang1-16 (1:16.0.6-20) ... Selecting previously unselected package libfmt9:armhf. Preparing to unpack .../056-libfmt9_9.1.0+ds1-2_armhf.deb ... Unpacking libfmt9:armhf (9.1.0+ds1-2) ... Selecting previously unselected package doxygen. Preparing to unpack .../057-doxygen_1.9.8+ds-2_armhf.deb ... Unpacking doxygen (1.9.8+ds-2) ... Selecting previously unselected package libpng16-16:armhf. Preparing to unpack .../058-libpng16-16_1.6.43-1_armhf.deb ... Unpacking libpng16-16:armhf (1.6.43-1) ... Selecting previously unselected package libfreetype6:armhf. Preparing to unpack .../059-libfreetype6_2.13.2+dfsg-1+b1_armhf.deb ... Unpacking libfreetype6:armhf (2.13.2+dfsg-1+b1) ... Selecting previously unselected package fonts-dejavu-mono. Preparing to unpack .../060-fonts-dejavu-mono_2.37-8_all.deb ... Unpacking fonts-dejavu-mono (2.37-8) ... Selecting previously unselected package fonts-dejavu-core. Preparing to unpack .../061-fonts-dejavu-core_2.37-8_all.deb ... Unpacking fonts-dejavu-core (2.37-8) ... Selecting previously unselected package libfontenc1:armhf. Preparing to unpack .../062-libfontenc1_1%3a1.1.8-1_armhf.deb ... Unpacking libfontenc1:armhf (1:1.1.8-1) ... Selecting previously unselected package x11-common. Preparing to unpack .../063-x11-common_1%3a7.7+23_all.deb ... Unpacking x11-common (1:7.7+23) ... Selecting previously unselected package xfonts-encodings. Preparing to unpack .../064-xfonts-encodings_1%3a1.0.4-2.2_all.deb ... Unpacking xfonts-encodings (1:1.0.4-2.2) ... Selecting previously unselected package xfonts-utils. Preparing to unpack .../065-xfonts-utils_1%3a7.7+6_armhf.deb ... Unpacking xfonts-utils (1:7.7+6) ... Selecting previously unselected package fonts-urw-base35. Preparing to unpack .../066-fonts-urw-base35_20200910-8_all.deb ... Unpacking fonts-urw-base35 (20200910-8) ... Selecting previously unselected package fontconfig-config. Preparing to unpack .../067-fontconfig-config_2.15.0-1.1_armhf.deb ... Unpacking fontconfig-config (2.15.0-1.1) ... Selecting previously unselected package libfontconfig1:armhf. Preparing to unpack .../068-libfontconfig1_2.15.0-1.1_armhf.deb ... Unpacking libfontconfig1:armhf (2.15.0-1.1) ... Selecting previously unselected package fontconfig. Preparing to unpack .../069-fontconfig_2.15.0-1.1_armhf.deb ... Unpacking fontconfig (2.15.0-1.1) ... Selecting previously unselected package fonts-mathjax. Preparing to unpack .../070-fonts-mathjax_2.7.9+dfsg-1_all.deb ... Unpacking fonts-mathjax (2.7.9+dfsg-1) ... Selecting previously unselected package libgs-common. Preparing to unpack .../071-libgs-common_10.02.1~dfsg-3_all.deb ... Unpacking libgs-common (10.02.1~dfsg-3) ... Selecting previously unselected package libgs10-common. Preparing to unpack .../072-libgs10-common_10.02.1~dfsg-3_all.deb ... Unpacking libgs10-common (10.02.1~dfsg-3) ... Selecting previously unselected package libavahi-common-data:armhf. Preparing to unpack .../073-libavahi-common-data_0.8-13+b1_armhf.deb ... Unpacking libavahi-common-data:armhf (0.8-13+b1) ... Selecting previously unselected package libavahi-common3:armhf. Preparing to unpack .../074-libavahi-common3_0.8-13+b1_armhf.deb ... Unpacking libavahi-common3:armhf (0.8-13+b1) ... Selecting previously unselected package libdbus-1-3:armhf. Preparing to unpack .../075-libdbus-1-3_1.14.10-4_armhf.deb ... Unpacking libdbus-1-3:armhf (1.14.10-4) ... Selecting previously unselected package libavahi-client3:armhf. Preparing to unpack .../076-libavahi-client3_0.8-13+b1_armhf.deb ... Unpacking libavahi-client3:armhf (0.8-13+b1) ... Selecting previously unselected package libcups2:armhf. Preparing to unpack .../077-libcups2_2.4.7-1+b1_armhf.deb ... Unpacking libcups2:armhf (2.4.7-1+b1) ... Selecting previously unselected package libidn12:armhf. Preparing to unpack .../078-libidn12_1.42-2_armhf.deb ... Unpacking libidn12:armhf (1.42-2) ... Selecting previously unselected package libijs-0.35:armhf. Preparing to unpack .../079-libijs-0.35_0.35-15.1+b1_armhf.deb ... Unpacking libijs-0.35:armhf (0.35-15.1+b1) ... Selecting previously unselected package libjbig2dec0:armhf. Preparing to unpack .../080-libjbig2dec0_0.20-1+b1_armhf.deb ... Unpacking libjbig2dec0:armhf (0.20-1+b1) ... Selecting previously unselected package libjpeg62-turbo:armhf. Preparing to unpack .../081-libjpeg62-turbo_1%3a2.1.5-2+b2_armhf.deb ... Unpacking libjpeg62-turbo:armhf (1:2.1.5-2+b2) ... Selecting previously unselected package liblcms2-2:armhf. Preparing to unpack .../082-liblcms2-2_2.14-2+b1_armhf.deb ... Unpacking liblcms2-2:armhf (2.14-2+b1) ... Selecting previously unselected package libopenjp2-7:armhf. Preparing to unpack .../083-libopenjp2-7_2.5.0-2+b2_armhf.deb ... Unpacking libopenjp2-7:armhf (2.5.0-2+b2) ... Selecting previously unselected package libpaper1:armhf. Preparing to unpack .../084-libpaper1_1.1.29_armhf.deb ... Unpacking libpaper1:armhf (1.1.29) ... Selecting previously unselected package libdeflate0:armhf. Preparing to unpack .../085-libdeflate0_1.20-1_armhf.deb ... Unpacking libdeflate0:armhf (1.20-1) ... Selecting previously unselected package libjbig0:armhf. Preparing to unpack .../086-libjbig0_2.1-6.1+b1_armhf.deb ... Unpacking libjbig0:armhf (2.1-6.1+b1) ... Selecting previously unselected package liblerc4:armhf. Preparing to unpack .../087-liblerc4_4.0.0+ds-4+b1_armhf.deb ... Unpacking liblerc4:armhf (4.0.0+ds-4+b1) ... Selecting previously unselected package libsharpyuv0:armhf. Preparing to unpack .../088-libsharpyuv0_1.3.2-0.4_armhf.deb ... Unpacking libsharpyuv0:armhf (1.3.2-0.4) ... Selecting previously unselected package libwebp7:armhf. Preparing to unpack .../089-libwebp7_1.3.2-0.4_armhf.deb ... Unpacking libwebp7:armhf (1.3.2-0.4) ... Selecting previously unselected package libtiff6:armhf. Preparing to unpack .../090-libtiff6_4.5.1+git230720-4_armhf.deb ... Unpacking libtiff6:armhf (4.5.1+git230720-4) ... Selecting previously unselected package libxau6:armhf. Preparing to unpack .../091-libxau6_1%3a1.0.9-1_armhf.deb ... Unpacking libxau6:armhf (1:1.0.9-1) ... Selecting previously unselected package libxdmcp6:armhf. Preparing to unpack .../092-libxdmcp6_1%3a1.1.2-3_armhf.deb ... Unpacking libxdmcp6:armhf (1:1.1.2-3) ... Selecting previously unselected package libxcb1:armhf. Preparing to unpack .../093-libxcb1_1.15-1_armhf.deb ... Unpacking libxcb1:armhf (1.15-1) ... Selecting previously unselected package libx11-data. Preparing to unpack .../094-libx11-data_2%3a1.8.7-1_all.deb ... Unpacking libx11-data (2:1.8.7-1) ... Selecting previously unselected package libx11-6:armhf. Preparing to unpack .../095-libx11-6_2%3a1.8.7-1_armhf.deb ... Unpacking libx11-6:armhf (2:1.8.7-1) ... Selecting previously unselected package libice6:armhf. Preparing to unpack .../096-libice6_2%3a1.0.10-1_armhf.deb ... Unpacking libice6:armhf (2:1.0.10-1) ... Selecting previously unselected package libsm6:armhf. Preparing to unpack .../097-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 .../098-libxt6_1%3a1.2.1-1.1_armhf.deb ... Unpacking libxt6:armhf (1:1.2.1-1.1) ... Selecting previously unselected package libgs10:armhf. Preparing to unpack .../099-libgs10_10.02.1~dfsg-3_armhf.deb ... Unpacking libgs10:armhf (10.02.1~dfsg-3) ... Selecting previously unselected package ghostscript. Preparing to unpack .../100-ghostscript_10.02.1~dfsg-3_armhf.deb ... Unpacking ghostscript (10.02.1~dfsg-3) ... Selecting previously unselected package libcdt5:armhf. Preparing to unpack .../101-libcdt5_2.42.2-8_armhf.deb ... Unpacking libcdt5:armhf (2.42.2-8) ... Selecting previously unselected package libcgraph6:armhf. Preparing to unpack .../102-libcgraph6_2.42.2-8_armhf.deb ... Unpacking libcgraph6:armhf (2.42.2-8) ... Selecting previously unselected package libaom3:armhf. Preparing to unpack .../103-libaom3_3.8.2-2_armhf.deb ... Unpacking libaom3:armhf (3.8.2-2) ... Selecting previously unselected package libdav1d7:armhf. Preparing to unpack .../104-libdav1d7_1.4.1-1_armhf.deb ... Unpacking libdav1d7:armhf (1.4.1-1) ... Selecting previously unselected package libabsl20220623:armhf. Preparing to unpack .../105-libabsl20220623_20220623.1-3_armhf.deb ... Unpacking libabsl20220623:armhf (20220623.1-3) ... Selecting previously unselected package libgav1-1:armhf. Preparing to unpack .../106-libgav1-1_0.18.0-1+b1_armhf.deb ... Unpacking libgav1-1:armhf (0.18.0-1+b1) ... Selecting previously unselected package librav1e0:armhf. Preparing to unpack .../107-librav1e0_0.7.1-2_armhf.deb ... Unpacking librav1e0:armhf (0.7.1-2) ... Selecting previously unselected package libsvtav1enc1d1:armhf. Preparing to unpack .../108-libsvtav1enc1d1_1.7.0+dfsg-2+b1_armhf.deb ... Unpacking libsvtav1enc1d1:armhf (1.7.0+dfsg-2+b1) ... Selecting previously unselected package libyuv0:armhf. Preparing to unpack .../109-libyuv0_0.0~git202401110.af6ac82-1_armhf.deb ... Unpacking libyuv0:armhf (0.0~git202401110.af6ac82-1) ... Selecting previously unselected package libavif16:armhf. Preparing to unpack .../110-libavif16_1.0.4-1_armhf.deb ... Unpacking libavif16:armhf (1.0.4-1) ... Selecting previously unselected package libheif-plugin-dav1d:armhf. Preparing to unpack .../111-libheif-plugin-dav1d_1.17.6-1_armhf.deb ... Unpacking libheif-plugin-dav1d:armhf (1.17.6-1) ... Selecting previously unselected package libde265-0:armhf. Preparing to unpack .../112-libde265-0_1.0.15-1_armhf.deb ... Unpacking libde265-0:armhf (1.0.15-1) ... Selecting previously unselected package libheif-plugin-libde265:armhf. Preparing to unpack .../113-libheif-plugin-libde265_1.17.6-1_armhf.deb ... Unpacking libheif-plugin-libde265:armhf (1.17.6-1) ... Selecting previously unselected package libheif1:armhf. Preparing to unpack .../114-libheif1_1.17.6-1_armhf.deb ... Unpacking libheif1:armhf (1.17.6-1) ... Selecting previously unselected package libxpm4:armhf. Preparing to unpack .../115-libxpm4_1%3a3.5.17-1_armhf.deb ... Unpacking libxpm4:armhf (1:3.5.17-1) ... Selecting previously unselected package libgd3:armhf. Preparing to unpack .../116-libgd3_2.3.3-9+b1_armhf.deb ... Unpacking libgd3:armhf (2.3.3-9+b1) ... Selecting previously unselected package libglib2.0-0:armhf. Preparing to unpack .../117-libglib2.0-0_2.78.4-1_armhf.deb ... Unpacking libglib2.0-0:armhf (2.78.4-1) ... Selecting previously unselected package libgts-0.7-5:armhf. Preparing to unpack .../118-libgts-0.7-5_0.7.6+darcs121130-5+b1_armhf.deb ... Unpacking libgts-0.7-5:armhf (0.7.6+darcs121130-5+b1) ... Selecting previously unselected package libpixman-1-0:armhf. Preparing to unpack .../119-libpixman-1-0_0.42.2-1+b1_armhf.deb ... Unpacking libpixman-1-0:armhf (0.42.2-1+b1) ... Selecting previously unselected package libxcb-render0:armhf. Preparing to unpack .../120-libxcb-render0_1.15-1_armhf.deb ... Unpacking libxcb-render0:armhf (1.15-1) ... Selecting previously unselected package libxcb-shm0:armhf. Preparing to unpack .../121-libxcb-shm0_1.15-1_armhf.deb ... Unpacking libxcb-shm0:armhf (1.15-1) ... Selecting previously unselected package libxext6:armhf. Preparing to unpack .../122-libxext6_2%3a1.3.4-1+b1_armhf.deb ... Unpacking libxext6:armhf (2:1.3.4-1+b1) ... Selecting previously unselected package libxrender1:armhf. Preparing to unpack .../123-libxrender1_1%3a0.9.10-1.1_armhf.deb ... Unpacking libxrender1:armhf (1:0.9.10-1.1) ... Selecting previously unselected package libcairo2:armhf. Preparing to unpack .../124-libcairo2_1.18.0-1+b1_armhf.deb ... Unpacking libcairo2:armhf (1.18.0-1+b1) ... Selecting previously unselected package libltdl7:armhf. Preparing to unpack .../125-libltdl7_2.4.7-7_armhf.deb ... Unpacking libltdl7:armhf (2.4.7-7) ... Selecting previously unselected package libfribidi0:armhf. Preparing to unpack .../126-libfribidi0_1.0.13-3+b1_armhf.deb ... Unpacking libfribidi0:armhf (1.0.13-3+b1) ... Selecting previously unselected package libgraphite2-3:armhf. Preparing to unpack .../127-libgraphite2-3_1.3.14-2_armhf.deb ... Unpacking libgraphite2-3:armhf (1.3.14-2) ... Selecting previously unselected package libharfbuzz0b:armhf. Preparing to unpack .../128-libharfbuzz0b_8.3.0-2_armhf.deb ... Unpacking libharfbuzz0b:armhf (8.3.0-2) ... Selecting previously unselected package libthai-data. Preparing to unpack .../129-libthai-data_0.1.29-2_all.deb ... Unpacking libthai-data (0.1.29-2) ... Selecting previously unselected package libdatrie1:armhf. Preparing to unpack .../130-libdatrie1_0.2.13-3_armhf.deb ... Unpacking libdatrie1:armhf (0.2.13-3) ... Selecting previously unselected package libthai0:armhf. Preparing to unpack .../131-libthai0_0.1.29-2_armhf.deb ... Unpacking libthai0:armhf (0.1.29-2) ... Selecting previously unselected package libpango-1.0-0:armhf. Preparing to unpack .../132-libpango-1.0-0_1.52.0+ds-1_armhf.deb ... Unpacking libpango-1.0-0:armhf (1.52.0+ds-1) ... Selecting previously unselected package libpangoft2-1.0-0:armhf. Preparing to unpack .../133-libpangoft2-1.0-0_1.52.0+ds-1_armhf.deb ... Unpacking libpangoft2-1.0-0:armhf (1.52.0+ds-1) ... Selecting previously unselected package libpangocairo-1.0-0:armhf. Preparing to unpack .../134-libpangocairo-1.0-0_1.52.0+ds-1_armhf.deb ... Unpacking libpangocairo-1.0-0:armhf (1.52.0+ds-1) ... Selecting previously unselected package libpathplan4:armhf. Preparing to unpack .../135-libpathplan4_2.42.2-8_armhf.deb ... Unpacking libpathplan4:armhf (2.42.2-8) ... Selecting previously unselected package libgvc6. Preparing to unpack .../136-libgvc6_2.42.2-8_armhf.deb ... Unpacking libgvc6 (2.42.2-8) ... Selecting previously unselected package libgvpr2:armhf. Preparing to unpack .../137-libgvpr2_2.42.2-8_armhf.deb ... Unpacking libgvpr2:armhf (2.42.2-8) ... Selecting previously unselected package liblab-gamut1:armhf. Preparing to unpack .../138-liblab-gamut1_2.42.2-8_armhf.deb ... Unpacking liblab-gamut1:armhf (2.42.2-8) ... Selecting previously unselected package libxmu6:armhf. Preparing to unpack .../139-libxmu6_2%3a1.1.3-3_armhf.deb ... Unpacking libxmu6:armhf (2:1.1.3-3) ... Selecting previously unselected package libxaw7:armhf. Preparing to unpack .../140-libxaw7_2%3a1.0.14-1_armhf.deb ... Unpacking libxaw7:armhf (2:1.0.14-1) ... Selecting previously unselected package graphviz. Preparing to unpack .../141-graphviz_2.42.2-8_armhf.deb ... Unpacking graphviz (2.42.2-8) ... Selecting previously unselected package libsuitesparseconfig7:armhf. Preparing to unpack .../142-libsuitesparseconfig7_1%3a7.6.1+dfsg-1_armhf.deb ... Unpacking libsuitesparseconfig7:armhf (1:7.6.1+dfsg-1) ... Selecting previously unselected package libamd3:armhf. Preparing to unpack .../143-libamd3_1%3a7.6.1+dfsg-1_armhf.deb ... Unpacking libamd3:armhf (1:7.6.1+dfsg-1) ... Selecting previously unselected package libblas3:armhf. Preparing to unpack .../144-libblas3_3.12.0-3_armhf.deb ... Unpacking libblas3:armhf (3.12.0-3) ... Selecting previously unselected package libblas-dev:armhf. Preparing to unpack .../145-libblas-dev_3.12.0-3_armhf.deb ... Unpacking libblas-dev:armhf (3.12.0-3) ... Selecting previously unselected package libbtf2:armhf. Preparing to unpack .../146-libbtf2_1%3a7.6.1+dfsg-1_armhf.deb ... Unpacking libbtf2:armhf (1:7.6.1+dfsg-1) ... Selecting previously unselected package libcamd3:armhf. Preparing to unpack .../147-libcamd3_1%3a7.6.1+dfsg-1_armhf.deb ... Unpacking libcamd3:armhf (1:7.6.1+dfsg-1) ... Selecting previously unselected package libccolamd3:armhf. Preparing to unpack .../148-libccolamd3_1%3a7.6.1+dfsg-1_armhf.deb ... Unpacking libccolamd3:armhf (1:7.6.1+dfsg-1) ... Selecting previously unselected package libcolamd3:armhf. Preparing to unpack .../149-libcolamd3_1%3a7.6.1+dfsg-1_armhf.deb ... Unpacking libcolamd3:armhf (1:7.6.1+dfsg-1) ... Selecting previously unselected package libgfortran5:armhf. Preparing to unpack .../150-libgfortran5_14-20240201-3_armhf.deb ... Unpacking libgfortran5:armhf (14-20240201-3) ... Selecting previously unselected package liblapack3:armhf. Preparing to unpack .../151-liblapack3_3.12.0-3_armhf.deb ... Unpacking liblapack3:armhf (3.12.0-3) ... Selecting previously unselected package libcholmod5:armhf. Preparing to unpack .../152-libcholmod5_1%3a7.6.1+dfsg-1_armhf.deb ... Unpacking libcholmod5:armhf (1:7.6.1+dfsg-1) ... Selecting previously unselected package libcxsparse4:armhf. Preparing to unpack .../153-libcxsparse4_1%3a7.6.1+dfsg-1_armhf.deb ... Unpacking libcxsparse4:armhf (1:7.6.1+dfsg-1) ... Selecting previously unselected package libglpk40:armhf. Preparing to unpack .../154-libglpk40_5.0-1+b1_armhf.deb ... Unpacking libglpk40:armhf (5.0-1+b1) ... Selecting previously unselected package libgmpxx4ldbl:armhf. Preparing to unpack .../155-libgmpxx4ldbl_2%3a6.3.0+dfsg-2+b1_armhf.deb ... Unpacking libgmpxx4ldbl:armhf (2:6.3.0+dfsg-2+b1) ... Selecting previously unselected package libgmp-dev:armhf. Preparing to unpack .../156-libgmp-dev_2%3a6.3.0+dfsg-2+b1_armhf.deb ... Unpacking libgmp-dev:armhf (2:6.3.0+dfsg-2+b1) ... Selecting previously unselected package zlib1g-dev:armhf. Preparing to unpack .../157-zlib1g-dev_1%3a1.3.dfsg-3+b1_armhf.deb ... Unpacking zlib1g-dev:armhf (1:1.3.dfsg-3+b1) ... Selecting previously unselected package libklu2:armhf. Preparing to unpack .../158-libklu2_1%3a7.6.1+dfsg-1_armhf.deb ... Unpacking libklu2:armhf (1:7.6.1+dfsg-1) ... Selecting previously unselected package libldl3:armhf. Preparing to unpack .../159-libldl3_1%3a7.6.1+dfsg-1_armhf.deb ... Unpacking libldl3:armhf (1:7.6.1+dfsg-1) ... Selecting previously unselected package libsuitesparse-mongoose3:armhf. Preparing to unpack .../160-libsuitesparse-mongoose3_1%3a7.6.1+dfsg-1_armhf.deb ... Unpacking libsuitesparse-mongoose3:armhf (1:7.6.1+dfsg-1) ... Selecting previously unselected package libumfpack6:armhf. Preparing to unpack .../161-libumfpack6_1%3a7.6.1+dfsg-1_armhf.deb ... Unpacking libumfpack6:armhf (1:7.6.1+dfsg-1) ... Selecting previously unselected package librbio4:armhf. Preparing to unpack .../162-librbio4_1%3a7.6.1+dfsg-1_armhf.deb ... Unpacking librbio4:armhf (1:7.6.1+dfsg-1) ... Selecting previously unselected package libspqr4:armhf. Preparing to unpack .../163-libspqr4_1%3a7.6.1+dfsg-1_armhf.deb ... Unpacking libspqr4:armhf (1:7.6.1+dfsg-1) ... Selecting previously unselected package libspex2:armhf. Preparing to unpack .../164-libspex2_1%3a7.6.1+dfsg-1_armhf.deb ... Unpacking libspex2:armhf (1:7.6.1+dfsg-1) ... Selecting previously unselected package libparu0:armhf. Preparing to unpack .../165-libparu0_1%3a7.6.1+dfsg-1_armhf.deb ... Unpacking libparu0:armhf (1:7.6.1+dfsg-1) ... Selecting previously unselected package liblapack-dev:armhf. Preparing to unpack .../166-liblapack-dev_3.12.0-3_armhf.deb ... Unpacking liblapack-dev:armhf (3.12.0-3) ... Selecting previously unselected package libsuitesparse-dev:armhf. Preparing to unpack .../167-libsuitesparse-dev_1%3a7.6.1+dfsg-1_armhf.deb ... Unpacking libsuitesparse-dev:armhf (1:7.6.1+dfsg-1) ... Selecting previously unselected package libglpk-dev:armhf. Preparing to unpack .../168-libglpk-dev_5.0-1+b1_armhf.deb ... Unpacking libglpk-dev:armhf (5.0-1+b1) ... Selecting previously unselected package libjs-mathjax. Preparing to unpack .../169-libjs-mathjax_2.7.9+dfsg-1_all.deb ... Unpacking libjs-mathjax (2.7.9+dfsg-1) ... Setting up media-types (10.1.0) ... Setting up libpipeline1:armhf (1.5.7-2) ... Setting up libgraphite2-3:armhf (1.3.14-2) ... Setting up liblcms2-2:armhf (2.14-2+b1) ... Setting up libpixman-1-0:armhf (0.42.2-1+b1) ... Setting up libsharpyuv0:armhf (1.3.2-0.4) ... Setting up libaom3:armhf (3.8.2-2) ... Setting up libabsl20220623:armhf (20220623.1-3) ... Setting up libxau6:armhf (1:1.0.9-1) ... Setting up libpsl5:armhf (0.21.2-1+b1) ... Setting up fonts-mathjax (2.7.9+dfsg-1) ... Setting up libicu72:armhf (72.1-4+b1) ... Setting up liblerc4:armhf (4.0.0+ds-4+b1) ... Setting up bsdextrautils (2.39.3-6) ... Setting up libjs-mathjax (2.7.9+dfsg-1) ... Setting up libdatrie1:armhf (0.2.13-3) ... Setting up libmagic-mgc (1:5.45-2+b1) ... Setting up libarchive-zip-perl (1.68-1) ... Setting up libglib2.0-0:armhf (2.78.4-1) ... No schema files found: doing nothing. Setting up libijs-0.35:armhf (0.35-15.1+b1) ... Setting up libdebhelper-perl (13.15.3) ... Setting up libgs-common (10.02.1~dfsg-3) ... Setting up libbrotli1:armhf (1.1.0-2+b3) ... Setting up liblab-gamut1:armhf (2.42.2-8) ... Setting up x11-common (1:7.7+23) ... invoke-rc.d: could not determine current runlevel Setting up X socket directories... /tmp/.X11-unix /tmp/.ICE-unix. Setting up libcxsparse4:armhf (1:7.6.1+dfsg-1) ... Setting up libnghttp2-14:armhf (1.59.0-1) ... Setting up libmagic1:armhf (1:5.45-2+b1) ... Setting up libdeflate0:armhf (1.20-1) ... Setting up gettext-base (0.21-14+b1) ... Setting up m4 (1.4.19-4) ... Setting up libsvtav1enc1d1:armhf (1.7.0+dfsg-2+b1) ... Setting up libldl3:armhf (1:7.6.1+dfsg-1) ... Setting up file (1:5.45-2+b1) ... Setting up libjbig0:armhf (2.1-6.1+b1) ... Setting up librav1e0:armhf (0.7.1-2) ... Setting up poppler-data (0.4.12-1) ... Setting up libsasl2-modules-db:armhf (2.1.28+dfsg1-4+b1) ... Setting up tzdata (2024a-1) ... Current default time zone: 'Etc/UTC' Local time is now: Sat Apr 13 04:45:08 UTC 2024. Universal Time is now: Sat Apr 13 04:45:08 UTC 2024. Run 'dpkg-reconfigure tzdata' if you wish to change it. Setting up libgts-0.7-5:armhf (0.7.6+darcs121130-5+b1) ... Setting up libbtf2:armhf (1:7.6.1+dfsg-1) ... Setting up libfontenc1:armhf (1:1.1.8-1) ... Setting up autotools-dev (20220109.1) ... Setting up libz3-4:armhf (4.8.12-3.1+b2) ... Setting up libblas3:armhf (3.12.0-3) ... 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.3.0+dfsg-2+b1) ... Setting up libuv1:armhf (1.48.0-1) ... Setting up libjpeg62-turbo:armhf (1:2.1.5-2+b2) ... Setting up libx11-data (2:1.8.7-1) ... Setting up libjbig2dec0:armhf (0.20-1+b1) ... Setting up librtmp1:armhf (2.4+20151223.gitfa8646d.1-2+b2) ... Setting up libpathplan4:armhf (2.42.2-8) ... Setting up libavahi-common-data:armhf (0.8-13+b1) ... Setting up libdbus-1-3:armhf (1.14.10-4) ... Setting up xfonts-encodings (1:1.0.4-2.2) ... Setting up libfribidi0:armhf (1.0.13-3+b1) ... Setting up libproc2-0:armhf (2:4.0.4-4) ... Setting up fonts-dejavu-mono (2.37-8) ... Setting up libpng16-16:armhf (1.6.43-1) ... Setting up libidn12:armhf (1.42-2) ... Setting up autopoint (0.21-14) ... Setting up libjsoncpp25:armhf (1.9.5-6+b2) ... Setting up fonts-dejavu-core (2.37-8) ... Setting up d-shlibs (0.106) ... Setting up libgav1-1:armhf (0.18.0-1+b1) ... Setting up libltdl7:armhf (2.4.7-7) ... Setting up libsasl2-2:armhf (2.1.28+dfsg1-4+b1) ... Setting up libgfortran5:armhf (14-20240201-3) ... Setting up autoconf (2.71-3) ... Setting up libwebp7:armhf (1.3.2-0.4) ... Setting up libfmt9:armhf (9.1.0+ds1-2) ... Setting up zlib1g-dev:armhf (1:1.3.dfsg-3+b1) ... Setting up libdav1d7:armhf (1.4.1-1) ... Setting up sensible-utils (0.0.22) ... Setting up librhash0:armhf (1.4.3-3+b1) ... Setting up libtiff6:armhf (4.5.1+git230720-4) ... Setting up libuchardet0:armhf (0.0.8-1+b1) ... Setting up procps (2:4.0.4-4) ... Setting up libsuitesparseconfig7:armhf (1:7.6.1+dfsg-1) ... Setting up libopenjp2-7:armhf (2.5.0-2+b2) ... Setting up libsub-override-perl (0.10-1) ... Setting up libthai-data (0.1.29-2) ... Setting up libssh2-1:armhf (1.11.0-4) ... Setting up netbase (6.4) ... Setting up cmake-data (3.28.3-1) ... Setting up libcdt5:armhf (2.42.2-8) ... Setting up libcgraph6:armhf (2.42.2-8) ... Setting up libde265-0:armhf (1.0.15-1) ... Setting up libbsd0:armhf (0.12.2-1) ... Setting up libyuv0:armhf (0.0~git202401110.af6ac82-1) ... Setting up libelf1:armhf (0.190-1+b1) ... Setting up readline-common (8.2-3) ... Setting up libxml2:armhf (2.9.14+dfsg-1.3+b2) ... Setting up libblas-dev:armhf (3.12.0-3) ... 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 automake (1:1.16.5-1.3) ... update-alternatives: using /usr/bin/automake-1.16 to provide /usr/bin/automake (automake) in auto mode Setting up libfile-stripnondeterminism-perl (1.13.1-1) ... Setting up libice6:armhf (2:1.0.10-1) ... Setting up libavif16:armhf (1.0.4-1) ... Setting up libxdmcp6:armhf (1:1.1.2-3) ... Setting up liblapack3:armhf (3.12.0-3) ... 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.15-1) ... Setting up gettext (0.21-14+b1) ... Setting up libgmp-dev:armhf (2:6.3.0+dfsg-2+b1) ... Setting up libamd3:armhf (1:7.6.1+dfsg-1) ... Setting up libtool (2.4.7-7) ... Setting up libcolamd3:armhf (1:7.6.1+dfsg-1) ... Setting up libarchive13:armhf (3.7.2-1) ... Setting up libxcb-render0:armhf (1.15-1) ... Setting up libsuitesparse-mongoose3:armhf (1:7.6.1+dfsg-1) ... Setting up fontconfig-config (2.15.0-1.1) ... Setting up libedit2:armhf (3.1-20230828-1) ... Setting up libreadline8:armhf (8.2-3+b1) ... Setting up libavahi-common3:armhf (0.8-13+b1) ... Setting up libxcb-shm0:armhf (1.15-1) ... Setting up libldap-2.5-0:armhf (2.5.13+dfsg-5+b3) ... Setting up libcamd3:armhf (1:7.6.1+dfsg-1) ... Setting up intltool-debian (0.35.0+20060710.6) ... Setting up dh-autoreconf (20) ... Setting up libthai0:armhf (0.1.29-2) ... Setting up libfreetype6:armhf (2.13.2+dfsg-1+b1) ... Setting up libglpk40:armhf (5.0-1+b1) ... Setting up librbio4:armhf (1:7.6.1+dfsg-1) ... Setting up liblapack-dev:armhf (3.12.0-3) ... 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 ucf (3.0043+nmu1) ... Setting up libccolamd3:armhf (1:7.6.1+dfsg-1) ... Setting up dh-strip-nondeterminism (1.13.1-1) ... Setting up libgvpr2:armhf (2.42.2-8) ... Setting up dwz (0.15-1) ... Setting up groff-base (1.23.0-3) ... Setting up libcurl4:armhf (8.5.0-2) ... Setting up libx11-6:armhf (2:1.8.7-1) ... Setting up libharfbuzz0b:armhf (8.3.0-2) ... Setting up libfontconfig1:armhf (2.15.0-1.1) ... Setting up libllvm16:armhf (1:16.0.6-20) ... Setting up libsm6:armhf (2:1.2.3-1) ... Setting up libavahi-client3:armhf (0.8-13+b1) ... Setting up libpaper1:armhf (1.1.29) ... Creating config file /etc/papersize with new version Setting up fontconfig (2.15.0-1.1) ... Regenerating fonts cache... done. Setting up libcholmod5:armhf (1:7.6.1+dfsg-1) ... Setting up libspex2:armhf (1:7.6.1+dfsg-1) ... Setting up libxpm4:armhf (1:3.5.17-1) ... Setting up libxrender1:armhf (1:0.9.10-1.1) ... Setting up libspqr4:armhf (1:7.6.1+dfsg-1) ... Setting up libclang1-16 (1:16.0.6-20) ... Setting up po-debconf (1.0.21+nmu1) ... Setting up libpython3.11-stdlib:armhf (3.11.8-1) ... Setting up libpango-1.0-0:armhf (1.52.0+ds-1) ... Setting up libxext6:armhf (2:1.3.4-1+b1) ... Setting up xfonts-utils (1:7.7+6) ... Setting up man-db (2.12.0-3) ... Not building database; man-db/auto-update is not 'true'. Setting up libcairo2:armhf (1.18.0-1+b1) ... Setting up libklu2:armhf (1:7.6.1+dfsg-1) ... Setting up libxt6:armhf (1:1.2.1-1.1) ... Setting up libcups2:armhf (2.4.7-1+b1) ... Setting up libumfpack6:armhf (1:7.6.1+dfsg-1) ... Setting up libclang-cpp16 (1:16.0.6-20) ... Setting up cmake (3.28.3-1) ... Setting up libpangoft2-1.0-0:armhf (1.52.0+ds-1) ... Setting up libpangocairo-1.0-0:armhf (1.52.0+ds-1) ... Setting up libpython3-stdlib:armhf (3.11.6-1) ... Setting up python3.11 (3.11.8-1) ... Setting up libxmu6:armhf (2:1.1.3-3) ... Setting up debhelper (13.15.3) ... Setting up libparu0:armhf (1:7.6.1+dfsg-1) ... Setting up python3 (3.11.6-1) ... Setting up libxaw7:armhf (2:1.0.14-1) ... Setting up fonts-urw-base35 (20200910-8) ... Setting up doxygen (1.9.8+ds-2) ... Setting up libgs10-common (10.02.1~dfsg-3) ... Setting up libsuitesparse-dev:armhf (1:7.6.1+dfsg-1) ... Setting up libglpk-dev:armhf (5.0-1+b1) ... Setting up libgs10:armhf (10.02.1~dfsg-3) ... Setting up ghostscript (10.02.1~dfsg-3) ... Setting up libheif-plugin-dav1d:armhf (1.17.6-1) ... Setting up libheif-plugin-libde265:armhf (1.17.6-1) ... Setting up libheif1:armhf (1.17.6-1) ... Setting up libgd3:armhf (2.3.3-9+b1) ... Setting up libgvc6 (2.42.2-8) ... Setting up graphviz (2.42.2-8) ... Processing triggers for libc-bin (2.37-15) ... Reading package lists... Building dependency tree... Reading state information... Reading extended state information... Initializing package states... Writing extended state information... Building tag database... -> Finished parsing the build-deps I: Building the package I: Running cd /build/reproducible-path/liblemon-1.3.1+dfsg/ && env PATH="/usr/sbin:/usr/bin:/sbin:/bin:/usr/games" HOME="/nonexistent/first-build" dpkg-buildpackage -us -uc -b && env PATH="/usr/sbin:/usr/bin:/sbin:/bin:/usr/games" HOME="/nonexistent/first-build" dpkg-genchanges -S > ../liblemon_1.3.1+dfsg-6_source.changes dpkg-buildpackage: info: source package liblemon dpkg-buildpackage: info: source version 1.3.1+dfsg-6 dpkg-buildpackage: info: source distribution unstable dpkg-buildpackage: info: source changed by Andreas Tille dpkg-source --before-build . dpkg-buildpackage: info: host architecture armhf debian/rules clean dh clean dh_clean debian/rules binary dh binary dh_update_autotools_config dh_autoreconf dh_auto_configure cd obj-arm-linux-gnueabihf && DEB_PYTHON_INSTALL_LAYOUT=deb 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_USE_PACKAGE_REGISTRY=OFF -DCMAKE_FIND_PACKAGE_NO_PACKAGE_REGISTRY=ON -DFETCHCONTENT_FULLY_DISCONNECTED=ON -DCMAKE_INSTALL_RUNSTATEDIR=/run -DCMAKE_SKIP_INSTALL_ALL_DEPENDENCY=ON "-GUnix Makefiles" -DCMAKE_VERBOSE_MAKEFILE=ON -DCMAKE_INSTALL_LIBDIR=lib/arm-linux-gnueabihf .. CMake Deprecation Warning at CMakeLists.txt:1 (CMAKE_MINIMUM_REQUIRED): Compatibility with CMake < 3.5 will be removed from a future version of CMake. Update the VERSION argument value or use a ... suffix to tell CMake that the project does not need compatibility with older versions. 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 13.2.0 -- The CXX compiler identification is GNU 13.2.0 -- Detecting C compiler ABI info -- Detecting C compiler ABI info - done -- Check for working C compiler: /usr/bin/cc - skipped -- Detecting C compile features -- Detecting C compile features - done -- Detecting CXX compiler ABI info -- Detecting CXX compiler ABI info - done -- Check for working CXX compiler: /usr/bin/c++ - skipped -- Detecting CXX compile features -- Detecting CXX compile features - done CMake Warning (dev) at CMakeLists.txt:8 (INCLUDE): Policy CMP0148 is not set: The FindPythonInterp and FindPythonLibs modules are removed. Run "cmake --help-policy CMP0148" for policy details. Use the cmake_policy command to set the policy and suppress this warning. This warning is for project developers. Use -Wno-dev to suppress it. -- Found PythonInterp: /usr/bin/python3 (found version "3.11.8") -- Could NOT find Wget (missing: WGET_EXECUTABLE) -- Found Doxygen: /usr/bin/doxygen (found version "1.9.8") 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 -- Performing Test CMAKE_HAVE_LIBC_PTHREAD -- Performing Test CMAKE_HAVE_LIBC_PTHREAD - Success -- Found Threads: TRUE -- Configuring done (10.8s) -- Generating done (0.7s) CMake Warning: Manually-specified variables were not used by the project: CMAKE_EXPORT_NO_PACKAGE_REGISTRY CMAKE_FIND_PACKAGE_NO_PACKAGE_REGISTRY CMAKE_INSTALL_LIBDIR CMAKE_INSTALL_LOCALSTATEDIR CMAKE_INSTALL_RUNSTATEDIR CMAKE_INSTALL_SYSCONFDIR FETCHCONTENT_FULLY_DISCONNECTED -- Build files have been written to: /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf debian/rules override_dh_auto_build make[1]: Entering directory '/build/reproducible-path/liblemon-1.3.1+dfsg' dh_auto_build cd obj-arm-linux-gnueabihf && make -j3 "INSTALL=install --strip-program=true" VERBOSE=1 make[2]: Entering directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' /usr/bin/cmake -S/build/reproducible-path/liblemon-1.3.1+dfsg -B/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf --check-build-system CMakeFiles/Makefile.cmake 0 /usr/bin/cmake -E cmake_progress_start /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/CMakeFiles /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf//CMakeFiles/progress.marks make -f CMakeFiles/Makefile2 all make[3]: Entering directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' make -f lemon/CMakeFiles/lemon_static.dir/build.make lemon/CMakeFiles/lemon_static.dir/depend make -f lemon/CMakeFiles/lemon.dir/build.make lemon/CMakeFiles/lemon.dir/depend make[4]: Entering directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /build/reproducible-path/liblemon-1.3.1+dfsg /build/reproducible-path/liblemon-1.3.1+dfsg/lemon /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon/CMakeFiles/lemon_static.dir/DependInfo.cmake "--color=" make[4]: Entering directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /build/reproducible-path/liblemon-1.3.1+dfsg /build/reproducible-path/liblemon-1.3.1+dfsg/lemon /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon/CMakeFiles/lemon.dir/DependInfo.cmake "--color=" make[4]: Leaving directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' make[4]: Leaving directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' make -f lemon/CMakeFiles/lemon_static.dir/build.make lemon/CMakeFiles/lemon_static.dir/build make -f lemon/CMakeFiles/lemon.dir/build.make lemon/CMakeFiles/lemon.dir/build make[4]: Entering directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' make[4]: Entering directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 12%] Building CXX object lemon/CMakeFiles/lemon_static.dir/arg_parser.cc.o [ 12%] Building CXX object lemon/CMakeFiles/lemon.dir/arg_parser.cc.o [ 12%] Building CXX object lemon/CMakeFiles/lemon_static.dir/base.cc.o cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon && /usr/bin/c++ -I/build/reproducible-path/liblemon-1.3.1+dfsg -I/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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 -MD -MT lemon/CMakeFiles/lemon_static.dir/arg_parser.cc.o -MF CMakeFiles/lemon_static.dir/arg_parser.cc.o.d -o CMakeFiles/lemon_static.dir/arg_parser.cc.o -c /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/arg_parser.cc cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon && /usr/bin/c++ -Dlemon_EXPORTS -I/build/reproducible-path/liblemon-1.3.1+dfsg -I/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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 -MD -MT lemon/CMakeFiles/lemon.dir/arg_parser.cc.o -MF CMakeFiles/lemon.dir/arg_parser.cc.o.d -o CMakeFiles/lemon.dir/arg_parser.cc.o -c /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/arg_parser.cc cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon && /usr/bin/c++ -I/build/reproducible-path/liblemon-1.3.1+dfsg -I/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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 -MD -MT lemon/CMakeFiles/lemon_static.dir/base.cc.o -MF CMakeFiles/lemon_static.dir/base.cc.o.d -o CMakeFiles/lemon_static.dir/base.cc.o -c /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/base.cc [ 12%] Building CXX object lemon/CMakeFiles/lemon_static.dir/color.cc.o cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon && /usr/bin/c++ -I/build/reproducible-path/liblemon-1.3.1+dfsg -I/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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 -MD -MT lemon/CMakeFiles/lemon_static.dir/color.cc.o -MF CMakeFiles/lemon_static.dir/color.cc.o.d -o CMakeFiles/lemon_static.dir/color.cc.o -c /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/color.cc In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/color.h:24, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/color.cc:22: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:1973:21: warning: 'template struct std::iterator' is deprecated [-Wdeprecated-declarations] 1973 | : public std::iterator { | ^~~~~~~~ In file included from /usr/include/c++/13/bits/stl_algobase.h:65, from /usr/include/c++/13/vector:62, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/color.h:22: /usr/include/c++/13/bits/stl_iterator_base_types.h:127:34: note: declared here 127 | struct _GLIBCXX17_DEPRECATED iterator | ^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:3135:21: warning: 'template struct std::iterator' is deprecated [-Wdeprecated-declarations] 3135 | : public std::iterator { | ^~~~~~~~ /usr/include/c++/13/bits/stl_iterator_base_types.h:127:34: note: declared here 127 | struct _GLIBCXX17_DEPRECATED iterator | ^~~~~~~~ [ 16%] Building CXX object lemon/CMakeFiles/lemon_static.dir/lp_base.cc.o cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon && /usr/bin/c++ -I/build/reproducible-path/liblemon-1.3.1+dfsg -I/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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 -MD -MT lemon/CMakeFiles/lemon_static.dir/lp_base.cc.o -MF CMakeFiles/lemon_static.dir/lp_base.cc.o.d -o CMakeFiles/lemon_static.dir/lp_base.cc.o -c /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lp_base.cc [ 20%] Building CXX object lemon/CMakeFiles/lemon_static.dir/lp_skeleton.cc.o cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon && /usr/bin/c++ -I/build/reproducible-path/liblemon-1.3.1+dfsg -I/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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 -MD -MT lemon/CMakeFiles/lemon_static.dir/lp_skeleton.cc.o -MF CMakeFiles/lemon_static.dir/lp_skeleton.cc.o.d -o CMakeFiles/lemon_static.dir/lp_skeleton.cc.o -c /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lp_skeleton.cc [ 24%] Building CXX object lemon/CMakeFiles/lemon.dir/base.cc.o cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon && /usr/bin/c++ -Dlemon_EXPORTS -I/build/reproducible-path/liblemon-1.3.1+dfsg -I/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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 -MD -MT lemon/CMakeFiles/lemon.dir/base.cc.o -MF CMakeFiles/lemon.dir/base.cc.o.d -o CMakeFiles/lemon.dir/base.cc.o -c /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/base.cc [ 28%] Building CXX object lemon/CMakeFiles/lemon_static.dir/random.cc.o cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon && /usr/bin/c++ -I/build/reproducible-path/liblemon-1.3.1+dfsg -I/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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 -MD -MT lemon/CMakeFiles/lemon_static.dir/random.cc.o -MF CMakeFiles/lemon_static.dir/random.cc.o.d -o CMakeFiles/lemon_static.dir/random.cc.o -c /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/random.cc In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/random.cc:22: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/random.h: In member function 'void lemon::_random_bits::RandomCore<_Word>::fillState()': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/random.h:252:24: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister] 252 | register Word *curr = state + length - 1; | ^~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/random.h:253:23: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister] 253 | register long num; | ^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/random.h: In member function 'std::pair lemon::Random::lognormalParamsFromMD(double, double)': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/random.h:825:5: note: parameter passing for argument of type 'std::pair' when C++17 is enabled changed to match C++14 in GCC 10.1 825 | { | ^ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/random.h: In instantiation of 'void lemon::_random_bits::RandomCore<_Word>::fillState() [with _Word = long unsigned int]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/random.h:236:31: required from 'lemon::_random_bits::RandomCore<_Word>::Word lemon::_random_bits::RandomCore<_Word>::operator()() [with _Word = long unsigned int; Word = long unsigned int]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/random.h:456:23: required from 'bool lemon::_random_bits::BoolProducer::convert(lemon::_random_bits::RandomCore&) [with Word = long unsigned int]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/random.h:760:35: required from here /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/random.h:252:24: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister] 252 | register Word *curr = state + length - 1; | ^~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/random.h:253:23: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister] 253 | register long num; | ^~~ [ 32%] Building CXX object lemon/CMakeFiles/lemon.dir/color.cc.o cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon && /usr/bin/c++ -Dlemon_EXPORTS -I/build/reproducible-path/liblemon-1.3.1+dfsg -I/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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 -MD -MT lemon/CMakeFiles/lemon.dir/color.cc.o -MF CMakeFiles/lemon.dir/color.cc.o.d -o CMakeFiles/lemon.dir/color.cc.o -c /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/color.cc [ 36%] Building CXX object lemon/CMakeFiles/lemon_static.dir/bits/windows.cc.o cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon && /usr/bin/c++ -I/build/reproducible-path/liblemon-1.3.1+dfsg -I/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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 -MD -MT lemon/CMakeFiles/lemon_static.dir/bits/windows.cc.o -MF CMakeFiles/lemon_static.dir/bits/windows.cc.o.d -o CMakeFiles/lemon_static.dir/bits/windows.cc.o -c /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/windows.cc [ 40%] Building CXX object lemon/CMakeFiles/lemon_static.dir/glpk.cc.o cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon && /usr/bin/c++ -I/build/reproducible-path/liblemon-1.3.1+dfsg -I/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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 -MD -MT lemon/CMakeFiles/lemon_static.dir/glpk.cc.o -MF CMakeFiles/lemon_static.dir/glpk.cc.o.d -o CMakeFiles/lemon_static.dir/glpk.cc.o -c /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/glpk.cc [ 44%] Building CXX object lemon/CMakeFiles/lemon.dir/lp_base.cc.o cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon && /usr/bin/c++ -Dlemon_EXPORTS -I/build/reproducible-path/liblemon-1.3.1+dfsg -I/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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 -MD -MT lemon/CMakeFiles/lemon.dir/lp_base.cc.o -MF CMakeFiles/lemon.dir/lp_base.cc.o.d -o CMakeFiles/lemon.dir/lp_base.cc.o -c /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lp_base.cc In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/color.h:24, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/color.cc:22: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:1973:21: warning: 'template struct std::iterator' is deprecated [-Wdeprecated-declarations] 1973 | : public std::iterator { | ^~~~~~~~ In file included from /usr/include/c++/13/bits/stl_algobase.h:65, from /usr/include/c++/13/vector:62, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/color.h:22: /usr/include/c++/13/bits/stl_iterator_base_types.h:127:34: note: declared here 127 | struct _GLIBCXX17_DEPRECATED iterator | ^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:3135:21: warning: 'template struct std::iterator' is deprecated [-Wdeprecated-declarations] 3135 | : public std::iterator { | ^~~~~~~~ /usr/include/c++/13/bits/stl_iterator_base_types.h:127:34: note: declared here 127 | struct _GLIBCXX17_DEPRECATED iterator | ^~~~~~~~ [ 48%] Building CXX object lemon/CMakeFiles/lemon.dir/lp_skeleton.cc.o cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon && /usr/bin/c++ -Dlemon_EXPORTS -I/build/reproducible-path/liblemon-1.3.1+dfsg -I/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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 -MD -MT lemon/CMakeFiles/lemon.dir/lp_skeleton.cc.o -MF CMakeFiles/lemon.dir/lp_skeleton.cc.o.d -o CMakeFiles/lemon.dir/lp_skeleton.cc.o -c /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lp_skeleton.cc [ 48%] Building CXX object lemon/CMakeFiles/lemon.dir/random.cc.o cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon && /usr/bin/c++ -Dlemon_EXPORTS -I/build/reproducible-path/liblemon-1.3.1+dfsg -I/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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 -MD -MT lemon/CMakeFiles/lemon.dir/random.cc.o -MF CMakeFiles/lemon.dir/random.cc.o.d -o CMakeFiles/lemon.dir/random.cc.o -c /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/random.cc In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/random.cc:22: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/random.h: In member function 'void lemon::_random_bits::RandomCore<_Word>::fillState()': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/random.h:252:24: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister] 252 | register Word *curr = state + length - 1; | ^~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/random.h:253:23: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister] 253 | register long num; | ^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/random.h: In member function 'std::pair lemon::Random::lognormalParamsFromMD(double, double)': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/random.h:825:5: note: parameter passing for argument of type 'std::pair' when C++17 is enabled changed to match C++14 in GCC 10.1 825 | { | ^ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/random.h: In instantiation of 'void lemon::_random_bits::RandomCore<_Word>::fillState() [with _Word = long unsigned int]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/random.h:236:31: required from 'lemon::_random_bits::RandomCore<_Word>::Word lemon::_random_bits::RandomCore<_Word>::operator()() [with _Word = long unsigned int; Word = long unsigned int]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/random.h:456:23: required from 'bool lemon::_random_bits::BoolProducer::convert(lemon::_random_bits::RandomCore&) [with Word = long unsigned int]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/random.h:760:35: required from here /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/random.h:252:24: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister] 252 | register Word *curr = state + length - 1; | ^~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/random.h:253:23: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister] 253 | register long num; | ^~~ [ 52%] Building CXX object lemon/CMakeFiles/lemon.dir/bits/windows.cc.o cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon && /usr/bin/c++ -Dlemon_EXPORTS -I/build/reproducible-path/liblemon-1.3.1+dfsg -I/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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 -MD -MT lemon/CMakeFiles/lemon.dir/bits/windows.cc.o -MF CMakeFiles/lemon.dir/bits/windows.cc.o.d -o CMakeFiles/lemon.dir/bits/windows.cc.o -c /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/windows.cc [ 56%] Building CXX object lemon/CMakeFiles/lemon.dir/glpk.cc.o cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon && /usr/bin/c++ -Dlemon_EXPORTS -I/build/reproducible-path/liblemon-1.3.1+dfsg -I/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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 -MD -MT lemon/CMakeFiles/lemon.dir/glpk.cc.o -MF CMakeFiles/lemon.dir/glpk.cc.o.d -o CMakeFiles/lemon.dir/glpk.cc.o -c /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/glpk.cc In file included from /usr/include/c++/13/vector:72, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lp_base.h:23, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/glpk.h:26, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/glpk.cc:22: /usr/include/c++/13/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const double&}; _Tp = double; _Alloc = std::allocator]': /usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/13/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_fill_insert(iterator, size_type, const value_type&) [with _Tp = double; _Alloc = std::allocator]': /usr/include/c++/13/bits/vector.tcc:529:5: note: parameter passing for argument of type 'std::vector::iterator' changed in GCC 7.1 529 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/13/vector:66: In member function 'void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = double; _Alloc = std::allocator]', inlined from 'virtual lemon::LpBase::Value lemon::GlpkLp::_getDualRay(int) const' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/glpk.cc:784:23: /usr/include/c++/13/bits/stl_vector.h:1034:25: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1034 | _M_fill_insert(end(), __new_size - size(), __x); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = double; _Alloc = std::allocator]', inlined from 'virtual lemon::LpBase::Value lemon::GlpkLp::_getPrimalRay(int) const' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/glpk.cc:733:25: /usr/include/c++/13/bits/stl_vector.h:1034:25: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1034 | _M_fill_insert(end(), __new_size - size(), __x); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = double; _Alloc = std::allocator]', inlined from 'virtual int lemon::GlpkBase::_addRow(lemon::LpBase::Value, lemon::LpBase::ExprIterator, lemon::LpBase::ExprIterator, lemon::LpBase::Value)' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/glpk.cc:90:23: /usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1289 | _M_realloc_insert(end(), __x); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = double; _Alloc = std::allocator]', inlined from 'virtual void lemon::GlpkBase::_setRowCoeffs(int, lemon::LpBase::ExprIterator, lemon::LpBase::ExprIterator)' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/glpk.cc:161:23: /usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1289 | _M_realloc_insert(end(), __x); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = double; _Alloc = std::allocator]', inlined from 'virtual void lemon::GlpkBase::_setColCoeffs(int, lemon::LpBase::ExprIterator, lemon::LpBase::ExprIterator)' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/glpk.cc:193:23: /usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1289 | _M_realloc_insert(end(), __x); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~ [ 60%] Linking CXX static library liblemon_static.a cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon && /usr/bin/cmake -P CMakeFiles/lemon_static.dir/cmake_clean_target.cmake cd /build/reproducible-path/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 '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 60%] Built target lemon_static In file included from /usr/include/c++/13/vector:72, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lp_base.h:23, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/glpk.h:26, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/glpk.cc:22: /usr/include/c++/13/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const double&}; _Tp = double; _Alloc = std::allocator]': /usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/13/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_fill_insert(iterator, size_type, const value_type&) [with _Tp = double; _Alloc = std::allocator]': /usr/include/c++/13/bits/vector.tcc:529:5: note: parameter passing for argument of type 'std::vector::iterator' changed in GCC 7.1 529 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/13/vector:66: In member function 'void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = double; _Alloc = std::allocator]', inlined from 'virtual lemon::LpBase::Value lemon::GlpkLp::_getDualRay(int) const' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/glpk.cc:784:23: /usr/include/c++/13/bits/stl_vector.h:1034:25: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1034 | _M_fill_insert(end(), __new_size - size(), __x); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = double; _Alloc = std::allocator]', inlined from 'virtual lemon::LpBase::Value lemon::GlpkLp::_getPrimalRay(int) const' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/glpk.cc:733:25: /usr/include/c++/13/bits/stl_vector.h:1034:25: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1034 | _M_fill_insert(end(), __new_size - size(), __x); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = double; _Alloc = std::allocator]', inlined from 'virtual int lemon::GlpkBase::_addRow(lemon::LpBase::Value, lemon::LpBase::ExprIterator, lemon::LpBase::ExprIterator, lemon::LpBase::Value)' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/glpk.cc:90:23: /usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1289 | _M_realloc_insert(end(), __x); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = double; _Alloc = std::allocator]', inlined from 'virtual void lemon::GlpkBase::_setRowCoeffs(int, lemon::LpBase::ExprIterator, lemon::LpBase::ExprIterator)' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/glpk.cc:161:23: /usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1289 | _M_realloc_insert(end(), __x); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = double; _Alloc = std::allocator]', inlined from 'virtual void lemon::GlpkBase::_setColCoeffs(int, lemon::LpBase::ExprIterator, lemon::LpBase::ExprIterator)' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/glpk.cc:193:23: /usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1289 | _M_realloc_insert(end(), __x); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~ [ 64%] Linking CXX shared library liblemon.so cd /build/reproducible-path/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 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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,-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 cd /build/reproducible-path/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 '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 64%] Built target lemon make -f demo/CMakeFiles/arg_parser_demo.dir/build.make demo/CMakeFiles/arg_parser_demo.dir/depend 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 '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /build/reproducible-path/liblemon-1.3.1+dfsg /build/reproducible-path/liblemon-1.3.1+dfsg/demo /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/demo /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/demo/CMakeFiles/arg_parser_demo.dir/DependInfo.cmake "--color=" make[4]: Entering directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /build/reproducible-path/liblemon-1.3.1+dfsg /build/reproducible-path/liblemon-1.3.1+dfsg/demo /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/demo /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/demo/CMakeFiles/graph_to_eps_demo.dir/DependInfo.cmake "--color=" make[4]: Entering directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /build/reproducible-path/liblemon-1.3.1+dfsg /build/reproducible-path/liblemon-1.3.1+dfsg/demo /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/demo /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/demo/CMakeFiles/lgf_demo.dir/DependInfo.cmake "--color=" make[4]: Leaving directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' make[4]: Leaving directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' make -f demo/CMakeFiles/graph_to_eps_demo.dir/build.make demo/CMakeFiles/graph_to_eps_demo.dir/build make -f demo/CMakeFiles/lgf_demo.dir/build.make demo/CMakeFiles/lgf_demo.dir/build make[4]: Entering directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' make[4]: Entering directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' make[4]: Leaving directory '/build/reproducible-path/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]: Entering directory '/build/reproducible-path/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 cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/demo && /usr/bin/c++ -I/build/reproducible-path/liblemon-1.3.1+dfsg -I/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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 -MD -MT demo/CMakeFiles/graph_to_eps_demo.dir/graph_to_eps_demo.cc.o -MF CMakeFiles/graph_to_eps_demo.dir/graph_to_eps_demo.cc.o.d -o CMakeFiles/graph_to_eps_demo.dir/graph_to_eps_demo.cc.o -c /build/reproducible-path/liblemon-1.3.1+dfsg/demo/graph_to_eps_demo.cc [ 72%] Building CXX object demo/CMakeFiles/lgf_demo.dir/lgf_demo.cc.o cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/demo && /usr/bin/c++ -I/build/reproducible-path/liblemon-1.3.1+dfsg -I/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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 -MD -MT demo/CMakeFiles/lgf_demo.dir/lgf_demo.cc.o -MF CMakeFiles/lgf_demo.dir/lgf_demo.cc.o.d -o CMakeFiles/lgf_demo.dir/lgf_demo.cc.o -c /build/reproducible-path/liblemon-1.3.1+dfsg/demo/lgf_demo.cc [ 76%] Building CXX object demo/CMakeFiles/arg_parser_demo.dir/arg_parser_demo.cc.o cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/demo && /usr/bin/c++ -I/build/reproducible-path/liblemon-1.3.1+dfsg -I/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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 -MD -MT demo/CMakeFiles/arg_parser_demo.dir/arg_parser_demo.cc.o -MF CMakeFiles/arg_parser_demo.dir/arg_parser_demo.cc.o.d -o CMakeFiles/arg_parser_demo.dir/arg_parser_demo.cc.o -c /build/reproducible-path/liblemon-1.3.1+dfsg/demo/arg_parser_demo.cc In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lgf_writer.h:37, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:36, from /build/reproducible-path/liblemon-1.3.1+dfsg/demo/lgf_demo.cc:36: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:1973:21: warning: 'template struct std::iterator' is deprecated [-Wdeprecated-declarations] 1973 | : public std::iterator { | ^~~~~~~~ In file included from /usr/include/c++/13/bits/stl_iterator_base_funcs.h:66, from /usr/include/c++/13/string:47, from /usr/include/c++/13/bits/locale_classes.h:40, from /usr/include/c++/13/bits/ios_base.h:41, from /usr/include/c++/13/ios:44, from /usr/include/c++/13/ostream:40, from /usr/include/c++/13/iostream:41, from /build/reproducible-path/liblemon-1.3.1+dfsg/demo/lgf_demo.cc:34: /usr/include/c++/13/bits/stl_iterator_base_types.h:127:34: note: declared here 127 | struct _GLIBCXX17_DEPRECATED iterator | ^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:3135:21: warning: 'template struct std::iterator' is deprecated [-Wdeprecated-declarations] 3135 | : public std::iterator { | ^~~~~~~~ /usr/include/c++/13/bits/stl_iterator_base_types.h:127:34: note: declared here 127 | struct _GLIBCXX17_DEPRECATED iterator | ^~~~~~~~ [ 80%] Linking CXX executable arg_parser_demo cd /build/reproducible-path/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 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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,-z,relro -Wl,-z,now -rdynamic CMakeFiles/arg_parser_demo.dir/arg_parser_demo.cc.o -o arg_parser_demo -L/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/graph_to_eps.h:38, from /build/reproducible-path/liblemon-1.3.1+dfsg/demo/graph_to_eps_demo.cc:34: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:1973:21: warning: 'template struct std::iterator' is deprecated [-Wdeprecated-declarations] 1973 | : public std::iterator { | ^~~~~~~~ In file included from /usr/include/c++/13/bits/stl_algobase.h:65, from /usr/include/c++/13/vector:62, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/core.h:22, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/list_graph.h:26, from /build/reproducible-path/liblemon-1.3.1+dfsg/demo/graph_to_eps_demo.cc:33: /usr/include/c++/13/bits/stl_iterator_base_types.h:127:34: note: declared here 127 | struct _GLIBCXX17_DEPRECATED iterator | ^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:3135:21: warning: 'template struct std::iterator' is deprecated [-Wdeprecated-declarations] 3135 | : public std::iterator { | ^~~~~~~~ /usr/include/c++/13/bits/stl_iterator_base_types.h:127:34: note: declared here 127 | struct _GLIBCXX17_DEPRECATED iterator | ^~~~~~~~ In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/graph_to_eps.h:40: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/bezier.h: In member function 'lemon::dim2::Bezier1 lemon::dim2::Bezier1::before(double) const': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/bezier.h:54:3: note: parameter passing for argument of type 'lemon::dim2::Bezier1' when C++17 is enabled changed to match C++14 in GCC 10.1 54 | { | ^ make[4]: Leaving directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 80%] Built target arg_parser_demo make -f tools/CMakeFiles/lgf-gen.dir/build.make tools/CMakeFiles/lgf-gen.dir/depend make[4]: Entering directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /build/reproducible-path/liblemon-1.3.1+dfsg /build/reproducible-path/liblemon-1.3.1+dfsg/tools /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/tools /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/tools/CMakeFiles/lgf-gen.dir/DependInfo.cmake "--color=" make[4]: Leaving directory '/build/reproducible-path/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 '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 80%] Building CXX object tools/CMakeFiles/lgf-gen.dir/lgf-gen.cc.o cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/tools && /usr/bin/c++ -I/build/reproducible-path/liblemon-1.3.1+dfsg -I/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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 -MD -MT tools/CMakeFiles/lgf-gen.dir/lgf-gen.cc.o -MF CMakeFiles/lgf-gen.dir/lgf-gen.cc.o.d -o CMakeFiles/lgf-gen.dir/lgf-gen.cc.o -c /build/reproducible-path/liblemon-1.3.1+dfsg/tools/lgf-gen.cc In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/tools/lgf-gen.cc:35: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/random.h: In member function 'void lemon::_random_bits::RandomCore<_Word>::fillState()': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/random.h:252:24: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister] 252 | register Word *curr = state + length - 1; | ^~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/random.h:253:23: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister] 253 | register long num; | ^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/random.h: In member function 'std::pair lemon::Random::lognormalParamsFromMD(double, double)': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/random.h:825:5: note: parameter passing for argument of type 'std::pair' when C++17 is enabled changed to match C++14 in GCC 10.1 825 | { | ^ In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bfs.h:30, from /build/reproducible-path/liblemon-1.3.1+dfsg/tools/lgf-gen.cc:37: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h: At global scope: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:1973:21: warning: 'template struct std::iterator' is deprecated [-Wdeprecated-declarations] 1973 | : public std::iterator { | ^~~~~~~~ In file included from /usr/include/c++/13/bits/stl_algobase.h:65, from /usr/include/c++/13/algorithm:60, from /build/reproducible-path/liblemon-1.3.1+dfsg/tools/lgf-gen.cc:31: /usr/include/c++/13/bits/stl_iterator_base_types.h:127:34: note: declared here 127 | struct _GLIBCXX17_DEPRECATED iterator | ^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:3135:21: warning: 'template struct std::iterator' is deprecated [-Wdeprecated-declarations] 3135 | : public std::iterator { | ^~~~~~~~ /usr/include/c++/13/bits/stl_iterator_base_types.h:127:34: note: declared here 127 | struct _GLIBCXX17_DEPRECATED iterator | ^~~~~~~~ In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/graph_to_eps.h:40, from /build/reproducible-path/liblemon-1.3.1+dfsg/tools/lgf-gen.cc:40: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/bezier.h: In member function 'lemon::dim2::Bezier1 lemon::dim2::Bezier1::before(double) const': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/bezier.h:54:3: note: parameter passing for argument of type 'lemon::dim2::Bezier1' when C++17 is enabled changed to match C++14 in GCC 10.1 54 | { | ^ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/random.h: In instantiation of 'void lemon::_random_bits::RandomCore<_Word>::fillState() [with _Word = long unsigned int]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/random.h:236:31: required from 'lemon::_random_bits::RandomCore<_Word>::Word lemon::_random_bits::RandomCore<_Word>::operator()() [with _Word = long unsigned int; Word = long unsigned int]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/random.h:456:23: required from 'bool lemon::_random_bits::BoolProducer::convert(lemon::_random_bits::RandomCore&) [with Word = long unsigned int]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/random.h:760:35: required from here /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/random.h:252:24: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister] 252 | register Word *curr = state + length - 1; | ^~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/random.h:253:23: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister] 253 | register long num; | ^~~ In file included from /usr/include/arm-linux-gnueabihf/c++/13/bits/c++allocator.h:33, from /usr/include/c++/13/bits/allocator.h:46, from /usr/include/c++/13/string:43: In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]', inlined from 'static void std::allocator_traits >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]' at /usr/include/c++/13/bits/alloc_traits.h:538:17, inlined from 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/vector.tcc:117:30, inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/stl_vector.h:1296:21, inlined from 'lemon::SmartDigraphBase::Node lemon::SmartDigraphBase::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:22, inlined from 'lemon::DigraphExtender::Node lemon::DigraphExtender::addNode() [with Base = lemon::SmartDigraphBase]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:268:34, inlined from 'lemon::DigraphExtender::Node lemon::SmartDigraph::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:223:44, inlined from 'void lemon::DigraphReader::readNodes() [with DGR = lemon::SmartDigraph]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:954:31: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/demo/lgf_demo.cc:35: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h: In member function 'void lemon::DigraphReader::readNodes() [with DGR = lemon::SmartDigraph]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:29: note: '' declared here 77 | nodes.push_back(NodeT()); | ^ In file included from /usr/include/c++/13/vector:72: /usr/include/c++/13/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {lemon::Color}; _Tp = lemon::Color; _Alloc = std::allocator]': /usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/13/bits/vector.tcc: In function 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {lemon::Color}; _Tp = lemon::Color; _Alloc = std::allocator]': /usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::ArcT; _Args = {lemon::SmartDigraphBase::ArcT}; _Tp = lemon::SmartDigraphBase::ArcT]', inlined from 'static void std::allocator_traits >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::ArcT; _Args = {lemon::SmartDigraphBase::ArcT}; _Tp = lemon::SmartDigraphBase::ArcT]' at /usr/include/c++/13/bits/alloc_traits.h:538:17, inlined from 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {lemon::SmartDigraphBase::ArcT}; _Tp = lemon::SmartDigraphBase::ArcT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/vector.tcc:117:30, inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = lemon::SmartDigraphBase::ArcT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/stl_vector.h:1296:21, inlined from 'lemon::SmartDigraphBase::Arc lemon::SmartDigraphBase::addArc(Node, Node)' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:85:21, inlined from 'lemon::DigraphExtender::Arc lemon::DigraphExtender::addArc(const Node&, const Node&) [with Base = lemon::SmartDigraphBase]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:274:31: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h: In member function 'lemon::DigraphExtender::Arc lemon::DigraphExtender::addArc(const Node&, const Node&) [with Base = lemon::SmartDigraphBase]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:85:27: note: '' declared here 85 | arcs.push_back(ArcT()); | ^ In file included from /usr/include/c++/13/bits/stl_algo.h:61, from /usr/include/c++/13/algorithm:61: /usr/include/c++/13/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, vector, allocator > > >; _Distance = int; _Tp = pair; _Compare = __gnu_cxx::__ops::_Iter_comp_iter, allocator > > > >]': /usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, | ^~~~~~~~~~~~~ /usr/include/c++/13/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, vector, allocator > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter, allocator > > > >]': /usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1792 | __unguarded_linear_insert(_RandomAccessIterator __last, | ^~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, vector, allocator > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter, allocator > > > >]': /usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1812 | __insertion_sort(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 /usr/include/c++/13/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, vector > >; _Compare = __gnu_cxx::__ops::_Val_less_iter]': /usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector > >' changed in GCC 7.1 1792 | __unguarded_linear_insert(_RandomAccessIterator __last, | ^~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/arm-linux-gnueabihf/c++/13/bits/c++allocator.h:33, from /usr/include/c++/13/bits/allocator.h:46, from /usr/include/c++/13/bits/stl_tree.h:64, from /usr/include/c++/13/set:62, from /build/reproducible-path/liblemon-1.3.1+dfsg/tools/lgf-gen.cc:32: In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::dim2::Point; _Args = {lemon::dim2::Point}; _Tp = lemon::dim2::Point]', inlined from 'void lemon::ArrayMap<_Graph, _Item, _Value>::add(const std::vector<_Item>&) [with _Graph = lemon::GraphExtender; _Item = lemon::ListGraphBase::Node; _Value = lemon::dim2::Point]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/array_map.h:272:28: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/default_map.h:23, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:25, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/list_graph.h:28, from /build/reproducible-path/liblemon-1.3.1+dfsg/tools/lgf-gen.cc:34: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/array_map.h: In member function 'void lemon::ArrayMap<_Graph, _Item, _Value>::add(const std::vector<_Item>&) [with _Graph = lemon::GraphExtender; _Item = lemon::ListGraphBase::Node; _Value = lemon::dim2::Point]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/array_map.h:272:44: note: '' declared here 272 | allocator.construct(&(values[id]), Value()); | ^~~~~~~ In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::dim2::Point; _Args = {lemon::dim2::Point}; _Tp = lemon::dim2::Point]', inlined from 'void lemon::ArrayMap<_Graph, _Item, _Value>::add(const Key&) [with _Graph = lemon::GraphExtender; _Item = lemon::ListGraphBase::Node; _Value = lemon::dim2::Point]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/array_map.h:229:26: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/array_map.h: In member function 'void lemon::ArrayMap<_Graph, _Item, _Value>::add(const Key&) [with _Graph = lemon::GraphExtender; _Item = lemon::ListGraphBase::Node; _Value = lemon::dim2::Point]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/array_map.h:229:42: note: '' declared here 229 | allocator.construct(&(values[id]), Value()); | ^~~~~~~ In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::dim2::Point; _Args = {lemon::dim2::Point}; _Tp = lemon::dim2::Point]', inlined from 'void lemon::ArrayMap<_Graph, _Item, _Value>::build() [with _Graph = lemon::GraphExtender; _Item = lemon::ListGraphBase::Node; _Value = lemon::dim2::Point]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/array_map.h:306:28: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/array_map.h: In member function 'void lemon::ArrayMap<_Graph, _Item, _Value>::build() [with _Graph = lemon::GraphExtender; _Item = lemon::ListGraphBase::Node; _Value = lemon::dim2::Point]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/array_map.h:306:44: note: '' declared here 306 | allocator.construct(&(values[id]), Value()); | ^~~~~~~ /usr/include/c++/13/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, vector > >; _Distance = int; _Tp = pair; _Compare = __gnu_cxx::__ops::_Iter_less_iter]': /usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector > >' changed in GCC 7.1 224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, | ^~~~~~~~~~~~~ [ 84%] Linking CXX executable lgf_demo cd /build/reproducible-path/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 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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,-z,relro -Wl,-z,now -rdynamic CMakeFiles/lgf_demo.dir/lgf_demo.cc.o -o lgf_demo -L/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[4]: Leaving directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 84%] Built target lgf_demo make -f tools/CMakeFiles/dimacs-to-lgf.dir/build.make tools/CMakeFiles/dimacs-to-lgf.dir/depend make[4]: Entering directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /build/reproducible-path/liblemon-1.3.1+dfsg /build/reproducible-path/liblemon-1.3.1+dfsg/tools /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/tools /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/tools/CMakeFiles/dimacs-to-lgf.dir/DependInfo.cmake "--color=" make[4]: Leaving directory '/build/reproducible-path/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 '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 88%] Building CXX object tools/CMakeFiles/dimacs-to-lgf.dir/dimacs-to-lgf.cc.o cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/tools && /usr/bin/c++ -I/build/reproducible-path/liblemon-1.3.1+dfsg -I/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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 -MD -MT tools/CMakeFiles/dimacs-to-lgf.dir/dimacs-to-lgf.cc.o -MF CMakeFiles/dimacs-to-lgf.dir/dimacs-to-lgf.cc.o.d -o CMakeFiles/dimacs-to-lgf.dir/dimacs-to-lgf.cc.o -c /build/reproducible-path/liblemon-1.3.1+dfsg/tools/dimacs-to-lgf.cc In file included from /usr/include/c++/13/vector:72, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/core.h:22, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/list_graph.h:26: /usr/include/c++/13/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const lemon::dim2::Point&}; _Tp = lemon::dim2::Point; _Alloc = std::allocator >]': /usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/13/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const Parc&}; _Tp = Parc; _Alloc = std::allocator]': /usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector::iterator' changed in GCC 7.1 /usr/include/c++/13/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const double&}; _Tp = double; _Alloc = std::allocator]': /usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector::iterator' changed in GCC 7.1 /usr/include/c++/13/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {std::pair}; _Tp = std::pair; _Alloc = std::allocator >]': /usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector >::iterator' changed in GCC 7.1 /usr/include/c++/13/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, vector > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]': /usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector > >' changed in GCC 7.1 1812 | __insertion_sort(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector > >' changed in GCC 7.1 In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/dimacs.h:26, from /build/reproducible-path/liblemon-1.3.1+dfsg/tools/dimacs-to-lgf.cc:37: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:1973:21: warning: 'template struct std::iterator' is deprecated [-Wdeprecated-declarations] 1973 | : public std::iterator { | ^~~~~~~~ In file included from /usr/include/c++/13/bits/stl_iterator_base_funcs.h:66, from /usr/include/c++/13/string:47, from /usr/include/c++/13/bits/locale_classes.h:40, from /usr/include/c++/13/bits/ios_base.h:41, from /usr/include/c++/13/ios:44, from /usr/include/c++/13/ostream:40, from /usr/include/c++/13/iostream:41, from /build/reproducible-path/liblemon-1.3.1+dfsg/tools/dimacs-to-lgf.cc:32: /usr/include/c++/13/bits/stl_iterator_base_types.h:127:34: note: declared here 127 | struct _GLIBCXX17_DEPRECATED iterator | ^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:3135:21: warning: 'template struct std::iterator' is deprecated [-Wdeprecated-declarations] 3135 | : public std::iterator { | ^~~~~~~~ /usr/include/c++/13/bits/stl_iterator_base_types.h:127:34: note: declared here 127 | struct _GLIBCXX17_DEPRECATED iterator | ^~~~~~~~ /usr/include/c++/13/bits/stl_algo.h: In function 'void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = __gnu_cxx::__normal_iterator*, vector > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]': /usr/include/c++/13/bits/stl_algo.h:85:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector > >' changed in GCC 7.1 85 | __move_median_to_first(_Iterator __result,_Iterator __a, _Iterator __b, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13/bits/stl_algo.h:85:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector > >' changed in GCC 7.1 /usr/include/c++/13/bits/stl_algo.h:85:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector > >' changed in GCC 7.1 /usr/include/c++/13/bits/stl_algo.h:85:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector > >' changed in GCC 7.1 /usr/include/c++/13/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, vector > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]': /usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector > >' changed in GCC 7.1 In function '_RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, vector > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]', inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, vector > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]' at /usr/include/c++/13/bits/stl_algo.h:1931:38: /usr/include/c++/13/bits/stl_algo.h:1897:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector > >' changed in GCC 7.1 1897 | std::__move_median_to_first(__first, __first + 1, __mid, __last - 1, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1898 | __comp); | ~~~~~~~ /usr/include/c++/13/bits/stl_algo.h:1897:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector > >' changed in GCC 7.1 /usr/include/c++/13/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, vector > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]': /usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13/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++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1792 | __unguarded_linear_insert(_RandomAccessIterator __last, | ^~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13/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++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1812 | __insertion_sort(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 /usr/include/c++/13/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {std::pair}; _Tp = std::pair; _Alloc = std::allocator >]': /usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::allocator > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/13/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, vector, allocator > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter, allocator > > > >]': /usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 /usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/tools/dimacs-to-lgf.cc: In function 'int main(int, const char**)': /build/reproducible-path/liblemon-1.3.1+dfsg/tools/dimacs-to-lgf.cc:73:7: warning: this statement may fall through [-Wimplicit-fallthrough=] 73 | if (!output) { | ^~ /build/reproducible-path/liblemon-1.3.1+dfsg/tools/dimacs-to-lgf.cc:76:5: note: here 76 | case 1: | ^~~~ /usr/include/c++/13/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++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, | ^~~~~~~~~~~~~ /usr/include/c++/13/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++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 /usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/13/vector:66: In member function 'void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = lemon::dim2::Point; _Alloc = std::allocator >]', inlined from 'void delaunay()' at /build/reproducible-path/liblemon-1.3.1+dfsg/tools/lgf-gen.cc:275:21: /usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector > >' changed in GCC 7.1 1289 | _M_realloc_insert(end(), __x); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, vector > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]', inlined from 'void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator*, vector > >]' at /usr/include/c++/13/bits/stl_algo.h:4861:18, inlined from 'void delaunay()' at /build/reproducible-path/liblemon-1.3.1+dfsg/tools/lgf-gen.cc:287:12: /usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, vector > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, vector > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]' at /usr/include/c++/13/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator*, vector > >]' at /usr/include/c++/13/bits/stl_algo.h:4861:18, inlined from 'void delaunay()' at /build/reproducible-path/liblemon-1.3.1+dfsg/tools/lgf-gen.cc:287:12: /usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {std::pair}; _Tp = std::pair; _Alloc = std::allocator >]', inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = std::pair; _Alloc = std::allocator >]' at /usr/include/c++/13/bits/stl_vector.h:1296:21, inlined from 'void delaunay()' at /build/reproducible-path/liblemon-1.3.1+dfsg/tools/lgf-gen.cc:303:22: /usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, vector > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]', inlined from 'void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator*, vector > >]' at /usr/include/c++/13/bits/stl_algo.h:4861:18, inlined from 'void delaunay()' at /build/reproducible-path/liblemon-1.3.1+dfsg/tools/lgf-gen.cc:308:14: /usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, vector > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, vector > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]' at /usr/include/c++/13/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator*, vector > >]' at /usr/include/c++/13/bits/stl_algo.h:4861:18, inlined from 'void delaunay()' at /build/reproducible-path/liblemon-1.3.1+dfsg/tools/lgf-gen.cc:308:14: /usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {std::pair}; _Tp = std::pair; _Alloc = std::allocator >]', inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = std::pair; _Alloc = std::allocator >]' at /usr/include/c++/13/bits/stl_vector.h:1296:21, inlined from 'static lemon::_kruskal_bits::KruskalInputSelector, void>::type>::Value lemon::_kruskal_bits::KruskalInputSelector, void>::type>::kruskal(const Graph&, const In&, Out&) [with Graph = lemon::ListGraph; In = LengthSquareMap::NodeMap > >; Out = lemon::GraphExtender::EdgeMap]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/kruskal.h:200:24, inlined from 'typename lemon::_kruskal_bits::KruskalValueSelector::Value lemon::kruskal(const Graph&, const In&, Out&) [with Graph = ListGraph; In = LengthSquareMap::NodeMap > >; Out = GraphExtender::EdgeMap]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/kruskal.h:310:14, inlined from 'void minTree()' at /build/reproducible-path/liblemon-1.3.1+dfsg/tools/lgf-gen.cc:567:10: /usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, vector, allocator > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter, allocator > > > >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator*, vector, allocator > > >; _Compare = lemon::_kruskal_bits::PairComp, allocator > > >]' at /usr/include/c++/13/bits/stl_algo.h:4894:18, inlined from 'static lemon::_kruskal_bits::KruskalInputSelector, void>::type>::Value lemon::_kruskal_bits::KruskalInputSelector, void>::type>::kruskal(const Graph&, const In&, Out&) [with Graph = lemon::ListGraph; In = LengthSquareMap::NodeMap > >; Out = lemon::GraphExtender::EdgeMap]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/kruskal.h:203:18, inlined from 'typename lemon::_kruskal_bits::KruskalValueSelector::Value lemon::kruskal(const Graph&, const In&, Out&) [with Graph = ListGraph; In = LengthSquareMap::NodeMap > >; Out = GraphExtender::EdgeMap]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/kruskal.h:310:14, inlined from 'void minTree()' at /build/reproducible-path/liblemon-1.3.1+dfsg/tools/lgf-gen.cc:567:10: /usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, vector, allocator > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter, allocator > > > >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, vector, allocator > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter, allocator > > > >]' at /usr/include/c++/13/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator*, vector, allocator > > >; _Compare = lemon::_kruskal_bits::PairComp, allocator > > >]' at /usr/include/c++/13/bits/stl_algo.h:4894:18, inlined from 'static lemon::_kruskal_bits::KruskalInputSelector, void>::type>::Value lemon::_kruskal_bits::KruskalInputSelector, void>::type>::kruskal(const Graph&, const In&, Out&) [with Graph = lemon::ListGraph; In = LengthSquareMap::NodeMap > >; Out = lemon::GraphExtender::EdgeMap]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/kruskal.h:203:18, inlined from 'typename lemon::_kruskal_bits::KruskalValueSelector::Value lemon::kruskal(const Graph&, const In&, Out&) [with Graph = ListGraph; In = LengthSquareMap::NodeMap > >; Out = GraphExtender::EdgeMap]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/kruskal.h:310:14, inlined from 'void minTree()' at /build/reproducible-path/liblemon-1.3.1+dfsg/tools/lgf-gen.cc:567:10: /usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = Parc; _Alloc = std::allocator]', inlined from 'void tsp2()' at /build/reproducible-path/liblemon-1.3.1+dfsg/tools/lgf-gen.cc:607:27: /usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1289 | _M_realloc_insert(end(), __x); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator >; _Compare = bool (*)(Parc, Parc)]' at /usr/include/c++/13/bits/stl_algo.h:4894:18, inlined from 'void tsp2()' at /build/reproducible-path/liblemon-1.3.1+dfsg/tools/lgf-gen.cc:609:14: /usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter]' at /usr/include/c++/13/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator >; _Compare = bool (*)(Parc, Parc)]' at /usr/include/c++/13/bits/stl_algo.h:4894:18, inlined from 'void tsp2()' at /build/reproducible-path/liblemon-1.3.1+dfsg/tools/lgf-gen.cc:609:14: /usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/arm-linux-gnueabihf/c++/13/bits/c++allocator.h:33, from /usr/include/c++/13/bits/allocator.h:46, from /usr/include/c++/13/string:43: In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::ArcT; _Args = {lemon::SmartDigraphBase::ArcT}; _Tp = lemon::SmartDigraphBase::ArcT]', inlined from 'static void std::allocator_traits >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::ArcT; _Args = {lemon::SmartDigraphBase::ArcT}; _Tp = lemon::SmartDigraphBase::ArcT]' at /usr/include/c++/13/bits/alloc_traits.h:538:17, inlined from 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {lemon::SmartDigraphBase::ArcT}; _Tp = lemon::SmartDigraphBase::ArcT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/vector.tcc:117:30, inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = lemon::SmartDigraphBase::ArcT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/stl_vector.h:1296:21, inlined from 'lemon::SmartDigraphBase::Arc lemon::SmartDigraphBase::addArc(Node, Node)' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:85:21, inlined from 'lemon::DigraphExtender::Arc lemon::DigraphExtender::addArc(const Node&, const Node&) [with Base = lemon::SmartDigraphBase]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:274:31: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/tools/dimacs-to-lgf.cc:36: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h: In member function 'lemon::DigraphExtender::Arc lemon::DigraphExtender::addArc(const Node&, const Node&) [with Base = lemon::SmartDigraphBase]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:85:27: note: '' declared here 85 | arcs.push_back(ArcT()); | ^ In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]', inlined from 'static void std::allocator_traits >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]' at /usr/include/c++/13/bits/alloc_traits.h:538:17, inlined from 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/vector.tcc:117:30, inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/stl_vector.h:1296:21, inlined from 'lemon::SmartDigraphBase::Node lemon::SmartDigraphBase::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:22, inlined from 'lemon::DigraphExtender::Node lemon::DigraphExtender::addNode() [with Base = lemon::SmartDigraphBase]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:268:34, inlined from 'lemon::DigraphExtender::Node lemon::SmartDigraph::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:223:44, inlined from 'void lemon::readDimacsMin(std::istream&, Digraph&, LowerMap&, CapacityMap&, CostMap&, SupplyMap&, typename CapacityMap::Value, DimacsDescriptor) [with Digraph = SmartDigraph; LowerMap = DigraphExtender::ArcMap; CapacityMap = DigraphExtender::ArcMap; CostMap = DigraphExtender::ArcMap; SupplyMap = DigraphExtender::NodeMap]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/dimacs.h:150:27: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h: In function 'void lemon::readDimacsMin(std::istream&, Digraph&, LowerMap&, CapacityMap&, CostMap&, SupplyMap&, typename CapacityMap::Value, DimacsDescriptor) [with Digraph = SmartDigraph; LowerMap = DigraphExtender::ArcMap; CapacityMap = DigraphExtender::ArcMap; CostMap = DigraphExtender::ArcMap; SupplyMap = DigraphExtender::NodeMap]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:29: note: '' declared here 77 | nodes.push_back(NodeT()); | ^ In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]', inlined from 'static void std::allocator_traits >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]' at /usr/include/c++/13/bits/alloc_traits.h:538:17, inlined from 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/vector.tcc:117:30, inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/stl_vector.h:1296:21, inlined from 'lemon::SmartDigraphBase::Node lemon::SmartDigraphBase::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:22, inlined from 'lemon::DigraphExtender::Node lemon::DigraphExtender::addNode() [with Base = lemon::SmartDigraphBase]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:268:34, inlined from 'lemon::DigraphExtender::Node lemon::SmartDigraph::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:223:44, inlined from 'void lemon::readDimacsMat(std::istream&, Graph&, DimacsDescriptor) [with Graph = SmartDigraph]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/dimacs.h:393:27: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h: In function 'void lemon::readDimacsMat(std::istream&, Graph&, DimacsDescriptor) [with Graph = SmartDigraph]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:29: note: '' declared here 77 | nodes.push_back(NodeT()); | ^ In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]', inlined from 'static void std::allocator_traits >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]' at /usr/include/c++/13/bits/alloc_traits.h:538:17, inlined from 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/vector.tcc:117:30, inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/stl_vector.h:1296:21, inlined from 'lemon::SmartDigraphBase::Node lemon::SmartDigraphBase::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:22, inlined from 'lemon::DigraphExtender::Node lemon::DigraphExtender::addNode() [with Base = lemon::SmartDigraphBase]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:268:34, inlined from 'lemon::DigraphExtender::Node lemon::SmartDigraph::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:223:44, inlined from 'void lemon::_readDimacs(std::istream&, Digraph&, CapacityMap&, typename Digraph::Node&, typename Digraph::Node&, typename CapacityMap::Value, DimacsDescriptor) [with Digraph = SmartDigraph; CapacityMap = DigraphExtender::ArcMap]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/dimacs.h:207:27: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h: In function 'void lemon::_readDimacs(std::istream&, Digraph&, CapacityMap&, typename Digraph::Node&, typename Digraph::Node&, typename CapacityMap::Value, DimacsDescriptor) [with Digraph = SmartDigraph; CapacityMap = DigraphExtender::ArcMap]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:29: note: '' declared here 77 | nodes.push_back(NodeT()); | ^ In member function 'void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = Parc; _Alloc = std::allocator]', inlined from 'void sparseTriangle(int)' at /build/reproducible-path/liblemon-1.3.1+dfsg/tools/lgf-gen.cc:516:25: /usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1289 | _M_realloc_insert(end(), __x); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator >; _Compare = bool (*)(Parc, Parc)]' at /usr/include/c++/13/bits/stl_algo.h:4894:18, inlined from 'void sparseTriangle(int)' at /build/reproducible-path/liblemon-1.3.1+dfsg/tools/lgf-gen.cc:518:12: /usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter]' at /usr/include/c++/13/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator >; _Compare = bool (*)(Parc, Parc)]' at /usr/include/c++/13/bits/stl_algo.h:4894:18, inlined from 'void sparseTriangle(int)' at /build/reproducible-path/liblemon-1.3.1+dfsg/tools/lgf-gen.cc:518:12: /usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ [ 92%] Linking CXX executable dimacs-to-lgf cd /build/reproducible-path/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 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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,-z,relro -Wl,-z,now -rdynamic "CMakeFiles/dimacs-to-lgf.dir/dimacs-to-lgf.cc.o" -o dimacs-to-lgf -L/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon: ../lemon/liblemon.so.1.3.1 -lglpk make[4]: Leaving directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 92%] Built target dimacs-to-lgf make -f tools/CMakeFiles/dimacs-solver.dir/build.make tools/CMakeFiles/dimacs-solver.dir/depend make[4]: Entering directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /build/reproducible-path/liblemon-1.3.1+dfsg /build/reproducible-path/liblemon-1.3.1+dfsg/tools /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/tools /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/tools/CMakeFiles/dimacs-solver.dir/DependInfo.cmake "--color=" make[4]: Leaving directory '/build/reproducible-path/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 '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 92%] Building CXX object tools/CMakeFiles/dimacs-solver.dir/dimacs-solver.cc.o cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/tools && /usr/bin/c++ -I/build/reproducible-path/liblemon-1.3.1+dfsg -I/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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 -MD -MT tools/CMakeFiles/dimacs-solver.dir/dimacs-solver.cc.o -MF CMakeFiles/dimacs-solver.dir/dimacs-solver.cc.o.d -o CMakeFiles/dimacs-solver.dir/dimacs-solver.cc.o -c /build/reproducible-path/liblemon-1.3.1+dfsg/tools/dimacs-solver.cc In member function 'void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = double; _Alloc = std::allocator]', inlined from 'int main(int, const char**)' at /build/reproducible-path/liblemon-1.3.1+dfsg/tools/lgf-gen.cc:768:22: /usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1289 | _M_realloc_insert(end(), __x); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = double; _Alloc = std::allocator]', inlined from 'int main(int, const char**)' at /build/reproducible-path/liblemon-1.3.1+dfsg/tools/lgf-gen.cc:769:26: /usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1289 | _M_realloc_insert(end(), __x); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~ [ 92%] Linking CXX executable graph_to_eps_demo cd /build/reproducible-path/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 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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,-z,relro -Wl,-z,now -rdynamic CMakeFiles/graph_to_eps_demo.dir/graph_to_eps_demo.cc.o -o graph_to_eps_demo -L/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::dim2::Point; _Args = {lemon::dim2::Point}; _Tp = lemon::dim2::Point]', inlined from 'lemon::ArrayMap<_Graph, _Item, _Value>::ArrayMap(const GraphType&) [with _Graph = lemon::GraphExtender; _Item = lemon::ListGraphBase::Node; _Value = lemon::dim2::Point]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/array_map.h:91:28, inlined from 'lemon::DefaultMap<_Graph, _Item, _Value>::DefaultMap(const GraphType&) [with _Graph = lemon::GraphExtender; _Item = lemon::ListGraphBase::Node; _Value = lemon::dim2::Point]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/default_map.h:164:63, inlined from 'lemon::MapExtender<_Map>::MapExtender(const GraphType&) [with _Map = lemon::DefaultMap, lemon::ListGraphBase::Node, lemon::dim2::Point >]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/map_extender.h:63:21, inlined from 'lemon::GraphExtender::NodeMap<_Value>::NodeMap(const lemon::GraphExtender::Graph&) [with _Value = lemon::dim2::Point; Base = lemon::ListGraphBase]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:608:23, inlined from 'void __static_initialization_and_destruction_0()' at /build/reproducible-path/liblemon-1.3.1+dfsg/tools/lgf-gen.cc:62:35, inlined from '(static initializers for /build/reproducible-path/liblemon-1.3.1+dfsg/tools/lgf-gen.cc)' at /build/reproducible-path/liblemon-1.3.1+dfsg/tools/lgf-gen.cc:846:1: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/array_map.h: In function '(static initializers for /build/reproducible-path/liblemon-1.3.1+dfsg/tools/lgf-gen.cc)': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/array_map.h:91:44: note: '' declared here 91 | allocator.construct(&(values[id]), Value()); | ^~~~~~~ make[4]: Leaving directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 92%] Built target graph_to_eps_demo In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/dimacs.h:26, from /build/reproducible-path/liblemon-1.3.1+dfsg/tools/dimacs-solver.cc:36: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:1973:21: warning: 'template struct std::iterator' is deprecated [-Wdeprecated-declarations] 1973 | : public std::iterator { | ^~~~~~~~ In file included from /usr/include/c++/13/bits/stl_iterator_base_funcs.h:66, from /usr/include/c++/13/string:47, from /usr/include/c++/13/bits/locale_classes.h:40, from /usr/include/c++/13/bits/ios_base.h:41, from /usr/include/c++/13/ios:44, from /usr/include/c++/13/ostream:40, from /usr/include/c++/13/iostream:41, from /build/reproducible-path/liblemon-1.3.1+dfsg/tools/dimacs-solver.cc:31: /usr/include/c++/13/bits/stl_iterator_base_types.h:127:34: note: declared here 127 | struct _GLIBCXX17_DEPRECATED iterator | ^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:3135:21: warning: 'template struct std::iterator' is deprecated [-Wdeprecated-declarations] 3135 | : public std::iterator { | ^~~~~~~~ /usr/include/c++/13/bits/stl_iterator_base_types.h:127:34: note: declared here 127 | struct _GLIBCXX17_DEPRECATED iterator | ^~~~~~~~ [ 96%] Linking CXX executable lgf-gen cd /build/reproducible-path/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 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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,-z,relro -Wl,-z,now -rdynamic "CMakeFiles/lgf-gen.dir/lgf-gen.cc.o" -o lgf-gen -L/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon: ../lemon/liblemon.so.1.3.1 -lglpk make[4]: Leaving directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 96%] Built target lgf-gen In file included from /usr/include/arm-linux-gnueabihf/c++/13/bits/c++allocator.h:33, from /usr/include/c++/13/bits/allocator.h:46, from /usr/include/c++/13/string:43: In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::ArcT; _Args = {lemon::SmartDigraphBase::ArcT}; _Tp = lemon::SmartDigraphBase::ArcT]', inlined from 'static void std::allocator_traits >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::ArcT; _Args = {lemon::SmartDigraphBase::ArcT}; _Tp = lemon::SmartDigraphBase::ArcT]' at /usr/include/c++/13/bits/alloc_traits.h:538:17, inlined from 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {lemon::SmartDigraphBase::ArcT}; _Tp = lemon::SmartDigraphBase::ArcT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/vector.tcc:117:30, inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = lemon::SmartDigraphBase::ArcT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/stl_vector.h:1296:21, inlined from 'lemon::SmartDigraphBase::Arc lemon::SmartDigraphBase::addArc(Node, Node)' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:85:21, inlined from 'lemon::DigraphExtender::Arc lemon::DigraphExtender::addArc(const Node&, const Node&) [with Base = lemon::SmartDigraphBase]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:274:31: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/tools/dimacs-solver.cc:35: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h: In member function 'lemon::DigraphExtender::Arc lemon::DigraphExtender::addArc(const Node&, const Node&) [with Base = lemon::SmartDigraphBase]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:85:27: note: '' declared here 85 | arcs.push_back(ArcT()); | ^ In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]', inlined from 'static void std::allocator_traits >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]' at /usr/include/c++/13/bits/alloc_traits.h:538:17, inlined from 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/vector.tcc:117:30, inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/stl_vector.h:1296:21, inlined from 'lemon::SmartDigraphBase::Node lemon::SmartDigraphBase::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:22, inlined from 'lemon::DigraphExtender::Node lemon::DigraphExtender::addNode() [with Base = lemon::SmartDigraphBase]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:268:34, inlined from 'lemon::DigraphExtender::Node lemon::SmartDigraph::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:223:44, inlined from 'void lemon::readDimacsMin(std::istream&, Digraph&, LowerMap&, CapacityMap&, CostMap&, SupplyMap&, typename CapacityMap::Value, DimacsDescriptor) [with Digraph = SmartDigraph; LowerMap = DigraphExtender::ArcMap; CapacityMap = DigraphExtender::ArcMap; CostMap = DigraphExtender::ArcMap; SupplyMap = DigraphExtender::NodeMap]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/dimacs.h:150:27: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h: In function 'void lemon::readDimacsMin(std::istream&, Digraph&, LowerMap&, CapacityMap&, CostMap&, SupplyMap&, typename CapacityMap::Value, DimacsDescriptor) [with Digraph = SmartDigraph; LowerMap = DigraphExtender::ArcMap; CapacityMap = DigraphExtender::ArcMap; CostMap = DigraphExtender::ArcMap; SupplyMap = DigraphExtender::NodeMap]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:29: note: '' declared here 77 | nodes.push_back(NodeT()); | ^ In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]', inlined from 'static void std::allocator_traits >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]' at /usr/include/c++/13/bits/alloc_traits.h:538:17, inlined from 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/vector.tcc:117:30, inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/stl_vector.h:1296:21, inlined from 'lemon::SmartDigraphBase::Node lemon::SmartDigraphBase::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:22, inlined from 'lemon::DigraphExtender::Node lemon::DigraphExtender::addNode() [with Base = lemon::SmartDigraphBase]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:268:34, inlined from 'lemon::DigraphExtender::Node lemon::SmartDigraph::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:223:44, inlined from 'void lemon::_readDimacs(std::istream&, Digraph&, CapacityMap&, typename Digraph::Node&, typename Digraph::Node&, typename CapacityMap::Value, DimacsDescriptor) [with Digraph = SmartDigraph; CapacityMap = DigraphExtender::ArcMap]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/dimacs.h:207:27: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h: In function 'void lemon::_readDimacs(std::istream&, Digraph&, CapacityMap&, typename Digraph::Node&, typename Digraph::Node&, typename CapacityMap::Value, DimacsDescriptor) [with Digraph = SmartDigraph; CapacityMap = DigraphExtender::ArcMap]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:29: note: '' declared here 77 | nodes.push_back(NodeT()); | ^ In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]', inlined from 'static void std::allocator_traits >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]' at /usr/include/c++/13/bits/alloc_traits.h:538:17, inlined from 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/vector.tcc:117:30, inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/stl_vector.h:1296:21, inlined from 'lemon::SmartDigraphBase::Node lemon::SmartDigraphBase::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:22, inlined from 'lemon::DigraphExtender::Node lemon::DigraphExtender::addNode() [with Base = lemon::SmartDigraphBase]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:268:34, inlined from 'lemon::DigraphExtender::Node lemon::SmartDigraph::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:223:44, inlined from 'void lemon::_readDimacs(std::istream&, Digraph&, CapacityMap&, typename Digraph::Node&, typename Digraph::Node&, typename CapacityMap::Value, DimacsDescriptor) [with Digraph = SmartDigraph; CapacityMap = DigraphExtender::ArcMap]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/dimacs.h:207:27: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h: In function 'void lemon::_readDimacs(std::istream&, Digraph&, CapacityMap&, typename Digraph::Node&, typename Digraph::Node&, typename CapacityMap::Value, DimacsDescriptor) [with Digraph = SmartDigraph; CapacityMap = DigraphExtender::ArcMap]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:29: note: '' declared here 77 | nodes.push_back(NodeT()); | ^ In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]', inlined from 'static void std::allocator_traits >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]' at /usr/include/c++/13/bits/alloc_traits.h:538:17, inlined from 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/vector.tcc:117:30, inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/stl_vector.h:1296:21, inlined from 'lemon::SmartDigraphBase::Node lemon::SmartDigraphBase::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:22, inlined from 'lemon::DigraphExtender::Node lemon::DigraphExtender::addNode() [with Base = lemon::SmartDigraphBase]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:268:34, inlined from 'lemon::DigraphExtender::Node lemon::SmartDigraph::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:223:44, inlined from 'void lemon::_readDimacs(std::istream&, Digraph&, CapacityMap&, typename Digraph::Node&, typename Digraph::Node&, typename CapacityMap::Value, DimacsDescriptor) [with Digraph = SmartDigraph; CapacityMap = DigraphExtender::ArcMap]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/dimacs.h:207:27: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h: In function 'void lemon::_readDimacs(std::istream&, Digraph&, CapacityMap&, typename Digraph::Node&, typename Digraph::Node&, typename CapacityMap::Value, DimacsDescriptor) [with Digraph = SmartDigraph; CapacityMap = DigraphExtender::ArcMap]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:29: note: '' declared here 77 | nodes.push_back(NodeT()); | ^ In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]', inlined from 'static void std::allocator_traits >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]' at /usr/include/c++/13/bits/alloc_traits.h:538:17, inlined from 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/vector.tcc:117:30, inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/stl_vector.h:1296:21, inlined from 'lemon::SmartDigraphBase::Node lemon::SmartDigraphBase::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:22, inlined from 'lemon::DigraphExtender::Node lemon::DigraphExtender::addNode() [with Base = lemon::SmartDigraphBase]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:268:34, inlined from 'lemon::DigraphExtender::Node lemon::SmartDigraph::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:223:44, inlined from 'void lemon::_readDimacs(std::istream&, Digraph&, CapacityMap&, typename Digraph::Node&, typename Digraph::Node&, typename CapacityMap::Value, DimacsDescriptor) [with Digraph = SmartDigraph; CapacityMap = DigraphExtender::ArcMap]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/dimacs.h:207:27: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h: In function 'void lemon::_readDimacs(std::istream&, Digraph&, CapacityMap&, typename Digraph::Node&, typename Digraph::Node&, typename CapacityMap::Value, DimacsDescriptor) [with Digraph = SmartDigraph; CapacityMap = DigraphExtender::ArcMap]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:29: note: '' declared here 77 | nodes.push_back(NodeT()); | ^ In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]', inlined from 'static void std::allocator_traits >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]' at /usr/include/c++/13/bits/alloc_traits.h:538:17, inlined from 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/vector.tcc:117:30, inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/stl_vector.h:1296:21, inlined from 'lemon::SmartDigraphBase::Node lemon::SmartDigraphBase::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:22, inlined from 'lemon::DigraphExtender::Node lemon::DigraphExtender::addNode() [with Base = lemon::SmartDigraphBase]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:268:34, inlined from 'lemon::DigraphExtender::Node lemon::SmartDigraph::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:223:44, inlined from 'void lemon::readDimacsMin(std::istream&, Digraph&, LowerMap&, CapacityMap&, CostMap&, SupplyMap&, typename CapacityMap::Value, DimacsDescriptor) [with Digraph = SmartDigraph; LowerMap = DigraphExtender::ArcMap; CapacityMap = DigraphExtender::ArcMap; CostMap = DigraphExtender::ArcMap; SupplyMap = DigraphExtender::NodeMap]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/dimacs.h:150:27: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h: In function 'void lemon::readDimacsMin(std::istream&, Digraph&, LowerMap&, CapacityMap&, CostMap&, SupplyMap&, typename CapacityMap::Value, DimacsDescriptor) [with Digraph = SmartDigraph; LowerMap = DigraphExtender::ArcMap; CapacityMap = DigraphExtender::ArcMap; CostMap = DigraphExtender::ArcMap; SupplyMap = DigraphExtender::NodeMap]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:29: note: '' declared here 77 | nodes.push_back(NodeT()); | ^ In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]', inlined from 'static void std::allocator_traits >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]' at /usr/include/c++/13/bits/alloc_traits.h:538:17, inlined from 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/vector.tcc:117:30, inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/stl_vector.h:1296:21, inlined from 'lemon::SmartDigraphBase::Node lemon::SmartDigraphBase::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:22, inlined from 'lemon::DigraphExtender::Node lemon::DigraphExtender::addNode() [with Base = lemon::SmartDigraphBase]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:268:34, inlined from 'lemon::DigraphExtender::Node lemon::SmartDigraph::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:223:44, inlined from 'void lemon::readDimacsMin(std::istream&, Digraph&, LowerMap&, CapacityMap&, CostMap&, SupplyMap&, typename CapacityMap::Value, DimacsDescriptor) [with Digraph = SmartDigraph; LowerMap = DigraphExtender::ArcMap; CapacityMap = DigraphExtender::ArcMap; CostMap = DigraphExtender::ArcMap; SupplyMap = DigraphExtender::NodeMap]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/dimacs.h:150:27: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h: In function 'void lemon::readDimacsMin(std::istream&, Digraph&, LowerMap&, CapacityMap&, CostMap&, SupplyMap&, typename CapacityMap::Value, DimacsDescriptor) [with Digraph = SmartDigraph; LowerMap = DigraphExtender::ArcMap; CapacityMap = DigraphExtender::ArcMap; CostMap = DigraphExtender::ArcMap; SupplyMap = DigraphExtender::NodeMap]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:29: note: '' declared here 77 | nodes.push_back(NodeT()); | ^ In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]', inlined from 'static void std::allocator_traits >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]' at /usr/include/c++/13/bits/alloc_traits.h:538:17, inlined from 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/vector.tcc:117:30, inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/stl_vector.h:1296:21, inlined from 'lemon::SmartDigraphBase::Node lemon::SmartDigraphBase::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:22, inlined from 'lemon::DigraphExtender::Node lemon::DigraphExtender::addNode() [with Base = lemon::SmartDigraphBase]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:268:34, inlined from 'lemon::DigraphExtender::Node lemon::SmartDigraph::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:223:44, inlined from 'void lemon::readDimacsMin(std::istream&, Digraph&, LowerMap&, CapacityMap&, CostMap&, SupplyMap&, typename CapacityMap::Value, DimacsDescriptor) [with Digraph = SmartDigraph; LowerMap = DigraphExtender::ArcMap; CapacityMap = DigraphExtender::ArcMap; CostMap = DigraphExtender::ArcMap; SupplyMap = DigraphExtender::NodeMap]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/dimacs.h:150:27: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h: In function 'void lemon::readDimacsMin(std::istream&, Digraph&, LowerMap&, CapacityMap&, CostMap&, SupplyMap&, typename CapacityMap::Value, DimacsDescriptor) [with Digraph = SmartDigraph; LowerMap = DigraphExtender::ArcMap; CapacityMap = DigraphExtender::ArcMap; CostMap = DigraphExtender::ArcMap; SupplyMap = DigraphExtender::NodeMap]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:29: note: '' declared here 77 | nodes.push_back(NodeT()); | ^ [100%] Linking CXX executable dimacs-solver cd /build/reproducible-path/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 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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,-z,relro -Wl,-z,now -rdynamic "CMakeFiles/dimacs-solver.dir/dimacs-solver.cc.o" -o dimacs-solver -L/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon: ../lemon/liblemon.so.1.3.1 -lglpk make[4]: Leaving directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [100%] Built target dimacs-solver make[3]: Leaving directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' /usr/bin/cmake -E cmake_progress_start /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/CMakeFiles 0 make[2]: Leaving directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd obj-*/doc && make html make[2]: Entering directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/doc' cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && make -f CMakeFiles/Makefile2 doc/CMakeFiles/html.dir/rule make[3]: Entering directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' /usr/bin/cmake -S/build/reproducible-path/liblemon-1.3.1+dfsg -B/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf --check-build-system CMakeFiles/Makefile.cmake 0 /usr/bin/cmake -E cmake_progress_start /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/CMakeFiles 0 make -f CMakeFiles/Makefile2 doc/CMakeFiles/html.dir/all make[4]: Entering directory '/build/reproducible-path/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 '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /build/reproducible-path/liblemon-1.3.1+dfsg /build/reproducible-path/liblemon-1.3.1+dfsg/doc /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/doc /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/doc/CMakeFiles/html.dir/DependInfo.cmake "--color=" make[5]: Leaving directory '/build/reproducible-path/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 '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/doc && /usr/bin/cmake -E remove_directory gen-images cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/doc && /usr/bin/cmake -E make_directory gen-images cd /build/reproducible-path/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 /build/reproducible-path/liblemon-1.3.1+dfsg/doc/images/grid_graph.eps cd /build/reproducible-path/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 /build/reproducible-path/liblemon-1.3.1+dfsg/doc/images/adaptors2.eps cd /build/reproducible-path/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 /build/reproducible-path/liblemon-1.3.1+dfsg/doc/images/connected_components.eps cd /build/reproducible-path/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 /build/reproducible-path/liblemon-1.3.1+dfsg/doc/images/strongly_connected_components.eps cd /build/reproducible-path/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 /build/reproducible-path/liblemon-1.3.1+dfsg/doc/images/node_biconnected_components.eps cd /build/reproducible-path/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 /build/reproducible-path/liblemon-1.3.1+dfsg/doc/images/edge_biconnected_components.eps cd /build/reproducible-path/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 /build/reproducible-path/liblemon-1.3.1+dfsg/doc/images/bipartite_partitions.eps cd /build/reproducible-path/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 /build/reproducible-path/liblemon-1.3.1+dfsg/doc/images/matching.eps cd /build/reproducible-path/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 /build/reproducible-path/liblemon-1.3.1+dfsg/doc/images/bipartite_matching.eps cd /build/reproducible-path/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 /build/reproducible-path/liblemon-1.3.1+dfsg/doc/images/planar.eps cd /build/reproducible-path/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 /build/reproducible-path/liblemon-1.3.1+dfsg/doc/images/tsp.eps cd /build/reproducible-path/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 /build/reproducible-path/liblemon-1.3.1+dfsg/doc/images/nodeshape_0.eps cd /build/reproducible-path/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 /build/reproducible-path/liblemon-1.3.1+dfsg/doc/images/nodeshape_1.eps cd /build/reproducible-path/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 /build/reproducible-path/liblemon-1.3.1+dfsg/doc/images/nodeshape_2.eps cd /build/reproducible-path/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 /build/reproducible-path/liblemon-1.3.1+dfsg/doc/images/nodeshape_3.eps cd /build/reproducible-path/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 /build/reproducible-path/liblemon-1.3.1+dfsg/doc/images/nodeshape_4.eps cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/doc && /usr/bin/cmake -E remove_directory html cd /build/reproducible-path/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 'COLS_IN_ALPHA_INDEX' at line 138 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_TIMESTAMP' at line 152 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 'FORMULA_TRANSPARENT' at line 184 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 'LATEX_SOURCE_CODE' at line 205 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: Tag 'PERL_PATH' at line 260 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 'CLASS_DIAGRAMS' at line 264 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 'MSCGEN_PATH' at line 265 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 'DOT_FONTNAME' at line 269 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 'DOT_FONTSIZE' at line 270 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 'DOT_TRANSPARENT' at line 289 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: argument 'a4wide' for option PAPER_TYPE is not a valid enum value Using the default: a4! 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. Doxygen version used: 1.9.8 Parsing layout file /build/reproducible-path/liblemon-1.3.1+dfsg/doc/DoxygenLayout.xml... Searching for include files... Searching for example files... Searching for files in directory /build/reproducible-path/liblemon-1.3.1+dfsg/demo Searching for files in directory /build/reproducible-path/liblemon-1.3.1+dfsg/doc Searching for images... Searching for files in directory /build/reproducible-path/liblemon-1.3.1+dfsg/doc/images Searching for files in directory /build/reproducible-path/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 /build/reproducible-path/liblemon-1.3.1+dfsg/doc Searching for files in directory /build/reproducible-path/liblemon-1.3.1+dfsg/lemon Searching for files in directory /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits Searching for files in directory /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts Searching for files in directory /build/reproducible-path/liblemon-1.3.1+dfsg/demo Searching for files in directory /build/reproducible-path/liblemon-1.3.1+dfsg/contrib Searching for files in directory /build/reproducible-path/liblemon-1.3.1+dfsg/tools Reading and parsing tag files Parsing files Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/doc/coding_style.dox... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/doc/coding_style.dox... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/doc/dirs.dox... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/doc/dirs.dox... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/doc/groups.dox... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/doc/groups.dox... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/doc/lgf.dox... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/doc/lgf.dox... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/doc/license.dox... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/doc/license.dox... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/doc/migration.dox... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/doc/migration.dox... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/doc/min_cost_flow.dox... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/doc/min_cost_flow.dox... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/doc/named-param.dox... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/doc/named-param.dox... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/doc/namespaces.dox... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/doc/namespaces.dox... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/doc/template.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/doc/template.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/adaptors.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/adaptors.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/arg_parser.cc... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/arg_parser.cc... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/arg_parser.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/arg_parser.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/assert.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/assert.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/base.cc... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/base.cc... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bellman_ford.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bellman_ford.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bfs.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bfs.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bin_heap.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bin_heap.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/binomial_heap.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/binomial_heap.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bucket_heap.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bucket_heap.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/capacity_scaling.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/capacity_scaling.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/cbc.cc... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/cbc.cc... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/cbc.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/cbc.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/christofides_tsp.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/christofides_tsp.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/circulation.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/circulation.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/clp.cc... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/clp.cc... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/clp.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/clp.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/color.cc... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/color.cc... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/color.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/color.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/connectivity.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/connectivity.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/core.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/core.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/cost_scaling.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/cost_scaling.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/counter.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/counter.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/cplex.cc... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/cplex.cc... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/cplex.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/cplex.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/dfs.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/dfs.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/dheap.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/dheap.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/dijkstra.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/dijkstra.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/dim2.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/dim2.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/dimacs.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/dimacs.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/edge_set.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/edge_set.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/edmonds_karp.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/edmonds_karp.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/elevator.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/elevator.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/error.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/error.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/euler.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/euler.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/fib_heap.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/fib_heap.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/fractional_matching.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/fractional_matching.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/full_graph.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/full_graph.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/glpk.cc... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/glpk.cc... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/glpk.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/glpk.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/gomory_hu.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/gomory_hu.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/graph_to_eps.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/graph_to_eps.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/greedy_tsp.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/greedy_tsp.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/grid_graph.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/grid_graph.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/grosso_locatelli_pullan_mc.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/grosso_locatelli_pullan_mc.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/hao_orlin.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/hao_orlin.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/hartmann_orlin_mmc.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/hartmann_orlin_mmc.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/howard_mmc.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/howard_mmc.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/hypercube_graph.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/hypercube_graph.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/insertion_tsp.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/insertion_tsp.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/karp_mmc.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/karp_mmc.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/kruskal.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/kruskal.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lgf_reader.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lgf_reader.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lgf_writer.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lgf_writer.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/list_graph.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/list_graph.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lp.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lp.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lp_base.cc... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lp_base.cc... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lp_base.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lp_base.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lp_skeleton.cc... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lp_skeleton.cc... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lp_skeleton.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lp_skeleton.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/matching.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/matching.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/math.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/math.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/max_cardinality_search.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/max_cardinality_search.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/min_cost_arborescence.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/min_cost_arborescence.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/nagamochi_ibaraki.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/nagamochi_ibaraki.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/nauty_reader.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/nauty_reader.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/nearest_neighbor_tsp.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/nearest_neighbor_tsp.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/network_simplex.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/network_simplex.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/opt2_tsp.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/opt2_tsp.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/pairing_heap.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/pairing_heap.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/path.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/path.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/planarity.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/planarity.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/preflow.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/preflow.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/quad_heap.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/quad_heap.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/radix_heap.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/radix_heap.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/radix_sort.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/radix_sort.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/random.cc... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/random.cc... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/random.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/random.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/soplex.cc... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/soplex.cc... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/soplex.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/soplex.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/static_graph.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/static_graph.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/suurballe.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/suurballe.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/time_measure.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/time_measure.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/tolerance.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/tolerance.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/unionfind.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/unionfind.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/alteration_notifier.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/alteration_notifier.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/array_map.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/array_map.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/bezier.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/bezier.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/default_map.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/default_map.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/edge_set_extender.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/edge_set_extender.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/enable_if.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/enable_if.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_adaptor_extender.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_adaptor_extender.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/lock.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/lock.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/map_extender.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/map_extender.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/path_dump.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/path_dump.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/solver_bits.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/solver_bits.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/traits.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/traits.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/variant.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/variant.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/vector_map.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/vector_map.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/windows.cc... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/windows.cc... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/windows.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/windows.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h... Preprocessing /build/reproducible-path/lerror opening bib30993.bbl: No such file or directory bibtex command failed: No such file or directory sh: 1: latex: not found sh: 1: latex: not found iblemon-1.3.1+dfsg/lemon/concepts/graph.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/heap.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/heap.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/maps.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/maps.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/path.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/path.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/demo/arg_parser_demo.cc... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/demo/arg_parser_demo.cc... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/demo/graph_to_eps_demo.cc... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/demo/graph_to_eps_demo.cc... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/demo/lgf_demo.cc... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/demo/lgf_demo.cc... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/tools/dimacs-solver.cc... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/tools/dimacs-solver.cc... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/tools/dimacs-to-lgf.cc... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/tools/dimacs-to-lgf.cc... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/tools/lgf-gen.cc... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/tools/lgf-gen.cc... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/test/test_tools.h... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/test/test_tools.h... Preprocessing /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/doc/mainpage.dox... Parsing file /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/doc/mainpage.dox... Building macro definition list... Building group list... Building directory list... Building namespace list... Building file list... Building class list... Building concept list... Computing nesting relations for classes... Associating documentation with classes... Associating documentation with concepts... Associating documentation with modules... 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... Computing module relations... Sorting lists... 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... Setting anonymous enum type... Computing dependencies between directories... Generating citations page... Counting members... 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... Correcting members for VHDL... Computing tooltip texts... Generating style sheet... Generating search indices... Generating images for formulas in HTML... 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/concepts/maps.h... Generating docs for file lemon/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/concepts/path.h... Generating docs for file lemon/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 concept documentation... Generating module documentation... Generating namespace documentation... 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..Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories . 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... Generating 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 index page... Generating main page... 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 plantuml with JAVA... Running dot... Generating dot graphs using 5 parallel threads... Running dot for graph 1/205 Running dot for graph 2/205 Running dot for graph 3/205 Running dot for graph 4/205 Running dot for graph 5/205 Running dot for graph 6/205 Running dot for graph 7/205 Running dot for graph 8/205 Running dot for graph 9/205 Running dot for graph 10/205 Running dot for graph 11/205 Running dot for graph 12/205 Running dot for graph 13/205 Running dot for graph 14/205 Running dot for graph 15/205 Running dot for graph 16/205 Running dot for graph 17/205 Running dot for graph 18/205 Running dot for graph 19/205 Running dot for graphFontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories 20/205 Running dot for graph 21/205 Running dot for graph 22/205 Running dot for graph 23/205 Running dot for graph 24/205 Running dot for graph 25/205 Running dot for graph 26/205 Running dot for graph 27/205 Running dot for graph 28/205 Running dot for graph 29/205 Running dot for graph 30/205 Running dot for graph 31/205 Running dot for graph 32/205 Running dot for graph 33/205 Running dot for graph 34/205 Running dot for graph 35/205 Running dot for graph 36/205 Running dot for graph 37/205 Running dot for graph 38/205 Running dot for graph 39/205 Running dot for graph 40/205 Running dot for graph 41/205 Running dot for graph 42/205 Running dot for graph 43/205 Running dot for graph 44/205 Running dot for graph 45/205 Running dot for graph 46/205 Running dot for graph 47/205 Running dot for graph 48/205 Running dot for graph 49/205 Running dot for graph 50/205 Running dot for graph 51/205 Running dot for graph 52/205 Running dot for graph 53/205 Running dot for graph 54/205 Running dot for graph 55/205 Running dot for graph 56/205 Running dot for graph 57/205 Running dot for graph 58/205 Running dot for graph 59/205 Running dot for graph 60/205 Running dot for graph 61/205 Running dot for graph 62/205 Running dot for graph 63/205 Running dot for graph 64/205 Running dot for graph 65/205 Running dot for graph 66/205 Running dot for graph 67/205 Running dot for graph 68/205 Running dot for graph 69/205 Running dot for graph 70/205 Running dot for graph 71/205 Running dot for graph 72/205 Running dot for graph 73/205 Running dot for graph 74/205 Running dot for graph 75/205 Running dot for graph 76/205 Running dot for graph 77/205 Running dot for graph 78/205 Running dot for graph 79/205 Running dot for graph 80/205 Running dot for graph 81/205 Running dot for graph 82/205 Running dot for graph 83/205 Running dot for graph 84/205 Running dot for graph 85/205 Running dot for graph 86/205 Running dot for graph 87/205 Running dot for graph 88/205 Running dot for graph 89/205 Running dot for graph 90/205 Running dot for graph 91/205 Running dot for graph 92/205 Running dot for graph 93/205 Running dot for graph 94/205 Running dot for graph 95/205 Running dot for graph 96/205 Running dot for graph 97/205 Running dot for graph 98/205 Running dot for graph 99/205 Running dot for graph 100/205 Running dot for graph 101/205 Running dot for graph 102/205 Running dot for graph 103/205 Running dot for graph 104/205 Running dot for graph 105/205 Running dot for graph 106/205 Running dot for graph 107/205 Running dot for graph 108/205 Running dot for graph 109/205 Running dot for graph 110/205 Running dot for graph 111/205 Running dot for graph 112/205 Running dot for graph 113/205 Running dot for graph 114/205 Running dot for graph 115/205 Running dot for graph 116/205 Running dot for graph 117/205 Running dot for graph 118/205 Running dot for graph 119/205 Running dot for graph 120/205 Running dot for graph 121/205 Running dot for graph 122/205 Running dot for graph 123/205 Running dot for graph 124/205 Running dot for graph 125/205 Running dot for graph 126/205 Running dot for graph 127/205 Running dot for graph 128/205 Running dot for graph 129/205 Running dot for graph 130/205 Running dot for graph 131/205 Running dot for graph 132/205 Running dot for graph 133/205 Running dot for graph 134/205 Running dot for graph 135/205 Running dot for graph 136/205 Running dot for graph 137/205 Running dot for graph 138/205 Running dot for graph 139/205 Running dot for graph 140/205 Running dot for graph 141/205 Running dot for graph 142/205 Running dot for graph 143/205 Running dot for graph 144/205 Running dot for graph 145/205 Running dot for graph 146/205 Running dot for graph 147/205 Running dot for graph 148/205 Running dot for graph 149/205 Running dot for graph 150/205 Running dot for graph 151/205 Running dot for graph 152/205 Running dot for graph 153/205 Running dot for graph 154/205 Running dot for graph 155/205 Running dot for graph 156/205 Running dot for graph 157/205 Running dot for graph 158/205 Running dot for graph 159/2Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories Fontconfig error: No writable cache directories 05 Running dot for graph 160/205 Running dot for graph 161/205 Running dot for graph 162/205 Running dot for graph 163/205 Running dot for graph 164/205 Running dot for graph 165/205 Running dot for graph 166/205 Running dot for graph 167/205 Running dot for graph 168/205 Running dot for graph 169/205 Running dot for graph 170/205 Running dot for graph 171/205 Running dot for graph 172/205 Running dot for graph 173/205 Running dot for graph 174/205 Running dot for graph 175/205 Running dot for graph 176/205 Running dot for graph 177/205 Running dot for graph 178/205 Running dot for graph 179/205 Running dot for graph 180/205 Running dot for graph 181/205 Running dot for graph 182/205 Running dot for graph 183/205 Running dot for graph 184/205 Running dot for graph 185/205 Running dot for graph 186/205 Running dot for graph 187/205 Running dot for graph 188/205 Running dot for graph 189/205 Running dot for graph 190/205 Running dot for graph 191/205 Running dot for graph 192/205 Running dot for graph 193/205 Running dot for graph 194/205 Running dot for graph 195/205 Running dot for graph 196/205 Running dot for graph 197/205 Running dot for graph 198/205 Running dot for graph 199/205 Running dot for graph 200/205 Running dot for graph 201/205 Running dot for graph 202/205 Running dot for graph 203/205 Running dot for graph 204/205 Running dot for graph 205/205 Patching output file 1/204 Patching output file 2/204 Patching output file 3/204 Patching output file 4/204 Patching output file 5/204 Patching output file 6/204 Patching output file 7/204 Patching output file 8/204 Patching output file 9/204 Patching output file 10/204 Patching output file 11/204 Patching output file 12/204 Patching output file 13/204 Patching output file 14/204 Patching output file 15/204 Patching output file 16/204 Patching output file 17/204 Patching output file 18/204 Patching output file 19/204 Patching output file 20/204 Patching output file 21/204 Patching output file 22/204 Patching output file 23/204 Patching output file 24/204 Patching output file 25/204 Patching output file 26/204 Patching output file 27/204 Patching output file 28/204 Patching output file 29/204 Patching output file 30/204 Patching output file 31/204 Patching output file 32/204 Patching output file 33/204 Patching output file 34/204 Patching output file 35/204 Patching output file 36/204 Patching output file 37/204 Patching output file 38/204 Patching output file 39/204 Patching output file 40/204 Patching output file 41/204 Patching output file 42/204 Patching output file 43/204 Patching output file 44/204 Patching output file 45/204 Patching output file 46/204 Patching output file 47/204 Patching output file 48/204 Patching output file 49/204 Patching output file 50/204 Patching output file 51/204 Patching output file 52/204 Patching output file 53/204 Patching output file 54/204 Patching output file 55/204 Patching output file 56/204 Patching output file 57/204 Patching output file 58/204 Patching output file 59/204 Patching output file 60/204 Patching output file 61/204 Patching output file 62/204 Patching output file 63/204 Patching output file 64/204 Patching output file 65/204 Patching output file 66/204 Patching output file 67/204 Patching output file 68/204 Patching output file 69/204 Patching output file 70/204 Patching output file 71/204 Patching output file 72/204 Patching output file 73/204 Patching output file 74/204 Patching output file 75/204 Patching output file 76/204 Patching output file 77/204 Patching output file 78/204 Patching output file 79/204 Patching output file 80/204 Patching output file 81/204 Patching output file 82/204 Patching output file 83/204 Patching output file 84/204 Patching output file 85/204 Patching output file 86/204 Patching output file 87/204 Patching output file 88/204 Patching output file 89/204 Patching output file 90/204 Patching output file 91/204 Patching output file 92/204 Patching output file 93/204 Patching output file 94/204 Patching output file 95/204 Patching output file 96/204 Patching output file 97/204 Patching output file 98/204 Patching output file 99/204 Patching output file 100/204 Patching output file 101/204 Patching output file 102/204 Patching output file 103/204 Patching output file 104/204 Patching output file 105/204 Patching output file 106/204 Patching output file 107/204 Patching output file 108/204 Patching output file 109/204 Patching output file 110/204 Patching output file 111/204 Patching output file 112/204 Patching output file 113/204 Patching output file 114/204 Patching output file 115/204 Patching output file 116/204 Patching output file 117/204 Patching output file 118/204 Patching output file 119/204 Patching output file 120/204 Patching output file 121/204 Patching output file 122/204 Patching output file 123/204 Patching output file 124/204 Patching output file 125/204 Patching output file 126/204 Patching output file 127/204 Patching output file 128/204 Patching output file 129/204 Patching output file 130/204 Patching output file 131/204 Patching output file 132/204 Patching output file 133/204 Patching output file 134/204 Patching output file 135/204 Patching output file 136/204 Patching output file 137/204 Patching output file 138/204 Patching output file 139/204 Patching output file 140/204 Patching output file 141/204 Patching output file 142/204 Patching output file 143/204 Patching output file 144/204 Patching output file 145/204 Patching output file 146/204 Patching output file 147/204 Patching output file 148/204 Patching output file 149/204 Patching output file 150/204 Patching output file 151/204 Patching output file 152/204 Patching output file 153/204 Patching output file 154/204 Patching output file 155/204 Patching output file 156/204 Patching output file 157/204 Patching output file 158/204 Patching output file 159/204 Patching output file 160/204 Patching output file 161/204 Patching output file 162/204 Patching output file 163/204 Patching output file 164/204 Patching output file 165/204 Patching output file 166/204 Patching output file 167/204 Patching output file 168/204 Patching output file 169/204 Patching output file 170/204 Patching output file 171/204 Patching output file 172/204 Patching output file 173/204 Patching output file 174/204 Patching output file 175/204 Patching output file 176/204 Patching output file 177/204 Patching output file 178/204 Patching output file 179/204 Patching output file 180/204 Patching output file 181/204 Patching output file 182/204 Patching output file 183/204 Patching output file 184/204 Patching output file 185/204 Patching output file 186/204 Patching output file 187/204 Patching output file 188/204 Patching output file 189/204 Patching output file 190/204 Patching output file 191/204 Patching output file 192/204 Patching output file 193/204 Patching output file 194/204 Patching output file 195/204 Patching output file 196/204 Patching output file 197/204 Patching output file 198/204 Patching output file 199/204 Patching output file 200/204 Patching output file 201/204 Patching output file 202/204 Patching output file 203/204 Patching output file 204/204 type lookup cache used 11839/65536 hits=63102 misses=17186 symbol lookup cache used 8283/65536 hits=76480 misses=8283 finished... make[5]: Leaving directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' Built target html make[4]: Leaving directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' /usr/bin/cmake -E cmake_progress_start /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/CMakeFiles 0 make[3]: Leaving directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' make[2]: Leaving directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/doc' make[1]: Leaving directory '/build/reproducible-path/liblemon-1.3.1+dfsg' debian/rules override_dh_auto_test make[1]: Entering directory '/build/reproducible-path/liblemon-1.3.1+dfsg' cd obj-* && make check make[2]: Entering directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' /usr/bin/cmake -S/build/reproducible-path/liblemon-1.3.1+dfsg -B/build/reproducible-path/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 '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' /usr/bin/cmake -S/build/reproducible-path/liblemon-1.3.1+dfsg -B/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf --check-build-system CMakeFiles/Makefile.cmake 0 /usr/bin/cmake -E cmake_progress_start /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/CMakeFiles 83 make -f CMakeFiles/Makefile2 CMakeFiles/check.dir/all make[4]: Entering directory '/build/reproducible-path/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 '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /build/reproducible-path/liblemon-1.3.1+dfsg /build/reproducible-path/liblemon-1.3.1+dfsg/lemon /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon/CMakeFiles/lemon.dir/DependInfo.cmake "--color=" make[5]: Leaving directory '/build/reproducible-path/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 '/build/reproducible-path/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 '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 9%] Built target lemon make -f test/CMakeFiles/unionfind_test.dir/build.make test/CMakeFiles/unionfind_test.dir/depend make[5]: Entering directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /build/reproducible-path/liblemon-1.3.1+dfsg /build/reproducible-path/liblemon-1.3.1+dfsg/test /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test/CMakeFiles/unionfind_test.dir/DependInfo.cmake "--color=" make[5]: Leaving directory '/build/reproducible-path/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 '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 10%] Building CXX object test/CMakeFiles/unionfind_test.dir/unionfind_test.cc.o cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -I/build/reproducible-path/liblemon-1.3.1+dfsg -I/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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 -MD -MT test/CMakeFiles/unionfind_test.dir/unionfind_test.cc.o -MF CMakeFiles/unionfind_test.dir/unionfind_test.cc.o.d -o CMakeFiles/unionfind_test.dir/unionfind_test.cc.o -c /build/reproducible-path/liblemon-1.3.1+dfsg/test/unionfind_test.cc In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/test/unionfind_test.cc:20: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:1973:21: warning: 'template struct std::iterator' is deprecated [-Wdeprecated-declarations] 1973 | : public std::iterator { | ^~~~~~~~ In file included from /usr/include/c++/13/bits/stl_algobase.h:65, from /usr/include/c++/13/vector:62, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/core.h:22, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/list_graph.h:26, from /build/reproducible-path/liblemon-1.3.1+dfsg/test/unionfind_test.cc:19: /usr/include/c++/13/bits/stl_iterator_base_types.h:127:34: note: declared here 127 | struct _GLIBCXX17_DEPRECATED iterator | ^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:3135:21: warning: 'template struct std::iterator' is deprecated [-Wdeprecated-declarations] 3135 | : public std::iterator { | ^~~~~~~~ /usr/include/c++/13/bits/stl_iterator_base_types.h:127:34: note: declared here 127 | struct _GLIBCXX17_DEPRECATED iterator | ^~~~~~~~ [ 12%] Linking CXX executable unionfind_test cd /build/reproducible-path/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 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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,-z,relro -Wl,-z,now -rdynamic CMakeFiles/unionfind_test.dir/unionfind_test.cc.o -o unionfind_test -L/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[5]: Leaving directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 12%] Built target unionfind_test make -f test/CMakeFiles/lp_test.dir/build.make test/CMakeFiles/lp_test.dir/depend make[5]: Entering directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /build/reproducible-path/liblemon-1.3.1+dfsg /build/reproducible-path/liblemon-1.3.1+dfsg/test /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test/CMakeFiles/lp_test.dir/DependInfo.cmake "--color=" make[5]: Leaving directory '/build/reproducible-path/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 '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 13%] Building CXX object test/CMakeFiles/lp_test.dir/lp_test.cc.o cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -I/build/reproducible-path/liblemon-1.3.1+dfsg -I/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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 -MD -MT test/CMakeFiles/lp_test.dir/lp_test.cc.o -MF CMakeFiles/lp_test.dir/lp_test.cc.o.d -o CMakeFiles/lp_test.dir/lp_test.cc.o -c /build/reproducible-path/liblemon-1.3.1+dfsg/test/lp_test.cc [ 14%] Linking CXX executable lp_test cd /build/reproducible-path/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 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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,-z,relro -Wl,-z,now -rdynamic CMakeFiles/lp_test.dir/lp_test.cc.o -o lp_test -L/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[5]: Leaving directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 14%] Built target lp_test make -f test/CMakeFiles/mip_test.dir/build.make test/CMakeFiles/mip_test.dir/depend make[5]: Entering directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /build/reproducible-path/liblemon-1.3.1+dfsg /build/reproducible-path/liblemon-1.3.1+dfsg/test /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test/CMakeFiles/mip_test.dir/DependInfo.cmake "--color=" make[5]: Leaving directory '/build/reproducible-path/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 '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 14%] Building CXX object test/CMakeFiles/mip_test.dir/mip_test.cc.o cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -I/build/reproducible-path/liblemon-1.3.1+dfsg -I/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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 -MD -MT test/CMakeFiles/mip_test.dir/mip_test.cc.o -MF CMakeFiles/mip_test.dir/mip_test.cc.o.d -o CMakeFiles/mip_test.dir/mip_test.cc.o -c /build/reproducible-path/liblemon-1.3.1+dfsg/test/mip_test.cc [ 15%] Linking CXX executable mip_test cd /build/reproducible-path/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 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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,-z,relro -Wl,-z,now -rdynamic CMakeFiles/mip_test.dir/mip_test.cc.o -o mip_test -L/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[5]: Leaving directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 15%] Built target mip_test make -f test/CMakeFiles/adaptors_test.dir/build.make test/CMakeFiles/adaptors_test.dir/depend make[5]: Entering directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /build/reproducible-path/liblemon-1.3.1+dfsg /build/reproducible-path/liblemon-1.3.1+dfsg/test /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test/CMakeFiles/adaptors_test.dir/DependInfo.cmake "--color=" make[5]: Leaving directory '/build/reproducible-path/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 '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 15%] Building CXX object test/CMakeFiles/adaptors_test.dir/adaptors_test.cc.o cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -I/build/reproducible-path/liblemon-1.3.1+dfsg -I/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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 -MD -MT test/CMakeFiles/adaptors_test.dir/adaptors_test.cc.o -MF CMakeFiles/adaptors_test.dir/adaptors_test.cc.o.d -o CMakeFiles/adaptors_test.dir/adaptors_test.cc.o -c /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bfs.h:30, from /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:24: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:1973:21: warning: 'template struct std::iterator' is deprecated [-Wdeprecated-declarations] 1973 | : public std::iterator { | ^~~~~~~~ In file included from /usr/include/c++/13/bits/stl_iterator_base_funcs.h:66, from /usr/include/c++/13/string:47, from /usr/include/c++/13/bits/locale_classes.h:40, from /usr/include/c++/13/bits/ios_base.h:41, from /usr/include/c++/13/ios:44, from /usr/include/c++/13/ostream:40, from /usr/include/c++/13/iostream:41, from /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:19: /usr/include/c++/13/bits/stl_iterator_base_types.h:127:34: note: declared here 127 | struct _GLIBCXX17_DEPRECATED iterator | ^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:3135:21: warning: 'template struct std::iterator' is deprecated [-Wdeprecated-declarations] 3135 | : public std::iterator { | ^~~~~~~~ /usr/include/c++/13/bits/stl_iterator_base_types.h:127:34: note: declared here 127 | struct _GLIBCXX17_DEPRECATED iterator | ^~~~~~~~ In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/adaptors.h:30, from /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:33: /build/reproducible-path/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]': /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/adaptors.h:2951:11: required from here /build/reproducible-path/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(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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; First = lemon::ListDigraphBase::Arc]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/adaptors.h:2964:22: required from 'lemon::SplitNodesBase::Arc::Arc(lemon::Invalid) [with DGR = const lemon::ListDigraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:790:40: required from here /build/reproducible-path/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); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/variant.h: In instantiation of 'const lemon::BiVariant<_First, _Second>::First& lemon::BiVariant<_First, _Second>::first() const [with _First = lemon::ListDigraphBase::Arc; _Second = lemon::ListDigraphBase::Node; First = lemon::ListDigraphBase::Arc]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/adaptors.h:2997:55: required from 'lemon::SplitNodesBase::Arc::operator lemon::SplitNodesBase::DigraphArc() const [with DGR = const lemon::ListDigraph; lemon::SplitNodesBase::DigraphArc = lemon::ListDigraphBase::Arc]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:792:25: required from here /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/variant.h:184:15: warning: cast from 'const char*' to 'const lemon::BiVariant::First*' {aka 'const lemon::ListDigraphBase::Arc*'} increases required alignment of target type [-Wcast-align] 184 | return *reinterpret_cast(data); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/variant.h: In instantiation of 'const lemon::BiVariant<_First, _Second>::Second& lemon::BiVariant<_First, _Second>::second() const [with _First = lemon::ListDigraphBase::Arc; _Second = lemon::ListDigraphBase::Node; Second = lemon::ListDigraphBase::Node]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/adaptors.h:3075:35: required from 'lemon::SplitNodesBase::Node lemon::SplitNodesBase::source(const Arc&) const [with DGR = const lemon::ListDigraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:793:7: required from here /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/variant.h:207:15: warning: cast from 'const char*' to 'const lemon::BiVariant::Second*' {aka 'const lemon::ListDigraphBase::Node*'} increases required alignment of target type [-Wcast-align] 207 | return *reinterpret_cast(data); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/adaptors.h:2951:11: required from 'lemon::ConArcIt::ConArcIt(const GR&, Node, Node) [with GR = lemon::SplitNodes; Node = lemon::SplitNodesBase::Node]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/graph_test.h:169:30: required from 'void lemon::checkGraphConArcList(const Graph&, int) [with Graph = SplitNodes]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:767:23: required from here /build/reproducible-path/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()); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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()); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/adaptors.h:2951:11: required from 'lemon::ConArcIt& lemon::ConArcIt::operator++() [with GR = lemon::SplitNodes]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/graph_test.h:169:56: required from 'void lemon::checkGraphConArcList(const Graph&, int) [with Graph = SplitNodes]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:767:23: required from here /build/reproducible-path/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()); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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()); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/adaptors.h:2963:13: required from 'lemon::SplitNodesBase::Arc::Arc() [with DGR = const lemon::ListDigraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/graph_test.h:252:5: required from 'void lemon::checkArcIds(const Graph&) [with Graph = SplitNodes]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:784:14: required from here /build/reproducible-path/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(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/adaptors.h:3017:24: required from 'void lemon::SplitNodesBase::first(Arc&) const [with DGR = const lemon::ListDigraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_adaptor_extender.h:98:24: required from 'lemon::DigraphAdaptorExtender<_Digraph>::ArcIt::ArcIt(const lemon::DigraphAdaptorExtender<_Digraph>::Adaptor&) [with _Digraph = lemon::SplitNodesBase; lemon::DigraphAdaptorExtender<_Digraph>::Adaptor = lemon::DigraphAdaptorExtender >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:790:32: required from here /build/reproducible-path/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(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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; Second = lemon::ListDigraphBase::Node]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/adaptors.h:3018:37: required from 'void lemon::SplitNodesBase::first(Arc&) const [with DGR = const lemon::ListDigraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_adaptor_extender.h:98:24: required from 'lemon::DigraphAdaptorExtender<_Digraph>::ArcIt::ArcIt(const lemon::DigraphAdaptorExtender<_Digraph>::Adaptor&) [with _Digraph = lemon::SplitNodesBase; lemon::DigraphAdaptorExtender<_Digraph>::Adaptor = lemon::DigraphAdaptorExtender >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:790:32: required from here /build/reproducible-path/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); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/adaptors.h:3020:25: required from 'void lemon::SplitNodesBase::first(Arc&) const [with DGR = const lemon::ListDigraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_adaptor_extender.h:98:24: required from 'lemon::DigraphAdaptorExtender<_Digraph>::ArcIt::ArcIt(const lemon::DigraphAdaptorExtender<_Digraph>::Adaptor&) [with _Digraph = lemon::SplitNodesBase; lemon::DigraphAdaptorExtender<_Digraph>::Adaptor = lemon::DigraphAdaptorExtender >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:790:32: required from here /build/reproducible-path/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(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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; First = lemon::ListDigraphBase::Arc]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/adaptors.h:3021:38: required from 'void lemon::SplitNodesBase::first(Arc&) const [with DGR = const lemon::ListDigraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_adaptor_extender.h:98:24: required from 'lemon::DigraphAdaptorExtender<_Digraph>::ArcIt::ArcIt(const lemon::DigraphAdaptorExtender<_Digraph>::Adaptor&) [with _Digraph = lemon::SplitNodesBase; lemon::DigraphAdaptorExtender<_Digraph>::Adaptor = lemon::DigraphAdaptorExtender >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:790:32: required from here /build/reproducible-path/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); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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]': /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/adaptors.h:2951:11: required from 'void lemon::checkGraphArcList(const Graph&, int) [with Graph = SplitNodes::EdgeMap > >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1396:20: required from here /build/reproducible-path/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(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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; First = lemon::GridGraphBase::Edge]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/adaptors.h:2964:22: required from 'lemon::SplitNodesBase::Arc::Arc(lemon::Invalid) [with DGR = const lemon::Orienter::EdgeMap >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/graph_test.h:84:7: required from 'void lemon::checkGraphArcList(const Graph&, int) [with Graph = SplitNodes::EdgeMap > >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1396:20: required from here /build/reproducible-path/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); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/variant.h: In instantiation of 'const lemon::BiVariant<_First, _Second>::First& lemon::BiVariant<_First, _Second>::first() const [with _First = lemon::GridGraphBase::Edge; _Second = lemon::GridGraphBase::Node; First = lemon::GridGraphBase::Edge]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/adaptors.h:3073:51: required from 'lemon::SplitNodesBase::Node lemon::SplitNodesBase::source(const Arc&) const [with DGR = const lemon::Orienter::EdgeMap >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/graph_test.h:85:7: required from 'void lemon::checkGraphArcList(const Graph&, int) [with Graph = SplitNodes::EdgeMap > >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1396:20: required from here /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/variant.h:184:15: warning: cast from 'const char*' to 'const lemon::BiVariant::First*' {aka 'const lemon::GridGraphBase::Edge*'} increases required alignment of target type [-Wcast-align] 184 | return *reinterpret_cast(data); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/variant.h: In instantiation of 'const lemon::BiVariant<_First, _Second>::Second& lemon::BiVariant<_First, _Second>::second() const [with _First = lemon::GridGraphBase::Edge; _Second = lemon::GridGraphBase::Node; Second = lemon::GridGraphBase::Node]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/adaptors.h:3075:35: required from 'lemon::SplitNodesBase::Node lemon::SplitNodesBase::source(const Arc&) const [with DGR = const lemon::Orienter::EdgeMap >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/graph_test.h:85:7: required from 'void lemon::checkGraphArcList(const Graph&, int) [with Graph = SplitNodes::EdgeMap > >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1396:20: required from here /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/variant.h:207:15: warning: cast from 'const char*' to 'const lemon::BiVariant::Second*' {aka 'const lemon::GridGraphBase::Node*'} increases required alignment of target type [-Wcast-align] 207 | return *reinterpret_cast(data); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/adaptors.h:2951:11: required from 'lemon::ConArcIt::ConArcIt(const GR&, Node, Node) [with GR = lemon::SplitNodes::EdgeMap > >; Node = lemon::SplitNodesBase::EdgeMap > >::Node]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/graph_test.h:169:30: required from 'void lemon::checkGraphConArcList(const Graph&, int) [with Graph = SplitNodes::EdgeMap > >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1397:23: required from here /build/reproducible-path/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()); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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()); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/adaptors.h:2951:11: required from 'lemon::ConArcIt& lemon::ConArcIt::operator++() [with GR = lemon::SplitNodes::EdgeMap > >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/graph_test.h:169:56: required from 'void lemon::checkGraphConArcList(const Graph&, int) [with Graph = SplitNodes::EdgeMap > >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1397:23: required from here /build/reproducible-path/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()); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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()); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/adaptors.h:2963:13: required from 'lemon::SplitNodesBase::Arc::Arc() [with DGR = const lemon::Orienter::EdgeMap >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/graph_test.h:252:5: required from 'void lemon::checkArcIds(const Graph&) [with Graph = SplitNodes::EdgeMap > >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1418:14: required from here /build/reproducible-path/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 /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:27: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of 'void lemon::concepts::BaseDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::ReverseDigraph]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseDigraphComponent; Type = ReverseDigraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:477:55: required from 'void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::ReverseDigraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = ReverseDigraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:42:70: required from here /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent<>; Type = ReverseDigraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: required from 'void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::ReverseDigraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = ReverseDigraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:42:70: required from here /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IDableDigraphComponent<>; Type = ReverseDigraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:479:59: required from 'void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::ReverseDigraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = ReverseDigraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:42:70: required from here /build/reproducible-path/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; | ~~~~^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~^~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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); | ~~~~^~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of 'void lemon::concepts::BaseDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::SubDigraph]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseDigraphComponent; Type = SubDigraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:477:55: required from 'void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::SubDigraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = SubDigraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:159:66: required from here /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent<>; Type = SubDigraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: required from 'void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::SubDigraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = SubDigraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:159:66: required from here /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IDableDigraphComponent<>; Type = SubDigraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:479:59: required from 'void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::SubDigraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = SubDigraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:159:66: required from here /build/reproducible-path/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; | ~~~~^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~^~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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); | ~~~~^~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of 'void lemon::concepts::BaseDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::FilterNodes]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseDigraphComponent; Type = FilterNodes]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:477:55: required from 'void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::FilterNodes]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = FilterNodes]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:283:67: required from here /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent<>; Type = FilterNodes]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: required from 'void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::FilterNodes]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = FilterNodes]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:283:67: required from here /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IDableDigraphComponent<>; Type = FilterNodes]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:479:59: required from 'void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::FilterNodes]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = FilterNodes]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:283:67: required from here /build/reproducible-path/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; | ~~~~^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~^~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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); | ~~~~^~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of 'void lemon::concepts::BaseDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::FilterArcs]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseDigraphComponent; Type = FilterArcs]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:477:55: required from 'void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::FilterArcs]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = FilterArcs]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:379:66: required from here /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent<>; Type = FilterArcs]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: required from 'void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::FilterArcs]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = FilterArcs]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:379:66: required from here /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IDableDigraphComponent<>; Type = FilterArcs]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:479:59: required from 'void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::FilterArcs]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = FilterArcs]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:379:66: required from here /build/reproducible-path/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; | ~~~~^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~^~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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); | ~~~~^~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of 'void lemon::concepts::BaseGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::Undirector]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseGraphComponent; Type = Undirector]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:775:51: required from 'void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::Undirector]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Graph; Type = Undirector]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:477:64: required from here /build/reproducible-path/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); | ~~^~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~^~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableGraphComponent<>; Type = Undirector]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:776:57: required from 'void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::Undirector]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Graph; Type = Undirector]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:477:64: required from here /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IDableGraphComponent<>; Type = Undirector]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:777:55: required from 'void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::Undirector]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Graph; Type = Undirector]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:477:64: required from here /build/reproducible-path/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); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of 'void lemon::concepts::BaseDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::ResidualDigraph]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseDigraphComponent; Type = ResidualDigraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:477:55: required from 'void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::ResidualDigraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = ResidualDigraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:588:71: required from here /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent<>; Type = ResidualDigraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: required from 'void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::ResidualDigraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = ResidualDigraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:588:71: required from here /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IDableDigraphComponent<>; Type = ResidualDigraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:479:59: required from 'void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::ResidualDigraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = ResidualDigraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:588:71: required from here /build/reproducible-path/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; | ~~~~^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; Second = lemon::ListDigraphBase::Node]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/adaptors.h:3039:26: required from 'void lemon::SplitNodesBase::firstOut(Arc&, const Node&) const [with DGR = const lemon::ListDigraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_adaptor_extender.h:122:27: required from 'lemon::DigraphAdaptorExtender<_Digraph>::OutArcIt::OutArcIt(const lemon::DigraphAdaptorExtender<_Digraph>::Adaptor&, const lemon::DigraphAdaptorExtender<_Digraph>::Node&) [with _Digraph = lemon::SplitNodesBase; lemon::DigraphAdaptorExtender<_Digraph>::Adaptor = lemon::DigraphAdaptorExtender >; lemon::DigraphAdaptorExtender<_Digraph>::Node = lemon::SplitNodesBase::Node]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/graph_test.h:98:30: required from 'void lemon::checkGraphOutArcList(const Graph&, typename Graph::Node, int) [with Graph = SplitNodes; typename Graph::Node = SplitNodesBase::Node]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:769:23: required from here /build/reproducible-path/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); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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; First = lemon::ListDigraphBase::Arc]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/adaptors.h:3048:25: required from 'void lemon::SplitNodesBase::nextOut(Arc&) const [with DGR = const lemon::ListDigraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_adaptor_extender.h:129:26: required from 'lemon::DigraphAdaptorExtender<_Digraph>::OutArcIt& lemon::DigraphAdaptorExtender<_Digraph>::OutArcIt::operator++() [with _Digraph = lemon::SplitNodesBase]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/graph_test.h:104:7: required from 'void lemon::checkGraphOutArcList(const Graph&, typename Graph::Node, int) [with Graph = SplitNodes; typename Graph::Node = SplitNodesBase::Node]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:769:23: required from here /build/reproducible-path/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); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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; Second = lemon::ListDigraphBase::Node]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/adaptors.h:2958:47: required from 'lemon::SplitNodesBase::Arc::Arc(const lemon::SplitNodesBase::DigraphNode&) [with DGR = const lemon::ListDigraph; lemon::SplitNodesBase::DigraphNode = lemon::ListDigraphBase::Node]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/graph_test.h:247:7: required from 'void lemon::checkArcIds(const Graph&) [with Graph = SplitNodes]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:784:14: required from here /build/reproducible-path/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); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of 'void lemon::concepts::BaseGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::SubGraph]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseGraphComponent; Type = SubGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:775:51: required from 'void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::SubGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Graph; Type = SubGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:867:60: required from here /build/reproducible-path/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 /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:28: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; | ~~~^~~ /build/reproducible-path/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&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableGraphComponent<>; Type = SubGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:776:57: required from 'void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::SubGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Graph; Type = SubGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:867:60: required from here /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IDableGraphComponent<>; Type = SubGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:777:55: required from 'void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::SubGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Graph; Type = SubGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:867:60: required from here /build/reproducible-path/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); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of 'void lemon::concepts::BaseGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::FilterNodes]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseGraphComponent; Type = FilterNodes]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:775:51: required from 'void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::FilterNodes]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Graph; Type = FilterNodes]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1001:63: required from here /build/reproducible-path/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); | ~~^~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; | ~~~^~~ /build/reproducible-path/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&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableGraphComponent<>; Type = FilterNodes]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:776:57: required from 'void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::FilterNodes]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Graph; Type = FilterNodes]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1001:63: required from here /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IDableGraphComponent<>; Type = FilterNodes]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:777:55: required from 'void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::FilterNodes]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Graph; Type = FilterNodes]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1001:63: required from here /build/reproducible-path/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); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of 'void lemon::concepts::BaseGraphComponent::Constraints<_Graph>::constraints() [with _Graph = lemon::FilterEdges]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseGraphComponent; Type = FilterEdges]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:775:51: required from 'void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::FilterEdges]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Graph; Type = FilterEdges]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1106:63: required from here /build/reproducible-path/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); | ~~^~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; | ~~~^~~ /build/reproducible-path/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&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableGraphComponent<>; Type = FilterEdges]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:776:57: required from 'void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::FilterEdges]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Graph; Type = FilterEdges]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1106:63: required from here /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IDableGraphComponent<>; Type = FilterEdges]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:777:55: required from 'void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::FilterEdges]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Graph; Type = FilterEdges]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1106:63: required from here /build/reproducible-path/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); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of 'void lemon::concepts::BaseDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::Orienter]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseDigraphComponent; Type = Orienter]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:477:55: required from 'void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::Orienter]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = Orienter]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1212:62: required from here /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent<>; Type = Orienter]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: required from 'void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::Orienter]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = Orienter]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1212:62: required from here /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IDableDigraphComponent<>; Type = Orienter]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:479:59: required from 'void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::Orienter]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = Orienter]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1212:62: required from here /build/reproducible-path/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; | ~~~~^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~^~~~~~~~ /build/reproducible-path/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&) { } | ^~~~ /build/reproducible-path/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); | ~~~~^~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/adaptors.h:3017:24: required from 'void lemon::SplitNodesBase::first(Arc&) const [with DGR = const lemon::Orienter::EdgeMap >]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_adaptor_extender.h:98:24: required from 'lemon::DigraphAdaptorExtender<_Digraph>::ArcIt::ArcIt(const lemon::DigraphAdaptorExtender<_Digraph>::Adaptor&) [with _Digraph = lemon::SplitNodesBase::EdgeMap > >; lemon::DigraphAdaptorExtender<_Digraph>::Adaptor = lemon::DigraphAdaptorExtender::EdgeMap > > >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/graph_test.h:82:27: required from 'void lemon::checkGraphArcList(const Graph&, int) [with Graph = SplitNodes::EdgeMap > >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1396:20: required from here /build/reproducible-path/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(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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; Second = lemon::GridGraphBase::Node]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/adaptors.h:3018:37: required from 'void lemon::SplitNodesBase::first(Arc&) const [with DGR = const lemon::Orienter::EdgeMap >]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_adaptor_extender.h:98:24: required from 'lemon::DigraphAdaptorExtender<_Digraph>::ArcIt::ArcIt(const lemon::DigraphAdaptorExtender<_Digraph>::Adaptor&) [with _Digraph = lemon::SplitNodesBase::EdgeMap > >; lemon::DigraphAdaptorExtender<_Digraph>::Adaptor = lemon::DigraphAdaptorExtender::EdgeMap > > >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/graph_test.h:82:27: required from 'void lemon::checkGraphArcList(const Graph&, int) [with Graph = SplitNodes::EdgeMap > >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1396:20: required from here /build/reproducible-path/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); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/adaptors.h:3020:25: required from 'void lemon::SplitNodesBase::first(Arc&) const [with DGR = const lemon::Orienter::EdgeMap >]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_adaptor_extender.h:98:24: required from 'lemon::DigraphAdaptorExtender<_Digraph>::ArcIt::ArcIt(const lemon::DigraphAdaptorExtender<_Digraph>::Adaptor&) [with _Digraph = lemon::SplitNodesBase::EdgeMap > >; lemon::DigraphAdaptorExtender<_Digraph>::Adaptor = lemon::DigraphAdaptorExtender::EdgeMap > > >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/graph_test.h:82:27: required from 'void lemon::checkGraphArcList(const Graph&, int) [with Graph = SplitNodes::EdgeMap > >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1396:20: required from here /build/reproducible-path/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(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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; First = lemon::GridGraphBase::Edge]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/adaptors.h:3021:38: required from 'void lemon::SplitNodesBase::first(Arc&) const [with DGR = const lemon::Orienter::EdgeMap >]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_adaptor_extender.h:98:24: required from 'lemon::DigraphAdaptorExtender<_Digraph>::ArcIt::ArcIt(const lemon::DigraphAdaptorExtender<_Digraph>::Adaptor&) [with _Digraph = lemon::SplitNodesBase::EdgeMap > >; lemon::DigraphAdaptorExtender<_Digraph>::Adaptor = lemon::DigraphAdaptorExtender::EdgeMap > > >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/graph_test.h:82:27: required from 'void lemon::checkGraphArcList(const Graph&, int) [with Graph = SplitNodes::EdgeMap > >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1396:20: required from here /build/reproducible-path/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); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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; Second = lemon::GridGraphBase::Node]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/adaptors.h:3039:26: required from 'void lemon::SplitNodesBase::firstOut(Arc&, const Node&) const [with DGR = const lemon::Orienter::EdgeMap >]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_adaptor_extender.h:122:27: required from 'lemon::DigraphAdaptorExtender<_Digraph>::OutArcIt::OutArcIt(const lemon::DigraphAdaptorExtender<_Digraph>::Adaptor&, const lemon::DigraphAdaptorExtender<_Digraph>::Node&) [with _Digraph = lemon::SplitNodesBase::EdgeMap > >; lemon::DigraphAdaptorExtender<_Digraph>::Adaptor = lemon::DigraphAdaptorExtender::EdgeMap > > >; lemon::DigraphAdaptorExtender<_Digraph>::Node = lemon::SplitNodesBase::EdgeMap > >::Node]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/graph_test.h:98:30: required from 'void lemon::checkGraphOutArcList(const Graph&, typename Graph::Node, int) [with Graph = SplitNodes::EdgeMap > >; typename Graph::Node = SplitNodesBase::EdgeMap > >::Node]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1399:23: required from here /build/reproducible-path/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); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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; First = lemon::GridGraphBase::Edge]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/adaptors.h:3048:25: required from 'void lemon::SplitNodesBase::nextOut(Arc&) const [with DGR = const lemon::Orienter::EdgeMap >]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_adaptor_extender.h:129:26: required from 'lemon::DigraphAdaptorExtender<_Digraph>::OutArcIt& lemon::DigraphAdaptorExtender<_Digraph>::OutArcIt::operator++() [with _Digraph = lemon::SplitNodesBase::EdgeMap > >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/graph_test.h:104:7: required from 'void lemon::checkGraphOutArcList(const Graph&, typename Graph::Node, int) [with Graph = SplitNodes::EdgeMap > >; typename Graph::Node = SplitNodesBase::EdgeMap > >::Node]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1399:23: required from here /build/reproducible-path/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); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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; Second = lemon::GridGraphBase::Node]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/adaptors.h:2958:47: required from 'lemon::SplitNodesBase::Arc::Arc(const lemon::SplitNodesBase::DigraphNode&) [with DGR = const lemon::Orienter::EdgeMap >; lemon::SplitNodesBase::DigraphNode = lemon::GridGraphBase::Node]' /build/reproducible-path/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 >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/graph_test.h:247:7: required from 'void lemon::checkArcIds(const Graph&) [with Graph = SplitNodes::EdgeMap > >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1418:14: required from here /build/reproducible-path/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); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItem<'n'>; Type = concepts::Digraph::Node]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseDigraphComponent; Type = ReverseDigraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:477:55: required from 'void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::ReverseDigraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = ReverseDigraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:42:70: required from here /build/reproducible-path/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; | ~~^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~^~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItem<'a'>; Type = concepts::Digraph::Arc]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseDigraphComponent; Type = ReverseDigraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:477:55: required from 'void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::ReverseDigraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = ReverseDigraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:42:70: required from here /build/reproducible-path/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; | ~~^~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; | ~~~^~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; | ~~~^~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItemIt, concepts::Digraph::Arc>; Type = DigraphAdaptorExtender >::ArcIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent<>; Type = ReverseDigraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: required from 'void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::ReverseDigraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = ReverseDigraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:42:70: required from here /build/reproducible-path/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; | ~~~^~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItemIt, concepts::Digraph::Node>; Type = DigraphAdaptorExtender >::NodeIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent<>; Type = ReverseDigraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: required from 'void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::ReverseDigraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = ReverseDigraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:42:70: required from here /build/reproducible-path/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; | ~~~^~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphIncIt, concepts::Digraph::Arc, concepts::Digraph::Node, 'i'>; Type = DigraphAdaptorExtender >::InArcIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent<>; Type = ReverseDigraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: required from 'void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::ReverseDigraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = ReverseDigraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:42:70: required from here /build/reproducible-path/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; | ~~^~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphIncIt, concepts::Digraph::Arc, concepts::Digraph::Node, 'o'>; Type = DigraphAdaptorExtender >::OutArcIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent<>; Type = ReverseDigraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: required from 'void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::ReverseDigraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = ReverseDigraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:42:70: required from here /build/reproducible-path/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; | ~~^~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItemIt, concepts::Digraph::Arc>; Type = DigraphAdaptorExtender, concepts::Digraph::ArcMap, true> >::ArcIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent<>; Type = SubDigraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: required from 'void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::SubDigraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = SubDigraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:159:66: required from here /build/reproducible-path/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; | ~~~^~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItemIt, concepts::Digraph::Node>; Type = DigraphAdaptorExtender, concepts::Digraph::ArcMap, true> >::NodeIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent<>; Type = SubDigraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: required from 'void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::SubDigraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = SubDigraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:159:66: required from here /build/reproducible-path/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; | ~~~^~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphIncIt, concepts::Digraph::Arc, concepts::Digraph::Node, 'i'>; Type = DigraphAdaptorExtender, concepts::Digraph::ArcMap, true> >::InArcIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent<>; Type = SubDigraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: required from 'void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::SubDigraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = SubDigraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:159:66: required from here /build/reproducible-path/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; | ~~^~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphIncIt, concepts::Digraph::Arc, concepts::Digraph::Node, 'o'>; Type = DigraphAdaptorExtender, concepts::Digraph::ArcMap, true> >::OutArcIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent<>; Type = SubDigraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: required from 'void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::SubDigraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = SubDigraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:159:66: required from here /build/reproducible-path/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; | ~~^~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItemIt, concepts::Digraph::Arc>; Type = DigraphAdaptorExtender, ConstMap >, true> >::ArcIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent<>; Type = FilterNodes]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: required from 'void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::FilterNodes]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = FilterNodes]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:283:67: required from here /build/reproducible-path/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; | ~~~^~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItemIt, concepts::Digraph::Node>; Type = DigraphAdaptorExtender, ConstMap >, true> >::NodeIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent<>; Type = FilterNodes]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: required from 'void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::FilterNodes]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = FilterNodes]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:283:67: required from here /build/reproducible-path/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; | ~~~^~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphIncIt, concepts::Digraph::Arc, concepts::Digraph::Node, 'i'>; Type = DigraphAdaptorExtender, ConstMap >, true> >::InArcIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent<>; Type = FilterNodes]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: required from 'void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::FilterNodes]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = FilterNodes]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:283:67: required from here /build/reproducible-path/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; | ~~^~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphIncIt, concepts::Digraph::Arc, concepts::Digraph::Node, 'o'>; Type = DigraphAdaptorExtender, ConstMap >, true> >::OutArcIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent<>; Type = FilterNodes]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: required from 'void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::FilterNodes]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = FilterNodes]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:283:67: required from here /build/reproducible-path/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; | ~~^~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItemIt, concepts::Digraph::Arc>; Type = DigraphAdaptorExtender >, concepts::Digraph::ArcMap, false> >::ArcIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent<>; Type = FilterArcs]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: required from 'void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::FilterArcs]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = FilterArcs]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:379:66: required from here /build/reproducible-path/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; | ~~~^~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItemIt, concepts::Digraph::Node>; Type = DigraphAdaptorExtender >, concepts::Digraph::ArcMap, false> >::NodeIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent<>; Type = FilterArcs]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: required from 'void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::FilterArcs]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = FilterArcs]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:379:66: required from here /build/reproducible-path/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; | ~~~^~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphIncIt, concepts::Digraph::Arc, concepts::Digraph::Node, 'i'>; Type = DigraphAdaptorExtender >, concepts::Digraph::ArcMap, false> >::InArcIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent<>; Type = FilterArcs]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: required from 'void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::FilterArcs]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = FilterArcs]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:379:66: required from here /build/reproducible-path/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; | ~~^~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphIncIt, concepts::Digraph::Arc, concepts::Digraph::Node, 'o'>; Type = DigraphAdaptorExtender >, concepts::Digraph::ArcMap, false> >::OutArcIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent<>; Type = FilterArcs]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: required from 'void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::FilterArcs]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = FilterArcs]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:379:66: required from here /build/reproducible-path/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; | ~~^~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of 'void lemon::concepts::BaseDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::Undirector]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseDigraphComponent; Type = Undirector]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseGraphComponent; Type = Undirector]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:775:51: required from 'void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::Undirector]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Graph; Type = Undirector]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:477:64: required from here /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItem<'e'>; Type = concepts::Digraph::Arc]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseGraphComponent; Type = Undirector]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:775:51: required from 'void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::Undirector]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Graph; Type = Undirector]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:477:64: required from here /build/reproducible-path/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; | ~~^~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; | ~~~^~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; | ~~~^~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent; Type = Undirector]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableGraphComponent<>; Type = Undirector]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:776:57: required from 'void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::Undirector]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Graph; Type = Undirector]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:477:64: required from here /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItemIt, concepts::Digraph::Arc>; Type = GraphAdaptorExtender >::EdgeIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableGraphComponent<>; Type = Undirector]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:776:57: required from 'void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::Undirector]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Graph; Type = Undirector]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:477:64: required from here /build/reproducible-path/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; | ~~~^~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphIncIt, concepts::Digraph::Arc, concepts::Digraph::Node, 'e'>; Type = GraphAdaptorExtender >::IncEdgeIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableGraphComponent<>; Type = Undirector]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:776:57: required from 'void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::Undirector]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Graph; Type = Undirector]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:477:64: required from here /build/reproducible-path/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; | ~~^~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IDableDigraphComponent; Type = Undirector]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IDableGraphComponent<>; Type = Undirector]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:777:55: required from 'void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::Undirector]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Graph; Type = Undirector]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:477:64: required from here /build/reproducible-path/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; | ~~~~^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItemIt, concepts::Digraph::Node>; Type = DigraphAdaptorExtender, ConstMap >, Undirector::CombinedArcMap<_adaptor_bits::ResForwardFilter, concepts::Digraph::ArcMap, Tolerance >, _adaptor_bits::ResBackwardFilter, concepts::Digraph::ArcMap, Tolerance > >, true> >::NodeIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent<>; Type = ResidualDigraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: required from 'void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::ResidualDigraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = ResidualDigraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:588:71: required from here /build/reproducible-path/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; | ~~~^~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of 'void lemon::concepts::BaseDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::SubGraph]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseDigraphComponent; Type = SubGraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseGraphComponent; Type = SubGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:775:51: required from 'void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::SubGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Graph; Type = SubGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:867:60: required from here /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItem<'e'>; Type = concepts::Graph::Edge]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseGraphComponent; Type = SubGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:775:51: required from 'void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::SubGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Graph; Type = SubGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:867:60: required from here /build/reproducible-path/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; | ~~^~~~~~~~ /build/reproducible-path/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&) { } | ^~~~ /build/reproducible-path/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; | ~~~^~~~ /build/reproducible-path/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&) { } | ^~~~ /build/reproducible-path/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; | ~~~^~~~~~~~~ /build/reproducible-path/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&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent; Type = SubGraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableGraphComponent<>; Type = SubGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:776:57: required from 'void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::SubGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Graph; Type = SubGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:867:60: required from here /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItemIt, concepts::Graph::Edge>; Type = GraphAdaptorExtender, concepts::Graph::EdgeMap, true> >::EdgeIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableGraphComponent<>; Type = SubGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:776:57: required from 'void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::SubGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Graph; Type = SubGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:867:60: required from here /build/reproducible-path/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; | ~~~^~~~~ /build/reproducible-path/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&) { } | ^~~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphIncIt, concepts::Graph::Edge, concepts::Graph::Node, 'e'>; Type = GraphAdaptorExtender, concepts::Graph::EdgeMap, true> >::IncEdgeIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableGraphComponent<>; Type = SubGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:776:57: required from 'void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::SubGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Graph; Type = SubGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:867:60: required from here /build/reproducible-path/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; | ~~^~~~~ /build/reproducible-path/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&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IDableDigraphComponent; Type = SubGraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IDableGraphComponent<>; Type = SubGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:777:55: required from 'void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::SubGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Graph; Type = SubGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:867:60: required from here /build/reproducible-path/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; | ~~~~^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~^~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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); | ~~~~^~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of 'void lemon::concepts::BaseDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::FilterNodes]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseDigraphComponent; Type = FilterNodes]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseGraphComponent; Type = FilterNodes]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:775:51: required from 'void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::FilterNodes]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Graph; Type = FilterNodes]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1001:63: required from here /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent; Type = FilterNodes]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableGraphComponent<>; Type = FilterNodes]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:776:57: required from 'void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::FilterNodes]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Graph; Type = FilterNodes]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1001:63: required from here /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItemIt, concepts::Graph::Edge>; Type = GraphAdaptorExtender, ConstMap >, true> >::EdgeIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableGraphComponent<>; Type = FilterNodes]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:776:57: required from 'void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::FilterNodes]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Graph; Type = FilterNodes]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1001:63: required from here /build/reproducible-path/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; | ~~~^~~~~ /build/reproducible-path/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&) { } | ^~~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphIncIt, concepts::Graph::Edge, concepts::Graph::Node, 'e'>; Type = GraphAdaptorExtender, ConstMap >, true> >::IncEdgeIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableGraphComponent<>; Type = FilterNodes]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:776:57: required from 'void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::FilterNodes]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Graph; Type = FilterNodes]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1001:63: required from here /build/reproducible-path/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; | ~~^~~~~ /build/reproducible-path/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&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IDableDigraphComponent; Type = FilterNodes]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IDableGraphComponent<>; Type = FilterNodes]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:777:55: required from 'void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::FilterNodes]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Graph; Type = FilterNodes]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1001:63: required from here /build/reproducible-path/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; | ~~~~^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~^~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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); | ~~~~^~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of 'void lemon::concepts::BaseDigraphComponent::Constraints<_Digraph>::constraints() [with _Digraph = lemon::FilterEdges]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseDigraphComponent; Type = FilterEdges]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseGraphComponent; Type = FilterEdges]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:775:51: required from 'void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::FilterEdges]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Graph; Type = FilterEdges]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1106:63: required from here /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent; Type = FilterEdges]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableGraphComponent<>; Type = FilterEdges]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:776:57: required from 'void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::FilterEdges]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Graph; Type = FilterEdges]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1106:63: required from here /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItemIt, concepts::Graph::Edge>; Type = GraphAdaptorExtender >, concepts::Graph::EdgeMap, false> >::EdgeIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableGraphComponent<>; Type = FilterEdges]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:776:57: required from 'void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::FilterEdges]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Graph; Type = FilterEdges]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1106:63: required from here /build/reproducible-path/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; | ~~~^~~~~ /build/reproducible-path/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&) { } | ^~~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphIncIt, concepts::Graph::Edge, concepts::Graph::Node, 'e'>; Type = GraphAdaptorExtender >, concepts::Graph::EdgeMap, false> >::IncEdgeIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableGraphComponent<>; Type = FilterEdges]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:776:57: required from 'void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::FilterEdges]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Graph; Type = FilterEdges]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1106:63: required from here /build/reproducible-path/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; | ~~^~~~~ /build/reproducible-path/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&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IDableDigraphComponent; Type = FilterEdges]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IDableGraphComponent<>; Type = FilterEdges]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:777:55: required from 'void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::FilterEdges]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Graph; Type = FilterEdges]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1106:63: required from here /build/reproducible-path/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; | ~~~~^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~^~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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); | ~~~~^~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItem<'n'>; Type = concepts::Graph::Node]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseDigraphComponent; Type = Orienter]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:477:55: required from 'void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::Orienter]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = Orienter]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1212:62: required from here /build/reproducible-path/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; | ~~^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~^~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItem<'a'>; Type = concepts::Graph::Edge]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseDigraphComponent; Type = Orienter]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:477:55: required from 'void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::Orienter]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = Orienter]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1212:62: required from here /build/reproducible-path/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; | ~~^~~~~~~~ /build/reproducible-path/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&) { } | ^~~~ /build/reproducible-path/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; | ~~~^~~~ /build/reproducible-path/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&) { } | ^~~~ /build/reproducible-path/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; | ~~~^~~~~~~~~ /build/reproducible-path/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&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItemIt, concepts::Graph::Edge>; Type = DigraphAdaptorExtender > >::ArcIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent<>; Type = Orienter]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: required from 'void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::Orienter]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = Orienter]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1212:62: required from here /build/reproducible-path/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; | ~~~^~~~~ /build/reproducible-path/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&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItemIt, concepts::Graph::Node>; Type = DigraphAdaptorExtender > >::NodeIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent<>; Type = Orienter]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: required from 'void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::Orienter]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = Orienter]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1212:62: required from here /build/reproducible-path/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; | ~~~^~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphIncIt, concepts::Graph::Edge, concepts::Graph::Node, 'i'>; Type = DigraphAdaptorExtender > >::InArcIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent<>; Type = Orienter]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: required from 'void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::Orienter]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = Orienter]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1212:62: required from here /build/reproducible-path/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; | ~~^~~~~ /build/reproducible-path/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&) { } | ^~~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphIncIt, concepts::Graph::Edge, concepts::Graph::Node, 'o'>; Type = DigraphAdaptorExtender > >::OutArcIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent<>; Type = Orienter]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: required from 'void lemon::concepts::Digraph::Constraints<_Digraph>::constraints() [with _Digraph = lemon::Orienter]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = Orienter]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1212:62: required from here /build/reproducible-path/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; | ~~^~~~~ /build/reproducible-path/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&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItemIt, concepts::Digraph::Node>; Type = GraphAdaptorExtender >::NodeIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent; Type = Undirector]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableGraphComponent<>; Type = Undirector]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:776:57: required from 'void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::Undirector]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Graph; Type = Undirector]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:477:64: required from here /build/reproducible-path/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; | ~~~^~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItem<'a'>; Type = concepts::Graph::Arc]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseDigraphComponent; Type = SubGraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseGraphComponent; Type = SubGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:775:51: required from 'void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::SubGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Graph; Type = SubGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:867:60: required from here /build/reproducible-path/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; | ~~^~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; | ~~~^~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; | ~~~^~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItemIt, concepts::Graph::Arc>; Type = GraphAdaptorExtender, concepts::Graph::EdgeMap, true> >::ArcIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent; Type = SubGraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableGraphComponent<>; Type = SubGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:776:57: required from 'void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::SubGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Graph; Type = SubGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:867:60: required from here /build/reproducible-path/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; | ~~~^~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItemIt, concepts::Graph::Node>; Type = GraphAdaptorExtender, concepts::Graph::EdgeMap, true> >::NodeIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent; Type = SubGraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableGraphComponent<>; Type = SubGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:776:57: required from 'void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::SubGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Graph; Type = SubGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:867:60: required from here /build/reproducible-path/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; | ~~~^~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphIncIt, concepts::Graph::Arc, concepts::Graph::Node, 'i'>; Type = GraphAdaptorExtender, concepts::Graph::EdgeMap, true> >::InArcIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent; Type = SubGraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableGraphComponent<>; Type = SubGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:776:57: required from 'void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::SubGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Graph; Type = SubGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:867:60: required from here /build/reproducible-path/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; | ~~^~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphIncIt, concepts::Graph::Arc, concepts::Graph::Node, 'o'>; Type = GraphAdaptorExtender, concepts::Graph::EdgeMap, true> >::OutArcIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent; Type = SubGraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableGraphComponent<>; Type = SubGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:776:57: required from 'void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::SubGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Graph; Type = SubGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:867:60: required from here /build/reproducible-path/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; | ~~^~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItemIt, concepts::Graph::Arc>; Type = GraphAdaptorExtender, ConstMap >, true> >::ArcIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent; Type = FilterNodes]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableGraphComponent<>; Type = FilterNodes]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:776:57: required from 'void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::FilterNodes]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Graph; Type = FilterNodes]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1001:63: required from here /build/reproducible-path/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; | ~~~^~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItemIt, concepts::Graph::Node>; Type = GraphAdaptorExtender, ConstMap >, true> >::NodeIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent; Type = FilterNodes]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableGraphComponent<>; Type = FilterNodes]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:776:57: required from 'void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::FilterNodes]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Graph; Type = FilterNodes]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1001:63: required from here /build/reproducible-path/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; | ~~~^~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphIncIt, concepts::Graph::Arc, concepts::Graph::Node, 'i'>; Type = GraphAdaptorExtender, ConstMap >, true> >::InArcIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent; Type = FilterNodes]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableGraphComponent<>; Type = FilterNodes]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:776:57: required from 'void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::FilterNodes]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Graph; Type = FilterNodes]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1001:63: required from here /build/reproducible-path/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; | ~~^~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphIncIt, concepts::Graph::Arc, concepts::Graph::Node, 'o'>; Type = GraphAdaptorExtender, ConstMap >, true> >::OutArcIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent; Type = FilterNodes]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableGraphComponent<>; Type = FilterNodes]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:776:57: required from 'void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::FilterNodes]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Graph; Type = FilterNodes]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1001:63: required from here /build/reproducible-path/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; | ~~^~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItemIt, concepts::Graph::Arc>; Type = GraphAdaptorExtender >, concepts::Graph::EdgeMap, false> >::ArcIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent; Type = FilterEdges]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableGraphComponent<>; Type = FilterEdges]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:776:57: required from 'void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::FilterEdges]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Graph; Type = FilterEdges]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1106:63: required from here /build/reproducible-path/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; | ~~~^~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItemIt, concepts::Graph::Node>; Type = GraphAdaptorExtender >, concepts::Graph::EdgeMap, false> >::NodeIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent; Type = FilterEdges]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableGraphComponent<>; Type = FilterEdges]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:776:57: required from 'void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::FilterEdges]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Graph; Type = FilterEdges]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1106:63: required from here /build/reproducible-path/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; | ~~~^~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphIncIt, concepts::Graph::Arc, concepts::Graph::Node, 'i'>; Type = GraphAdaptorExtender >, concepts::Graph::EdgeMap, false> >::InArcIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent; Type = FilterEdges]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableGraphComponent<>; Type = FilterEdges]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:776:57: required from 'void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::FilterEdges]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Graph; Type = FilterEdges]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1106:63: required from here /build/reproducible-path/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; | ~~^~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphIncIt, concepts::Graph::Arc, concepts::Graph::Node, 'o'>; Type = GraphAdaptorExtender >, concepts::Graph::EdgeMap, false> >::OutArcIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent; Type = FilterEdges]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableGraphComponent<>; Type = FilterEdges]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:776:57: required from 'void lemon::concepts::Graph::Constraints<_Graph>::constraints() [with _Graph = lemon::FilterEdges]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Graph; Type = FilterEdges]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/adaptors_test.cc:1106:63: required from here /build/reproducible-path/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; | ~~^~~~~ /build/reproducible-path/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&) { } | ^~~ [ 16%] Linking CXX executable adaptors_test cd /build/reproducible-path/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 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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,-z,relro -Wl,-z,now -rdynamic CMakeFiles/adaptors_test.dir/adaptors_test.cc.o -o adaptors_test -L/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[5]: Leaving directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 16%] Built target adaptors_test make -f test/CMakeFiles/arc_look_up_test.dir/build.make test/CMakeFiles/arc_look_up_test.dir/depend make[5]: Entering directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /build/reproducible-path/liblemon-1.3.1+dfsg /build/reproducible-path/liblemon-1.3.1+dfsg/test /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test/CMakeFiles/arc_look_up_test.dir/DependInfo.cmake "--color=" make[5]: Leaving directory '/build/reproducible-path/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 '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 18%] Building CXX object test/CMakeFiles/arc_look_up_test.dir/arc_look_up_test.cc.o cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -I/build/reproducible-path/liblemon-1.3.1+dfsg -I/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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 -MD -MT test/CMakeFiles/arc_look_up_test.dir/arc_look_up_test.cc.o -MF CMakeFiles/arc_look_up_test.dir/arc_look_up_test.cc.o.d -o CMakeFiles/arc_look_up_test.dir/arc_look_up_test.cc.o -c /build/reproducible-path/liblemon-1.3.1+dfsg/test/arc_look_up_test.cc In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lgf_writer.h:37, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:36, from /build/reproducible-path/liblemon-1.3.1+dfsg/test/arc_look_up_test.cc:21: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:1973:21: warning: 'template struct std::iterator' is deprecated [-Wdeprecated-declarations] 1973 | : public std::iterator { | ^~~~~~~~ In file included from /usr/include/c++/13/bits/stl_iterator_base_funcs.h:66, from /usr/include/c++/13/string:47, from /usr/include/c++/13/bits/locale_classes.h:40, from /usr/include/c++/13/bits/ios_base.h:41, from /usr/include/c++/13/ios:44, from /usr/include/c++/13/ostream:40, from /usr/include/c++/13/iostream:41, from /build/reproducible-path/liblemon-1.3.1+dfsg/test/arc_look_up_test.cc:19: /usr/include/c++/13/bits/stl_iterator_base_types.h:127:34: note: declared here 127 | struct _GLIBCXX17_DEPRECATED iterator | ^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:3135:21: warning: 'template struct std::iterator' is deprecated [-Wdeprecated-declarations] 3135 | : public std::iterator { | ^~~~~~~~ /usr/include/c++/13/bits/stl_iterator_base_types.h:127:34: note: declared here 127 | struct _GLIBCXX17_DEPRECATED iterator | ^~~~~~~~ [ 19%] Linking CXX executable arc_look_up_test cd /build/reproducible-path/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 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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,-z,relro -Wl,-z,now -rdynamic CMakeFiles/arc_look_up_test.dir/arc_look_up_test.cc.o -o arc_look_up_test -L/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[5]: Leaving directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 19%] Built target arc_look_up_test make -f test/CMakeFiles/bellman_ford_test.dir/build.make test/CMakeFiles/bellman_ford_test.dir/depend make[5]: Entering directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /build/reproducible-path/liblemon-1.3.1+dfsg /build/reproducible-path/liblemon-1.3.1+dfsg/test /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test/CMakeFiles/bellman_ford_test.dir/DependInfo.cmake "--color=" make[5]: Leaving directory '/build/reproducible-path/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 '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 19%] Building CXX object test/CMakeFiles/bellman_ford_test.dir/bellman_ford_test.cc.o cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -I/build/reproducible-path/liblemon-1.3.1+dfsg -I/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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 -MD -MT test/CMakeFiles/bellman_ford_test.dir/bellman_ford_test.cc.o -MF CMakeFiles/bellman_ford_test.dir/bellman_ford_test.cc.o.d -o CMakeFiles/bellman_ford_test.dir/bellman_ford_test.cc.o -c /build/reproducible-path/liblemon-1.3.1+dfsg/test/bellman_ford_test.cc In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lgf_writer.h:37, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:36, from /build/reproducible-path/liblemon-1.3.1+dfsg/test/bellman_ford_test.cc:22: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:1973:21: warning: 'template struct std::iterator' is deprecated [-Wdeprecated-declarations] 1973 | : public std::iterator { | ^~~~~~~~ In file included from /usr/include/c++/13/bits/stl_algobase.h:65, from /usr/include/c++/13/vector:62, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/core.h:22, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:26, from /build/reproducible-path/liblemon-1.3.1+dfsg/test/bellman_ford_test.cc:19: /usr/include/c++/13/bits/stl_iterator_base_types.h:127:34: note: declared here 127 | struct _GLIBCXX17_DEPRECATED iterator | ^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:3135:21: warning: 'template struct std::iterator' is deprecated [-Wdeprecated-declarations] 3135 | : public std::iterator { | ^~~~~~~~ /usr/include/c++/13/bits/stl_iterator_base_types.h:127:34: note: declared here 127 | struct _GLIBCXX17_DEPRECATED iterator | ^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/test/bellman_ford_test.cc: In function 'void checkBellmanFordCompile()': /build/reproducible-path/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); | ^ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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); | ^ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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(); | ^ /build/reproducible-path/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) : | ^~~~~~~ /build/reproducible-path/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(); | ^ /build/reproducible-path/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) : | ^~~~~~~ /build/reproducible-path/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); | ^ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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); | ^ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/test/bellman_ford_test.cc:23: /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/test/bellman_ford_test.cc:101:37: required from here /build/reproducible-path/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])) { | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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])) { | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/test/bellman_ford_test.cc:138:31: required from here /build/reproducible-path/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])) { | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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])) { | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:27: /build/reproducible-path/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&; Key = lemon::concepts::Digraph::Node; Value = lemon::concepts::Digraph::Arc]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bellman_ford.h:406:19: required from 'void lemon::BellmanFord::init(Value) [with GR = lemon::concepts::Digraph; LEN = lemon::concepts::ReadMap; TR = lemon::BellmanFordDefaultTraits >; Value = int]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/bellman_ford_test.cc:84:17: required from here /build/reproducible-path/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; } | ~~~~~~~~~~~~~^~ /build/reproducible-path/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 /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bellman_ford.h:27: /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/path.h:228:28: required from 'void lemon::Path::buildRev(const CPath&) [with CPath = lemon::PredMapPath >; GR = lemon::concepts::Digraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/path.h:1017:20: required from 'static void lemon::_path_bits::PathCopySelectorBackward::copy(const From&, To&) [with From = lemon::PredMapPath >; To = lemon::Path]' /build/reproducible-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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/path.h:1046:49: required from 'void lemon::pathCopy(const From&, To&) [with From = PredMapPath >; To = Path]' /build/reproducible-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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bellman_ford.h:1010:62: required from 'bool lemon::BellmanFordWizard::run(Node, Node) [with TR = lemon::BellmanFordWizardBase >; Node = lemon::concepts::Digraph::Node]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/bellman_ford_test.cc:155:37: required from here /build/reproducible-path/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) { | ~~~~~^~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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); | ~~~~~^~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/path.h:1017:20: required from 'static void lemon::_path_bits::PathCopySelectorBackward::copy(const From&, To&) [with From = lemon::PredMapPath >; To = lemon::Path]' /build/reproducible-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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/path.h:1046:49: required from 'void lemon::pathCopy(const From&, To&) [with From = PredMapPath >; To = Path]' /build/reproducible-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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bellman_ford.h:1010:62: required from 'bool lemon::BellmanFordWizard::run(Node, Node) [with TR = lemon::BellmanFordWizardBase >; Node = lemon::concepts::Digraph::Node]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/bellman_ford_test.cc:155:37: required from here /build/reproducible-path/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; | ~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/path.h:1017:20: required from 'static void lemon::_path_bits::PathCopySelectorBackward::copy(const From&, To&) [with From = lemon::PredMapPath >; To = lemon::Path]' /build/reproducible-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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/path.h:1046:49: required from 'void lemon::pathCopy(const From&, To&) [with From = PredMapPath >; To = Path]' /build/reproducible-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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bellman_ford.h:1010:62: required from 'bool lemon::BellmanFordWizard::run(Node, Node) [with TR = lemon::BellmanFordWizardBase >; Node = lemon::concepts::Digraph::Node]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/bellman_ford_test.cc:155:37: required from here /build/reproducible-path/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]); | ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ In file included from /usr/include/arm-linux-gnueabihf/c++/13/bits/c++allocator.h:33, from /usr/include/c++/13/bits/allocator.h:46, from /usr/include/c++/13/vector:63: In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]', inlined from 'static void std::allocator_traits >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]' at /usr/include/c++/13/bits/alloc_traits.h:538:17, inlined from 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/vector.tcc:117:30, inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/stl_vector.h:1296:21, inlined from 'lemon::SmartDigraphBase::Node lemon::SmartDigraphBase::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:22, inlined from 'lemon::DigraphExtender::Node lemon::DigraphExtender::addNode() [with Base = lemon::SmartDigraphBase]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:268:34: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/test/bellman_ford_test.cc:20: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h: In member function 'lemon::DigraphExtender::Node lemon::DigraphExtender::addNode() [with Base = lemon::SmartDigraphBase]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:29: note: '' declared here 77 | nodes.push_back(NodeT()); | ^ In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::ArcT; _Args = {lemon::SmartDigraphBase::ArcT}; _Tp = lemon::SmartDigraphBase::ArcT]', inlined from 'static void std::allocator_traits >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::ArcT; _Args = {lemon::SmartDigraphBase::ArcT}; _Tp = lemon::SmartDigraphBase::ArcT]' at /usr/include/c++/13/bits/alloc_traits.h:538:17, inlined from 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {lemon::SmartDigraphBase::ArcT}; _Tp = lemon::SmartDigraphBase::ArcT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/vector.tcc:117:30, inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = lemon::SmartDigraphBase::ArcT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/stl_vector.h:1296:21, inlined from 'lemon::SmartDigraphBase::Arc lemon::SmartDigraphBase::addArc(Node, Node)' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:85:21, inlined from 'lemon::DigraphExtender::Arc lemon::DigraphExtender::addArc(const Node&, const Node&) [with Base = lemon::SmartDigraphBase]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:274:31: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h: In member function 'lemon::DigraphExtender::Arc lemon::DigraphExtender::addArc(const Node&, const Node&) [with Base = lemon::SmartDigraphBase]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:85:27: note: '' declared here 85 | arcs.push_back(ArcT()); | ^ In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]', inlined from 'static void std::allocator_traits >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]' at /usr/include/c++/13/bits/alloc_traits.h:538:17, inlined from 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/vector.tcc:117:30, inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/stl_vector.h:1296:21, inlined from 'lemon::SmartDigraphBase::Node lemon::SmartDigraphBase::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:22, inlined from 'lemon::DigraphExtender::Node lemon::DigraphExtender::addNode() [with Base = lemon::SmartDigraphBase]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:268:34, inlined from 'lemon::DigraphExtender::Node lemon::SmartDigraph::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:223:44, inlined from 'void checkBellmanFordNegativeCycle()' at /build/reproducible-path/liblemon-1.3.1+dfsg/test/bellman_ford_test.cc:235:23: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h: In function 'void checkBellmanFordNegativeCycle()': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:29: note: '' declared here 77 | nodes.push_back(NodeT()); | ^ In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]', inlined from 'static void std::allocator_traits >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]' at /usr/include/c++/13/bits/alloc_traits.h:538:17, inlined from 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/vector.tcc:117:30, inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/stl_vector.h:1296:21, inlined from 'lemon::SmartDigraphBase::Node lemon::SmartDigraphBase::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:22, inlined from 'lemon::DigraphExtender::Node lemon::DigraphExtender::addNode() [with Base = lemon::SmartDigraphBase]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:268:34, inlined from 'lemon::DigraphExtender::Node lemon::SmartDigraph::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:223:44, inlined from 'void checkBellmanFordNegativeCycle()' at /build/reproducible-path/liblemon-1.3.1+dfsg/test/bellman_ford_test.cc:236:23: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h: In function 'void checkBellmanFordNegativeCycle()': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:29: note: '' declared here 77 | nodes.push_back(NodeT()); | ^ In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]', inlined from 'static void std::allocator_traits >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]' at /usr/include/c++/13/bits/alloc_traits.h:538:17, inlined from 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/vector.tcc:117:30, inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/stl_vector.h:1296:21, inlined from 'lemon::SmartDigraphBase::Node lemon::SmartDigraphBase::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:22, inlined from 'lemon::DigraphExtender::Node lemon::DigraphExtender::addNode() [with Base = lemon::SmartDigraphBase]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:268:34, inlined from 'lemon::DigraphExtender::Node lemon::SmartDigraph::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:223:44, inlined from 'void checkBellmanFordNegativeCycle()' at /build/reproducible-path/liblemon-1.3.1+dfsg/test/bellman_ford_test.cc:237:23: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h: In function 'void checkBellmanFordNegativeCycle()': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:29: note: '' declared here 77 | nodes.push_back(NodeT()); | ^ In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]', inlined from 'static void std::allocator_traits >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]' at /usr/include/c++/13/bits/alloc_traits.h:538:17, inlined from 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/vector.tcc:117:30, inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/stl_vector.h:1296:21, inlined from 'lemon::SmartDigraphBase::Node lemon::SmartDigraphBase::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:22, inlined from 'lemon::DigraphExtender::Node lemon::DigraphExtender::addNode() [with Base = lemon::SmartDigraphBase]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:268:34, inlined from 'lemon::DigraphExtender::Node lemon::SmartDigraph::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:223:44, inlined from 'void checkBellmanFordNegativeCycle()' at /build/reproducible-path/liblemon-1.3.1+dfsg/test/bellman_ford_test.cc:238:23: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h: In function 'void checkBellmanFordNegativeCycle()': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:29: note: '' declared here 77 | nodes.push_back(NodeT()); | ^ [ 20%] Linking CXX executable bellman_ford_test cd /build/reproducible-path/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 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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,-z,relro -Wl,-z,now -rdynamic CMakeFiles/bellman_ford_test.dir/bellman_ford_test.cc.o -o bellman_ford_test -L/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[5]: Leaving directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 20%] Built target bellman_ford_test make -f test/CMakeFiles/bfs_test.dir/build.make test/CMakeFiles/bfs_test.dir/depend make[5]: Entering directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /build/reproducible-path/liblemon-1.3.1+dfsg /build/reproducible-path/liblemon-1.3.1+dfsg/test /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test/CMakeFiles/bfs_test.dir/DependInfo.cmake "--color=" make[5]: Leaving directory '/build/reproducible-path/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 '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 21%] Building CXX object test/CMakeFiles/bfs_test.dir/bfs_test.cc.o cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -I/build/reproducible-path/liblemon-1.3.1+dfsg -I/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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 -MD -MT test/CMakeFiles/bfs_test.dir/bfs_test.cc.o -MF CMakeFiles/bfs_test.dir/bfs_test.cc.o.d -o CMakeFiles/bfs_test.dir/bfs_test.cc.o -c /build/reproducible-path/liblemon-1.3.1+dfsg/test/bfs_test.cc In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lgf_writer.h:37, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:36, from /build/reproducible-path/liblemon-1.3.1+dfsg/test/bfs_test.cc:22: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:1973:21: warning: 'template struct std::iterator' is deprecated [-Wdeprecated-declarations] 1973 | : public std::iterator { | ^~~~~~~~ In file included from /usr/include/c++/13/bits/stl_algobase.h:65, from /usr/include/c++/13/vector:62, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/core.h:22, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:26, from /build/reproducible-path/liblemon-1.3.1+dfsg/test/bfs_test.cc:19: /usr/include/c++/13/bits/stl_iterator_base_types.h:127:34: note: declared here 127 | struct _GLIBCXX17_DEPRECATED iterator | ^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:3135:21: warning: 'template struct std::iterator' is deprecated [-Wdeprecated-declarations] 3135 | : public std::iterator { | ^~~~~~~~ /usr/include/c++/13/bits/stl_iterator_base_types.h:127:34: note: declared here 127 | struct _GLIBCXX17_DEPRECATED iterator | ^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/test/bfs_test.cc: In function 'void checkBfsCompile()': /build/reproducible-path/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(); | ^ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ^ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ^ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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(); | ^ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ^ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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); | ^ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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(); | ^ /build/reproducible-path/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) : | ^~~~~~~ /build/reproducible-path/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(); | ^ /build/reproducible-path/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) : | ^~~~~~~ /build/reproducible-path/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(); | ^ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ^ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ^ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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(); | ^ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ^ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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); | ^ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/test/bfs_test.cc:23: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bfs.h: In instantiation of 'void lemon::Bfs::addSource(Node) [with GR = lemon::concepts::Digraph; TR = lemon::BfsDefaultTraits; Node = lemon::concepts::Digraph::Node]': /build/reproducible-path/liblemon-1.3.1+dfsg/test/bfs_test.cc:80:23: required from here /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~^~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; Node = lemon::concepts::Digraph::Node]': /build/reproducible-path/liblemon-1.3.1+dfsg/test/bfs_test.cc:81:33: required from here /build/reproducible-path/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)]) { | ~^~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~^~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bfs.h: In instantiation of 'lemon::Bfs::Node lemon::Bfs::processNextNode(Node, bool&) [with GR = lemon::concepts::Digraph; TR = lemon::BfsDefaultTraits; Node = lemon::concepts::Digraph::Node]': /build/reproducible-path/liblemon-1.3.1+dfsg/test/bfs_test.cc:82:33: required from here /build/reproducible-path/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)]) { | ~^~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~^~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bfs.h: In instantiation of 'lemon::Bfs::Node lemon::Bfs::processNextNode(const NM&, Node&) [with NM = lemon::concepts::ReadMap; GR = lemon::concepts::Digraph; TR = lemon::BfsDefaultTraits; Node = lemon::concepts::Digraph::Node]': /build/reproducible-path/liblemon-1.3.1+dfsg/test/bfs_test.cc:83:33: required from here /build/reproducible-path/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)]) { | ~^~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~^~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bfs.h: In instantiation of 'void lemon::Bfs::addSource(Node) [with GR = lemon::concepts::Digraph; TR = lemon::Bfs::SetPredMapTraits > >::SetDistMapTraits > >::SetReachedMapTraits > >::SetStandardProcessedMapTraits>::SetProcessedMapTraits >; Node = lemon::concepts::Digraph::Node]': /build/reproducible-path/liblemon-1.3.1+dfsg/test/bfs_test.cc:125:23: required from here /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~^~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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 >; Node = lemon::concepts::Digraph::Node]': /build/reproducible-path/liblemon-1.3.1+dfsg/test/bfs_test.cc:126:33: required from here /build/reproducible-path/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)]) { | ~^~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~^~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bfs.h: In instantiation of 'lemon::Bfs::Node lemon::Bfs::processNextNode(Node, bool&) [with GR = lemon::concepts::Digraph; TR = lemon::Bfs::SetPredMapTraits > >::SetDistMapTraits > >::SetReachedMapTraits > >::SetStandardProcessedMapTraits>::SetProcessedMapTraits >; Node = lemon::concepts::Digraph::Node]': /build/reproducible-path/liblemon-1.3.1+dfsg/test/bfs_test.cc:127:33: required from here /build/reproducible-path/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)]) { | ~^~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~^~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bfs.h: In instantiation of 'lemon::Bfs::Node lemon::Bfs::processNextNode(const NM&, Node&) [with NM = lemon::concepts::ReadMap; GR = lemon::concepts::Digraph; TR = lemon::Bfs::SetPredMapTraits > >::SetDistMapTraits > >::SetReachedMapTraits > >::SetStandardProcessedMapTraits>::SetProcessedMapTraits >; Node = lemon::concepts::Digraph::Node]': /build/reproducible-path/liblemon-1.3.1+dfsg/test/bfs_test.cc:128:33: required from here /build/reproducible-path/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)]) { | ~^~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~^~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:27: /build/reproducible-path/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&; Key = lemon::concepts::Digraph::Node; Value = lemon::concepts::Digraph::Arc]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bfs.h:441:19: required from 'void lemon::Bfs::init() [with GR = lemon::concepts::Digraph; TR = lemon::BfsDefaultTraits]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/bfs_test.cc:79:18: required from here /build/reproducible-path/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; } | ~~~~~~~~~~~~~^~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bfs.h: In instantiation of 'void lemon::Bfs::addSource(Node) [with GR = lemon::concepts::Digraph; TR = lemon::BfsWizardBase; Node = lemon::concepts::Digraph::Node]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bfs.h:683:7: required from 'void lemon::Bfs::run(Node) [with GR = lemon::concepts::Digraph; TR = lemon::BfsWizardBase; Node = lemon::concepts::Digraph::Node]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bfs.h:1023:16: required from 'void lemon::BfsWizard::run(Node) [with TR = lemon::BfsWizardBase; Node = lemon::concepts::Digraph::Node]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/bfs_test.cc:156:13: required from here /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~^~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bfs.h: In instantiation of 'void lemon::Bfs::addSource(Node) [with GR = lemon::concepts::Digraph; TR = lemon::BfsWizard >::SetPredMapBase > >::SetDistMapBase > >::SetReachedMapBase > >::SetProcessedMapBase >; Node = lemon::concepts::Digraph::Node]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bfs.h:683:7: required from 'void lemon::Bfs::run(Node) [with GR = lemon::concepts::Digraph; TR = lemon::BfsWizard >::SetPredMapBase > >::SetDistMapBase > >::SetReachedMapBase > >::SetProcessedMapBase >; Node = lemon::concepts::Digraph::Node]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bfs.h:1023:16: required from 'void lemon::BfsWizard::run(Node) [with TR = lemon::BfsWizard >::SetPredMapBase > >::SetDistMapBase > >::SetReachedMapBase > >::SetProcessedMapBase >; Node = lemon::concepts::Digraph::Node]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/bfs_test.cc:164:9: required from here /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~^~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bfs.h: In instantiation of 'void lemon::Bfs::addSource(Node) [with GR = lemon::concepts::Digraph; TR = lemon::BfsWizard >::SetPredMapBase > >::SetDistMapBase > >::SetReachedMapBase > >::SetProcessedMapBase > >::SetPathBase >; Node = lemon::concepts::Digraph::Node]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bfs.h:704:7: required from 'bool lemon::Bfs::run(Node, Node) [with GR = lemon::concepts::Digraph; TR = lemon::BfsWizard >::SetPredMapBase > >::SetDistMapBase > >::SetReachedMapBase > >::SetProcessedMapBase > >::SetPathBase >; Node = lemon::concepts::Digraph::Node]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bfs.h:1046:14: required from 'bool lemon::BfsWizard::run(Node, Node) [with TR = lemon::BfsWizard >::SetPredMapBase > >::SetDistMapBase > >::SetReachedMapBase > >::SetProcessedMapBase > >::SetPathBase >; Node = lemon::concepts::Digraph::Node]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/bfs_test.cc:172:9: required from here /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~^~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; Node = lemon::concepts::Digraph::Node]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bfs.h:601:46: required from 'void lemon::Bfs::start() [with GR = lemon::concepts::Digraph; TR = lemon::BfsWizardBase]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bfs.h:684:12: required from 'void lemon::Bfs::run(Node) [with GR = lemon::concepts::Digraph; TR = lemon::BfsWizardBase; Node = lemon::concepts::Digraph::Node]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bfs.h:1023:16: required from 'void lemon::BfsWizard::run(Node) [with TR = lemon::BfsWizardBase; Node = lemon::concepts::Digraph::Node]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/bfs_test.cc:156:13: required from here /build/reproducible-path/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)]) { | ~^~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~^~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bfs.h: In instantiation of 'lemon::Bfs::Node lemon::Bfs::processNextNode(Node, bool&) [with GR = lemon::concepts::Digraph; TR = lemon::BfsWizardBase; Node = lemon::concepts::Digraph::Node]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bfs.h:628:56: required from 'void lemon::Bfs::start(Node) [with GR = lemon::concepts::Digraph; TR = lemon::BfsWizardBase; Node = lemon::concepts::Digraph::Node]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bfs.h:705:12: required from 'bool lemon::Bfs::run(Node, Node) [with GR = lemon::concepts::Digraph; TR = lemon::BfsWizardBase; Node = lemon::concepts::Digraph::Node]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bfs.h:1046:14: required from 'bool lemon::BfsWizard::run(Node, Node) [with TR = lemon::BfsWizardBase; Node = lemon::concepts::Digraph::Node]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/bfs_test.cc:157:15: required from here /build/reproducible-path/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)]) { | ~^~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~^~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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 >; Node = lemon::concepts::Digraph::Node]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bfs.h:601:46: required from 'void lemon::Bfs::start() [with GR = lemon::concepts::Digraph; TR = lemon::BfsWizard >::SetPredMapBase > >::SetDistMapBase > >::SetReachedMapBase > >::SetProcessedMapBase >]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bfs.h:684:12: required from 'void lemon::Bfs::run(Node) [with GR = lemon::concepts::Digraph; TR = lemon::BfsWizard >::SetPredMapBase > >::SetDistMapBase > >::SetReachedMapBase > >::SetProcessedMapBase >; Node = lemon::concepts::Digraph::Node]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bfs.h:1023:16: required from 'void lemon::BfsWizard::run(Node) [with TR = lemon::BfsWizard >::SetPredMapBase > >::SetDistMapBase > >::SetReachedMapBase > >::SetProcessedMapBase >; Node = lemon::concepts::Digraph::Node]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/bfs_test.cc:164:9: required from here /build/reproducible-path/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)]) { | ~^~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~^~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bfs.h: In instantiation of 'lemon::Bfs::Node lemon::Bfs::processNextNode(Node, bool&) [with GR = lemon::concepts::Digraph; TR = lemon::BfsWizard >::SetPredMapBase > >::SetDistMapBase > >::SetReachedMapBase > >::SetProcessedMapBase > >::SetPathBase >; Node = lemon::concepts::Digraph::Node]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bfs.h:628:56: required from 'void lemon::Bfs::start(Node) [with GR = lemon::concepts::Digraph; TR = lemon::BfsWizard >::SetPredMapBase > >::SetDistMapBase > >::SetReachedMapBase > >::SetProcessedMapBase > >::SetPathBase >; Node = lemon::concepts::Digraph::Node]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bfs.h:705:12: required from 'bool lemon::Bfs::run(Node, Node) [with GR = lemon::concepts::Digraph; TR = lemon::BfsWizard >::SetPredMapBase > >::SetDistMapBase > >::SetReachedMapBase > >::SetProcessedMapBase > >::SetPathBase >; Node = lemon::concepts::Digraph::Node]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bfs.h:1046:14: required from 'bool lemon::BfsWizard::run(Node, Node) [with TR = lemon::BfsWizard >::SetPredMapBase > >::SetDistMapBase > >::SetReachedMapBase > >::SetProcessedMapBase > >::SetPathBase >; Node = lemon::concepts::Digraph::Node]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/bfs_test.cc:172:9: required from here /build/reproducible-path/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)]) { | ~^~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~^~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bfs.h:27: /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/path.h:228:28: required from 'void lemon::Path::buildRev(const CPath&) [with CPath = lemon::PredMapPath >; GR = lemon::concepts::Digraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/path.h:1017:20: required from 'static void lemon::_path_bits::PathCopySelectorBackward::copy(const From&, To&) [with From = lemon::PredMapPath >; To = lemon::Path]' /build/reproducible-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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/path.h:1046:49: required from 'void lemon::pathCopy(const From&, To&) [with From = PredMapPath >; To = Path]' /build/reproducible-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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/bfs_test.cc:98:31: required from here /build/reproducible-path/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) { | ~~~~~^~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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); | ~~~~~^~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/path.h:1017:20: required from 'static void lemon::_path_bits::PathCopySelectorBackward::copy(const From&, To&) [with From = lemon::PredMapPath >; To = lemon::Path]' /build/reproducible-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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/path.h:1046:49: required from 'void lemon::pathCopy(const From&, To&) [with From = PredMapPath >; To = Path]' /build/reproducible-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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/bfs_test.cc:98:31: required from here /build/reproducible-path/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; | ~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/path.h:1017:20: required from 'static void lemon::_path_bits::PathCopySelectorBackward::copy(const From&, To&) [with From = lemon::PredMapPath >; To = lemon::Path]' /build/reproducible-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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/path.h:1046:49: required from 'void lemon::pathCopy(const From&, To&) [with From = PredMapPath >; To = Path]' /build/reproducible-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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/bfs_test.cc:98:31: required from here /build/reproducible-path/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]); | ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/path.h:228:28: required from 'void lemon::Path::buildRev(const CPath&) [with CPath = lemon::PredMapPath >; GR = lemon::concepts::Digraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/path.h:1017:20: required from 'static void lemon::_path_bits::PathCopySelectorBackward::copy(const From&, To&) [with From = lemon::PredMapPath >; To = lemon::Path]' /build/reproducible-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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/path.h:1046:49: required from 'void lemon::pathCopy(const From&, To&) [with From = PredMapPath >; To = Path]' /build/reproducible-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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/bfs_test.cc:141:25: required from here /build/reproducible-path/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) { | ~~~~~^~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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); | ~~~~~^~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/path.h:1017:20: required from 'static void lemon::_path_bits::PathCopySelectorBackward::copy(const From&, To&) [with From = lemon::PredMapPath >; To = lemon::Path]' /build/reproducible-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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/path.h:1046:49: required from 'void lemon::pathCopy(const From&, To&) [with From = PredMapPath >; To = Path]' /build/reproducible-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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/bfs_test.cc:141:25: required from here /build/reproducible-path/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; | ~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/path.h:1017:20: required from 'static void lemon::_path_bits::PathCopySelectorBackward::copy(const From&, To&) [with From = lemon::PredMapPath >; To = lemon::Path]' /build/reproducible-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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/path.h:1046:49: required from 'void lemon::pathCopy(const From&, To&) [with From = PredMapPath >; To = Path]' /build/reproducible-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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/bfs_test.cc:141:25: required from here /build/reproducible-path/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]); | ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ In file included from /usr/include/arm-linux-gnueabihf/c++/13/bits/c++allocator.h:33, from /usr/include/c++/13/bits/allocator.h:46, from /usr/include/c++/13/vector:63: In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::ArcT; _Args = {lemon::SmartDigraphBase::ArcT}; _Tp = lemon::SmartDigraphBase::ArcT]', inlined from 'static void std::allocator_traits >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::ArcT; _Args = {lemon::SmartDigraphBase::ArcT}; _Tp = lemon::SmartDigraphBase::ArcT]' at /usr/include/c++/13/bits/alloc_traits.h:538:17, inlined from 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {lemon::SmartDigraphBase::ArcT}; _Tp = lemon::SmartDigraphBase::ArcT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/vector.tcc:117:30, inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = lemon::SmartDigraphBase::ArcT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/stl_vector.h:1296:21, inlined from 'lemon::SmartDigraphBase::Arc lemon::SmartDigraphBase::addArc(Node, Node)' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:85:21, inlined from 'lemon::DigraphExtender::Arc lemon::DigraphExtender::addArc(const Node&, const Node&) [with Base = lemon::SmartDigraphBase]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:274:31: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/test/bfs_test.cc:20: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h: In member function 'lemon::DigraphExtender::Arc lemon::DigraphExtender::addArc(const Node&, const Node&) [with Base = lemon::SmartDigraphBase]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:85:27: note: '' declared here 85 | arcs.push_back(ArcT()); | ^ In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]', inlined from 'static void std::allocator_traits >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]' at /usr/include/c++/13/bits/alloc_traits.h:538:17, inlined from 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/vector.tcc:117:30, inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/stl_vector.h:1296:21, inlined from 'lemon::SmartDigraphBase::Node lemon::SmartDigraphBase::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:22, inlined from 'lemon::DigraphExtender::Node lemon::DigraphExtender::addNode() [with Base = lemon::SmartDigraphBase]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:268:34, inlined from 'lemon::DigraphExtender::Node lemon::SmartDigraph::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:223:44, inlined from 'void lemon::DigraphReader::readNodes() [with DGR = lemon::SmartDigraph]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:954:31: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h: In member function 'void lemon::DigraphReader::readNodes() [with DGR = lemon::SmartDigraph]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:29: note: '' declared here 77 | nodes.push_back(NodeT()); | ^ [ 22%] Linking CXX executable bfs_test cd /build/reproducible-path/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 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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,-z,relro -Wl,-z,now -rdynamic CMakeFiles/bfs_test.dir/bfs_test.cc.o -o bfs_test -L/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[5]: Leaving directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 22%] Built target bfs_test make -f test/CMakeFiles/bpgraph_test.dir/build.make test/CMakeFiles/bpgraph_test.dir/depend make[5]: Entering directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /build/reproducible-path/liblemon-1.3.1+dfsg /build/reproducible-path/liblemon-1.3.1+dfsg/test /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test/CMakeFiles/bpgraph_test.dir/DependInfo.cmake "--color=" make[5]: Leaving directory '/build/reproducible-path/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 '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 24%] Building CXX object test/CMakeFiles/bpgraph_test.dir/bpgraph_test.cc.o cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -I/build/reproducible-path/liblemon-1.3.1+dfsg -I/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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 -MD -MT test/CMakeFiles/bpgraph_test.dir/bpgraph_test.cc.o -MF CMakeFiles/bpgraph_test.dir/bpgraph_test.cc.o.d -o CMakeFiles/bpgraph_test.dir/bpgraph_test.cc.o -c /build/reproducible-path/liblemon-1.3.1+dfsg/test/bpgraph_test.cc In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/test/graph_test.h:25, from /build/reproducible-path/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:25: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:1973:21: warning: 'template struct std::iterator' is deprecated [-Wdeprecated-declarations] 1973 | : public std::iterator { | ^~~~~~~~ In file included from /usr/include/c++/13/bits/stl_algobase.h:65, from /usr/include/c++/13/vector:62, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/core.h:22, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:26, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:26, from /build/reproducible-path/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:19: /usr/include/c++/13/bits/stl_iterator_base_types.h:127:34: note: declared here 127 | struct _GLIBCXX17_DEPRECATED iterator | ^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:3135:21: warning: 'template struct std::iterator' is deprecated [-Wdeprecated-declarations] 3135 | : public std::iterator { | ^~~~~~~~ /usr/include/c++/13/bits/stl_iterator_base_types.h:127:34: note: declared here 127 | struct _GLIBCXX17_DEPRECATED iterator | ^~~~~~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseBpGraphComponent; Type = concepts::BaseBpGraphComponent]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:324:62: required from here /build/reproducible-path/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); | ~~~^~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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() {} | ^~~~~~~ /build/reproducible-path/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); | ~~~^~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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() {} | ^~~~~~~~ /build/reproducible-path/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); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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() {} | ^~~~~~~ /build/reproducible-path/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); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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() {} | ^~~~~~~~ /build/reproducible-path/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); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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() {} | ^~~~~~~ /build/reproducible-path/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); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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() {} | ^~~~~~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::ExtendableBpGraphComponent<>; Type = concepts::ExtendableBpGraphComponent<>]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:339:37: required from here /build/reproducible-path/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(); | ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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() {} | ^~~~~~~ /build/reproducible-path/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(); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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() {} | ^~~~~~~~ /build/reproducible-path/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); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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() {} | ^~~~ /build/reproducible-path/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); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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() {} | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::ExtendableBpGraphComponent<>; Type = SmartBpGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:354:61: required from here /build/reproducible-path/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 /build/reproducible-path/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:21: /build/reproducible-path/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) {} | ^~~~~~~ /build/reproducible-path/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(); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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) {} | ^~~~~~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseGraphComponent; Type = concepts::BaseBpGraphComponent]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseBpGraphComponent; Type = concepts::BaseBpGraphComponent]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:324:62: required from here /build/reproducible-path/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; | ~~~^~~ /build/reproducible-path/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() {} | ^~~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItem<'n'>; Type = concepts::BaseBpGraphComponent::RedNode]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseBpGraphComponent; Type = concepts::BaseBpGraphComponent]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:324:62: required from here /build/reproducible-path/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; | ~~^~~~~~~~ /build/reproducible-path/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() {} | ^~~~~~~ /build/reproducible-path/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; | ~~~^~~~ /build/reproducible-path/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() {} | ^~~~~~~ /build/reproducible-path/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; | ~~~^~~~~~~~~ /build/reproducible-path/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() {} | ^~~~~~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItem<'n'>; Type = concepts::BaseBpGraphComponent::BlueNode]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseBpGraphComponent; Type = concepts::BaseBpGraphComponent]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:324:62: required from here /build/reproducible-path/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; | ~~^~~~~~~~ /build/reproducible-path/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() {} | ^~~~~~~~ /build/reproducible-path/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; | ~~~^~~~ /build/reproducible-path/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() {} | ^~~~~~~~ /build/reproducible-path/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; | ~~~^~~~~~~~~ /build/reproducible-path/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() {} | ^~~~~~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IDableGraphComponent; Type = concepts::IDableBpGraphComponent<>]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IDableBpGraphComponent<>; Type = concepts::IDableBpGraphComponent<>]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:327:33: required from here /build/reproducible-path/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); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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() {} | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItemIt, concepts::BaseBpGraphComponent::RedNode>; Type = concepts::GraphItemIt, concepts::BaseBpGraphComponent::RedNode>]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableBpGraphComponent<>; Type = concepts::IterableBpGraphComponent<>]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:330:35: required from here /build/reproducible-path/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; | ~~~^~~~~ /build/reproducible-path/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() {} | ^~~~~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItemIt, concepts::BaseBpGraphComponent::BlueNode>; Type = concepts::GraphItemIt, concepts::BaseBpGraphComponent::BlueNode>]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableBpGraphComponent<>; Type = concepts::IterableBpGraphComponent<>]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:330:35: required from here /build/reproducible-path/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; | ~~~^~~~~ /build/reproducible-path/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() {} | ^~~~~~~~ /build/reproducible-path/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<>]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseBpGraphComponent; Type = concepts::ExtendableBpGraphComponent<>]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::ExtendableBpGraphComponent<>; Type = concepts::ExtendableBpGraphComponent<>]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:339:37: required from here /build/reproducible-path/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); | ~~~^~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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() {} | ^~~~~~~ /build/reproducible-path/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); | ~~~^~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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() {} | ^~~~~~~~ /build/reproducible-path/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); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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() {} | ^~~~~~~ /build/reproducible-path/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); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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() {} | ^~~~~~~~ /build/reproducible-path/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); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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() {} | ^~~~~~~ /build/reproducible-path/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); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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() {} | ^~~~~~~~ /build/reproducible-path/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<>]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseBpGraphComponent; Type = concepts::ErasableBpGraphComponent<>]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::ErasableBpGraphComponent<>; Type = concepts::ErasableBpGraphComponent<>]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:342:35: required from here /build/reproducible-path/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); | ~~~^~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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() {} | ^~~~~~~ /build/reproducible-path/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); | ~~~^~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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() {} | ^~~~~~~~ /build/reproducible-path/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); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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() {} | ^~~~~~~ /build/reproducible-path/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); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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() {} | ^~~~~~~~ /build/reproducible-path/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); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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() {} | ^~~~~~~ /build/reproducible-path/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); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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() {} | ^~~~~~~~ /build/reproducible-path/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<>]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseBpGraphComponent; Type = concepts::ClearableBpGraphComponent<>]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::ClearableBpGraphComponent<>; Type = concepts::ClearableBpGraphComponent<>]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:345:36: required from here /build/reproducible-path/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); | ~~~^~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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() {} | ^~~~~~~ /build/reproducible-path/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); | ~~~^~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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() {} | ^~~~~~~~ /build/reproducible-path/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); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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() {} | ^~~~~~~ /build/reproducible-path/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); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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() {} | ^~~~~~~~ /build/reproducible-path/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); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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() {} | ^~~~~~~ /build/reproducible-path/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); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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() {} | ^~~~~~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseBpGraphComponent; Type = concepts::BpGraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BpGraph; Type = concepts::BpGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:349:35: required from here /build/reproducible-path/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); | ~~~^~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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() { } | ^~~~~~~ /build/reproducible-path/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); | ~~~^~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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() { } | ^~~~~~~~ /build/reproducible-path/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); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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() { } | ^~~~~~~ /build/reproducible-path/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); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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() { } | ^~~~~~~~ /build/reproducible-path/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); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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() { } | ^~~~~~~ /build/reproducible-path/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); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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() { } | ^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h: In instantiation of 'void lemon::concepts::BaseBpGraphComponent::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::SmartBpGraph]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseBpGraphComponent; Type = SmartBpGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:1016:55: required from 'void lemon::concepts::BpGraph::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::SmartBpGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BpGraph; Type = SmartBpGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:352:40: required from here /build/reproducible-path/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); | ~~~^~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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) {} | ^~~~~~~ /build/reproducible-path/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); | ~~~^~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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) {} | ^~~~~~~~ /build/reproducible-path/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); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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) {} | ^~~~~~~ /build/reproducible-path/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); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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) {} | ^~~~~~~~ /build/reproducible-path/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); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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) {} | ^~~~~~~ /build/reproducible-path/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); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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) {} | ^~~~~~~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItem<'e'>; Type = concepts::BaseGraphComponent::Edge]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseGraphComponent; Type = concepts::BaseBpGraphComponent]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseBpGraphComponent; Type = concepts::BaseBpGraphComponent]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:324:62: required from here /build/reproducible-path/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; | ~~^~~~~~~~ /build/reproducible-path/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() {} | ^~~~ /build/reproducible-path/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; | ~~~^~~~ /build/reproducible-path/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() {} | ^~~~ /build/reproducible-path/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; | ~~~^~~~~~~~~ /build/reproducible-path/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() {} | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItemIt, concepts::BaseGraphComponent::Edge>; Type = concepts::GraphItemIt, concepts::BaseGraphComponent::Edge>]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableGraphComponent; Type = concepts::IterableBpGraphComponent<>]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableBpGraphComponent<>; Type = concepts::IterableBpGraphComponent<>]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:330:35: required from here /build/reproducible-path/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; | ~~~^~~~~ /build/reproducible-path/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() {} | ^~~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphIncIt, concepts::BaseGraphComponent::Edge, concepts::GraphItem<'n'>, 'e'>; Type = concepts::GraphIncIt, concepts::BaseGraphComponent::Edge, concepts::GraphItem<'n'>, 'e'>]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableGraphComponent; Type = concepts::IterableBpGraphComponent<>]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableBpGraphComponent<>; Type = concepts::IterableBpGraphComponent<>]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:330:35: required from here /build/reproducible-path/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; | ~~^~~~~ /build/reproducible-path/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() {} | ^~~~ /build/reproducible-path/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<>]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseGraphComponent; Type = concepts::ExtendableBpGraphComponent<>]' /build/reproducible-path/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<>]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseBpGraphComponent; Type = concepts::ExtendableBpGraphComponent<>]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::ExtendableBpGraphComponent<>; Type = concepts::ExtendableBpGraphComponent<>]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:339:37: required from here /build/reproducible-path/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; | ~~~^~~ /build/reproducible-path/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() {} | ^~~~ /build/reproducible-path/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<>]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseGraphComponent; Type = concepts::ErasableBpGraphComponent<>]' /build/reproducible-path/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<>]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseBpGraphComponent; Type = concepts::ErasableBpGraphComponent<>]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::ErasableBpGraphComponent<>; Type = concepts::ErasableBpGraphComponent<>]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:342:35: required from here /build/reproducible-path/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; | ~~~^~~ /build/reproducible-path/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() {} | ^~~~ /build/reproducible-path/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<>]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseGraphComponent; Type = concepts::ClearableBpGraphComponent<>]' /build/reproducible-path/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<>]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseBpGraphComponent; Type = concepts::ClearableBpGraphComponent<>]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::ClearableBpGraphComponent<>; Type = concepts::ClearableBpGraphComponent<>]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:345:36: required from here /build/reproducible-path/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; | ~~~^~~ /build/reproducible-path/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() {} | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseGraphComponent; Type = concepts::BpGraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseBpGraphComponent; Type = concepts::BpGraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BpGraph; Type = concepts::BpGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:349:35: required from here /build/reproducible-path/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); | ~~^~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; | ~~~^~~ /build/reproducible-path/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&) { } | ^~~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItem<'n'>; Type = concepts::BpGraph::RedNode]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseBpGraphComponent; Type = concepts::BpGraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BpGraph; Type = concepts::BpGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:349:35: required from here /build/reproducible-path/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; | ~~^~~~~~~~ /build/reproducible-path/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() { } | ^~~~~~~ /build/reproducible-path/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; | ~~~^~~~ /build/reproducible-path/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() { } | ^~~~~~~ /build/reproducible-path/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; | ~~~^~~~~~~~~ /build/reproducible-path/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() { } | ^~~~~~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItem<'n'>; Type = concepts::BpGraph::BlueNode]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseBpGraphComponent; Type = concepts::BpGraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BpGraph; Type = concepts::BpGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:349:35: required from here /build/reproducible-path/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; | ~~^~~~~~~~ /build/reproducible-path/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() { } | ^~~~~~~~ /build/reproducible-path/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; | ~~~^~~~ /build/reproducible-path/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() { } | ^~~~~~~~ /build/reproducible-path/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; | ~~~^~~~~~~~~ /build/reproducible-path/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() { } | ^~~~~~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableGraphComponent; Type = concepts::BpGraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableBpGraphComponent<>; Type = concepts::BpGraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BpGraph; Type = concepts::BpGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:349:35: required from here /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItemIt; Type = concepts::BpGraph::RedNodeIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableBpGraphComponent<>; Type = concepts::BpGraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BpGraph; Type = concepts::BpGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:349:35: required from here /build/reproducible-path/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; | ~~~~^~~~~~~ /build/reproducible-path/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) { } | ^~~~~~~~~ /build/reproducible-path/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; | ~~~~~~^~~~~ /build/reproducible-path/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) { } | ^~~~~~~~~ /build/reproducible-path/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; | ~~~^~~~~ /build/reproducible-path/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() { } | ^~~~~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItemIt; Type = concepts::BpGraph::BlueNodeIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableBpGraphComponent<>; Type = concepts::BpGraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BpGraph; Type = concepts::BpGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:349:35: required from here /build/reproducible-path/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; | ~~~~^~~~~~~ /build/reproducible-path/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) { } | ^~~~~~~~~~ /build/reproducible-path/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; | ~~~~~~^~~~~ /build/reproducible-path/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) { } | ^~~~~~~~~~ /build/reproducible-path/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; | ~~~^~~~~ /build/reproducible-path/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() { } | ^~~~~~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IDableGraphComponent; Type = concepts::BpGraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IDableBpGraphComponent<>; Type = concepts::BpGraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BpGraph; Type = concepts::BpGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:349:35: required from here /build/reproducible-path/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); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItem<'n'>; Type = SmartBpGraphBase::RedNode]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseBpGraphComponent; Type = SmartBpGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:1016:55: required from 'void lemon::concepts::BpGraph::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::SmartBpGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BpGraph; Type = SmartBpGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:352:40: required from here /build/reproducible-path/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; | ~~^~~~~~~~ /build/reproducible-path/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) {} | ^~~~~~~ /build/reproducible-path/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; | ~~~^~~~ /build/reproducible-path/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) {} | ^~~~~~~ /build/reproducible-path/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; | ~~~^~~~~~~~~ /build/reproducible-path/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) {} | ^~~~~~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItem<'n'>; Type = SmartBpGraphBase::BlueNode]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseBpGraphComponent; Type = SmartBpGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:1016:55: required from 'void lemon::concepts::BpGraph::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::SmartBpGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BpGraph; Type = SmartBpGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:352:40: required from here /build/reproducible-path/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; | ~~^~~~~~~~ /build/reproducible-path/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) {} | ^~~~~~~~ /build/reproducible-path/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; | ~~~^~~~ /build/reproducible-path/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) {} | ^~~~~~~~ /build/reproducible-path/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; | ~~~^~~~~~~~~ /build/reproducible-path/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) {} | ^~~~~~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItemIt; Type = BpGraphExtender::RedNodeIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableBpGraphComponent<>; Type = SmartBpGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:1017:61: required from 'void lemon::concepts::BpGraph::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::SmartBpGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BpGraph; Type = SmartBpGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:352:40: required from here /build/reproducible-path/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; | ~~~^~~~~ /build/reproducible-path/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) {} | ^~~~~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItemIt; Type = BpGraphExtender::BlueNodeIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableBpGraphComponent<>; Type = SmartBpGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/bpgraph.h:1017:61: required from 'void lemon::concepts::BpGraph::Constraints<_BpGraph>::constraints() [with _BpGraph = lemon::SmartBpGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BpGraph; Type = SmartBpGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:352:40: required from here /build/reproducible-path/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; | ~~~^~~~~ /build/reproducible-path/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) {} | ^~~~~~~~ /build/reproducible-path/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<>]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseBpGraphComponent; Type = concepts::IDableBpGraphComponent<>]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IDableDigraphComponent; Type = concepts::IDableBpGraphComponent<>]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IDableGraphComponent; Type = concepts::IDableBpGraphComponent<>]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IDableBpGraphComponent<>; Type = concepts::IDableBpGraphComponent<>]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:327:33: required from here /build/reproducible-path/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); | ~~~^~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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() {} | ^~~~~~~ /build/reproducible-path/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); | ~~~^~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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() {} | ^~~~~~~~ /build/reproducible-path/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); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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() {} | ^~~~~~~ /build/reproducible-path/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); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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() {} | ^~~~~~~~ /build/reproducible-path/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); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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() {} | ^~~~~~~ /build/reproducible-path/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); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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() {} | ^~~~~~~~ /build/reproducible-path/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<>]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseBpGraphComponent; Type = concepts::IterableBpGraphComponent<>]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent; Type = concepts::IterableBpGraphComponent<>]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableGraphComponent; Type = concepts::IterableBpGraphComponent<>]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableBpGraphComponent<>; Type = concepts::IterableBpGraphComponent<>]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:330:35: required from here /build/reproducible-path/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); | ~~~^~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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() {} | ^~~~~~~ /build/reproducible-path/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); | ~~~^~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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() {} | ^~~~~~~~ /build/reproducible-path/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); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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() {} | ^~~~~~~ /build/reproducible-path/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); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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() {} | ^~~~~~~~ /build/reproducible-path/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); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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() {} | ^~~~~~~ /build/reproducible-path/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); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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() {} | ^~~~~~~~ /build/reproducible-path/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<>]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseBpGraphComponent; Type = concepts::AlterableBpGraphComponent<>]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::AlterableDigraphComponent; Type = concepts::AlterableBpGraphComponent<>]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::AlterableGraphComponent; Type = concepts::AlterableBpGraphComponent<>]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::AlterableBpGraphComponent<>; Type = concepts::AlterableBpGraphComponent<>]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:333:36: required from here /build/reproducible-path/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); | ~~~^~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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() {} | ^~~~~~~ /build/reproducible-path/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); | ~~~^~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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() {} | ^~~~~~~~ /build/reproducible-path/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); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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() {} | ^~~~~~~ /build/reproducible-path/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); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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() {} | ^~~~~~~~ /build/reproducible-path/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); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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() {} | ^~~~~~~ /build/reproducible-path/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); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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() {} | ^~~~~~~~ /build/reproducible-path/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<>]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseBpGraphComponent; Type = concepts::MappableBpGraphComponent<>]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::MappableDigraphComponent; Type = concepts::MappableBpGraphComponent<>]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::MappableGraphComponent; Type = concepts::MappableBpGraphComponent<>]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::MappableBpGraphComponent<>; Type = concepts::MappableBpGraphComponent<>]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:336:35: required from here /build/reproducible-path/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); | ~~~^~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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() {} | ^~~~~~~ /build/reproducible-path/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); | ~~~^~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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() {} | ^~~~~~~~ /build/reproducible-path/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); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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() {} | ^~~~~~~ /build/reproducible-path/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); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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() {} | ^~~~~~~~ /build/reproducible-path/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); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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() {} | ^~~~~~~ /build/reproducible-path/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); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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() {} | ^~~~~~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseDigraphComponent; Type = concepts::BpGraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseGraphComponent; Type = concepts::BpGraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseBpGraphComponent; Type = concepts::BpGraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BpGraph; Type = concepts::BpGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:349:35: required from here /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItem<'e'>; Type = concepts::BpGraph::Edge]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseGraphComponent; Type = concepts::BpGraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseBpGraphComponent; Type = concepts::BpGraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BpGraph; Type = concepts::BpGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:349:35: required from here /build/reproducible-path/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; | ~~^~~~~~~~ /build/reproducible-path/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&) { } | ^~~~ /build/reproducible-path/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; | ~~~^~~~ /build/reproducible-path/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&) { } | ^~~~ /build/reproducible-path/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; | ~~~^~~~~~~~~ /build/reproducible-path/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&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent; Type = concepts::BpGraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableGraphComponent; Type = concepts::BpGraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableBpGraphComponent<>; Type = concepts::BpGraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BpGraph; Type = concepts::BpGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:349:35: required from here /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItemIt; Type = concepts::BpGraph::EdgeIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableGraphComponent; Type = concepts::BpGraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableBpGraphComponent<>; Type = concepts::BpGraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BpGraph; Type = concepts::BpGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:349:35: required from here /build/reproducible-path/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; | ~~~~^~~~~~~ /build/reproducible-path/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) { } | ^~~~~~ /build/reproducible-path/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; | ~~~~~~^~~~~ /build/reproducible-path/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) { } | ^~~~~~ /build/reproducible-path/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; | ~~~^~~~~ /build/reproducible-path/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&) { } | ^~~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphIncIt; Type = concepts::BpGraph::IncEdgeIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableGraphComponent; Type = concepts::BpGraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableBpGraphComponent<>; Type = concepts::BpGraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BpGraph; Type = concepts::BpGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:349:35: required from here /build/reproducible-path/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; | ~~~~^~~~~~~ /build/reproducible-path/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) { } | ^~~~~~~~~ /build/reproducible-path/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; | ~~~~~~^~~~~ /build/reproducible-path/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) { } | ^~~~~~~~~ /build/reproducible-path/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; | ~~^~~~~ /build/reproducible-path/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&) { } | ^~~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItem<>; Type = concepts::BpGraph::RedNodeIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItemIt; Type = concepts::BpGraph::RedNodeIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableBpGraphComponent<>; Type = concepts::BpGraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BpGraph; Type = concepts::BpGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:349:35: required from here /build/reproducible-path/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; | ~~^~~~~~~~ /build/reproducible-path/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) { } | ^~~~~~~~~ /build/reproducible-path/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; | ~~~^~~~ /build/reproducible-path/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) { } | ^~~~~~~~~ /build/reproducible-path/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; | ~~~^~~~~~~~~ /build/reproducible-path/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) { } | ^~~~~~~~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItem<>; Type = concepts::BpGraph::BlueNodeIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItemIt; Type = concepts::BpGraph::BlueNodeIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableBpGraphComponent<>; Type = concepts::BpGraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BpGraph; Type = concepts::BpGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:349:35: required from here /build/reproducible-path/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; | ~~^~~~~~~~ /build/reproducible-path/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) { } | ^~~~~~~~~~ /build/reproducible-path/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; | ~~~^~~~ /build/reproducible-path/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) { } | ^~~~~~~~~~ /build/reproducible-path/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; | ~~~^~~~~~~~~ /build/reproducible-path/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) { } | ^~~~~~~~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IDableDigraphComponent; Type = concepts::BpGraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IDableGraphComponent; Type = concepts::BpGraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IDableBpGraphComponent<>; Type = concepts::BpGraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BpGraph; Type = concepts::BpGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:349:35: required from here /build/reproducible-path/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; | ~~~~^~~~~~~~ /build/reproducible-path/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&) { } | ^~~~ /build/reproducible-path/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); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~~ /build/reproducible-path/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; | ~~~^~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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); | ~~~~^~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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<>]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseGraphComponent; Type = concepts::IDableBpGraphComponent<>]' /build/reproducible-path/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<>]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseBpGraphComponent; Type = concepts::IDableBpGraphComponent<>]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IDableDigraphComponent; Type = concepts::IDableBpGraphComponent<>]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IDableGraphComponent; Type = concepts::IDableBpGraphComponent<>]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IDableBpGraphComponent<>; Type = concepts::IDableBpGraphComponent<>]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:327:33: required from here /build/reproducible-path/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; | ~~~^~~ /build/reproducible-path/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() {} | ^~~~ /build/reproducible-path/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<>]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseGraphComponent; Type = concepts::IterableBpGraphComponent<>]' /build/reproducible-path/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<>]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseBpGraphComponent; Type = concepts::IterableBpGraphComponent<>]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent; Type = concepts::IterableBpGraphComponent<>]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableGraphComponent; Type = concepts::IterableBpGraphComponent<>]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableBpGraphComponent<>; Type = concepts::IterableBpGraphComponent<>]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:330:35: required from here /build/reproducible-path/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; | ~~~^~~ /build/reproducible-path/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() {} | ^~~~ /build/reproducible-path/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<>]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseGraphComponent; Type = concepts::AlterableBpGraphComponent<>]' /build/reproducible-path/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<>]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseBpGraphComponent; Type = concepts::AlterableBpGraphComponent<>]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::AlterableDigraphComponent; Type = concepts::AlterableBpGraphComponent<>]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::AlterableGraphComponent; Type = concepts::AlterableBpGraphComponent<>]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::AlterableBpGraphComponent<>; Type = concepts::AlterableBpGraphComponent<>]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:333:36: required from here /build/reproducible-path/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; | ~~~^~~ /build/reproducible-path/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() {} | ^~~~ /build/reproducible-path/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<>]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseGraphComponent; Type = concepts::MappableBpGraphComponent<>]' /build/reproducible-path/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<>]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseBpGraphComponent; Type = concepts::MappableBpGraphComponent<>]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::MappableDigraphComponent; Type = concepts::MappableBpGraphComponent<>]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::MappableGraphComponent; Type = concepts::MappableBpGraphComponent<>]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::MappableBpGraphComponent<>; Type = concepts::MappableBpGraphComponent<>]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:336:35: required from here /build/reproducible-path/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; | ~~~^~~ /build/reproducible-path/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() {} | ^~~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItem<'n'>; Type = concepts::BpGraph::Node]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseDigraphComponent; Type = concepts::BpGraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseGraphComponent; Type = concepts::BpGraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseBpGraphComponent; Type = concepts::BpGraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BpGraph; Type = concepts::BpGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:349:35: required from here /build/reproducible-path/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; | ~~^~~~~~~~ /build/reproducible-path/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&) { } | ^~~~ /build/reproducible-path/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; | ~~~^~~~ /build/reproducible-path/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&) { } | ^~~~ /build/reproducible-path/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; | ~~~^~~~~~~~~ /build/reproducible-path/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&) { } | ^~~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItem<'a'>; Type = concepts::BpGraph::Arc]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseDigraphComponent; Type = concepts::BpGraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseGraphComponent; Type = concepts::BpGraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseBpGraphComponent; Type = concepts::BpGraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BpGraph; Type = concepts::BpGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:349:35: required from here /build/reproducible-path/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; | ~~^~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; | ~~~^~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; | ~~~^~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItemIt; Type = concepts::BpGraph::ArcIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent; Type = concepts::BpGraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableGraphComponent; Type = concepts::BpGraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableBpGraphComponent<>; Type = concepts::BpGraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BpGraph; Type = concepts::BpGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:349:35: required from here /build/reproducible-path/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; | ~~~~^~~~~~~ /build/reproducible-path/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) { } | ^~~~~ /build/reproducible-path/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; | ~~~~~~^~~~~ /build/reproducible-path/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) { } | ^~~~~ /build/reproducible-path/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; | ~~~^~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItemIt; Type = concepts::BpGraph::NodeIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent; Type = concepts::BpGraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableGraphComponent; Type = concepts::BpGraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableBpGraphComponent<>; Type = concepts::BpGraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BpGraph; Type = concepts::BpGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:349:35: required from here /build/reproducible-path/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; | ~~~~^~~~~~~ /build/reproducible-path/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) { } | ^~~~~~ /build/reproducible-path/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; | ~~~~~~^~~~~ /build/reproducible-path/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) { } | ^~~~~~ /build/reproducible-path/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; | ~~~^~~~~ /build/reproducible-path/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&) { } | ^~~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphIncIt; Type = concepts::BpGraph::InArcIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent; Type = concepts::BpGraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableGraphComponent; Type = concepts::BpGraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableBpGraphComponent<>; Type = concepts::BpGraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BpGraph; Type = concepts::BpGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:349:35: required from here /build/reproducible-path/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; | ~~~~^~~~~~~ /build/reproducible-path/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) { } | ^~~~~~~ /build/reproducible-path/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; | ~~~~~~^~~~~ /build/reproducible-path/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) { } | ^~~~~~~ /build/reproducible-path/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; | ~~^~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphIncIt; Type = concepts::BpGraph::OutArcIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent; Type = concepts::BpGraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableGraphComponent; Type = concepts::BpGraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableBpGraphComponent<>; Type = concepts::BpGraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BpGraph; Type = concepts::BpGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:349:35: required from here /build/reproducible-path/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; | ~~~~^~~~~~~ /build/reproducible-path/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) { } | ^~~~~~~~ /build/reproducible-path/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; | ~~~~~~^~~~~ /build/reproducible-path/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) { } | ^~~~~~~~ /build/reproducible-path/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; | ~~^~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItem<>; Type = concepts::BpGraph::EdgeIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItemIt; Type = concepts::BpGraph::EdgeIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableGraphComponent; Type = concepts::BpGraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableBpGraphComponent<>; Type = concepts::BpGraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BpGraph; Type = concepts::BpGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:349:35: required from here /build/reproducible-path/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; | ~~^~~~~~~~ /build/reproducible-path/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) { } | ^~~~~~ /build/reproducible-path/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; | ~~~^~~~ /build/reproducible-path/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) { } | ^~~~~~ /build/reproducible-path/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; | ~~~^~~~~~~~~ /build/reproducible-path/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) { } | ^~~~~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItem<'e'>; Type = concepts::BpGraph::IncEdgeIt]' /build/reproducible-path/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']' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphIncIt; Type = concepts::BpGraph::IncEdgeIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableGraphComponent; Type = concepts::BpGraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableBpGraphComponent<>; Type = concepts::BpGraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BpGraph; Type = concepts::BpGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:349:35: required from here /build/reproducible-path/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; | ~~^~~~~~~~ /build/reproducible-path/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) { } | ^~~~~~~~~ /build/reproducible-path/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; | ~~~^~~~ /build/reproducible-path/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) { } | ^~~~~~~~~ /build/reproducible-path/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; | ~~~^~~~~~~~~ /build/reproducible-path/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) { } | ^~~~~~~~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItem<>; Type = concepts::BpGraph::ArcIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItemIt; Type = concepts::BpGraph::ArcIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableGraphComponent; Type = concepts::BpGraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableBpGraphComponent<>; Type = concepts::BpGraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BpGraph; Type = concepts::BpGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:349:35: required from here /build/reproducible-path/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; | ~~^~~~~~~~ /build/reproducible-path/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) { } | ^~~~~ /build/reproducible-path/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; | ~~~^~~~ /build/reproducible-path/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) { } | ^~~~~ /build/reproducible-path/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; | ~~~^~~~~~~~~ /build/reproducible-path/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) { } | ^~~~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItem<>; Type = concepts::BpGraph::NodeIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItemIt; Type = concepts::BpGraph::NodeIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableGraphComponent; Type = concepts::BpGraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableBpGraphComponent<>; Type = concepts::BpGraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BpGraph; Type = concepts::BpGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:349:35: required from here /build/reproducible-path/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; | ~~^~~~~~~~ /build/reproducible-path/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) { } | ^~~~~~ /build/reproducible-path/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; | ~~~^~~~ /build/reproducible-path/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) { } | ^~~~~~ /build/reproducible-path/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; | ~~~^~~~~~~~~ /build/reproducible-path/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) { } | ^~~~~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItem<'i'>; Type = concepts::BpGraph::InArcIt]' /build/reproducible-path/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']' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphIncIt; Type = concepts::BpGraph::InArcIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableGraphComponent; Type = concepts::BpGraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableBpGraphComponent<>; Type = concepts::BpGraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BpGraph; Type = concepts::BpGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:349:35: required from here /build/reproducible-path/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; | ~~^~~~~~~~ /build/reproducible-path/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) { } | ^~~~~~~ /build/reproducible-path/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; | ~~~^~~~ /build/reproducible-path/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) { } | ^~~~~~~ /build/reproducible-path/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; | ~~~^~~~~~~~~ /build/reproducible-path/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) { } | ^~~~~~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItem<'o'>; Type = concepts::BpGraph::OutArcIt]' /build/reproducible-path/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']' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphIncIt; Type = concepts::BpGraph::OutArcIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableGraphComponent; Type = concepts::BpGraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableBpGraphComponent<>; Type = concepts::BpGraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BpGraph; Type = concepts::BpGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/bpgraph_test.cc:349:35: required from here /build/reproducible-path/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; | ~~^~~~~~~~ /build/reproducible-path/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) { } | ^~~~~~~~ /build/reproducible-path/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; | ~~~^~~~ /build/reproducible-path/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) { } | ^~~~~~~~ /build/reproducible-path/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; | ~~~^~~~~~~~~ /build/reproducible-path/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) { } | ^~~~~~~~ [ 25%] Linking CXX executable bpgraph_test cd /build/reproducible-path/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 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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,-z,relro -Wl,-z,now -rdynamic CMakeFiles/bpgraph_test.dir/bpgraph_test.cc.o -o bpgraph_test -L/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[5]: Leaving directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 25%] Built target bpgraph_test make -f test/CMakeFiles/circulation_test.dir/build.make test/CMakeFiles/circulation_test.dir/depend make[5]: Entering directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /build/reproducible-path/liblemon-1.3.1+dfsg /build/reproducible-path/liblemon-1.3.1+dfsg/test /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test/CMakeFiles/circulation_test.dir/DependInfo.cmake "--color=" make[5]: Leaving directory '/build/reproducible-path/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 '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 26%] Building CXX object test/CMakeFiles/circulation_test.dir/circulation_test.cc.o cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -I/build/reproducible-path/liblemon-1.3.1+dfsg -I/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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 -MD -MT test/CMakeFiles/circulation_test.dir/circulation_test.cc.o -MF CMakeFiles/circulation_test.dir/circulation_test.cc.o.d -o CMakeFiles/circulation_test.dir/circulation_test.cc.o -c /build/reproducible-path/liblemon-1.3.1+dfsg/test/circulation_test.cc In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lgf_writer.h:37, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:36, from /build/reproducible-path/liblemon-1.3.1+dfsg/test/circulation_test.cc:24: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:1973:21: warning: 'template struct std::iterator' is deprecated [-Wdeprecated-declarations] 1973 | : public std::iterator { | ^~~~~~~~ In file included from /usr/include/c++/13/bits/stl_iterator_base_funcs.h:66, from /usr/include/c++/13/string:47, from /usr/include/c++/13/bits/locale_classes.h:40, from /usr/include/c++/13/bits/ios_base.h:41, from /usr/include/c++/13/ios:44, from /usr/include/c++/13/ostream:40, from /usr/include/c++/13/iostream:41, from /build/reproducible-path/liblemon-1.3.1+dfsg/test/circulation_test.cc:19: /usr/include/c++/13/bits/stl_iterator_base_types.h:127:34: note: declared here 127 | struct _GLIBCXX17_DEPRECATED iterator | ^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:3135:21: warning: 'template struct std::iterator' is deprecated [-Wdeprecated-declarations] 3135 | : public std::iterator { | ^~~~~~~~ /usr/include/c++/13/bits/stl_iterator_base_types.h:127:34: note: declared here 127 | struct _GLIBCXX17_DEPRECATED iterator | ^~~~~~~~ In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/test/circulation_test.cc:23: /build/reproducible-path/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 >]': /build/reproducible-path/liblemon-1.3.1+dfsg/test/circulation_test.cc:99:18: required from here /build/reproducible-path/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 /build/reproducible-path/liblemon-1.3.1+dfsg/test/circulation_test.cc:25: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/circulation.h:23: /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/circulation.h:514:24: 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 >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/circulation_test.cc:97:17: required from here /build/reproducible-path/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; | ~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/circulation.h:516:28: 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 >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/circulation_test.cc:97:17: required from here /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~~~~~~~~^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/circulation.h:520:27: 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 >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/circulation_test.cc:97:17: required from here /build/reproducible-path/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]; | ~~~~~~~~~~~~~~~~^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~~~~~~~~~~~~~~~^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~~~~~~~~~~~~^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/circulation.h:592:33: 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 >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/circulation_test.cc:99:18: required from here /build/reproducible-path/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]; | ~~~~~~~~~~~~~~~~^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~~~~~~~~~~~~~~~^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~~~~~~~~~~~~~~~~~^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~~~~~~~~^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/circulation.h:633:41: 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 >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/circulation_test.cc:99:18: required from here /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/circulation.h:638:36: 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 >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/circulation_test.cc:99:18: required from here /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/circulation.h:639:29: 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 >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/circulation_test.cc:99:18: required from here /build/reproducible-path/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]; | ~~^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ [ 26%] Linking CXX executable circulation_test cd /build/reproducible-path/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 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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,-z,relro -Wl,-z,now -rdynamic CMakeFiles/circulation_test.dir/circulation_test.cc.o -o circulation_test -L/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[5]: Leaving directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 26%] Built target circulation_test make -f test/CMakeFiles/connectivity_test.dir/build.make test/CMakeFiles/connectivity_test.dir/depend make[5]: Entering directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /build/reproducible-path/liblemon-1.3.1+dfsg /build/reproducible-path/liblemon-1.3.1+dfsg/test /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test/CMakeFiles/connectivity_test.dir/DependInfo.cmake "--color=" make[5]: Leaving directory '/build/reproducible-path/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 '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 27%] Building CXX object test/CMakeFiles/connectivity_test.dir/connectivity_test.cc.o cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -I/build/reproducible-path/liblemon-1.3.1+dfsg -I/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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 -MD -MT test/CMakeFiles/connectivity_test.dir/connectivity_test.cc.o -MF CMakeFiles/connectivity_test.dir/connectivity_test.cc.o.d -o CMakeFiles/connectivity_test.dir/connectivity_test.cc.o -c /build/reproducible-path/liblemon-1.3.1+dfsg/test/connectivity_test.cc In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/dfs.h:30, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/connectivity.h:22, from /build/reproducible-path/liblemon-1.3.1+dfsg/test/connectivity_test.cc:19: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:1973:21: warning: 'template struct std::iterator' is deprecated [-Wdeprecated-declarations] 1973 | : public std::iterator { | ^~~~~~~~ In file included from /usr/include/c++/13/bits/stl_algobase.h:65, from /usr/include/c++/13/vector:62, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/core.h:22, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/list_graph.h:26, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/dfs.h:26: /usr/include/c++/13/bits/stl_iterator_base_types.h:127:34: note: declared here 127 | struct _GLIBCXX17_DEPRECATED iterator | ^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:3135:21: warning: 'template struct std::iterator' is deprecated [-Wdeprecated-declarations] 3135 | : public std::iterator { | ^~~~~~~~ /usr/include/c++/13/bits/stl_iterator_base_types.h:127:34: note: declared here 127 | struct _GLIBCXX17_DEPRECATED iterator | ^~~~~~~~ [ 28%] Linking CXX executable connectivity_test cd /build/reproducible-path/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 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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,-z,relro -Wl,-z,now -rdynamic CMakeFiles/connectivity_test.dir/connectivity_test.cc.o -o connectivity_test -L/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[5]: Leaving directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 28%] Built target connectivity_test make -f test/CMakeFiles/counter_test.dir/build.make test/CMakeFiles/counter_test.dir/depend make[5]: Entering directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /build/reproducible-path/liblemon-1.3.1+dfsg /build/reproducible-path/liblemon-1.3.1+dfsg/test /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test/CMakeFiles/counter_test.dir/DependInfo.cmake "--color=" make[5]: Leaving directory '/build/reproducible-path/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 '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 30%] Building CXX object test/CMakeFiles/counter_test.dir/counter_test.cc.o cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -I/build/reproducible-path/liblemon-1.3.1+dfsg -I/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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 -MD -MT test/CMakeFiles/counter_test.dir/counter_test.cc.o -MF CMakeFiles/counter_test.dir/counter_test.cc.o.d -o CMakeFiles/counter_test.dir/counter_test.cc.o -c /build/reproducible-path/liblemon-1.3.1+dfsg/test/counter_test.cc [ 31%] Linking CXX executable counter_test cd /build/reproducible-path/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 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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,-z,relro -Wl,-z,now -rdynamic CMakeFiles/counter_test.dir/counter_test.cc.o -o counter_test -L/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[5]: Leaving directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 31%] Built target counter_test make -f test/CMakeFiles/dfs_test.dir/build.make test/CMakeFiles/dfs_test.dir/depend make[5]: Entering directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /build/reproducible-path/liblemon-1.3.1+dfsg /build/reproducible-path/liblemon-1.3.1+dfsg/test /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test/CMakeFiles/dfs_test.dir/DependInfo.cmake "--color=" make[5]: Leaving directory '/build/reproducible-path/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 '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 32%] Building CXX object test/CMakeFiles/dfs_test.dir/dfs_test.cc.o cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -I/build/reproducible-path/liblemon-1.3.1+dfsg -I/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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 -MD -MT test/CMakeFiles/dfs_test.dir/dfs_test.cc.o -MF CMakeFiles/dfs_test.dir/dfs_test.cc.o.d -o CMakeFiles/dfs_test.dir/dfs_test.cc.o -c /build/reproducible-path/liblemon-1.3.1+dfsg/test/dfs_test.cc In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lgf_writer.h:37, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:36, from /build/reproducible-path/liblemon-1.3.1+dfsg/test/dfs_test.cc:22: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:1973:21: warning: 'template struct std::iterator' is deprecated [-Wdeprecated-declarations] 1973 | : public std::iterator { | ^~~~~~~~ In file included from /usr/include/c++/13/bits/stl_algobase.h:65, from /usr/include/c++/13/vector:62, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/core.h:22, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:26, from /build/reproducible-path/liblemon-1.3.1+dfsg/test/dfs_test.cc:19: /usr/include/c++/13/bits/stl_iterator_base_types.h:127:34: note: declared here 127 | struct _GLIBCXX17_DEPRECATED iterator | ^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:3135:21: warning: 'template struct std::iterator' is deprecated [-Wdeprecated-declarations] 3135 | : public std::iterator { | ^~~~~~~~ /usr/include/c++/13/bits/stl_iterator_base_types.h:127:34: note: declared here 127 | struct _GLIBCXX17_DEPRECATED iterator | ^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/test/dfs_test.cc: In function 'void checkDfsCompile()': /build/reproducible-path/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(); | ^ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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(); | ^ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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); | ^ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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); | ^ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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(); | ^ /build/reproducible-path/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) : | ^~~~~~~ /build/reproducible-path/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(); | ^ /build/reproducible-path/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) : | ^~~~~~~ /build/reproducible-path/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(); | ^ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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(); | ^ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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); | ^ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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); | ^ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/test/dfs_test.cc:23: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/dfs.h: In instantiation of 'void lemon::Dfs::addSource(Node) [with GR = lemon::concepts::Digraph; TR = lemon::DfsDefaultTraits; Node = lemon::concepts::Digraph::Node]': /build/reproducible-path/liblemon-1.3.1+dfsg/test/dfs_test.cc:86:23: required from here /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~^~ /build/reproducible-path/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) { } | ^~~~~~~~ /build/reproducible-path/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; Arc = lemon::concepts::Digraph::Arc]': /build/reproducible-path/liblemon-1.3.1+dfsg/test/dfs_test.cc:87:32: required from here /build/reproducible-path/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)]) { | ~^~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ /build/reproducible-path/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) { } | ^~~~~~~~ /build/reproducible-path/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); | ~^~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]); | ~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/dfs.h: In instantiation of 'void lemon::Dfs::addSource(Node) [with GR = lemon::concepts::Digraph; TR = lemon::Dfs::SetPredMapTraits > >::SetDistMapTraits > >::SetReachedMapTraits > >::SetStandardProcessedMapTraits>::SetProcessedMapTraits >; Node = lemon::concepts::Digraph::Node]': /build/reproducible-path/liblemon-1.3.1+dfsg/test/dfs_test.cc:129:23: required from here /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~^~ /build/reproducible-path/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) { } | ^~~~~~~~ /build/reproducible-path/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 >; Arc = lemon::concepts::Digraph::Arc]': /build/reproducible-path/liblemon-1.3.1+dfsg/test/dfs_test.cc:130:32: required from here /build/reproducible-path/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)]) { | ~^~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ /build/reproducible-path/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) { } | ^~~~~~~~ /build/reproducible-path/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); | ~^~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]); | ~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:27: /build/reproducible-path/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&; Key = lemon::concepts::Digraph::Node; Value = lemon::concepts::Digraph::Arc]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/dfs.h:439:19: required from 'void lemon::Dfs::init() [with GR = lemon::concepts::Digraph; TR = lemon::DfsDefaultTraits]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/dfs_test.cc:85:18: required from here /build/reproducible-path/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; } | ~~~~~~~~~~~~~^~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/dfs.h: In instantiation of 'void lemon::Dfs::addSource(Node) [with GR = lemon::concepts::Digraph; TR = lemon::DfsWizardBase; Node = lemon::concepts::Digraph::Node]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/dfs.h:615:7: required from 'void lemon::Dfs::run(Node) [with GR = lemon::concepts::Digraph; TR = lemon::DfsWizardBase; Node = lemon::concepts::Digraph::Node]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/dfs.h:953:16: required from 'void lemon::DfsWizard::run(Node) [with TR = lemon::DfsWizardBase; Node = lemon::concepts::Digraph::Node]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/dfs_test.cc:158:13: required from here /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~^~ /build/reproducible-path/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) { } | ^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/dfs.h: In instantiation of 'void lemon::Dfs::addSource(Node) [with GR = lemon::concepts::Digraph; TR = lemon::DfsWizard >::SetPredMapBase > >::SetDistMapBase > >::SetReachedMapBase > >::SetProcessedMapBase >; Node = lemon::concepts::Digraph::Node]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/dfs.h:615:7: required from 'void lemon::Dfs::run(Node) [with GR = lemon::concepts::Digraph; TR = lemon::DfsWizard >::SetPredMapBase > >::SetDistMapBase > >::SetReachedMapBase > >::SetProcessedMapBase >; Node = lemon::concepts::Digraph::Node]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/dfs.h:953:16: required from 'void lemon::DfsWizard::run(Node) [with TR = lemon::DfsWizard >::SetPredMapBase > >::SetDistMapBase > >::SetReachedMapBase > >::SetProcessedMapBase >; Node = lemon::concepts::Digraph::Node]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/dfs_test.cc:166:9: required from here /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~^~ /build/reproducible-path/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) { } | ^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/dfs.h: In instantiation of 'void lemon::Dfs::addSource(Node) [with GR = lemon::concepts::Digraph; TR = lemon::DfsWizard >::SetPredMapBase > >::SetDistMapBase > >::SetReachedMapBase > >::SetProcessedMapBase > >::SetPathBase >; Node = lemon::concepts::Digraph::Node]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/dfs.h:636:7: required from 'bool lemon::Dfs::run(Node, Node) [with GR = lemon::concepts::Digraph; TR = lemon::DfsWizard >::SetPredMapBase > >::SetDistMapBase > >::SetReachedMapBase > >::SetProcessedMapBase > >::SetPathBase >; Node = lemon::concepts::Digraph::Node]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/dfs.h:976:14: required from 'bool lemon::DfsWizard::run(Node, Node) [with TR = lemon::DfsWizard >::SetPredMapBase > >::SetDistMapBase > >::SetReachedMapBase > >::SetProcessedMapBase > >::SetPathBase >; Node = lemon::concepts::Digraph::Node]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/dfs_test.cc:174:9: required from here /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~^~ /build/reproducible-path/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) { } | ^~~~~~~~ /build/reproducible-path/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; Arc = lemon::concepts::Digraph::Arc]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/dfs.h:550:31: required from 'void lemon::Dfs::start() [with GR = lemon::concepts::Digraph; TR = lemon::DfsWizardBase]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/dfs.h:616:12: required from 'void lemon::Dfs::run(Node) [with GR = lemon::concepts::Digraph; TR = lemon::DfsWizardBase; Node = lemon::concepts::Digraph::Node]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/dfs.h:953:16: required from 'void lemon::DfsWizard::run(Node) [with TR = lemon::DfsWizardBase; Node = lemon::concepts::Digraph::Node]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/dfs_test.cc:158:13: required from here /build/reproducible-path/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)]) { | ~^~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ /build/reproducible-path/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) { } | ^~~~~~~~ /build/reproducible-path/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); | ~^~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]); | ~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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 >; Arc = lemon::concepts::Digraph::Arc]': /build/reproducible-path/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 >]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/dfs.h:616:12: required from 'void lemon::Dfs::run(Node) [with GR = lemon::concepts::Digraph; TR = lemon::DfsWizard >::SetPredMapBase > >::SetDistMapBase > >::SetReachedMapBase > >::SetProcessedMapBase >; Node = lemon::concepts::Digraph::Node]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/dfs.h:953:16: required from 'void lemon::DfsWizard::run(Node) [with TR = lemon::DfsWizard >::SetPredMapBase > >::SetDistMapBase > >::SetReachedMapBase > >::SetProcessedMapBase >; Node = lemon::concepts::Digraph::Node]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/dfs_test.cc:166:9: required from here /build/reproducible-path/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)]) { | ~^~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ /build/reproducible-path/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) { } | ^~~~~~~~ /build/reproducible-path/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); | ~^~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]); | ~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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 >; Arc = lemon::concepts::Digraph::Arc]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/dfs.h:569:9: required from 'void lemon::Dfs::start(Node) [with GR = lemon::concepts::Digraph; TR = lemon::DfsWizard >::SetPredMapBase > >::SetDistMapBase > >::SetReachedMapBase > >::SetProcessedMapBase > >::SetPathBase >; Node = lemon::concepts::Digraph::Node]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/dfs.h:637:12: required from 'bool lemon::Dfs::run(Node, Node) [with GR = lemon::concepts::Digraph; TR = lemon::DfsWizard >::SetPredMapBase > >::SetDistMapBase > >::SetReachedMapBase > >::SetProcessedMapBase > >::SetPathBase >; Node = lemon::concepts::Digraph::Node]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/dfs.h:976:14: required from 'bool lemon::DfsWizard::run(Node, Node) [with TR = lemon::DfsWizard >::SetPredMapBase > >::SetDistMapBase > >::SetReachedMapBase > >::SetProcessedMapBase > >::SetPathBase >; Node = lemon::concepts::Digraph::Node]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/dfs_test.cc:174:9: required from here /build/reproducible-path/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)]) { | ~^~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ /build/reproducible-path/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) { } | ^~~~~~~~ /build/reproducible-path/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); | ~^~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]); | ~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/dfs.h:27: /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/path.h:228:28: required from 'void lemon::Path::buildRev(const CPath&) [with CPath = lemon::PredMapPath >; GR = lemon::concepts::Digraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/path.h:1017:20: required from 'static void lemon::_path_bits::PathCopySelectorBackward::copy(const From&, To&) [with From = lemon::PredMapPath >; To = lemon::Path]' /build/reproducible-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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/path.h:1046:49: required from 'void lemon::pathCopy(const From&, To&) [with From = PredMapPath >; To = Path]' /build/reproducible-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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/dfs_test.cc:102:31: required from here /build/reproducible-path/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) { | ~~~~~^~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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); | ~~~~~^~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/path.h:1017:20: required from 'static void lemon::_path_bits::PathCopySelectorBackward::copy(const From&, To&) [with From = lemon::PredMapPath >; To = lemon::Path]' /build/reproducible-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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/path.h:1046:49: required from 'void lemon::pathCopy(const From&, To&) [with From = PredMapPath >; To = Path]' /build/reproducible-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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/dfs_test.cc:102:31: required from here /build/reproducible-path/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; | ~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/path.h:1017:20: required from 'static void lemon::_path_bits::PathCopySelectorBackward::copy(const From&, To&) [with From = lemon::PredMapPath >; To = lemon::Path]' /build/reproducible-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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/path.h:1046:49: required from 'void lemon::pathCopy(const From&, To&) [with From = PredMapPath >; To = Path]' /build/reproducible-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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/dfs_test.cc:102:31: required from here /build/reproducible-path/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]); | ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/path.h:228:28: required from 'void lemon::Path::buildRev(const CPath&) [with CPath = lemon::PredMapPath >; GR = lemon::concepts::Digraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/path.h:1017:20: required from 'static void lemon::_path_bits::PathCopySelectorBackward::copy(const From&, To&) [with From = lemon::PredMapPath >; To = lemon::Path]' /build/reproducible-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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/path.h:1046:49: required from 'void lemon::pathCopy(const From&, To&) [with From = PredMapPath >; To = Path]' /build/reproducible-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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/dfs_test.cc:143:25: required from here /build/reproducible-path/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) { | ~~~~~^~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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); | ~~~~~^~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/path.h:1017:20: required from 'static void lemon::_path_bits::PathCopySelectorBackward::copy(const From&, To&) [with From = lemon::PredMapPath >; To = lemon::Path]' /build/reproducible-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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/path.h:1046:49: required from 'void lemon::pathCopy(const From&, To&) [with From = PredMapPath >; To = Path]' /build/reproducible-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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/dfs_test.cc:143:25: required from here /build/reproducible-path/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; | ~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/path.h:1017:20: required from 'static void lemon::_path_bits::PathCopySelectorBackward::copy(const From&, To&) [with From = lemon::PredMapPath >; To = lemon::Path]' /build/reproducible-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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/path.h:1046:49: required from 'void lemon::pathCopy(const From&, To&) [with From = PredMapPath >; To = Path]' /build/reproducible-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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/dfs_test.cc:143:25: required from here /build/reproducible-path/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]); | ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ In file included from /usr/include/arm-linux-gnueabihf/c++/13/bits/c++allocator.h:33, from /usr/include/c++/13/bits/allocator.h:46, from /usr/include/c++/13/vector:63: In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::ArcT; _Args = {lemon::SmartDigraphBase::ArcT}; _Tp = lemon::SmartDigraphBase::ArcT]', inlined from 'static void std::allocator_traits >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::ArcT; _Args = {lemon::SmartDigraphBase::ArcT}; _Tp = lemon::SmartDigraphBase::ArcT]' at /usr/include/c++/13/bits/alloc_traits.h:538:17, inlined from 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {lemon::SmartDigraphBase::ArcT}; _Tp = lemon::SmartDigraphBase::ArcT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/vector.tcc:117:30, inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = lemon::SmartDigraphBase::ArcT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/stl_vector.h:1296:21, inlined from 'lemon::SmartDigraphBase::Arc lemon::SmartDigraphBase::addArc(Node, Node)' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:85:21, inlined from 'lemon::DigraphExtender::Arc lemon::DigraphExtender::addArc(const Node&, const Node&) [with Base = lemon::SmartDigraphBase]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:274:31: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/test/dfs_test.cc:20: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h: In member function 'lemon::DigraphExtender::Arc lemon::DigraphExtender::addArc(const Node&, const Node&) [with Base = lemon::SmartDigraphBase]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:85:27: note: '' declared here 85 | arcs.push_back(ArcT()); | ^ In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]', inlined from 'static void std::allocator_traits >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]' at /usr/include/c++/13/bits/alloc_traits.h:538:17, inlined from 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/vector.tcc:117:30, inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/stl_vector.h:1296:21, inlined from 'lemon::SmartDigraphBase::Node lemon::SmartDigraphBase::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:22, inlined from 'lemon::DigraphExtender::Node lemon::DigraphExtender::addNode() [with Base = lemon::SmartDigraphBase]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:268:34, inlined from 'lemon::DigraphExtender::Node lemon::SmartDigraph::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:223:44, inlined from 'void lemon::DigraphReader::readNodes() [with DGR = lemon::SmartDigraph]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:954:31: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h: In member function 'void lemon::DigraphReader::readNodes() [with DGR = lemon::SmartDigraph]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:29: note: '' declared here 77 | nodes.push_back(NodeT()); | ^ [ 32%] Linking CXX executable dfs_test cd /build/reproducible-path/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 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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,-z,relro -Wl,-z,now -rdynamic CMakeFiles/dfs_test.dir/dfs_test.cc.o -o dfs_test -L/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[5]: Leaving directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 32%] Built target dfs_test make -f test/CMakeFiles/digraph_test.dir/build.make test/CMakeFiles/digraph_test.dir/depend make[5]: Entering directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /build/reproducible-path/liblemon-1.3.1+dfsg /build/reproducible-path/liblemon-1.3.1+dfsg/test /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test/CMakeFiles/digraph_test.dir/DependInfo.cmake "--color=" make[5]: Leaving directory '/build/reproducible-path/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 '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 33%] Building CXX object test/CMakeFiles/digraph_test.dir/digraph_test.cc.o cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -I/build/reproducible-path/liblemon-1.3.1+dfsg -I/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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 -MD -MT test/CMakeFiles/digraph_test.dir/digraph_test.cc.o -MF CMakeFiles/digraph_test.dir/digraph_test.cc.o.d -o CMakeFiles/digraph_test.dir/digraph_test.cc.o -c /build/reproducible-path/liblemon-1.3.1+dfsg/test/digraph_test.cc In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/test/graph_test.h:25, from /build/reproducible-path/liblemon-1.3.1+dfsg/test/digraph_test.cc:26: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:1973:21: warning: 'template struct std::iterator' is deprecated [-Wdeprecated-declarations] 1973 | : public std::iterator { | ^~~~~~~~ In file included from /usr/include/c++/13/bits/stl_algobase.h:65, from /usr/include/c++/13/vector:62, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/core.h:22, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:26, from /build/reproducible-path/liblemon-1.3.1+dfsg/test/digraph_test.cc:19: /usr/include/c++/13/bits/stl_iterator_base_types.h:127:34: note: declared here 127 | struct _GLIBCXX17_DEPRECATED iterator | ^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:3135:21: warning: 'template struct std::iterator' is deprecated [-Wdeprecated-declarations] 3135 | : public std::iterator { | ^~~~~~~~ /usr/include/c++/13/bits/stl_iterator_base_types.h:127:34: note: declared here 127 | struct _GLIBCXX17_DEPRECATED iterator | ^~~~~~~~ In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29: /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseDigraphComponent; Type = concepts::Digraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = concepts::Digraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/digraph_test.cc:322:35: required from here /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent<>; Type = concepts::Digraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = concepts::Digraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/digraph_test.cc:322:35: required from here /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IDableDigraphComponent<>; Type = concepts::Digraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = concepts::Digraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/digraph_test.cc:322:35: required from here /build/reproducible-path/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; | ~~~~^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~^~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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); | ~~~~^~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItem<'n'>; Type = concepts::Digraph::Node]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseDigraphComponent; Type = concepts::Digraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = concepts::Digraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/digraph_test.cc:322:35: required from here /build/reproducible-path/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; | ~~^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~^~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItem<'a'>; Type = concepts::Digraph::Arc]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseDigraphComponent; Type = concepts::Digraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = concepts::Digraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/digraph_test.cc:322:35: required from here /build/reproducible-path/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; | ~~^~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; | ~~~^~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; | ~~~^~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItemIt; Type = concepts::Digraph::ArcIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent<>; Type = concepts::Digraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = concepts::Digraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/digraph_test.cc:322:35: required from here /build/reproducible-path/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; | ~~~~^~~~~~~ /build/reproducible-path/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) { } | ^~~~~ /build/reproducible-path/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; | ~~~~~~^~~~~ /build/reproducible-path/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) { } | ^~~~~ /build/reproducible-path/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; | ~~~^~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItemIt; Type = concepts::Digraph::NodeIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent<>; Type = concepts::Digraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = concepts::Digraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/digraph_test.cc:322:35: required from here /build/reproducible-path/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; | ~~~~^~~~~~~ /build/reproducible-path/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) { } | ^~~~~~ /build/reproducible-path/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; | ~~~~~~^~~~~ /build/reproducible-path/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) { } | ^~~~~~ /build/reproducible-path/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; | ~~~^~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphIncIt; Type = concepts::Digraph::InArcIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent<>; Type = concepts::Digraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = concepts::Digraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/digraph_test.cc:322:35: required from here /build/reproducible-path/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; | ~~~~^~~~~~~ /build/reproducible-path/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) { } | ^~~~~~~ /build/reproducible-path/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; | ~~~~~~^~~~~ /build/reproducible-path/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) { } | ^~~~~~~ /build/reproducible-path/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; | ~~^~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphIncIt; Type = concepts::Digraph::OutArcIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent<>; Type = concepts::Digraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = concepts::Digraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/digraph_test.cc:322:35: required from here /build/reproducible-path/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; | ~~~~^~~~~~~ /build/reproducible-path/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) { } | ^~~~~~~~ /build/reproducible-path/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; | ~~~~~~^~~~~ /build/reproducible-path/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) { } | ^~~~~~~~ /build/reproducible-path/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; | ~~^~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItem<>; Type = concepts::Digraph::ArcIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItemIt; Type = concepts::Digraph::ArcIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent<>; Type = concepts::Digraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = concepts::Digraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/digraph_test.cc:322:35: required from here /build/reproducible-path/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; | ~~^~~~~~~~ /build/reproducible-path/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) { } | ^~~~~ /build/reproducible-path/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; | ~~~^~~~ /build/reproducible-path/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) { } | ^~~~~ /build/reproducible-path/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; | ~~~^~~~~~~~~ /build/reproducible-path/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) { } | ^~~~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItem<>; Type = concepts::Digraph::NodeIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItemIt; Type = concepts::Digraph::NodeIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent<>; Type = concepts::Digraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = concepts::Digraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/digraph_test.cc:322:35: required from here /build/reproducible-path/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; | ~~^~~~~~~~ /build/reproducible-path/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) { } | ^~~~~~ /build/reproducible-path/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; | ~~~^~~~ /build/reproducible-path/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) { } | ^~~~~~ /build/reproducible-path/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; | ~~~^~~~~~~~~ /build/reproducible-path/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) { } | ^~~~~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItem<'i'>; Type = concepts::Digraph::InArcIt]' /build/reproducible-path/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']' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphIncIt; Type = concepts::Digraph::InArcIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent<>; Type = concepts::Digraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = concepts::Digraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/digraph_test.cc:322:35: required from here /build/reproducible-path/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; | ~~^~~~~~~~ /build/reproducible-path/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) { } | ^~~~~~~ /build/reproducible-path/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; | ~~~^~~~ /build/reproducible-path/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) { } | ^~~~~~~ /build/reproducible-path/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; | ~~~^~~~~~~~~ /build/reproducible-path/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) { } | ^~~~~~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItem<'o'>; Type = concepts::Digraph::OutArcIt]' /build/reproducible-path/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']' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphIncIt; Type = concepts::Digraph::OutArcIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent<>; Type = concepts::Digraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = concepts::Digraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/digraph_test.cc:322:35: required from here /build/reproducible-path/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; | ~~^~~~~~~~ /build/reproducible-path/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) { } | ^~~~~~~~ /build/reproducible-path/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; | ~~~^~~~ /build/reproducible-path/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) { } | ^~~~~~~~ /build/reproducible-path/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; | ~~~^~~~~~~~~ /build/reproducible-path/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/arm-linux-gnueabihf/c++/13/bits/c++allocator.h:33, from /usr/include/c++/13/bits/allocator.h:46, from /usr/include/c++/13/vector:63: In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]', inlined from 'static void std::allocator_traits >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]' at /usr/include/c++/13/bits/alloc_traits.h:538:17, inlined from 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/vector.tcc:117:30, inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/stl_vector.h:1296:21, inlined from 'lemon::SmartDigraphBase::Node lemon::SmartDigraphBase::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:22, inlined from 'lemon::DigraphExtender::Node lemon::DigraphExtender::addNode() [with Base = lemon::SmartDigraphBase]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:268:34: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/test/digraph_test.cc:21: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h: In member function 'lemon::DigraphExtender::Node lemon::DigraphExtender::addNode() [with Base = lemon::SmartDigraphBase]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:29: note: '' declared here 77 | nodes.push_back(NodeT()); | ^ In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::ArcT; _Args = {lemon::SmartDigraphBase::ArcT}; _Tp = lemon::SmartDigraphBase::ArcT]', inlined from 'static void std::allocator_traits >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::ArcT; _Args = {lemon::SmartDigraphBase::ArcT}; _Tp = lemon::SmartDigraphBase::ArcT]' at /usr/include/c++/13/bits/alloc_traits.h:538:17, inlined from 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {lemon::SmartDigraphBase::ArcT}; _Tp = lemon::SmartDigraphBase::ArcT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/vector.tcc:117:30, inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = lemon::SmartDigraphBase::ArcT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/stl_vector.h:1296:21, inlined from 'lemon::SmartDigraphBase::Arc lemon::SmartDigraphBase::addArc(Node, Node)' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:85:21, inlined from 'lemon::DigraphExtender::Arc lemon::DigraphExtender::addArc(const Node&, const Node&) [with Base = lemon::SmartDigraphBase]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:274:31: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h: In member function 'lemon::DigraphExtender::Arc lemon::DigraphExtender::addArc(const Node&, const Node&) [with Base = lemon::SmartDigraphBase]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:85:27: note: '' declared here 85 | arcs.push_back(ArcT()); | ^ In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]', inlined from 'static void std::allocator_traits >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]' at /usr/include/c++/13/bits/alloc_traits.h:538:17, inlined from 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/vector.tcc:117:30, inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/stl_vector.h:1296:21, inlined from 'lemon::SmartDigraphBase::Node lemon::SmartDigraphBase::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:22, inlined from 'lemon::DigraphExtender::Node lemon::DigraphExtender::addNode() [with Base = lemon::SmartDigraphBase]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:268:34, inlined from 'lemon::DigraphExtender::Node lemon::SmartDigraph::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:223:44, inlined from 'void checkDigraphValidity() [with Digraph = lemon::SmartDigraph]' at /build/reproducible-path/liblemon-1.3.1+dfsg/test/digraph_test.cc:352:19: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h: In function 'void checkDigraphValidity() [with Digraph = lemon::SmartDigraph]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:29: note: '' declared here 77 | nodes.push_back(NodeT()); | ^ In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]', inlined from 'static void std::allocator_traits >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]' at /usr/include/c++/13/bits/alloc_traits.h:538:17, inlined from 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/vector.tcc:117:30, inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/stl_vector.h:1296:21, inlined from 'lemon::SmartDigraphBase::Node lemon::SmartDigraphBase::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:22, inlined from 'lemon::DigraphExtender::Node lemon::DigraphExtender::addNode() [with Base = lemon::SmartDigraphBase]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:268:34, inlined from 'lemon::DigraphExtender::Node lemon::SmartDigraph::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:223:44, inlined from 'void checkDigraphValidity() [with Digraph = lemon::SmartDigraph]' at /build/reproducible-path/liblemon-1.3.1+dfsg/test/digraph_test.cc:353:19: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h: In function 'void checkDigraphValidity() [with Digraph = lemon::SmartDigraph]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:29: note: '' declared here 77 | nodes.push_back(NodeT()); | ^ In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]', inlined from 'static void std::allocator_traits >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]' at /usr/include/c++/13/bits/alloc_traits.h:538:17, inlined from 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/vector.tcc:117:30, inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/stl_vector.h:1296:21, inlined from 'lemon::SmartDigraphBase::Node lemon::SmartDigraphBase::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:22, inlined from 'lemon::DigraphExtender::Node lemon::DigraphExtender::addNode() [with Base = lemon::SmartDigraphBase]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:268:34, inlined from 'lemon::DigraphExtender::Node lemon::SmartDigraph::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:223:44, inlined from 'void checkDigraphValidity() [with Digraph = lemon::SmartDigraph]' at /build/reproducible-path/liblemon-1.3.1+dfsg/test/digraph_test.cc:354:19: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h: In function 'void checkDigraphValidity() [with Digraph = lemon::SmartDigraph]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:29: note: '' declared here 77 | nodes.push_back(NodeT()); | ^ In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]', inlined from 'static void std::allocator_traits >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]' at /usr/include/c++/13/bits/alloc_traits.h:538:17, inlined from 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/vector.tcc:117:30, inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/stl_vector.h:1296:21, inlined from 'lemon::SmartDigraphBase::Node lemon::SmartDigraphBase::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:22, inlined from 'lemon::DigraphExtender::Node lemon::DigraphExtender::addNode() [with Base = lemon::SmartDigraphBase]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:268:34, inlined from 'lemon::DigraphExtender::Node lemon::SmartDigraph::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:223:44, inlined from 'void checkDigraphSplit() [with Digraph = lemon::SmartDigraph]' at /build/reproducible-path/liblemon-1.3.1+dfsg/test/digraph_test.cc:93:22: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h: In function 'void checkDigraphSplit() [with Digraph = lemon::SmartDigraph]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:29: note: '' declared here 77 | nodes.push_back(NodeT()); | ^ In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]', inlined from 'static void std::allocator_traits >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]' at /usr/include/c++/13/bits/alloc_traits.h:538:17, inlined from 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/vector.tcc:117:30, inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/stl_vector.h:1296:21, inlined from 'lemon::SmartDigraphBase::Node lemon::SmartDigraphBase::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:22, inlined from 'lemon::DigraphExtender::Node lemon::DigraphExtender::addNode() [with Base = lemon::SmartDigraphBase]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:268:34, inlined from 'lemon::DigraphExtender::Node lemon::SmartDigraph::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:223:44, inlined from 'void checkDigraphSplit() [with Digraph = lemon::SmartDigraph]' at /build/reproducible-path/liblemon-1.3.1+dfsg/test/digraph_test.cc:93:40: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h: In function 'void checkDigraphSplit() [with Digraph = lemon::SmartDigraph]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:29: note: '' declared here 77 | nodes.push_back(NodeT()); | ^ In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]', inlined from 'static void std::allocator_traits >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]' at /usr/include/c++/13/bits/alloc_traits.h:538:17, inlined from 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/vector.tcc:117:30, inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/stl_vector.h:1296:21, inlined from 'lemon::SmartDigraphBase::Node lemon::SmartDigraphBase::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:22, inlined from 'lemon::DigraphExtender::Node lemon::DigraphExtender::addNode() [with Base = lemon::SmartDigraphBase]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:268:34, inlined from 'lemon::DigraphExtender::Node lemon::SmartDigraph::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:223:44, inlined from 'lemon::DigraphExtender::Node lemon::SmartDigraph::split(lemon::DigraphExtender::Node, bool)' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:268:23, inlined from 'void checkDigraphSplit() [with Digraph = lemon::SmartDigraph]' at /build/reproducible-path/liblemon-1.3.1+dfsg/test/digraph_test.cc:98:20: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h: In function 'void checkDigraphSplit() [with Digraph = lemon::SmartDigraph]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:29: note: '' declared here 77 | nodes.push_back(NodeT()); | ^ In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]', inlined from 'static void std::allocator_traits >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]' at /usr/include/c++/13/bits/alloc_traits.h:538:17, inlined from 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/vector.tcc:117:30, inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/stl_vector.h:1296:21, inlined from 'lemon::SmartDigraphBase::Node lemon::SmartDigraphBase::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:22, inlined from 'lemon::DigraphExtender::Node lemon::DigraphExtender::addNode() [with Base = lemon::SmartDigraphBase]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:268:34, inlined from 'lemon::DigraphExtender::Node lemon::SmartDigraph::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:223:44, inlined from 'void checkDigraphBuild() [with Digraph = lemon::SmartDigraph]' at /build/reproducible-path/liblemon-1.3.1+dfsg/test/digraph_test.cc:43:19: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h: In function 'void checkDigraphBuild() [with Digraph = lemon::SmartDigraph]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:29: note: '' declared here 77 | nodes.push_back(NodeT()); | ^ In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]', inlined from 'static void std::allocator_traits >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]' at /usr/include/c++/13/bits/alloc_traits.h:538:17, inlined from 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/vector.tcc:117:30, inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/stl_vector.h:1296:21, inlined from 'lemon::SmartDigraphBase::Node lemon::SmartDigraphBase::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:22, inlined from 'lemon::DigraphExtender::Node lemon::DigraphExtender::addNode() [with Base = lemon::SmartDigraphBase]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:268:34, inlined from 'lemon::DigraphExtender::Node lemon::SmartDigraph::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:223:44, inlined from 'void checkDigraphBuild() [with Digraph = lemon::SmartDigraph]' at /build/reproducible-path/liblemon-1.3.1+dfsg/test/digraph_test.cc:44:19: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h: In function 'void checkDigraphBuild() [with Digraph = lemon::SmartDigraph]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:29: note: '' declared here 77 | nodes.push_back(NodeT()); | ^ In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]', inlined from 'static void std::allocator_traits >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]' at /usr/include/c++/13/bits/alloc_traits.h:538:17, inlined from 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/vector.tcc:117:30, inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/stl_vector.h:1296:21, inlined from 'lemon::SmartDigraphBase::Node lemon::SmartDigraphBase::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:22, inlined from 'lemon::DigraphExtender::Node lemon::DigraphExtender::addNode() [with Base = lemon::SmartDigraphBase]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:268:34, inlined from 'lemon::DigraphExtender::Node lemon::SmartDigraph::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:223:44, inlined from 'void checkDigraphSnapshot() [with Digraph = lemon::SmartDigraph]' at /build/reproducible-path/liblemon-1.3.1+dfsg/test/digraph_test.cc:289:12: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h: In function 'void checkDigraphSnapshot() [with Digraph = lemon::SmartDigraph]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:29: note: '' declared here 77 | nodes.push_back(NodeT()); | ^ In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]', inlined from 'static void std::allocator_traits >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]' at /usr/include/c++/13/bits/alloc_traits.h:538:17, inlined from 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/vector.tcc:117:30, inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/stl_vector.h:1296:21, inlined from 'lemon::SmartDigraphBase::Node lemon::SmartDigraphBase::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:22, inlined from 'lemon::DigraphExtender::Node lemon::DigraphExtender::addNode() [with Base = lemon::SmartDigraphBase]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:268:34, inlined from 'lemon::DigraphExtender::Node lemon::SmartDigraph::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:223:44, inlined from 'void checkDigraphSnapshot() [with Digraph = lemon::SmartDigraph]' at /build/reproducible-path/liblemon-1.3.1+dfsg/test/digraph_test.cc:292:11: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h: In function 'void checkDigraphSnapshot() [with Digraph = lemon::SmartDigraph]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:29: note: '' declared here 77 | nodes.push_back(NodeT()); | ^ In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]', inlined from 'static void std::allocator_traits >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]' at /usr/include/c++/13/bits/alloc_traits.h:538:17, inlined from 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/vector.tcc:117:30, inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/stl_vector.h:1296:21, inlined from 'lemon::SmartDigraphBase::Node lemon::SmartDigraphBase::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:22, inlined from 'lemon::DigraphExtender::Node lemon::DigraphExtender::addNode() [with Base = lemon::SmartDigraphBase]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:268:34, inlined from 'lemon::DigraphExtender::Node lemon::SmartDigraph::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:223:44, inlined from 'void checkDigraphSnapshot() [with Digraph = lemon::SmartDigraph]' at /build/reproducible-path/liblemon-1.3.1+dfsg/test/digraph_test.cc:300:11: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h: In function 'void checkDigraphSnapshot() [with Digraph = lemon::SmartDigraph]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:29: note: '' declared here 77 | nodes.push_back(NodeT()); | ^ [ 34%] Linking CXX executable digraph_test cd /build/reproducible-path/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 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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,-z,relro -Wl,-z,now -rdynamic CMakeFiles/digraph_test.dir/digraph_test.cc.o -o digraph_test -L/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[5]: Leaving directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 34%] Built target digraph_test make -f test/CMakeFiles/dijkstra_test.dir/build.make test/CMakeFiles/dijkstra_test.dir/depend make[5]: Entering directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /build/reproducible-path/liblemon-1.3.1+dfsg /build/reproducible-path/liblemon-1.3.1+dfsg/test /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test/CMakeFiles/dijkstra_test.dir/DependInfo.cmake "--color=" make[5]: Leaving directory '/build/reproducible-path/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 '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 36%] Building CXX object test/CMakeFiles/dijkstra_test.dir/dijkstra_test.cc.o cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -I/build/reproducible-path/liblemon-1.3.1+dfsg -I/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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 -MD -MT test/CMakeFiles/dijkstra_test.dir/dijkstra_test.cc.o -MF CMakeFiles/dijkstra_test.dir/dijkstra_test.cc.o.d -o CMakeFiles/dijkstra_test.dir/dijkstra_test.cc.o -c /build/reproducible-path/liblemon-1.3.1+dfsg/test/dijkstra_test.cc In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lgf_writer.h:37, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:36, from /build/reproducible-path/liblemon-1.3.1+dfsg/test/dijkstra_test.cc:22: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:1973:21: warning: 'template struct std::iterator' is deprecated [-Wdeprecated-declarations] 1973 | : public std::iterator { | ^~~~~~~~ In file included from /usr/include/c++/13/bits/stl_algobase.h:65, from /usr/include/c++/13/vector:62, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/core.h:22, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:26, from /build/reproducible-path/liblemon-1.3.1+dfsg/test/dijkstra_test.cc:19: /usr/include/c++/13/bits/stl_iterator_base_types.h:127:34: note: declared here 127 | struct _GLIBCXX17_DEPRECATED iterator | ^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:3135:21: warning: 'template struct std::iterator' is deprecated [-Wdeprecated-declarations] 3135 | : public std::iterator { | ^~~~~~~~ /usr/include/c++/13/bits/stl_iterator_base_types.h:127:34: note: declared here 127 | struct _GLIBCXX17_DEPRECATED iterator | ^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/test/dijkstra_test.cc: In function 'void checkDijkstraCompile()': /build/reproducible-path/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(); | ^ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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(); | ^ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ^ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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); | ^ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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(); | ^ /build/reproducible-path/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) : | ^~~~~~~ /build/reproducible-path/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(); | ^ /build/reproducible-path/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) : | ^~~~~~~ /build/reproducible-path/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(); | ^ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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(); | ^ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ^ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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); | ^ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:27: /build/reproducible-path/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&; Key = lemon::concepts::Digraph::Node; Value = lemon::concepts::Digraph::Arc]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/dijkstra.h:612:19: required from 'void lemon::Dijkstra::init() [with GR = lemon::concepts::Digraph; LEN = lemon::concepts::ReadMap; TR = lemon::DijkstraDefaultTraits >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/dijkstra_test.cc:83:23: required from here /build/reproducible-path/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; } | ~~~~~~~~~~~~~^~ /build/reproducible-path/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 /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/dijkstra.h:29, from /build/reproducible-path/liblemon-1.3.1+dfsg/test/dijkstra_test.cc:23: /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/path.h:228:28: required from 'void lemon::Path::buildRev(const CPath&) [with CPath = lemon::PredMapPath >; GR = lemon::concepts::Digraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/path.h:1017:20: required from 'static void lemon::_path_bits::PathCopySelectorBackward::copy(const From&, To&) [with From = lemon::PredMapPath >; To = lemon::Path]' /build/reproducible-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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/path.h:1046:49: required from 'void lemon::pathCopy(const From&, To&) [with From = PredMapPath >; To = Path]' /build/reproducible-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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/dijkstra_test.cc:102:36: required from here /build/reproducible-path/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) { | ~~~~~^~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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); | ~~~~~^~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/path.h:1017:20: required from 'static void lemon::_path_bits::PathCopySelectorBackward::copy(const From&, To&) [with From = lemon::PredMapPath >; To = lemon::Path]' /build/reproducible-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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/path.h:1046:49: required from 'void lemon::pathCopy(const From&, To&) [with From = PredMapPath >; To = Path]' /build/reproducible-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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/dijkstra_test.cc:102:36: required from here /build/reproducible-path/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; | ~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/path.h:1017:20: required from 'static void lemon::_path_bits::PathCopySelectorBackward::copy(const From&, To&) [with From = lemon::PredMapPath >; To = lemon::Path]' /build/reproducible-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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/path.h:1046:49: required from 'void lemon::pathCopy(const From&, To&) [with From = PredMapPath >; To = Path]' /build/reproducible-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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/dijkstra_test.cc:102:36: required from here /build/reproducible-path/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]); | ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/path.h:228:28: required from 'void lemon::Path::buildRev(const CPath&) [with CPath = lemon::PredMapPath >; GR = lemon::concepts::Digraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/path.h:1017:20: required from 'static void lemon::_path_bits::PathCopySelectorBackward::copy(const From&, To&) [with From = lemon::PredMapPath >; To = lemon::Path]' /build/reproducible-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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/path.h:1046:49: required from 'void lemon::pathCopy(const From&, To&) [with From = PredMapPath >; To = Path]' /build/reproducible-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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/dijkstra_test.cc:151:30: required from here /build/reproducible-path/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) { | ~~~~~^~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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); | ~~~~~^~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/path.h:1017:20: required from 'static void lemon::_path_bits::PathCopySelectorBackward::copy(const From&, To&) [with From = lemon::PredMapPath >; To = lemon::Path]' /build/reproducible-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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/path.h:1046:49: required from 'void lemon::pathCopy(const From&, To&) [with From = PredMapPath >; To = Path]' /build/reproducible-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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/dijkstra_test.cc:151:30: required from here /build/reproducible-path/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; | ~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/path.h:1017:20: required from 'static void lemon::_path_bits::PathCopySelectorBackward::copy(const From&, To&) [with From = lemon::PredMapPath >; To = lemon::Path]' /build/reproducible-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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/path.h:1046:49: required from 'void lemon::pathCopy(const From&, To&) [with From = PredMapPath >; To = Path]' /build/reproducible-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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/dijkstra_test.cc:151:30: required from here /build/reproducible-path/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]); | ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ In file included from /usr/include/arm-linux-gnueabihf/c++/13/bits/c++allocator.h:33, from /usr/include/c++/13/bits/allocator.h:46, from /usr/include/c++/13/vector:63: In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]', inlined from 'static void std::allocator_traits >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]' at /usr/include/c++/13/bits/alloc_traits.h:538:17, inlined from 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/vector.tcc:117:30, inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/stl_vector.h:1296:21, inlined from 'lemon::SmartDigraphBase::Node lemon::SmartDigraphBase::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:22, inlined from 'lemon::DigraphExtender::Node lemon::DigraphExtender::addNode() [with Base = lemon::SmartDigraphBase]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:268:34, inlined from 'lemon::DigraphExtender::Node lemon::SmartDigraph::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:223:44, inlined from 'void lemon::DigraphReader::readNodes() [with DGR = lemon::SmartDigraph]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:954:31: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/test/dijkstra_test.cc:20: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h: In member function 'void lemon::DigraphReader::readNodes() [with DGR = lemon::SmartDigraph]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:29: note: '' declared here 77 | nodes.push_back(NodeT()); | ^ In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::ArcT; _Args = {lemon::SmartDigraphBase::ArcT}; _Tp = lemon::SmartDigraphBase::ArcT]', inlined from 'static void std::allocator_traits >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::ArcT; _Args = {lemon::SmartDigraphBase::ArcT}; _Tp = lemon::SmartDigraphBase::ArcT]' at /usr/include/c++/13/bits/alloc_traits.h:538:17, inlined from 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {lemon::SmartDigraphBase::ArcT}; _Tp = lemon::SmartDigraphBase::ArcT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/vector.tcc:117:30, inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = lemon::SmartDigraphBase::ArcT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/stl_vector.h:1296:21, inlined from 'lemon::SmartDigraphBase::Arc lemon::SmartDigraphBase::addArc(Node, Node)' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:85:21, inlined from 'lemon::DigraphExtender::Arc lemon::DigraphExtender::addArc(const Node&, const Node&) [with Base = lemon::SmartDigraphBase]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:274:31: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h: In member function 'lemon::DigraphExtender::Arc lemon::DigraphExtender::addArc(const Node&, const Node&) [with Base = lemon::SmartDigraphBase]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:85:27: note: '' declared here 85 | arcs.push_back(ArcT()); | ^ [ 37%] Linking CXX executable dijkstra_test cd /build/reproducible-path/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 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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,-z,relro -Wl,-z,now -rdynamic CMakeFiles/dijkstra_test.dir/dijkstra_test.cc.o -o dijkstra_test -L/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[5]: Leaving directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 37%] Built target dijkstra_test make -f test/CMakeFiles/dim_test.dir/build.make test/CMakeFiles/dim_test.dir/depend make[5]: Entering directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /build/reproducible-path/liblemon-1.3.1+dfsg /build/reproducible-path/liblemon-1.3.1+dfsg/test /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test/CMakeFiles/dim_test.dir/DependInfo.cmake "--color=" make[5]: Leaving directory '/build/reproducible-path/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 '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 38%] Building CXX object test/CMakeFiles/dim_test.dir/dim_test.cc.o cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -I/build/reproducible-path/liblemon-1.3.1+dfsg -I/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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 -MD -MT test/CMakeFiles/dim_test.dir/dim_test.cc.o -MF CMakeFiles/dim_test.dir/dim_test.cc.o.d -o CMakeFiles/dim_test.dir/dim_test.cc.o -c /build/reproducible-path/liblemon-1.3.1+dfsg/test/dim_test.cc [ 39%] Linking CXX executable dim_test cd /build/reproducible-path/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 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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,-z,relro -Wl,-z,now -rdynamic CMakeFiles/dim_test.dir/dim_test.cc.o -o dim_test -L/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[5]: Leaving directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 39%] Built target dim_test make -f test/CMakeFiles/edge_set_test.dir/build.make test/CMakeFiles/edge_set_test.dir/depend make[5]: Entering directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /build/reproducible-path/liblemon-1.3.1+dfsg /build/reproducible-path/liblemon-1.3.1+dfsg/test /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test/CMakeFiles/edge_set_test.dir/DependInfo.cmake "--color=" make[5]: Leaving directory '/build/reproducible-path/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 '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 40%] Building CXX object test/CMakeFiles/edge_set_test.dir/edge_set_test.cc.o cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -I/build/reproducible-path/liblemon-1.3.1+dfsg -I/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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 -MD -MT test/CMakeFiles/edge_set_test.dir/edge_set_test.cc.o -MF CMakeFiles/edge_set_test.dir/edge_set_test.cc.o.d -o CMakeFiles/edge_set_test.dir/edge_set_test.cc.o -c /build/reproducible-path/liblemon-1.3.1+dfsg/test/edge_set_test.cc In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/test/graph_test.h:25, from /build/reproducible-path/liblemon-1.3.1+dfsg/test/edge_set_test.cc:30: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:1973:21: warning: 'template struct std::iterator' is deprecated [-Wdeprecated-declarations] 1973 | : public std::iterator { | ^~~~~~~~ In file included from /usr/include/c++/13/bits/stl_iterator_base_funcs.h:66, from /usr/include/c++/13/string:47, from /usr/include/c++/13/bits/locale_classes.h:40, from /usr/include/c++/13/bits/ios_base.h:41, from /usr/include/c++/13/ios:44, from /usr/include/c++/13/ostream:40, from /usr/include/c++/13/iostream:41, from /build/reproducible-path/liblemon-1.3.1+dfsg/test/edge_set_test.cc:19: /usr/include/c++/13/bits/stl_iterator_base_types.h:127:34: note: declared here 127 | struct _GLIBCXX17_DEPRECATED iterator | ^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:3135:21: warning: 'template struct std::iterator' is deprecated [-Wdeprecated-declarations] 3135 | : public std::iterator { | ^~~~~~~~ /usr/include/c++/13/bits/stl_iterator_base_types.h:127:34: note: declared here 127 | struct _GLIBCXX17_DEPRECATED iterator | ^~~~~~~~ In file included from /usr/include/arm-linux-gnueabihf/c++/13/bits/c++allocator.h:33, from /usr/include/c++/13/bits/allocator.h:46, from /usr/include/c++/13/string:43: In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::SmartArcSetBase::ArcT; _Args = {lemon::SmartArcSetBase::ArcT}; _Tp = lemon::SmartArcSetBase::ArcT]', inlined from 'static void std::allocator_traits >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = lemon::SmartArcSetBase::ArcT; _Args = {lemon::SmartArcSetBase::ArcT}; _Tp = lemon::SmartArcSetBase::ArcT]' at /usr/include/c++/13/bits/alloc_traits.h:538:17, inlined from 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {lemon::SmartArcSetBase::ArcT}; _Tp = lemon::SmartArcSetBase::ArcT; _Alloc = std::allocator::ArcT>]' at /usr/include/c++/13/bits/vector.tcc:117:30, inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = lemon::SmartArcSetBase::ArcT; _Alloc = std::allocator::ArcT>]' at /usr/include/c++/13/bits/stl_vector.h:1296:21, inlined from 'lemon::SmartArcSetBase::Arc lemon::SmartArcSetBase::addArc(const Node&, const Node&) [with GR = lemon::ListDigraph]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/edge_set.h:841:21, inlined from 'lemon::ArcSetExtender::Arc lemon::ArcSetExtender::addArc(const Node&, const Node&) [with Base = lemon::SmartArcSetBase]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/edge_set_extender.h:246:31: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/test/edge_set_test.cc:28: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/edge_set.h: In member function 'lemon::ArcSetExtender::Arc lemon::ArcSetExtender::addArc(const Node&, const Node&) [with Base = lemon::SmartArcSetBase]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/edge_set.h:841:22: note: '' declared here 841 | arcs.push_back(ArcT()); | ^~~~~~ In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::SmartEdgeSetBase::ArcT; _Args = {lemon::SmartEdgeSetBase::ArcT}; _Tp = lemon::SmartEdgeSetBase::ArcT]', inlined from 'static void std::allocator_traits >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = lemon::SmartEdgeSetBase::ArcT; _Args = {lemon::SmartEdgeSetBase::ArcT}; _Tp = lemon::SmartEdgeSetBase::ArcT]' at /usr/include/c++/13/bits/alloc_traits.h:538:17, inlined from 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {lemon::SmartEdgeSetBase::ArcT}; _Tp = lemon::SmartEdgeSetBase::ArcT; _Alloc = std::allocator::ArcT>]' at /usr/include/c++/13/bits/vector.tcc:117:30, inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = lemon::SmartEdgeSetBase::ArcT; _Alloc = std::allocator::ArcT>]' at /usr/include/c++/13/bits/stl_vector.h:1296:21, inlined from 'lemon::SmartEdgeSetBase::Edge lemon::SmartEdgeSetBase::addEdge(const Node&, const Node&) [with GR = lemon::ListDigraph]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/edge_set.h:1144:21, inlined from 'lemon::EdgeSetExtender::Edge lemon::EdgeSetExtender::addEdge(const Node&, const Node&) [with Base = lemon::SmartEdgeSetBase]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/edge_set_extender.h:588:34: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/edge_set.h: In member function 'lemon::EdgeSetExtender::Edge lemon::EdgeSetExtender::addEdge(const Node&, const Node&) [with Base = lemon::SmartEdgeSetBase]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/edge_set.h:1144:22: note: '' declared here 1144 | arcs.push_back(ArcT()); | ^~~~~~ In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::SmartEdgeSetBase::ArcT; _Args = {lemon::SmartEdgeSetBase::ArcT}; _Tp = lemon::SmartEdgeSetBase::ArcT]', inlined from 'static void std::allocator_traits >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = lemon::SmartEdgeSetBase::ArcT; _Args = {lemon::SmartEdgeSetBase::ArcT}; _Tp = lemon::SmartEdgeSetBase::ArcT]' at /usr/include/c++/13/bits/alloc_traits.h:538:17, inlined from 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {lemon::SmartEdgeSetBase::ArcT}; _Tp = lemon::SmartEdgeSetBase::ArcT; _Alloc = std::allocator::ArcT>]' at /usr/include/c++/13/bits/vector.tcc:117:30, inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = lemon::SmartEdgeSetBase::ArcT; _Alloc = std::allocator::ArcT>]' at /usr/include/c++/13/bits/stl_vector.h:1296:21, inlined from 'lemon::SmartEdgeSetBase::Edge lemon::SmartEdgeSetBase::addEdge(const Node&, const Node&) [with GR = lemon::ListDigraph]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/edge_set.h:1145:21, inlined from 'lemon::EdgeSetExtender::Edge lemon::EdgeSetExtender::addEdge(const Node&, const Node&) [with Base = lemon::SmartEdgeSetBase]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/edge_set_extender.h:588:34: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/edge_set.h: In member function 'lemon::EdgeSetExtender::Edge lemon::EdgeSetExtender::addEdge(const Node&, const Node&) [with Base = lemon::SmartEdgeSetBase]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/edge_set.h:1145:22: note: '' declared here 1145 | arcs.push_back(ArcT()); | ^~~~~~ [ 42%] Linking CXX executable edge_set_test cd /build/reproducible-path/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 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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,-z,relro -Wl,-z,now -rdynamic CMakeFiles/edge_set_test.dir/edge_set_test.cc.o -o edge_set_test -L/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[5]: Leaving directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 42%] Built target edge_set_test make -f test/CMakeFiles/error_test.dir/build.make test/CMakeFiles/error_test.dir/depend make[5]: Entering directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /build/reproducible-path/liblemon-1.3.1+dfsg /build/reproducible-path/liblemon-1.3.1+dfsg/test /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test/CMakeFiles/error_test.dir/DependInfo.cmake "--color=" make[5]: Leaving directory '/build/reproducible-path/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 '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 42%] Building CXX object test/CMakeFiles/error_test.dir/error_test.cc.o cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -I/build/reproducible-path/liblemon-1.3.1+dfsg -I/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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 -MD -MT test/CMakeFiles/error_test.dir/error_test.cc.o -MF CMakeFiles/error_test.dir/error_test.cc.o.d -o CMakeFiles/error_test.dir/error_test.cc.o -c /build/reproducible-path/liblemon-1.3.1+dfsg/test/error_test.cc [ 43%] Linking CXX executable error_test cd /build/reproducible-path/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 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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,-z,relro -Wl,-z,now -rdynamic CMakeFiles/error_test.dir/error_test.cc.o -o error_test -L/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[5]: Leaving directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 43%] Built target error_test make -f test/CMakeFiles/euler_test.dir/build.make test/CMakeFiles/euler_test.dir/depend make[5]: Entering directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /build/reproducible-path/liblemon-1.3.1+dfsg /build/reproducible-path/liblemon-1.3.1+dfsg/test /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test/CMakeFiles/euler_test.dir/DependInfo.cmake "--color=" make[5]: Leaving directory '/build/reproducible-path/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 '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 44%] Building CXX object test/CMakeFiles/euler_test.dir/euler_test.cc.o cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -I/build/reproducible-path/liblemon-1.3.1+dfsg -I/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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 -MD -MT test/CMakeFiles/euler_test.dir/euler_test.cc.o -MF CMakeFiles/euler_test.dir/euler_test.cc.o.d -o CMakeFiles/euler_test.dir/euler_test.cc.o -c /build/reproducible-path/liblemon-1.3.1+dfsg/test/euler_test.cc In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/adaptors.h:29, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/euler.h:23, from /build/reproducible-path/liblemon-1.3.1+dfsg/test/euler_test.cc:19: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:1973:21: warning: 'template struct std::iterator' is deprecated [-Wdeprecated-declarations] 1973 | : public std::iterator { | ^~~~~~~~ In file included from /usr/include/c++/13/bits/stl_algobase.h:65, from /usr/include/c++/13/vector:62, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/core.h:22, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/euler.h:22: /usr/include/c++/13/bits/stl_iterator_base_types.h:127:34: note: declared here 127 | struct _GLIBCXX17_DEPRECATED iterator | ^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:3135:21: warning: 'template struct std::iterator' is deprecated [-Wdeprecated-declarations] 3135 | : public std::iterator { | ^~~~~~~~ /usr/include/c++/13/bits/stl_iterator_base_types.h:127:34: note: declared here 127 | struct _GLIBCXX17_DEPRECATED iterator | ^~~~~~~~ In file included from /usr/include/arm-linux-gnueabihf/c++/13/bits/c++allocator.h:33, from /usr/include/c++/13/bits/allocator.h:46, from /usr/include/c++/13/vector:63: In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::GraphAdaptorExtender >::OutArcIt; _Args = {lemon::GraphAdaptorExtender >::OutArcIt}; _Tp = lemon::GraphAdaptorExtender >::OutArcIt]', inlined from 'void lemon::ArrayMap<_Graph, _Item, _Value>::add(const Key&) [with _Graph = lemon::DigraphExtender; _Item = lemon::ListDigraphBase::Node; _Value = lemon::GraphAdaptorExtender >::OutArcIt]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/array_map.h:229:26: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/default_map.h:23, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:25, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/list_graph.h:28, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/dfs.h:26, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/connectivity.h:22, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/euler.h:24: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/array_map.h: In member function 'void lemon::ArrayMap<_Graph, _Item, _Value>::add(const Key&) [with _Graph = lemon::DigraphExtender; _Item = lemon::ListDigraphBase::Node; _Value = lemon::GraphAdaptorExtender >::OutArcIt]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/array_map.h:229:42: note: '' declared here 229 | allocator.construct(&(values[id]), Value()); | ^~~~~~~ In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::GraphAdaptorExtender >::OutArcIt; _Args = {lemon::GraphAdaptorExtender >::OutArcIt}; _Tp = lemon::GraphAdaptorExtender >::OutArcIt]', inlined from 'void lemon::ArrayMap<_Graph, _Item, _Value>::add(const std::vector&) [with _Graph = lemon::DigraphExtender; _Item = lemon::ListDigraphBase::Node; _Value = lemon::GraphAdaptorExtender >::OutArcIt]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/array_map.h:272:28: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/array_map.h: In member function 'void lemon::ArrayMap<_Graph, _Item, _Value>::add(const std::vector&) [with _Graph = lemon::DigraphExtender; _Item = lemon::ListDigraphBase::Node; _Value = lemon::GraphAdaptorExtender >::OutArcIt]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/array_map.h:272:44: note: '' declared here 272 | allocator.construct(&(values[id]), Value()); | ^~~~~~~ In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::GraphAdaptorExtender >::OutArcIt; _Args = {lemon::GraphAdaptorExtender >::OutArcIt}; _Tp = lemon::GraphAdaptorExtender >::OutArcIt]', inlined from 'void lemon::ArrayMap<_Graph, _Item, _Value>::build() [with _Graph = lemon::DigraphExtender; _Item = lemon::ListDigraphBase::Node; _Value = lemon::GraphAdaptorExtender >::OutArcIt]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/array_map.h:306:28: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/array_map.h: In member function 'void lemon::ArrayMap<_Graph, _Item, _Value>::build() [with _Graph = lemon::DigraphExtender; _Item = lemon::ListDigraphBase::Node; _Value = lemon::GraphAdaptorExtender >::OutArcIt]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/array_map.h:306:44: note: '' declared here 306 | allocator.construct(&(values[id]), Value()); | ^~~~~~~ In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::GraphAdaptorExtender >::OutArcIt; _Args = {lemon::GraphAdaptorExtender >::OutArcIt}; _Tp = lemon::GraphAdaptorExtender >::OutArcIt]', inlined from 'lemon::ArrayMap<_Graph, _Item, _Value>::ArrayMap(const GraphType&) [with _Graph = lemon::DigraphExtender; _Item = lemon::ListDigraphBase::Node; _Value = lemon::GraphAdaptorExtender >::OutArcIt]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/array_map.h:91:28, inlined from 'lemon::DefaultMap<_Graph, _Item, _Value>::DefaultMap(const GraphType&) [with _Graph = lemon::DigraphExtender; _Item = lemon::ListDigraphBase::Node; _Value = lemon::GraphAdaptorExtender >::OutArcIt]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/default_map.h:164:63, inlined from 'lemon::MapExtender<_Map>::MapExtender(const GraphType&) [with _Map = lemon::DefaultMap, lemon::ListDigraphBase::Node, lemon::GraphAdaptorExtender >::OutArcIt>]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/map_extender.h:63:21, inlined from 'lemon::DigraphExtender::NodeMap<_Value>::NodeMap(const lemon::DigraphExtender::Digraph&) [with _Value = lemon::GraphAdaptorExtender >::OutArcIt; Base = lemon::ListDigraphBase]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:226:25, inlined from 'lemon::UndirectorBase::NodeMap::NodeMap(const lemon::UndirectorBase&) [with V = lemon::GraphAdaptorExtender >::OutArcIt; DGR = lemon::ListDigraph]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/adaptors.h:2144:35, inlined from 'lemon::DiEulerIt::DiEulerIt(const GR&, typename GR::Node) [with GR = lemon::Undirector]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/euler.h:78:16: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/array_map.h: In constructor 'lemon::DiEulerIt::DiEulerIt(const GR&, typename GR::Node) [with GR = lemon::Undirector]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/array_map.h:91:44: note: '' declared here 91 | allocator.construct(&(values[id]), Value()); | ^~~~~~~ In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::GraphAdaptorExtender >::OutArcIt; _Args = {lemon::GraphAdaptorExtender >::OutArcIt}; _Tp = lemon::GraphAdaptorExtender >::OutArcIt]', inlined from 'lemon::ArrayMap<_Graph, _Item, _Value>::ArrayMap(const GraphType&) [with _Graph = lemon::DigraphExtender; _Item = lemon::ListDigraphBase::Node; _Value = lemon::GraphAdaptorExtender >::OutArcIt]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/array_map.h:91:28, inlined from 'lemon::DefaultMap<_Graph, _Item, _Value>::DefaultMap(const GraphType&) [with _Graph = lemon::DigraphExtender; _Item = lemon::ListDigraphBase::Node; _Value = lemon::GraphAdaptorExtender >::OutArcIt]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/default_map.h:164:63, inlined from 'lemon::MapExtender<_Map>::MapExtender(const GraphType&) [with _Map = lemon::DefaultMap, lemon::ListDigraphBase::Node, lemon::GraphAdaptorExtender >::OutArcIt>]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/map_extender.h:63:21, inlined from 'lemon::DigraphExtender::NodeMap<_Value>::NodeMap(const lemon::DigraphExtender::Digraph&) [with _Value = lemon::GraphAdaptorExtender >::OutArcIt; Base = lemon::ListDigraphBase]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:226:25, inlined from 'lemon::UndirectorBase::NodeMap::NodeMap(const lemon::UndirectorBase&) [with V = lemon::GraphAdaptorExtender >::OutArcIt; DGR = lemon::ListDigraph]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/adaptors.h:2144:35, inlined from 'lemon::EulerIt::EulerIt(const GR&, typename GR::Node) [with GR = lemon::Undirector]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/euler.h:181:16: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/array_map.h: In constructor 'lemon::EulerIt::EulerIt(const GR&, typename GR::Node) [with GR = lemon::Undirector]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/array_map.h:91:44: note: '' declared here 91 | allocator.construct(&(values[id]), Value()); | ^~~~~~~ [ 45%] Linking CXX executable euler_test cd /build/reproducible-path/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 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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,-z,relro -Wl,-z,now -rdynamic CMakeFiles/euler_test.dir/euler_test.cc.o -o euler_test -L/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[5]: Leaving directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 45%] Built target euler_test make -f test/CMakeFiles/fractional_matching_test.dir/build.make test/CMakeFiles/fractional_matching_test.dir/depend make[5]: Entering directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /build/reproducible-path/liblemon-1.3.1+dfsg /build/reproducible-path/liblemon-1.3.1+dfsg/test /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test/CMakeFiles/fractional_matching_test.dir/DependInfo.cmake "--color=" make[5]: Leaving directory '/build/reproducible-path/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 '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 46%] Building CXX object test/CMakeFiles/fractional_matching_test.dir/fractional_matching_test.cc.o cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -I/build/reproducible-path/liblemon-1.3.1+dfsg -I/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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 -MD -MT test/CMakeFiles/fractional_matching_test.dir/fractional_matching_test.cc.o -MF CMakeFiles/fractional_matching_test.dir/fractional_matching_test.cc.o.d -o CMakeFiles/fractional_matching_test.dir/fractional_matching_test.cc.o -c /build/reproducible-path/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:30, from /build/reproducible-path/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:25: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:1973:21: warning: 'template struct std::iterator' is deprecated [-Wdeprecated-declarations] 1973 | : public std::iterator { | ^~~~~~~~ In file included from /usr/include/c++/13/bits/stl_iterator_base_funcs.h:66, from /usr/include/c++/13/string:47, from /usr/include/c++/13/bits/locale_classes.h:40, from /usr/include/c++/13/bits/ios_base.h:41, from /usr/include/c++/13/ios:44, from /usr/include/c++/13/ostream:40, from /usr/include/c++/13/iostream:41, from /build/reproducible-path/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:19: /usr/include/c++/13/bits/stl_iterator_base_types.h:127:34: note: declared here 127 | struct _GLIBCXX17_DEPRECATED iterator | ^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:3135:21: warning: 'template struct std::iterator' is deprecated [-Wdeprecated-declarations] 3135 | : public std::iterator { | ^~~~~~~~ /usr/include/c++/13/bits/stl_iterator_base_types.h:127:34: note: declared here 127 | struct _GLIBCXX17_DEPRECATED iterator | ^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc: In function 'void checkMaxFractionalMatchingCompile()': /build/reproducible-path/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 /build/reproducible-path/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:27: /build/reproducible-path/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&) { } | ^~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc: In function 'void checkMaxWeightedFractionalMatchingCompile()': /build/reproducible-path/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]; | ^ /build/reproducible-path/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&) { } | ^~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc: In function 'void checkMaxWeightedPerfectFractionalMatchingCompile()': /build/reproducible-path/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]; | ^ /build/reproducible-path/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&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:137:17: required from here /build/reproducible-path/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) { | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:139:24: required from here /build/reproducible-path/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) { | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:32: /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:389:24: required from 'void lemon::MaxFractionalMatching::init() [with GR = lemon::concepts::Graph; TR = lemon::MaxFractionalMatchingDefaultTraits]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:136:16: required from here /build/reproducible-path/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; | ~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/map_extender.h:27, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:24, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:30, from /build/reproducible-path/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:26: /build/reproducible-path/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&; Key = lemon::concepts::Graph::Node; Value = lemon::concepts::Graph::Arc]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:392:23: required from 'void lemon::MaxFractionalMatching::init() [with GR = lemon::concepts::Graph; TR = lemon::MaxFractionalMatchingDefaultTraits]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:136:16: required from here /build/reproducible-path/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; } | ~~~~~~~~~~~~~^~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:393:28: required from 'void lemon::MaxFractionalMatching::init() [with GR = lemon::concepts::Graph; TR = lemon::MaxFractionalMatchingDefaultTraits]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:136:16: required from here /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~~~~~~~~^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:410:27: required from 'void lemon::MaxFractionalMatching::init() [with GR = lemon::concepts::Graph; TR = lemon::MaxFractionalMatchingDefaultTraits]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:136:16: required from here /build/reproducible-path/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]; | ~~~~~~~~~~~~~~~~^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~~~~~~~~~~~~~~~^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~~~~~~~~~~~~^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:441:31: required from 'void lemon::MaxFractionalMatching::start(bool) [with GR = lemon::concepts::Graph; TR = lemon::MaxFractionalMatchingDefaultTraits]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:137:17: required from here /build/reproducible-path/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]; | ~~~~~~~~~~~~~~~~^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~~~~~~~~~~~~~~~^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~~~~~~~~~~~~~~~~~^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~~~~~~~~^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:449:36: required from 'void lemon::MaxFractionalMatching::start(bool) [with GR = lemon::concepts::Graph; TR = lemon::MaxFractionalMatchingDefaultTraits]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:137:17: required from here /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:451:41: required from 'void lemon::MaxFractionalMatching::start(bool) [with GR = lemon::concepts::Graph; TR = lemon::MaxFractionalMatchingDefaultTraits]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:137:17: required from here /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:454:28: required from 'void lemon::MaxFractionalMatching::start(bool) [with GR = lemon::concepts::Graph; TR = lemon::MaxFractionalMatchingDefaultTraits]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:137:17: required from here /build/reproducible-path/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]; | ~~^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/fractional_matching.h: In instantiation of 'void lemon::MaxFractionalMatching::postprocessing() [with GR = lemon::concepts::Graph; TR = lemon::MaxFractionalMatchingDefaultTraits]': /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:137:17: required from here /build/reproducible-path/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]); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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]); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:28: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/unionfind.h: In instantiation of 'int lemon::ExtendFindEnum::insert(const Item&) [with IM = lemon::concepts::Graph::NodeMap; Item = lemon::concepts::Graph::Node]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1185:26: required from 'void lemon::MaxWeightedFractionalMatching::init() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:172:16: required from here /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~^~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; Arc = lemon::concepts::Graph::Arc]': /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:173:17: required from here /build/reproducible-path/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]; | ~~~~~^~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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]); | ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; Edge = lemon::concepts::Graph::Edge]': /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:173:17: required from here /build/reproducible-path/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; | ~~~~^~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~^~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]); | ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]); | ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~^~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]); | ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]); | ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~^~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]); | ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]); | ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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]]); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; Arc = lemon::concepts::Graph::Arc]': /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:205:17: required from here /build/reproducible-path/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]; | ~~~~~^~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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]); | ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; Edge = lemon::concepts::Graph::Edge]': /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:205:17: required from here /build/reproducible-path/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; | ~~~~^~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~^~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]); | ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]); | ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~^~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]); | ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]); | ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~^~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]); | ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]); | ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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]]); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/fractional_matching.h: In instantiation of 'void lemon::MaxWeightedFractionalMatching::alternatePath(Node, int) [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap; Node = lemon::concepts::Graph::Node]': /build/reproducible-path/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; Node = lemon::concepts::Graph::Node]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:173:17: required from here /build/reproducible-path/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); | ~~~~^~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~~~~^~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/unionfind.h: In instantiation of 'void lemon::ExtendFindEnum::insert(const Item&, int) [with IM = lemon::concepts::Graph::NodeMap; Item = lemon::concepts::Graph::Node]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1003:24: required from 'void lemon::MaxWeightedFractionalMatching::extendOnArc(const Arc&) [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap; Arc = lemon::concepts::Graph::Arc]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:173:17: required from here /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~^~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/fractional_matching.h: In instantiation of 'void lemon::MaxWeightedFractionalMatching::evenToMatched(Node, int) [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap; Node = lemon::concepts::Graph::Node]': /build/reproducible-path/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; Edge = lemon::concepts::Graph::Edge]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:173:17: required from here /build/reproducible-path/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); | ~~~~^~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; | ~~~~~^~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/fractional_matching.h: In instantiation of 'void lemon::MaxWeightedFractionalMatching::oddToMatched(Node) [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap; Node = lemon::concepts::Graph::Node]': /build/reproducible-path/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; Edge = lemon::concepts::Graph::Edge]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:173:17: required from here /build/reproducible-path/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); | ~~~~^~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/fractional_matching.h: In instantiation of 'void lemon::MaxWeightedPerfectFractionalMatching::alternatePath(Node, int) [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap; Node = lemon::concepts::Graph::Node]': /build/reproducible-path/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; Arc = lemon::concepts::Graph::Arc]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:205:17: required from here /build/reproducible-path/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); | ~~~~^~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~~~~^~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/fractional_matching.h: In instantiation of 'void lemon::MaxWeightedPerfectFractionalMatching::evenToMatched(Node, int) [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap; Node = lemon::concepts::Graph::Node]': /build/reproducible-path/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; Edge = lemon::concepts::Graph::Edge]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:205:17: required from here /build/reproducible-path/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); | ~~~~^~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; | ~~~~~^~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/fractional_matching.h: In instantiation of 'void lemon::MaxWeightedPerfectFractionalMatching::oddToMatched(Node) [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap; Node = lemon::concepts::Graph::Node]': /build/reproducible-path/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; Edge = lemon::concepts::Graph::Edge]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/fractional_matching_test.cc:205:17: required from here /build/reproducible-path/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); | ~~~~^~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ [ 48%] Linking CXX executable fractional_matching_test cd /build/reproducible-path/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 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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,-z,relro -Wl,-z,now -rdynamic CMakeFiles/fractional_matching_test.dir/fractional_matching_test.cc.o -o fractional_matching_test -L/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[5]: Leaving directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 48%] Built target fractional_matching_test make -f test/CMakeFiles/gomory_hu_test.dir/build.make test/CMakeFiles/gomory_hu_test.dir/depend make[5]: Entering directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /build/reproducible-path/liblemon-1.3.1+dfsg /build/reproducible-path/liblemon-1.3.1+dfsg/test /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test/CMakeFiles/gomory_hu_test.dir/DependInfo.cmake "--color=" make[5]: Leaving directory '/build/reproducible-path/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 '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 49%] Building CXX object test/CMakeFiles/gomory_hu_test.dir/gomory_hu_test.cc.o cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -I/build/reproducible-path/liblemon-1.3.1+dfsg -I/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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 -MD -MT test/CMakeFiles/gomory_hu_test.dir/gomory_hu_test.cc.o -MF CMakeFiles/gomory_hu_test.dir/gomory_hu_test.cc.o.d -o CMakeFiles/gomory_hu_test.dir/gomory_hu_test.cc.o -c /build/reproducible-path/liblemon-1.3.1+dfsg/test/gomory_hu_test.cc In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lgf_writer.h:37, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:36, from /build/reproducible-path/liblemon-1.3.1+dfsg/test/gomory_hu_test.cc:25: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:1973:21: warning: 'template struct std::iterator' is deprecated [-Wdeprecated-declarations] 1973 | : public std::iterator { | ^~~~~~~~ In file included from /usr/include/c++/13/bits/stl_iterator_base_funcs.h:66, from /usr/include/c++/13/string:47, from /usr/include/c++/13/bits/locale_classes.h:40, from /usr/include/c++/13/bits/ios_base.h:41, from /usr/include/c++/13/ios:44, from /usr/include/c++/13/ostream:40, from /usr/include/c++/13/iostream:41, from /build/reproducible-path/liblemon-1.3.1+dfsg/test/gomory_hu_test.cc:19: /usr/include/c++/13/bits/stl_iterator_base_types.h:127:34: note: declared here 127 | struct _GLIBCXX17_DEPRECATED iterator | ^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:3135:21: warning: 'template struct std::iterator' is deprecated [-Wdeprecated-declarations] 3135 | : public std::iterator { | ^~~~~~~~ /usr/include/c++/13/bits/stl_iterator_base_types.h:127:34: note: declared here 127 | struct _GLIBCXX17_DEPRECATED iterator | ^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/test/gomory_hu_test.cc: In function 'void checkGomoryHuCompile()': /build/reproducible-path/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 /build/reproducible-path/liblemon-1.3.1+dfsg/test/gomory_hu_test.cc:23: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/test/gomory_hu_test.cc:26: /build/reproducible-path/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; Value = int; Node = lemon::concepts::Graph::Node]': /build/reproducible-path/liblemon-1.3.1+dfsg/test/gomory_hu_test.cc:82:32: required from here /build/reproducible-path/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]; | ~~~^~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~~^~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; Value = int; Node = lemon::concepts::Graph::Node]': /build/reproducible-path/liblemon-1.3.1+dfsg/test/gomory_hu_test.cc:83:30: required from here /build/reproducible-path/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; | ~~~^~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~~^~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~^~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~~^~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~~^~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/gomory_hu_test.cc:77:14: required from here /build/reproducible-path/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); | ~~~~~~^~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~^~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/gomory_hu_test.cc:77:14: required from here /build/reproducible-path/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; | ~~~~~~~~~~~~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~~~~~~~~~~~^~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~~^~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/gomory_hu.h:25: /build/reproducible-path/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 >; Node = lemon::concepts::Graph::Node]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/gomory_hu.h:160:18: required from 'void lemon::GomoryHu::start() [with GR = lemon::concepts::Graph; CAP = lemon::concepts::ReadMap]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/gomory_hu_test.cc:77:14: required from here /build/reproducible-path/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; | ~~~~~~~~^~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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 >; Node = lemon::concepts::Graph::Node]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/gomory_hu.h:161:18: required from 'void lemon::GomoryHu::start() [with GR = lemon::concepts::Graph; CAP = lemon::concepts::ReadMap]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/gomory_hu_test.cc:77:14: required from here /build/reproducible-path/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; | ~~~~~~~~^~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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 >]': /build/reproducible-path/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 >]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/gomory_hu.h:163:21: required from 'void lemon::GomoryHu::start() [with GR = lemon::concepts::Graph; CAP = lemon::concepts::ReadMap]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/gomory_hu_test.cc:77:14: required from here /build/reproducible-path/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(); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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(); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/preflow.h:23: /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/preflow.h:434:24: required from 'void lemon::Preflow::init() [with GR = lemon::concepts::Graph; CAP = lemon::concepts::ReadMap; TR = lemon::PreflowDefaultTraits >]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/preflow.h:897:11: required from 'void lemon::Preflow::runMinCut() [with GR = lemon::concepts::Graph; CAP = lemon::concepts::ReadMap; TR = lemon::PreflowDefaultTraits >]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/gomory_hu.h:163:21: required from 'void lemon::GomoryHu::start() [with GR = lemon::concepts::Graph; CAP = lemon::concepts::ReadMap]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/gomory_hu_test.cc:77:14: required from here /build/reproducible-path/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; | ~~^~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/elevator.h: In instantiation of 'void lemon::Elevator::swap(Vit, Vit) [with GR = lemon::concepts::Graph; Item = lemon::concepts::Graph::Node; Vit = lemon::concepts::Graph::Node*]': /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/preflow.h:435:26: required from 'void lemon::Preflow::init() [with GR = lemon::concepts::Graph; CAP = lemon::concepts::ReadMap; TR = lemon::PreflowDefaultTraits >]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/preflow.h:897:11: required from 'void lemon::Preflow::runMinCut() [with GR = lemon::concepts::Graph; CAP = lemon::concepts::ReadMap; TR = lemon::PreflowDefaultTraits >]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/gomory_hu.h:163:21: required from 'void lemon::GomoryHu::start() [with GR = lemon::concepts::Graph; CAP = lemon::concepts::ReadMap]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/gomory_hu_test.cc:77:14: required from here /build/reproducible-path/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]; | ~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/elevator.h: In instantiation of 'void lemon::Elevator::copy(Vit, Vit) [with GR = lemon::concepts::Graph; Item = lemon::concepts::Graph::Node; Vit = lemon::concepts::Graph::Node*]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/elevator.h:245:11: required from 'void lemon::Elevator::liftHighestActive(int) [with GR = lemon::concepts::Graph; Item = lemon::concepts::Graph::Node]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/preflow.h:644:40: required from 'void lemon::Preflow::startFirstPhase() [with GR = lemon::concepts::Graph; CAP = lemon::concepts::ReadMap; TR = lemon::PreflowDefaultTraits >]' /build/reproducible-path/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 >]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/gomory_hu.h:163:21: required from 'void lemon::GomoryHu::start() [with GR = lemon::concepts::Graph; CAP = lemon::concepts::ReadMap]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/gomory_hu_test.cc:77:14: required from here /build/reproducible-path/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; | ~~^~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/elevator.h: In instantiation of 'void lemon::Elevator::copy(Item, Vit) [with GR = lemon::concepts::Graph; Item = lemon::concepts::Graph::Node; Vit = lemon::concepts::Graph::Node*]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/elevator.h:251:11: required from 'void lemon::Elevator::liftHighestActive(int) [with GR = lemon::concepts::Graph; Item = lemon::concepts::Graph::Node]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/preflow.h:644:40: required from 'void lemon::Preflow::startFirstPhase() [with GR = lemon::concepts::Graph; CAP = lemon::concepts::ReadMap; TR = lemon::PreflowDefaultTraits >]' /build/reproducible-path/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 >]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/gomory_hu.h:163:21: required from 'void lemon::GomoryHu::start() [with GR = lemon::concepts::Graph; CAP = lemon::concepts::ReadMap]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/gomory_hu_test.cc:77:14: required from here /build/reproducible-path/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; | ~~^~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ [ 49%] Linking CXX executable gomory_hu_test cd /build/reproducible-path/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 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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,-z,relro -Wl,-z,now -rdynamic CMakeFiles/gomory_hu_test.dir/gomory_hu_test.cc.o -o gomory_hu_test -L/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[5]: Leaving directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 49%] Built target gomory_hu_test make -f test/CMakeFiles/graph_copy_test.dir/build.make test/CMakeFiles/graph_copy_test.dir/depend make[5]: Entering directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /build/reproducible-path/liblemon-1.3.1+dfsg /build/reproducible-path/liblemon-1.3.1+dfsg/test /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test/CMakeFiles/graph_copy_test.dir/DependInfo.cmake "--color=" make[5]: Leaving directory '/build/reproducible-path/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 '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 50%] Building CXX object test/CMakeFiles/graph_copy_test.dir/graph_copy_test.cc.o cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -I/build/reproducible-path/liblemon-1.3.1+dfsg -I/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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 -MD -MT test/CMakeFiles/graph_copy_test.dir/graph_copy_test.cc.o -MF CMakeFiles/graph_copy_test.dir/graph_copy_test.cc.o.d -o CMakeFiles/graph_copy_test.dir/graph_copy_test.cc.o -c /build/reproducible-path/liblemon-1.3.1+dfsg/test/graph_copy_test.cc In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lgf_writer.h:37, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:36, from /build/reproducible-path/liblemon-1.3.1+dfsg/test/graph_copy_test.cc:22: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:1973:21: warning: 'template struct std::iterator' is deprecated [-Wdeprecated-declarations] 1973 | : public std::iterator { | ^~~~~~~~ In file included from /usr/include/c++/13/bits/stl_algobase.h:65, from /usr/include/c++/13/vector:62, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:26, from /build/reproducible-path/liblemon-1.3.1+dfsg/test/graph_copy_test.cc:19: /usr/include/c++/13/bits/stl_iterator_base_types.h:127:34: note: declared here 127 | struct _GLIBCXX17_DEPRECATED iterator | ^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:3135:21: warning: 'template struct std::iterator' is deprecated [-Wdeprecated-declarations] 3135 | : public std::iterator { | ^~~~~~~~ /usr/include/c++/13/bits/stl_iterator_base_types.h:127:34: note: declared here 127 | struct _GLIBCXX17_DEPRECATED iterator | ^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/test/graph_copy_test.cc: In instantiation of 'void bpgraph_copy_test() [with GR = lemon::SmartBpGraph]': /build/reproducible-path/liblemon-1.3.1+dfsg/test/graph_copy_test.cc:384:34: required from here /build/reproducible-path/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; | ~~~~^~~~~~ /build/reproducible-path/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) {} | ^~~~~~~ /build/reproducible-path/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; | ~~~~^~~~~~ /build/reproducible-path/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) {} | ^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/test/graph_copy_test.cc: In instantiation of 'void bpgraph_copy_test() [with GR = lemon::ListBpGraph]': /build/reproducible-path/liblemon-1.3.1+dfsg/test/graph_copy_test.cc:385:33: required from here /build/reproducible-path/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; | ~~~~^~~~~~ /build/reproducible-path/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) {} | ^~~~~~~ /build/reproducible-path/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; | ~~~~^~~~~~ /build/reproducible-path/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 /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:28: /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/core.h:1541:13: required from 'void lemon::BpGraphCopy::run() [with From = lemon::SmartBpGraph; To = lemon::SmartBpGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/graph_copy_test.cc:295:33: required from 'void bpgraph_copy_test() [with GR = lemon::SmartBpGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/graph_copy_test.cc:384:34: required from here /build/reproducible-path/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(); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ /build/reproducible-path/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) {} | ^~~~~~~ /build/reproducible-path/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(); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ /build/reproducible-path/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) {} | ^~~~~~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/core.h:1541:13: required from 'void lemon::BpGraphCopy::run() [with From = lemon::SmartBpGraph; To = lemon::ListBpGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/graph_copy_test.cc:295:33: required from 'void bpgraph_copy_test() [with GR = lemon::ListBpGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/graph_copy_test.cc:385:33: required from here /build/reproducible-path/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 /build/reproducible-path/liblemon-1.3.1+dfsg/test/graph_copy_test.cc:20: /build/reproducible-path/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) {} | ^~~~~~~ /build/reproducible-path/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(); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ /build/reproducible-path/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) {} | ^~~~~~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/core.h:470:20: required from here /build/reproducible-path/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]; | ~~~~^~~~~~~~~ /build/reproducible-path/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) {} | ^~~~~~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/core.h:470:20: required from here /build/reproducible-path/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]; | ~~~~^~~~~~~~~ /build/reproducible-path/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) {} | ^~~~~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/core.h:470:20: required from here /build/reproducible-path/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]; | ~~~~^~~~~~~~~ /build/reproducible-path/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) {} | ^~~~~~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/core.h:470:20: required from here /build/reproducible-path/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]; | ~~~~^~~~~~~~~ /build/reproducible-path/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 /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/default_map.h:23, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:25, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:30: /build/reproducible-path/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; Key = lemon::ListBpGraphBase::BlueNode; Value = lemon::SmartBpGraphBase::BlueNode]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/core.h:506:20: 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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/core.h:503:20: required from here /build/reproducible-path/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; | ~~~~~~~~~~~~~^~~~~ /build/reproducible-path/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) {} | ^~~~~~~~ /build/reproducible-path/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; Key = lemon::ListBpGraphBase::RedNode; Value = lemon::SmartBpGraphBase::RedNode]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/core.h:506:20: 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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/core.h:503:20: required from here /build/reproducible-path/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; | ~~~~~~~~~~~~~^~~~~ /build/reproducible-path/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) {} | ^~~~~~~ /build/reproducible-path/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; Key = lemon::SmartBpGraphBase::BlueNode; Value = lemon::ListBpGraphBase::BlueNode]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/core.h:488:19: 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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/core.h:485:20: required from here /build/reproducible-path/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; | ~~~~~~~~~~~~~^~~~~ /build/reproducible-path/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) {} | ^~~~~~~~ /build/reproducible-path/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; Key = lemon::SmartBpGraphBase::RedNode; Value = lemon::ListBpGraphBase::RedNode]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/core.h:488:19: 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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/core.h:485:20: required from here /build/reproducible-path/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; | ~~~~~~~~~~~~~^~~~~ /build/reproducible-path/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) {} | ^~~~~~~ /build/reproducible-path/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; Key = lemon::SmartBpGraphBase::BlueNode; Value = lemon::SmartBpGraphBase::BlueNode]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/core.h:506:20: 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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/core.h:503:20: required from here /build/reproducible-path/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; | ~~~~~~~~~~~~~^~~~~ /build/reproducible-path/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) {} | ^~~~~~~~ /build/reproducible-path/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; Key = lemon::SmartBpGraphBase::RedNode; Value = lemon::SmartBpGraphBase::RedNode]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/core.h:506:20: 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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/core.h:503:20: required from here /build/reproducible-path/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; | ~~~~~~~~~~~~~^~~~~ /build/reproducible-path/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 /usr/include/arm-linux-gnueabihf/c++/13/bits/c++allocator.h:33, from /usr/include/c++/13/bits/allocator.h:46, from /usr/include/c++/13/vector:63: In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::ArcT; _Args = {lemon::SmartDigraphBase::ArcT}; _Tp = lemon::SmartDigraphBase::ArcT]', inlined from 'static void std::allocator_traits >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::ArcT; _Args = {lemon::SmartDigraphBase::ArcT}; _Tp = lemon::SmartDigraphBase::ArcT]' at /usr/include/c++/13/bits/alloc_traits.h:538:17, inlined from 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {lemon::SmartDigraphBase::ArcT}; _Tp = lemon::SmartDigraphBase::ArcT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/vector.tcc:117:30, inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = lemon::SmartDigraphBase::ArcT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/stl_vector.h:1296:21, inlined from 'lemon::SmartDigraphBase::Arc lemon::SmartDigraphBase::addArc(Node, Node)' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:85:21, inlined from 'lemon::DigraphExtender::Arc lemon::DigraphExtender::addArc(const Node&, const Node&) [with Base = lemon::SmartDigraphBase]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:274:31: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h: In member function 'lemon::DigraphExtender::Arc lemon::DigraphExtender::addArc(const Node&, const Node&) [with Base = lemon::SmartDigraphBase]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:85:27: note: '' declared here 85 | arcs.push_back(ArcT()); | ^ In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]', inlined from 'static void std::allocator_traits >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]' at /usr/include/c++/13/bits/alloc_traits.h:538:17, inlined from 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/vector.tcc:117:30, inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/stl_vector.h:1296:21, inlined from 'lemon::SmartDigraphBase::Node lemon::SmartDigraphBase::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:22, inlined from 'lemon::DigraphExtender::Node lemon::DigraphExtender::addNode() [with Base = lemon::SmartDigraphBase]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:268:34, inlined from 'lemon::DigraphExtender::Node lemon::SmartDigraph::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:223:44, inlined from 'static void lemon::_core_bits::DigraphCopySelector::copy(const From&, Digraph&, NodeRefMap&, ArcRefMap&) [with From = lemon::SmartDigraph; NodeRefMap = lemon::DigraphExtender::NodeMap; ArcRefMap = lemon::DigraphExtender::ArcMap; Digraph = lemon::SmartDigraph; Enable = void]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/core.h:521:38, inlined from 'void lemon::DigraphCopy::run() [with From = lemon::SmartDigraph; To = lemon::SmartDigraph]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/core.h:807:13: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h: In member function 'void lemon::DigraphCopy::run() [with From = lemon::SmartDigraph; To = lemon::SmartDigraph]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:29: note: '' declared here 77 | nodes.push_back(NodeT()); | ^ In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]', inlined from 'static void std::allocator_traits >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]' at /usr/include/c++/13/bits/alloc_traits.h:538:17, inlined from 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/vector.tcc:117:30, inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/stl_vector.h:1296:21, inlined from 'lemon::SmartDigraphBase::Node lemon::SmartDigraphBase::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:22, inlined from 'lemon::DigraphExtender::Node lemon::DigraphExtender::addNode() [with Base = lemon::SmartDigraphBase]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:268:34, inlined from 'lemon::DigraphExtender::Node lemon::SmartDigraph::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:223:44, inlined from 'void digraph_copy_test() [with GR = lemon::SmartDigraph]' at /build/reproducible-path/liblemon-1.3.1+dfsg/test/graph_copy_test.cc:43:43: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h: In function 'void digraph_copy_test() [with GR = lemon::SmartDigraph]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:29: note: '' declared here 77 | nodes.push_back(NodeT()); | ^ In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]', inlined from 'static void std::allocator_traits >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]' at /usr/include/c++/13/bits/alloc_traits.h:538:17, inlined from 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/vector.tcc:117:30, inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/stl_vector.h:1296:21, inlined from 'lemon::SmartDigraphBase::Node lemon::SmartDigraphBase::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:22, inlined from 'lemon::DigraphExtender::Node lemon::DigraphExtender::addNode() [with Base = lemon::SmartDigraphBase]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:268:34, inlined from 'lemon::DigraphExtender::Node lemon::SmartDigraph::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:223:44, inlined from 'void digraph_copy_test() [with GR = lemon::ListDigraph]' at /build/reproducible-path/liblemon-1.3.1+dfsg/test/graph_copy_test.cc:43:43: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h: In function 'void digraph_copy_test() [with GR = lemon::ListDigraph]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:29: note: '' declared here 77 | nodes.push_back(NodeT()); | ^ In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]', inlined from 'static void std::allocator_traits >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]' at /usr/include/c++/13/bits/alloc_traits.h:538:17, inlined from 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/vector.tcc:117:30, inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/stl_vector.h:1296:21, inlined from 'lemon::SmartDigraphBase::Node lemon::SmartDigraphBase::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:22, inlined from 'lemon::DigraphExtender::Node lemon::DigraphExtender::addNode() [with Base = lemon::SmartDigraphBase]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:268:34, inlined from 'lemon::DigraphExtender::Node lemon::SmartDigraph::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:223:44, inlined from 'void digraph_copy_test() [with GR = lemon::StaticDigraph]' at /build/reproducible-path/liblemon-1.3.1+dfsg/test/graph_copy_test.cc:43:43: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h: In function 'void digraph_copy_test() [with GR = lemon::StaticDigraph]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:29: note: '' declared here 77 | nodes.push_back(NodeT()); | ^ [ 51%] Linking CXX executable graph_copy_test cd /build/reproducible-path/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 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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,-z,relro -Wl,-z,now -rdynamic CMakeFiles/graph_copy_test.dir/graph_copy_test.cc.o -o graph_copy_test -L/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[5]: Leaving directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 51%] Built target graph_copy_test make -f test/CMakeFiles/graph_test.dir/build.make test/CMakeFiles/graph_test.dir/depend make[5]: Entering directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /build/reproducible-path/liblemon-1.3.1+dfsg /build/reproducible-path/liblemon-1.3.1+dfsg/test /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test/CMakeFiles/graph_test.dir/DependInfo.cmake "--color=" make[5]: Leaving directory '/build/reproducible-path/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 '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 53%] Building CXX object test/CMakeFiles/graph_test.dir/graph_test.cc.o cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -I/build/reproducible-path/liblemon-1.3.1+dfsg -I/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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 -MD -MT test/CMakeFiles/graph_test.dir/graph_test.cc.o -MF CMakeFiles/graph_test.dir/graph_test.cc.o.d -o CMakeFiles/graph_test.dir/graph_test.cc.o -c /build/reproducible-path/liblemon-1.3.1+dfsg/test/graph_test.cc In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/test/graph_test.h:25, from /build/reproducible-path/liblemon-1.3.1+dfsg/test/graph_test.cc:27: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:1973:21: warning: 'template struct std::iterator' is deprecated [-Wdeprecated-declarations] 1973 | : public std::iterator { | ^~~~~~~~ In file included from /usr/include/c++/13/bits/stl_algobase.h:65, from /usr/include/c++/13/vector:62, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/core.h:22, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph_components.h:26, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:26, from /build/reproducible-path/liblemon-1.3.1+dfsg/test/graph_test.cc:19: /usr/include/c++/13/bits/stl_iterator_base_types.h:127:34: note: declared here 127 | struct _GLIBCXX17_DEPRECATED iterator | ^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:3135:21: warning: 'template struct std::iterator' is deprecated [-Wdeprecated-declarations] 3135 | : public std::iterator { | ^~~~~~~~ /usr/include/c++/13/bits/stl_iterator_base_types.h:127:34: note: declared here 127 | struct _GLIBCXX17_DEPRECATED iterator | ^~~~~~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseGraphComponent; Type = concepts::BaseGraphComponent]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/graph_test.cc:337:58: required from here /build/reproducible-path/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; | ~~~^~~ /build/reproducible-path/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() {} | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IDableGraphComponent<>; Type = concepts::IDableGraphComponent<>]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/graph_test.cc:340:31: required from here /build/reproducible-path/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); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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() {} | ^~~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItem<'e'>; Type = concepts::BaseGraphComponent::Edge]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseGraphComponent; Type = concepts::BaseGraphComponent]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/graph_test.cc:337:58: required from here /build/reproducible-path/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; | ~~^~~~~~~~ /build/reproducible-path/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() {} | ^~~~ /build/reproducible-path/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; | ~~~^~~~ /build/reproducible-path/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() {} | ^~~~ /build/reproducible-path/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; | ~~~^~~~~~~~~ /build/reproducible-path/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() {} | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItemIt, concepts::BaseGraphComponent::Edge>; Type = concepts::GraphItemIt, concepts::BaseGraphComponent::Edge>]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableGraphComponent<>; Type = concepts::IterableGraphComponent<>]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/graph_test.cc:343:33: required from here /build/reproducible-path/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; | ~~~^~~~~ /build/reproducible-path/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() {} | ^~~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphIncIt, concepts::BaseGraphComponent::Edge, concepts::GraphItem<'n'>, 'e'>; Type = concepts::GraphIncIt, concepts::BaseGraphComponent::Edge, concepts::GraphItem<'n'>, 'e'>]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableGraphComponent<>; Type = concepts::IterableGraphComponent<>]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/graph_test.cc:343:33: required from here /build/reproducible-path/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; | ~~^~~~~ /build/reproducible-path/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() {} | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseGraphComponent; Type = concepts::Graph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Graph; Type = concepts::Graph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/graph_test.cc:349:31: required from here /build/reproducible-path/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); | ~~^~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; | ~~~^~~ /build/reproducible-path/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&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableGraphComponent<>; Type = concepts::Graph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Graph; Type = concepts::Graph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/graph_test.cc:349:31: required from here /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IDableGraphComponent<>; Type = concepts::Graph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Graph; Type = concepts::Graph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/graph_test.cc:349:31: required from here /build/reproducible-path/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); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~~ /build/reproducible-path/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<>]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseGraphComponent; Type = concepts::IDableGraphComponent<>]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IDableDigraphComponent; Type = concepts::IDableGraphComponent<>]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IDableGraphComponent<>; Type = concepts::IDableGraphComponent<>]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/graph_test.cc:340:31: required from here /build/reproducible-path/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; | ~~~^~~ /build/reproducible-path/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() {} | ^~~~ /build/reproducible-path/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<>]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseGraphComponent; Type = concepts::IterableGraphComponent<>]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent; Type = concepts::IterableGraphComponent<>]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableGraphComponent<>; Type = concepts::IterableGraphComponent<>]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/graph_test.cc:343:33: required from here /build/reproducible-path/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; | ~~~^~~ /build/reproducible-path/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() {} | ^~~~ /build/reproducible-path/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<>]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseGraphComponent; Type = concepts::MappableGraphComponent<>]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::MappableDigraphComponent; Type = concepts::MappableGraphComponent<>]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::MappableGraphComponent<>; Type = concepts::MappableGraphComponent<>]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/graph_test.cc:346:33: required from here /build/reproducible-path/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; | ~~~^~~ /build/reproducible-path/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() {} | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseDigraphComponent; Type = concepts::Graph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseGraphComponent; Type = concepts::Graph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Graph; Type = concepts::Graph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/graph_test.cc:349:31: required from here /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItem<'e'>; Type = concepts::Graph::Edge]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseGraphComponent; Type = concepts::Graph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Graph; Type = concepts::Graph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/graph_test.cc:349:31: required from here /build/reproducible-path/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; | ~~^~~~~~~~ /build/reproducible-path/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&) { } | ^~~~ /build/reproducible-path/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; | ~~~^~~~ /build/reproducible-path/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&) { } | ^~~~ /build/reproducible-path/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; | ~~~^~~~~~~~~ /build/reproducible-path/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&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent; Type = concepts::Graph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableGraphComponent<>; Type = concepts::Graph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Graph; Type = concepts::Graph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/graph_test.cc:349:31: required from here /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItemIt; Type = concepts::Graph::EdgeIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableGraphComponent<>; Type = concepts::Graph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Graph; Type = concepts::Graph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/graph_test.cc:349:31: required from here /build/reproducible-path/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; | ~~~~^~~~~~~ /build/reproducible-path/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) { } | ^~~~~~ /build/reproducible-path/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; | ~~~~~~^~~~~ /build/reproducible-path/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) { } | ^~~~~~ /build/reproducible-path/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; | ~~~^~~~~ /build/reproducible-path/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&) { } | ^~~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphIncIt; Type = concepts::Graph::IncEdgeIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableGraphComponent<>; Type = concepts::Graph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Graph; Type = concepts::Graph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/graph_test.cc:349:31: required from here /build/reproducible-path/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; | ~~~~^~~~~~~ /build/reproducible-path/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) { } | ^~~~~~~~~ /build/reproducible-path/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; | ~~~~~~^~~~~ /build/reproducible-path/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) { } | ^~~~~~~~~ /build/reproducible-path/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; | ~~^~~~~ /build/reproducible-path/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&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IDableDigraphComponent; Type = concepts::Graph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IDableGraphComponent<>; Type = concepts::Graph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Graph; Type = concepts::Graph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/graph_test.cc:349:31: required from here /build/reproducible-path/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; | ~~~~^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~^~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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); | ~~~~^~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItem<'n'>; Type = concepts::Graph::Node]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseDigraphComponent; Type = concepts::Graph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseGraphComponent; Type = concepts::Graph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Graph; Type = concepts::Graph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/graph_test.cc:349:31: required from here /build/reproducible-path/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; | ~~^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~^~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItem<'a'>; Type = concepts::Graph::Arc]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseDigraphComponent; Type = concepts::Graph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseGraphComponent; Type = concepts::Graph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Graph; Type = concepts::Graph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/graph_test.cc:349:31: required from here /build/reproducible-path/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; | ~~^~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; | ~~~^~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; | ~~~^~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItemIt; Type = concepts::Graph::ArcIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent; Type = concepts::Graph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableGraphComponent<>; Type = concepts::Graph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Graph; Type = concepts::Graph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/graph_test.cc:349:31: required from here /build/reproducible-path/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; | ~~~~^~~~~~~ /build/reproducible-path/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) { } | ^~~~~ /build/reproducible-path/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; | ~~~~~~^~~~~ /build/reproducible-path/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) { } | ^~~~~ /build/reproducible-path/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; | ~~~^~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItemIt; Type = concepts::Graph::NodeIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent; Type = concepts::Graph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableGraphComponent<>; Type = concepts::Graph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Graph; Type = concepts::Graph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/graph_test.cc:349:31: required from here /build/reproducible-path/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; | ~~~~^~~~~~~ /build/reproducible-path/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) { } | ^~~~~~ /build/reproducible-path/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; | ~~~~~~^~~~~ /build/reproducible-path/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) { } | ^~~~~~ /build/reproducible-path/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; | ~~~^~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphIncIt; Type = concepts::Graph::InArcIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent; Type = concepts::Graph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableGraphComponent<>; Type = concepts::Graph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Graph; Type = concepts::Graph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/graph_test.cc:349:31: required from here /build/reproducible-path/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; | ~~~~^~~~~~~ /build/reproducible-path/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) { } | ^~~~~~~ /build/reproducible-path/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; | ~~~~~~^~~~~ /build/reproducible-path/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) { } | ^~~~~~~ /build/reproducible-path/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; | ~~^~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphIncIt; Type = concepts::Graph::OutArcIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent; Type = concepts::Graph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableGraphComponent<>; Type = concepts::Graph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Graph; Type = concepts::Graph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/graph_test.cc:349:31: required from here /build/reproducible-path/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; | ~~~~^~~~~~~ /build/reproducible-path/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) { } | ^~~~~~~~ /build/reproducible-path/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; | ~~~~~~^~~~~ /build/reproducible-path/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) { } | ^~~~~~~~ /build/reproducible-path/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; | ~~^~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItem<>; Type = concepts::Graph::EdgeIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItemIt; Type = concepts::Graph::EdgeIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableGraphComponent<>; Type = concepts::Graph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Graph; Type = concepts::Graph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/graph_test.cc:349:31: required from here /build/reproducible-path/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; | ~~^~~~~~~~ /build/reproducible-path/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) { } | ^~~~~~ /build/reproducible-path/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; | ~~~^~~~ /build/reproducible-path/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) { } | ^~~~~~ /build/reproducible-path/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; | ~~~^~~~~~~~~ /build/reproducible-path/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) { } | ^~~~~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItem<'e'>; Type = concepts::Graph::IncEdgeIt]' /build/reproducible-path/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']' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphIncIt; Type = concepts::Graph::IncEdgeIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableGraphComponent<>; Type = concepts::Graph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Graph; Type = concepts::Graph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/graph_test.cc:349:31: required from here /build/reproducible-path/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; | ~~^~~~~~~~ /build/reproducible-path/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) { } | ^~~~~~~~~ /build/reproducible-path/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; | ~~~^~~~ /build/reproducible-path/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) { } | ^~~~~~~~~ /build/reproducible-path/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; | ~~~^~~~~~~~~ /build/reproducible-path/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) { } | ^~~~~~~~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItem<>; Type = concepts::Graph::ArcIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItemIt; Type = concepts::Graph::ArcIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent; Type = concepts::Graph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableGraphComponent<>; Type = concepts::Graph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Graph; Type = concepts::Graph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/graph_test.cc:349:31: required from here /build/reproducible-path/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; | ~~^~~~~~~~ /build/reproducible-path/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) { } | ^~~~~ /build/reproducible-path/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; | ~~~^~~~ /build/reproducible-path/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) { } | ^~~~~ /build/reproducible-path/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; | ~~~^~~~~~~~~ /build/reproducible-path/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) { } | ^~~~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItem<>; Type = concepts::Graph::NodeIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItemIt; Type = concepts::Graph::NodeIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent; Type = concepts::Graph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableGraphComponent<>; Type = concepts::Graph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Graph; Type = concepts::Graph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/graph_test.cc:349:31: required from here /build/reproducible-path/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; | ~~^~~~~~~~ /build/reproducible-path/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) { } | ^~~~~~ /build/reproducible-path/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; | ~~~^~~~ /build/reproducible-path/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) { } | ^~~~~~ /build/reproducible-path/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; | ~~~^~~~~~~~~ /build/reproducible-path/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) { } | ^~~~~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItem<'i'>; Type = concepts::Graph::InArcIt]' /build/reproducible-path/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']' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphIncIt; Type = concepts::Graph::InArcIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent; Type = concepts::Graph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableGraphComponent<>; Type = concepts::Graph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Graph; Type = concepts::Graph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/graph_test.cc:349:31: required from here /build/reproducible-path/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; | ~~^~~~~~~~ /build/reproducible-path/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) { } | ^~~~~~~ /build/reproducible-path/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; | ~~~^~~~ /build/reproducible-path/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) { } | ^~~~~~~ /build/reproducible-path/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; | ~~~^~~~~~~~~ /build/reproducible-path/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) { } | ^~~~~~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItem<'o'>; Type = concepts::Graph::OutArcIt]' /build/reproducible-path/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']' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphIncIt; Type = concepts::Graph::OutArcIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent; Type = concepts::Graph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableGraphComponent<>; Type = concepts::Graph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Graph; Type = concepts::Graph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/graph_test.cc:349:31: required from here /build/reproducible-path/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; | ~~^~~~~~~~ /build/reproducible-path/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) { } | ^~~~~~~~ /build/reproducible-path/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; | ~~~^~~~ /build/reproducible-path/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) { } | ^~~~~~~~ /build/reproducible-path/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; | ~~~^~~~~~~~~ /build/reproducible-path/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) { } | ^~~~~~~~ [ 54%] Linking CXX executable graph_test cd /build/reproducible-path/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 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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,-z,relro -Wl,-z,now -rdynamic CMakeFiles/graph_test.dir/graph_test.cc.o -o graph_test -L/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[5]: Leaving directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 54%] Built target graph_test make -f test/CMakeFiles/graph_utils_test.dir/build.make test/CMakeFiles/graph_utils_test.dir/depend make[5]: Entering directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /build/reproducible-path/liblemon-1.3.1+dfsg /build/reproducible-path/liblemon-1.3.1+dfsg/test /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test/CMakeFiles/graph_utils_test.dir/DependInfo.cmake "--color=" make[5]: Leaving directory '/build/reproducible-path/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 '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 55%] Building CXX object test/CMakeFiles/graph_utils_test.dir/graph_utils_test.cc.o cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -I/build/reproducible-path/liblemon-1.3.1+dfsg -I/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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 -MD -MT test/CMakeFiles/graph_utils_test.dir/graph_utils_test.cc.o -MF CMakeFiles/graph_utils_test.dir/graph_utils_test.cc.o.d -o CMakeFiles/graph_utils_test.dir/graph_utils_test.cc.o -c /build/reproducible-path/liblemon-1.3.1+dfsg/test/graph_utils_test.cc In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/test/graph_utils_test.cc:22: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/random.h: In member function 'void lemon::_random_bits::RandomCore<_Word>::fillState()': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/random.h:252:24: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister] 252 | register Word *curr = state + length - 1; | ^~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/random.h:253:23: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister] 253 | register long num; | ^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/random.h: In member function 'std::pair lemon::Random::lognormalParamsFromMD(double, double)': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/random.h:825:5: note: parameter passing for argument of type 'std::pair' when C++17 is enabled changed to match C++14 in GCC 10.1 825 | { | ^ In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/test/graph_utils_test.cc:25: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h: At global scope: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:1973:21: warning: 'template struct std::iterator' is deprecated [-Wdeprecated-declarations] 1973 | : public std::iterator { | ^~~~~~~~ In file included from /usr/include/c++/13/bits/stl_algobase.h:65, from /usr/include/c++/13/algorithm:60, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/random.h:65: /usr/include/c++/13/bits/stl_iterator_base_types.h:127:34: note: declared here 127 | struct _GLIBCXX17_DEPRECATED iterator | ^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:3135:21: warning: 'template struct std::iterator' is deprecated [-Wdeprecated-declarations] 3135 | : public std::iterator { | ^~~~~~~~ /usr/include/c++/13/bits/stl_iterator_base_types.h:127:34: note: declared here 127 | struct _GLIBCXX17_DEPRECATED iterator | ^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/random.h: In instantiation of 'void lemon::_random_bits::RandomCore<_Word>::fillState() [with _Word = long unsigned int]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/random.h:236:31: required from 'lemon::_random_bits::RandomCore<_Word>::Word lemon::_random_bits::RandomCore<_Word>::operator()() [with _Word = long unsigned int; Word = long unsigned int]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/random.h:456:23: required from 'bool lemon::_random_bits::BoolProducer::convert(lemon::_random_bits::RandomCore&) [with Word = long unsigned int]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/random.h:760:35: required from here /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/random.h:252:24: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister] 252 | register Word *curr = state + length - 1; | ^~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/random.h:253:23: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister] 253 | register long num; | ^~~ In file included from /usr/include/arm-linux-gnueabihf/c++/13/bits/c++allocator.h:33, from /usr/include/c++/13/bits/allocator.h:46, from /usr/include/c++/13/string:43, from /usr/include/c++/13/bits/locale_classes.h:40, from /usr/include/c++/13/bits/ios_base.h:41, from /usr/include/c++/13/streambuf:43, from /usr/include/c++/13/bits/streambuf_iterator.h:35, from /usr/include/c++/13/iterator:66, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/random.h:66: In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]', inlined from 'static void std::allocator_traits >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]' at /usr/include/c++/13/bits/alloc_traits.h:538:17, inlined from 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/vector.tcc:117:30, inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/stl_vector.h:1296:21, inlined from 'lemon::SmartDigraphBase::Node lemon::SmartDigraphBase::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:22, inlined from 'lemon::DigraphExtender::Node lemon::DigraphExtender::addNode() [with Base = lemon::SmartDigraphBase]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:268:34: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/test/graph_utils_test.cc:24: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h: In member function 'lemon::DigraphExtender::Node lemon::DigraphExtender::addNode() [with Base = lemon::SmartDigraphBase]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:29: note: '' declared here 77 | nodes.push_back(NodeT()); | ^ In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::ArcT; _Args = {lemon::SmartDigraphBase::ArcT}; _Tp = lemon::SmartDigraphBase::ArcT]', inlined from 'static void std::allocator_traits >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::ArcT; _Args = {lemon::SmartDigraphBase::ArcT}; _Tp = lemon::SmartDigraphBase::ArcT]' at /usr/include/c++/13/bits/alloc_traits.h:538:17, inlined from 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {lemon::SmartDigraphBase::ArcT}; _Tp = lemon::SmartDigraphBase::ArcT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/vector.tcc:117:30, inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = lemon::SmartDigraphBase::ArcT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/stl_vector.h:1296:21, inlined from 'lemon::SmartDigraphBase::Arc lemon::SmartDigraphBase::addArc(Node, Node)' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:85:21, inlined from 'lemon::DigraphExtender::Arc lemon::DigraphExtender::addArc(const Node&, const Node&) [with Base = lemon::SmartDigraphBase]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:274:31: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h: In member function 'lemon::DigraphExtender::Arc lemon::DigraphExtender::addArc(const Node&, const Node&) [with Base = lemon::SmartDigraphBase]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:85:27: note: '' declared here 85 | arcs.push_back(ArcT()); | ^ In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]', inlined from 'static void std::allocator_traits >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]' at /usr/include/c++/13/bits/alloc_traits.h:538:17, inlined from 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/vector.tcc:117:30, inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/stl_vector.h:1296:21, inlined from 'lemon::SmartDigraphBase::Node lemon::SmartDigraphBase::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:22, inlined from 'lemon::DigraphExtender::Node lemon::DigraphExtender::addNode() [with Base = lemon::SmartDigraphBase]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:268:34, inlined from 'lemon::DigraphExtender::Node lemon::SmartDigraph::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:223:44, inlined from 'void checkDeg() [with Digraph = lemon::SmartDigraph]' at /build/reproducible-path/liblemon-1.3.1+dfsg/test/graph_utils_test.cc:155:31: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h: In function 'void checkDeg() [with Digraph = lemon::SmartDigraph]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:29: note: '' declared here 77 | nodes.push_back(NodeT()); | ^ In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]', inlined from 'static void std::allocator_traits >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]' at /usr/include/c++/13/bits/alloc_traits.h:538:17, inlined from 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/vector.tcc:117:30, inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/stl_vector.h:1296:21, inlined from 'lemon::SmartDigraphBase::Node lemon::SmartDigraphBase::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:22, inlined from 'lemon::DigraphExtender::Node lemon::DigraphExtender::addNode() [with Base = lemon::SmartDigraphBase]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:268:34, inlined from 'lemon::DigraphExtender::Node lemon::SmartDigraph::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:223:44, inlined from 'void checkSnapDeg() [with Digraph = lemon::SmartDigraph]' at /build/reproducible-path/liblemon-1.3.1+dfsg/test/graph_utils_test.cc:177:20: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h: In function 'void checkSnapDeg() [with Digraph = lemon::SmartDigraph]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:29: note: '' declared here 77 | nodes.push_back(NodeT()); | ^ In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]', inlined from 'static void std::allocator_traits >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]' at /usr/include/c++/13/bits/alloc_traits.h:538:17, inlined from 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/vector.tcc:117:30, inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/stl_vector.h:1296:21, inlined from 'lemon::SmartDigraphBase::Node lemon::SmartDigraphBase::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:22, inlined from 'lemon::DigraphExtender::Node lemon::DigraphExtender::addNode() [with Base = lemon::SmartDigraphBase]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:268:34, inlined from 'lemon::DigraphExtender::Node lemon::SmartDigraph::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:223:44, inlined from 'void checkSnapDeg() [with Digraph = lemon::SmartDigraph]' at /build/reproducible-path/liblemon-1.3.1+dfsg/test/graph_utils_test.cc:178:20: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h: In function 'void checkSnapDeg() [with Digraph = lemon::SmartDigraph]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:29: note: '' declared here 77 | nodes.push_back(NodeT()); | ^ In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]', inlined from 'static void std::allocator_traits >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]' at /usr/include/c++/13/bits/alloc_traits.h:538:17, inlined from 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/vector.tcc:117:30, inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/stl_vector.h:1296:21, inlined from 'lemon::SmartDigraphBase::Node lemon::SmartDigraphBase::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:22, inlined from 'lemon::DigraphExtender::Node lemon::DigraphExtender::addNode() [with Base = lemon::SmartDigraphBase]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:268:34, inlined from 'lemon::DigraphExtender::Node lemon::SmartDigraph::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:223:44, inlined from 'void checkFindArcs() [with Digraph = lemon::SmartDigraph]' at /build/reproducible-path/liblemon-1.3.1+dfsg/test/graph_utils_test.cc:39:22: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h: In function 'void checkFindArcs() [with Digraph = lemon::SmartDigraph]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:29: note: '' declared here 77 | nodes.push_back(NodeT()); | ^ [ 56%] Linking CXX executable graph_utils_test cd /build/reproducible-path/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 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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,-z,relro -Wl,-z,now -rdynamic CMakeFiles/graph_utils_test.dir/graph_utils_test.cc.o -o graph_utils_test -L/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[5]: Leaving directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 56%] Built target graph_utils_test make -f test/CMakeFiles/hao_orlin_test.dir/build.make test/CMakeFiles/hao_orlin_test.dir/depend make[5]: Entering directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /build/reproducible-path/liblemon-1.3.1+dfsg /build/reproducible-path/liblemon-1.3.1+dfsg/test /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test/CMakeFiles/hao_orlin_test.dir/DependInfo.cmake "--color=" make[5]: Leaving directory '/build/reproducible-path/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 '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 57%] Building CXX object test/CMakeFiles/hao_orlin_test.dir/hao_orlin_test.cc.o cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -I/build/reproducible-path/liblemon-1.3.1+dfsg -I/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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 -MD -MT test/CMakeFiles/hao_orlin_test.dir/hao_orlin_test.cc.o -MF CMakeFiles/hao_orlin_test.dir/hao_orlin_test.cc.o.d -o CMakeFiles/hao_orlin_test.dir/hao_orlin_test.cc.o -c /build/reproducible-path/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/adaptors.h:29, from /build/reproducible-path/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:22: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:1973:21: warning: 'template struct std::iterator' is deprecated [-Wdeprecated-declarations] 1973 | : public std::iterator { | ^~~~~~~~ In file included from /usr/include/c++/13/bits/stl_iterator_base_funcs.h:66, from /usr/include/c++/13/string:47, from /usr/include/c++/13/bits/locale_classes.h:40, from /usr/include/c++/13/bits/ios_base.h:41, from /usr/include/c++/13/ios:44, from /usr/include/c++/13/istream:40, from /usr/include/c++/13/sstream:40, from /build/reproducible-path/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:19: /usr/include/c++/13/bits/stl_iterator_base_types.h:127:34: note: declared here 127 | struct _GLIBCXX17_DEPRECATED iterator | ^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:3135:21: warning: 'template struct std::iterator' is deprecated [-Wdeprecated-declarations] 3135 | : public std::iterator { | ^~~~~~~~ /usr/include/c++/13/bits/stl_iterator_base_types.h:127:34: note: declared here 127 | struct _GLIBCXX17_DEPRECATED iterator | ^~~~~~~~ In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:26: /build/reproducible-path/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; Node = lemon::concepts::Digraph::Node]': /build/reproducible-path/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:76:15: required from here /build/reproducible-path/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 /build/reproducible-path/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:23: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:77:23: required from here /build/reproducible-path/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; | ~~~~~~~~~~~~~~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~~~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~^~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~~~~~~~~~~^~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~~~~~~~~~~^~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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()]; | ~~~~~~~~~~~^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~^~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:78:22: required from here /build/reproducible-path/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; | ~~~~~~~~~~~~~~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~~~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~^~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~~~~~~~~~~^~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~~~~~~~~~~^~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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()]; | ~~~~~~~~~~~^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~^~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; Node = lemon::concepts::Digraph::Node]': /build/reproducible-path/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]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:77:23: required from here /build/reproducible-path/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]; | ~~~~~~~~~~~~^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; Node = lemon::concepts::Digraph::Node]': /build/reproducible-path/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]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:77:23: required from here /build/reproducible-path/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]; | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~~~~~~~~~~~~~^~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~~~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; Node = lemon::concepts::Digraph::Node]': /build/reproducible-path/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]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:77:23: required from here /build/reproducible-path/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]; | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~~~~~~~~~~~~~~^~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~~~~~~~~~~~^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ In file included from /usr/include/arm-linux-gnueabihf/c++/13/bits/c++allocator.h:33, from /usr/include/c++/13/bits/allocator.h:46, from /usr/include/c++/13/string:43: In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]', inlined from 'static void std::allocator_traits >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]' at /usr/include/c++/13/bits/alloc_traits.h:538:17, inlined from 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/vector.tcc:117:30, inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/stl_vector.h:1296:21, inlined from 'lemon::SmartDigraphBase::Node lemon::SmartDigraphBase::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:22, inlined from 'lemon::DigraphExtender::Node lemon::DigraphExtender::addNode() [with Base = lemon::SmartDigraphBase]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:268:34, inlined from 'lemon::DigraphExtender::Node lemon::SmartDigraph::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:223:44, inlined from 'void lemon::DigraphReader::readNodes() [with DGR = lemon::SmartDigraph]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:954:31: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/test/hao_orlin_test.cc:21: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h: In member function 'void lemon::DigraphReader::readNodes() [with DGR = lemon::SmartDigraph]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:29: note: '' declared here 77 | nodes.push_back(NodeT()); | ^ In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::ArcT; _Args = {lemon::SmartDigraphBase::ArcT}; _Tp = lemon::SmartDigraphBase::ArcT]', inlined from 'static void std::allocator_traits >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::ArcT; _Args = {lemon::SmartDigraphBase::ArcT}; _Tp = lemon::SmartDigraphBase::ArcT]' at /usr/include/c++/13/bits/alloc_traits.h:538:17, inlined from 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {lemon::SmartDigraphBase::ArcT}; _Tp = lemon::SmartDigraphBase::ArcT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/vector.tcc:117:30, inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = lemon::SmartDigraphBase::ArcT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/stl_vector.h:1296:21, inlined from 'lemon::SmartDigraphBase::Arc lemon::SmartDigraphBase::addArc(Node, Node)' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:85:21, inlined from 'lemon::DigraphExtender::Arc lemon::DigraphExtender::addArc(const Node&, const Node&) [with Base = lemon::SmartDigraphBase]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:274:31: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h: In member function 'lemon::DigraphExtender::Arc lemon::DigraphExtender::addArc(const Node&, const Node&) [with Base = lemon::SmartDigraphBase]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:85:27: note: '' declared here 85 | arcs.push_back(ArcT()); | ^ [ 59%] Linking CXX executable hao_orlin_test cd /build/reproducible-path/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 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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,-z,relro -Wl,-z,now -rdynamic CMakeFiles/hao_orlin_test.dir/hao_orlin_test.cc.o -o hao_orlin_test -L/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[5]: Leaving directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 59%] Built target hao_orlin_test make -f test/CMakeFiles/heap_test.dir/build.make test/CMakeFiles/heap_test.dir/depend make[5]: Entering directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /build/reproducible-path/liblemon-1.3.1+dfsg /build/reproducible-path/liblemon-1.3.1+dfsg/test /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test/CMakeFiles/heap_test.dir/DependInfo.cmake "--color=" make[5]: Leaving directory '/build/reproducible-path/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 '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 60%] Building CXX object test/CMakeFiles/heap_test.dir/heap_test.cc.o cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -I/build/reproducible-path/liblemon-1.3.1+dfsg -I/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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 -MD -MT test/CMakeFiles/heap_test.dir/heap_test.cc.o -MF CMakeFiles/heap_test.dir/heap_test.cc.o.d -o CMakeFiles/heap_test.dir/heap_test.cc.o -c /build/reproducible-path/liblemon-1.3.1+dfsg/test/heap_test.cc In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lgf_writer.h:37, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:36, from /build/reproducible-path/liblemon-1.3.1+dfsg/test/heap_test.cc:28: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:1973:21: warning: 'template struct std::iterator' is deprecated [-Wdeprecated-declarations] 1973 | : public std::iterator { | ^~~~~~~~ In file included from /usr/include/c++/13/bits/stl_iterator_base_funcs.h:66, from /usr/include/c++/13/string:47, from /usr/include/c++/13/bits/locale_classes.h:40, from /usr/include/c++/13/bits/ios_base.h:41, from /usr/include/c++/13/ios:44, from /usr/include/c++/13/ostream:40, from /usr/include/c++/13/iostream:41, from /build/reproducible-path/liblemon-1.3.1+dfsg/test/heap_test.cc:19: /usr/include/c++/13/bits/stl_iterator_base_types.h:127:34: note: declared here 127 | struct _GLIBCXX17_DEPRECATED iterator | ^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:3135:21: warning: 'template struct std::iterator' is deprecated [-Wdeprecated-declarations] 3135 | : public std::iterator { | ^~~~~~~~ /usr/include/c++/13/bits/stl_iterator_base_types.h:127:34: note: declared here 127 | struct _GLIBCXX17_DEPRECATED iterator | ^~~~~~~~ [ 61%] Linking CXX executable heap_test cd /build/reproducible-path/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 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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,-z,relro -Wl,-z,now -rdynamic CMakeFiles/heap_test.dir/heap_test.cc.o -o heap_test -L/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[5]: Leaving directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 61%] Built target heap_test make -f test/CMakeFiles/kruskal_test.dir/build.make test/CMakeFiles/kruskal_test.dir/depend make[5]: Entering directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /build/reproducible-path/liblemon-1.3.1+dfsg /build/reproducible-path/liblemon-1.3.1+dfsg/test /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test/CMakeFiles/kruskal_test.dir/DependInfo.cmake "--color=" make[5]: Leaving directory '/build/reproducible-path/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 '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 61%] Building CXX object test/CMakeFiles/kruskal_test.dir/kruskal_test.cc.o cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -I/build/reproducible-path/liblemon-1.3.1+dfsg -I/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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 -MD -MT test/CMakeFiles/kruskal_test.dir/kruskal_test.cc.o -MF CMakeFiles/kruskal_test.dir/kruskal_test.cc.o.d -o CMakeFiles/kruskal_test.dir/kruskal_test.cc.o -c /build/reproducible-path/liblemon-1.3.1+dfsg/test/kruskal_test.cc In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/test/kruskal_test.cc:23: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:1973:21: warning: 'template struct std::iterator' is deprecated [-Wdeprecated-declarations] 1973 | : public std::iterator { | ^~~~~~~~ In file included from /usr/include/c++/13/bits/stl_iterator_base_funcs.h:66, from /usr/include/c++/13/string:47, from /usr/include/c++/13/bits/locale_classes.h:40, from /usr/include/c++/13/bits/ios_base.h:41, from /usr/include/c++/13/ios:44, from /usr/include/c++/13/ostream:40, from /usr/include/c++/13/iostream:41, from /build/reproducible-path/liblemon-1.3.1+dfsg/test/kruskal_test.cc:19: /usr/include/c++/13/bits/stl_iterator_base_types.h:127:34: note: declared here 127 | struct _GLIBCXX17_DEPRECATED iterator | ^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:3135:21: warning: 'template struct std::iterator' is deprecated [-Wdeprecated-declarations] 3135 | : public std::iterator { | ^~~~~~~~ /usr/include/c++/13/bits/stl_iterator_base_types.h:127:34: note: declared here 127 | struct _GLIBCXX17_DEPRECATED iterator | ^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h: In instantiation of 'void lemon::LoggerBoolMap::set(const Key&, Value) [with IT = __gnu_cxx::__normal_iterator >; KEY = lemon::concepts::Digraph::Arc; Key = lemon::concepts::Digraph::Arc; Value = bool]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/kruskal.h:57:18: 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; typename In::value_type::second_type = int; typename In::value_type = std::pair]' /build/reproducible-path/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 >; Value = int]' /build/reproducible-path/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 >; Value = int]' /build/reproducible-path/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 = concepts::Digraph; In = concepts::ReadMap; Out = __gnu_cxx::__normal_iterator >; typename _kruskal_bits::KruskalValueSelector::Value = int]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/kruskal_test.cc:57:10: required from here /build/reproducible-path/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 /build/reproducible-path/liblemon-1.3.1+dfsg/test/kruskal_test.cc:28: /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h: In instantiation of 'void lemon::LoggerBoolMap::set(const Key&, Value) [with IT = __gnu_cxx::__normal_iterator >; KEY = lemon::concepts::Graph::Edge; Key = lemon::concepts::Graph::Edge; Value = bool]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/kruskal.h:86:18: 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; typename In::value_type::second_type = int; typename In::value_type = std::pair]' /build/reproducible-path/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 >; Value = int]' /build/reproducible-path/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 >; Value = int]' /build/reproducible-path/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 = concepts::Graph; In = concepts::ReadMap; Out = __gnu_cxx::__normal_iterator >; typename _kruskal_bits::KruskalValueSelector::Value = int]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/kruskal_test.cc:58:10: required from here /build/reproducible-path/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 /build/reproducible-path/liblemon-1.3.1+dfsg/test/kruskal_test.cc:29: /build/reproducible-path/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 /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/map_extender.h:27, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:24, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/list_graph.h:28, from /build/reproducible-path/liblemon-1.3.1+dfsg/test/kruskal_test.cc:25: In member function 'lemon::concepts::ReadMap::Value lemon::concepts::ReadMap::operator[](const Key&) const [with K = lemon::concepts::Digraph::Arc; T = int]', inlined 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 = lemon::concepts::WriteMap]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/kruskal.h:200:46, inlined from 'typename lemon::_kruskal_bits::KruskalValueSelector::Value lemon::kruskal(const Graph&, const In&, Out&) [with Graph = concepts::Digraph; In = concepts::ReadMap; Out = concepts::WriteMap]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/kruskal.h:310:14, inlined from 'void checkCompileKruskal()' at /build/reproducible-path/liblemon-1.3.1+dfsg/test/kruskal_test.cc:45:10: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/maps.h:52:43: warning: array subscript 0 is outside array bounds of 'lemon::concepts::ReadMap::Value [0]' [-Warray-bounds=] 52 | return *(static_cast(0)+1); | ^ In function 'void checkCompileKruskal()': cc1plus: note: source object is likely at address zero [ 62%] Linking CXX executable kruskal_test cd /build/reproducible-path/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 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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,-z,relro -Wl,-z,now -rdynamic CMakeFiles/kruskal_test.dir/kruskal_test.cc.o -o kruskal_test -L/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[5]: Leaving directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 62%] Built target kruskal_test make -f test/CMakeFiles/lgf_reader_writer_test.dir/build.make test/CMakeFiles/lgf_reader_writer_test.dir/depend make[5]: Entering directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /build/reproducible-path/liblemon-1.3.1+dfsg /build/reproducible-path/liblemon-1.3.1+dfsg/test /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test/CMakeFiles/lgf_reader_writer_test.dir/DependInfo.cmake "--color=" make[5]: Leaving directory '/build/reproducible-path/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 '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 63%] Building CXX object test/CMakeFiles/lgf_reader_writer_test.dir/lgf_reader_writer_test.cc.o cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -I/build/reproducible-path/liblemon-1.3.1+dfsg -I/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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 -MD -MT test/CMakeFiles/lgf_reader_writer_test.dir/lgf_reader_writer_test.cc.o -MF CMakeFiles/lgf_reader_writer_test.dir/lgf_reader_writer_test.cc.o.d -o CMakeFiles/lgf_reader_writer_test.dir/lgf_reader_writer_test.cc.o -c /build/reproducible-path/liblemon-1.3.1+dfsg/test/lgf_reader_writer_test.cc In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lgf_writer.h:37, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:36, from /build/reproducible-path/liblemon-1.3.1+dfsg/test/lgf_reader_writer_test.cc:27: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:1973:21: warning: 'template struct std::iterator' is deprecated [-Wdeprecated-declarations] 1973 | : public std::iterator { | ^~~~~~~~ In file included from /usr/include/c++/13/bits/stl_iterator_base_funcs.h:66, from /usr/include/c++/13/string:47, from /build/reproducible-path/liblemon-1.3.1+dfsg/test/lgf_reader_writer_test.cc:19: /usr/include/c++/13/bits/stl_iterator_base_types.h:127:34: note: declared here 127 | struct _GLIBCXX17_DEPRECATED iterator | ^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:3135:21: warning: 'template struct std::iterator' is deprecated [-Wdeprecated-declarations] 3135 | : public std::iterator { | ^~~~~~~~ /usr/include/c++/13/bits/stl_iterator_base_types.h:127:34: note: declared here 127 | struct _GLIBCXX17_DEPRECATED iterator | ^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lgf_reader.h: In instantiation of 'void lemon::DigraphReader::readNodes() [with DGR = lemon::concepts::ExtendableDigraphComponent]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:1188:15: required from 'void lemon::DigraphReader::run() [with DGR = lemon::concepts::ExtendableDigraphComponent]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/lgf_reader_writer_test.cc:75:13: required from here /build/reproducible-path/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 /build/reproducible-path/liblemon-1.3.1+dfsg/test/lgf_reader_writer_test.cc:21: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~^~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lgf_reader.h: In instantiation of 'void lemon::DigraphReader::readArcs() [with DGR = lemon::concepts::ExtendableDigraphComponent]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:1194:15: required from 'void lemon::DigraphReader::run() [with DGR = lemon::concepts::ExtendableDigraphComponent]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/lgf_reader_writer_test.cc:75:13: required from here /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; | ~~^~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lgf_reader.h: In instantiation of 'void lemon::GraphReader::readNodes() [with GR = lemon::concepts::ExtendableGraphComponent]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:2068:15: required from 'void lemon::GraphReader::run() [with GR = lemon::concepts::ExtendableGraphComponent]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/lgf_reader_writer_test.cc:145:13: required from here /build/reproducible-path/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 /build/reproducible-path/liblemon-1.3.1+dfsg/test/lgf_reader_writer_test.cc:22: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~^~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lgf_reader.h: In instantiation of 'void lemon::GraphReader::readEdges() [with GR = lemon::concepts::ExtendableGraphComponent]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:2074:15: required from 'void lemon::GraphReader::run() [with GR = lemon::concepts::ExtendableGraphComponent]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/lgf_reader_writer_test.cc:145:13: required from here /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~~ /build/reproducible-path/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; | ~~^~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lgf_reader.h: In instantiation of 'void lemon::BpGraphReader::readRedNodes() [with BGR = lemon::concepts::ExtendableBpGraphComponent]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:3126:15: required from 'void lemon::BpGraphReader::run() [with BGR = lemon::concepts::ExtendableBpGraphComponent]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/lgf_reader_writer_test.cc:232:13: required from here /build/reproducible-path/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 /build/reproducible-path/liblemon-1.3.1+dfsg/test/lgf_reader_writer_test.cc:23: /build/reproducible-path/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() { } | ^~~~~~~ /build/reproducible-path/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; | ~~^~~~~~~~~~~~ /build/reproducible-path/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() { } | ^~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lgf_reader.h: In instantiation of 'void lemon::BpGraphReader::readBlueNodes() [with BGR = lemon::concepts::ExtendableBpGraphComponent]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:3131:15: required from 'void lemon::BpGraphReader::run() [with BGR = lemon::concepts::ExtendableBpGraphComponent]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/lgf_reader_writer_test.cc:232:13: required from here /build/reproducible-path/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(); | ~~^~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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() { } | ^~~~~~~~ /build/reproducible-path/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; | ~~^~~~~~~~~~~~ /build/reproducible-path/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() { } | ^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lgf_reader.h: In instantiation of 'void lemon::BpGraphReader::readEdges() [with BGR = lemon::concepts::ExtendableBpGraphComponent]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:3137:15: required from 'void lemon::BpGraphReader::run() [with BGR = lemon::concepts::ExtendableBpGraphComponent]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/lgf_reader_writer_test.cc:232:13: required from here /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~~ /build/reproducible-path/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; | ~~^~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lgf_reader.h: In instantiation of 'void lemon::BpGraphReader::readRedNodes() [with BGR = lemon::ListBpGraph]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:3126:15: required from 'void lemon::BpGraphReader::run() [with BGR = lemon::ListBpGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/lgf_reader_writer_test.cc:545:13: required from here /build/reproducible-path/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 /build/reproducible-path/liblemon-1.3.1+dfsg/test/lgf_reader_writer_test.cc:25: /build/reproducible-path/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) {} | ^~~~~~~ /build/reproducible-path/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; | ~~^~~~~~~~~~~~ /build/reproducible-path/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) {} | ^~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lgf_reader.h: In instantiation of 'void lemon::BpGraphReader::readBlueNodes() [with BGR = lemon::ListBpGraph]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:3131:15: required from 'void lemon::BpGraphReader::run() [with BGR = lemon::ListBpGraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/lgf_reader_writer_test.cc:545:13: required from here /build/reproducible-path/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(); | ~~^~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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) {} | ^~~~~~~~ /build/reproducible-path/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; | ~~^~~~~~~~~~~~ /build/reproducible-path/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) {} | ^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lgf_reader.h: In instantiation of 'void lemon::_reader_bits::ValueStorage<_Value, _Converter>::set(const std::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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:152:20: required from here /build/reproducible-path/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); | ~~~~~~~^~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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) {} | ^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lgf_reader.h: In instantiation of 'void lemon::_reader_bits::ValueStorage<_Value, _Converter>::set(const std::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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:152:20: required from here /build/reproducible-path/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); | ~~~~~~~^~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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) {} | ^~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lgf_reader.h: In instantiation of 'void lemon::_reader_bits::ValueStorage<_Value, _Converter>::set(const std::string&) [with _Value = lemon::concepts::BpGraph::Arc; _Converter = lemon::_reader_bits::GraphArcLookUpConverter >; std::string = std::__cxx11::basic_string]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:152:20: required from here /build/reproducible-path/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); | ~~~~~~~^~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lgf_reader.h: In instantiation of 'void lemon::_reader_bits::ValueStorage<_Value, _Converter>::set(const std::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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:152:20: required from here /build/reproducible-path/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); | ~~~~~~~^~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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() { } | ^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lgf_reader.h: In instantiation of 'void lemon::_reader_bits::ValueStorage<_Value, _Converter>::set(const std::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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:152:20: required from here /build/reproducible-path/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); | ~~~~~~~^~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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() { } | ^~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lgf_reader.h: In instantiation of 'void lemon::_reader_bits::ValueStorage<_Value, _Converter>::set(const std::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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:152:20: required from here /build/reproducible-path/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); | ~~~~~~~^~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lgf_reader.h: In instantiation of 'void lemon::_reader_bits::ValueStorage<_Value, _Converter>::set(const std::string&) [with _Value = lemon::concepts::Graph::Arc; _Converter = lemon::_reader_bits::GraphArcLookUpConverter >; std::string = std::__cxx11::basic_string]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:152:20: required from here /build/reproducible-path/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); | ~~~~~~~^~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lgf_reader.h: In instantiation of 'void lemon::_reader_bits::ValueStorage<_Value, _Converter>::set(const std::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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:152:20: required from here /build/reproducible-path/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); | ~~~~~~~^~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lgf_reader.h: In instantiation of 'void lemon::_reader_bits::ValueStorage<_Value, _Converter>::set(const std::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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:152:20: required from here /build/reproducible-path/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); | ~~~~~~~^~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lgf_reader.h: In instantiation of 'void lemon::_reader_bits::ValueStorage<_Value, _Converter>::set(const std::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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:152:20: required from here /build/reproducible-path/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); | ~~~~~~~^~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ In file included from /usr/include/arm-linux-gnueabihf/c++/13/bits/c++allocator.h:33, from /usr/include/c++/13/bits/allocator.h:46, from /usr/include/c++/13/string:43: In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]', inlined from 'static void std::allocator_traits >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]' at /usr/include/c++/13/bits/alloc_traits.h:538:17, inlined from 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/vector.tcc:117:30, inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/stl_vector.h:1296:21, inlined from 'lemon::SmartDigraphBase::Node lemon::SmartDigraphBase::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:22, inlined from 'lemon::DigraphExtender::Node lemon::DigraphExtender::addNode() [with Base = lemon::SmartDigraphBase]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:268:34: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/test/lgf_reader_writer_test.cc:26: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h: In member function 'lemon::DigraphExtender::Node lemon::DigraphExtender::addNode() [with Base = lemon::SmartDigraphBase]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:29: note: '' declared here 77 | nodes.push_back(NodeT()); | ^ In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::ArcT; _Args = {lemon::SmartDigraphBase::ArcT}; _Tp = lemon::SmartDigraphBase::ArcT]', inlined from 'static void std::allocator_traits >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::ArcT; _Args = {lemon::SmartDigraphBase::ArcT}; _Tp = lemon::SmartDigraphBase::ArcT]' at /usr/include/c++/13/bits/alloc_traits.h:538:17, inlined from 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {lemon::SmartDigraphBase::ArcT}; _Tp = lemon::SmartDigraphBase::ArcT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/vector.tcc:117:30, inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = lemon::SmartDigraphBase::ArcT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/stl_vector.h:1296:21, inlined from 'lemon::SmartDigraphBase::Arc lemon::SmartDigraphBase::addArc(Node, Node)' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:85:21, inlined from 'lemon::DigraphExtender::Arc lemon::DigraphExtender::addArc(const Node&, const Node&) [with Base = lemon::SmartDigraphBase]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:274:31, inlined from 'lemon::DigraphExtender::Arc lemon::SmartDigraph::addArc(lemon::DigraphExtender::Node, lemon::DigraphExtender::Node)' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:231:28, inlined from 'void checkDigraphReaderWriter()' at /build/reproducible-path/liblemon-1.3.1+dfsg/test/lgf_reader_writer_test.cc:289:35: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h: In function 'void checkDigraphReaderWriter()': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:85:27: note: '' declared here 85 | arcs.push_back(ArcT()); | ^ In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::ArcT; _Args = {lemon::SmartDigraphBase::ArcT}; _Tp = lemon::SmartDigraphBase::ArcT]', inlined from 'static void std::allocator_traits >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::ArcT; _Args = {lemon::SmartDigraphBase::ArcT}; _Tp = lemon::SmartDigraphBase::ArcT]' at /usr/include/c++/13/bits/alloc_traits.h:538:17, inlined from 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {lemon::SmartDigraphBase::ArcT}; _Tp = lemon::SmartDigraphBase::ArcT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/vector.tcc:117:30, inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = lemon::SmartDigraphBase::ArcT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/stl_vector.h:1296:21, inlined from 'lemon::SmartDigraphBase::Arc lemon::SmartDigraphBase::addArc(Node, Node)' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:85:21, inlined from 'lemon::DigraphExtender::Arc lemon::DigraphExtender::addArc(const Node&, const Node&) [with Base = lemon::SmartDigraphBase]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:274:31, inlined from 'lemon::DigraphExtender::Arc lemon::SmartDigraph::addArc(lemon::DigraphExtender::Node, lemon::DigraphExtender::Node)' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:231:28, inlined from 'void checkDigraphReaderWriter()' at /build/reproducible-path/liblemon-1.3.1+dfsg/test/lgf_reader_writer_test.cc:290:35: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h: In function 'void checkDigraphReaderWriter()': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:85:27: note: '' declared here 85 | arcs.push_back(ArcT()); | ^ [ 65%] Linking CXX executable lgf_reader_writer_test cd /build/reproducible-path/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 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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,-z,relro -Wl,-z,now -rdynamic CMakeFiles/lgf_reader_writer_test.dir/lgf_reader_writer_test.cc.o -o lgf_reader_writer_test -L/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[5]: Leaving directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 65%] Built target lgf_reader_writer_test make -f test/CMakeFiles/lgf_test.dir/build.make test/CMakeFiles/lgf_test.dir/depend make[5]: Entering directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /build/reproducible-path/liblemon-1.3.1+dfsg /build/reproducible-path/liblemon-1.3.1+dfsg/test /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test/CMakeFiles/lgf_test.dir/DependInfo.cmake "--color=" make[5]: Leaving directory '/build/reproducible-path/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 '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 65%] Building CXX object test/CMakeFiles/lgf_test.dir/lgf_test.cc.o cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -I/build/reproducible-path/liblemon-1.3.1+dfsg -I/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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 -MD -MT test/CMakeFiles/lgf_test.dir/lgf_test.cc.o -MF CMakeFiles/lgf_test.dir/lgf_test.cc.o.d -o CMakeFiles/lgf_test.dir/lgf_test.cc.o -c /build/reproducible-path/liblemon-1.3.1+dfsg/test/lgf_test.cc In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lgf_writer.h:37, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:36, from /build/reproducible-path/liblemon-1.3.1+dfsg/test/lgf_test.cc:20: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:1973:21: warning: 'template struct std::iterator' is deprecated [-Wdeprecated-declarations] 1973 | : public std::iterator { | ^~~~~~~~ In file included from /usr/include/c++/13/bits/stl_algobase.h:65, from /usr/include/c++/13/vector:62, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/core.h:22, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/list_graph.h:26, from /build/reproducible-path/liblemon-1.3.1+dfsg/test/lgf_test.cc:19: /usr/include/c++/13/bits/stl_iterator_base_types.h:127:34: note: declared here 127 | struct _GLIBCXX17_DEPRECATED iterator | ^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:3135:21: warning: 'template struct std::iterator' is deprecated [-Wdeprecated-declarations] 3135 | : public std::iterator { | ^~~~~~~~ /usr/include/c++/13/bits/stl_iterator_base_types.h:127:34: note: declared here 127 | struct _GLIBCXX17_DEPRECATED iterator | ^~~~~~~~ [ 66%] Linking CXX executable lgf_test cd /build/reproducible-path/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 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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,-z,relro -Wl,-z,now -rdynamic CMakeFiles/lgf_test.dir/lgf_test.cc.o -o lgf_test -L/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[5]: Leaving directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 66%] Built target lgf_test make -f test/CMakeFiles/maps_test.dir/build.make test/CMakeFiles/maps_test.dir/depend make[5]: Entering directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /build/reproducible-path/liblemon-1.3.1+dfsg /build/reproducible-path/liblemon-1.3.1+dfsg/test /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test/CMakeFiles/maps_test.dir/DependInfo.cmake "--color=" make[5]: Leaving directory '/build/reproducible-path/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 '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 67%] Building CXX object test/CMakeFiles/maps_test.dir/maps_test.cc.o cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -I/build/reproducible-path/liblemon-1.3.1+dfsg -I/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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 -MD -MT test/CMakeFiles/maps_test.dir/maps_test.cc.o -MF CMakeFiles/maps_test.dir/maps_test.cc.o.d -o CMakeFiles/maps_test.dir/maps_test.cc.o -c /build/reproducible-path/liblemon-1.3.1+dfsg/test/maps_test.cc In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/test/maps_test.cc:24: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:1973:21: warning: 'template struct std::iterator' is deprecated [-Wdeprecated-declarations] 1973 | : public std::iterator { | ^~~~~~~~ In file included from /usr/include/c++/13/bits/stl_algobase.h:65, from /usr/include/c++/13/deque:62, from /build/reproducible-path/liblemon-1.3.1+dfsg/test/maps_test.cc:19: /usr/include/c++/13/bits/stl_iterator_base_types.h:127:34: note: declared here 127 | struct _GLIBCXX17_DEPRECATED iterator | ^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:3135:21: warning: 'template struct std::iterator' is deprecated [-Wdeprecated-declarations] 3135 | : public std::iterator { | ^~~~~~~~ /usr/include/c++/13/bits/stl_iterator_base_types.h:127:34: note: declared here 127 | struct _GLIBCXX17_DEPRECATED iterator | ^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/test/maps_test.cc: In function 'int main()': /build/reproducible-path/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; | ^~~~ /build/reproducible-path/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&); | ^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h: In instantiation of 'lemon::FunctorToMap::FunctorToMap(const F&) [with F = F; K = A; V = B]': /build/reproducible-path/liblemon-1.3.1+dfsg/test/maps_test.cc:234:21: required from here /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:627:38: warning: implicitly-declared 'constexpr F::F(const F&)' is deprecated [-Wdeprecated-copy] 627 | FunctorToMap(const F &f = F()) : _f(f) {} | ^~~~~ /build/reproducible-path/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++/13/set:62, from /build/reproducible-path/liblemon-1.3.1+dfsg/test/maps_test.cc:20: /usr/include/c++/13/bits/stl_tree.h: In function 'std::pair std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_get_insert_hint_unique_pos(const_iterator, const key_type&) [with _Key = double; _Val = std::pair; _KeyOfValue = std::_Select1st >; _Compare = std::less; _Alloc = std::allocator >]': /usr/include/c++/13/bits/stl_tree.h:2210:5: note: parameter passing for argument of type 'std::_Rb_tree, std::_Select1st >, std::less, std::allocator > >::const_iterator' changed in GCC 7.1 2210 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/arm-linux-gnueabihf/c++/13/bits/c++allocator.h:33, from /usr/include/c++/13/bits/allocator.h:46, from /usr/include/c++/13/deque:63: In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]', inlined from 'static void std::allocator_traits >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]' at /usr/include/c++/13/bits/alloc_traits.h:538:17, inlined from 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/vector.tcc:117:30, inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/stl_vector.h:1296:21, inlined from 'lemon::SmartDigraphBase::Node lemon::SmartDigraphBase::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:22, inlined from 'lemon::DigraphExtender::Node lemon::DigraphExtender::addNode() [with Base = lemon::SmartDigraphBase]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:268:34: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/test/maps_test.cc:26: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h: In member function 'lemon::DigraphExtender::Node lemon::DigraphExtender::addNode() [with Base = lemon::SmartDigraphBase]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:29: note: '' declared here 77 | nodes.push_back(NodeT()); | ^ In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::ArcT; _Args = {lemon::SmartDigraphBase::ArcT}; _Tp = lemon::SmartDigraphBase::ArcT]', inlined from 'static void std::allocator_traits >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::ArcT; _Args = {lemon::SmartDigraphBase::ArcT}; _Tp = lemon::SmartDigraphBase::ArcT]' at /usr/include/c++/13/bits/alloc_traits.h:538:17, inlined from 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {lemon::SmartDigraphBase::ArcT}; _Tp = lemon::SmartDigraphBase::ArcT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/vector.tcc:117:30, inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = lemon::SmartDigraphBase::ArcT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/stl_vector.h:1296:21, inlined from 'lemon::SmartDigraphBase::Arc lemon::SmartDigraphBase::addArc(Node, Node)' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:85:21, inlined from 'lemon::DigraphExtender::Arc lemon::DigraphExtender::addArc(const Node&, const Node&) [with Base = lemon::SmartDigraphBase]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:274:31: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h: In member function 'lemon::DigraphExtender::Arc lemon::DigraphExtender::addArc(const Node&, const Node&) [with Base = lemon::SmartDigraphBase]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:85:27: note: '' declared here 85 | arcs.push_back(ArcT()); | ^ /usr/include/c++/13/bits/stl_tree.h: In member function 'std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {std::pair}; _Key = double; _Val = std::pair; _KeyOfValue = std::_Select1st >; _Compare = std::less; _Alloc = std::allocator >]': /usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type 'std::_Rb_tree, std::_Select1st >, std::less, std::allocator > >::const_iterator' changed in GCC 7.1 2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/13/map:63, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:25: In member function 'std::__enable_if_t, _Pair>::value, typename std::_Rb_tree<_Key, std::pair, std::_Select1st >, _Compare, typename __gnu_cxx::__alloc_traits<_Allocator>::rebind >::other>::iterator> std::map<_Key, _Tp, _Compare, _Alloc>::insert(const_iterator, _Pair&&) [with _Pair = std::pair; _Key = double; _Tp = int; _Compare = std::less; _Alloc = std::allocator >]', inlined from 'lemon::SparseMap::Value& lemon::SparseMap::operator[](const Key&) [with K = double; V = int; Comp = std::less]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:409:27: /usr/include/c++/13/bits/stl_map.h:927:45: note: parameter passing for argument of type 'std::map::const_iterator' {aka 'std::_Rb_tree, std::_Select1st >, std::less, std::allocator > >::const_iterator'} changed in GCC 7.1 927 | return _M_t._M_emplace_hint_unique(__position, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~ 928 | std::forward<_Pair>(__x)); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13/bits/stl_tree.h: In member function 'std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {std::pair}; _Key = double; _Val = std::pair; _KeyOfValue = std::_Select1st >; _Compare = std::less; _Alloc = std::allocator >]': /usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type 'std::_Rb_tree, std::_Select1st >, std::less, std::allocator > >::const_iterator' changed in GCC 7.1 2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13/bits/stl_tree.h: In member function 'std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {std::pair}; _Key = int; _Val = std::pair; _KeyOfValue = std::_Select1st >; _Compare = std::less; _Alloc = std::allocator >]': /usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type 'std::_Rb_tree, std::_Select1st >, std::less, std::allocator > >::const_iterator' changed in GCC 7.1 In member function 'std::__enable_if_t, _Pair>::value, typename std::_Rb_tree<_Key, std::pair, std::_Select1st >, _Compare, typename __gnu_cxx::__alloc_traits<_Allocator>::rebind >::other>::iterator> std::map<_Key, _Tp, _Compare, _Alloc>::insert(const_iterator, _Pair&&) [with _Pair = std::pair; _Key = int; _Tp = double; _Compare = std::less; _Alloc = std::allocator >]', inlined from 'lemon::SparseMap::Value& lemon::SparseMap::operator[](const Key&) [with K = int; V = double; Comp = std::less]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:409:27: /usr/include/c++/13/bits/stl_map.h:927:45: note: parameter passing for argument of type 'std::map, std::allocator > >::const_iterator' {aka 'std::_Rb_tree, std::_Select1st >, std::less, std::allocator > >::const_iterator'} changed in GCC 7.1 927 | return _M_t._M_emplace_hint_unique(__position, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~ 928 | std::forward<_Pair>(__x)); | ~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/13/vector:72, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/core.h:22, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/maps.h:22, from /build/reproducible-path/liblemon-1.3.1+dfsg/test/maps_test.cc:23: /usr/include/c++/13/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_fill_insert(iterator, size_type, const value_type&) [with _Tp = double; _Alloc = std::allocator]': /usr/include/c++/13/bits/vector.tcc:529:5: note: parameter passing for argument of type 'std::vector::iterator' changed in GCC 7.1 529 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/13/vector:66: In member function 'void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = double; _Alloc = std::allocator]', inlined from 'lemon::VectorMap<_Graph, _Item, _Value>::VectorMap(const GraphType&, const Value&) [with _Graph = lemon::DigraphExtender; _Item = lemon::SmartDigraphBase::Arc; _Value = double]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/vector_map.h:103:23, inlined from 'lemon::DefaultMap<_Graph, _Item, _Value>::DefaultMap(const GraphType&, const Value&) [with _Graph = lemon::DigraphExtender; _Item = lemon::SmartDigraphBase::Arc; _Value = double]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/default_map.h:166:28, inlined from 'lemon::MapExtender<_Map>::MapExtender(const GraphType&, const Value&) [with _Map = lemon::DefaultMap, lemon::SmartDigraphBase::Arc, double>]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/map_extender.h:66:28, inlined from 'lemon::DigraphExtender::ArcMap<_Value>::ArcMap(const lemon::DigraphExtender::Digraph&, const _Value&) [with _Value = double; Base = lemon::SmartDigraphBase]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:252:32, inlined from 'lemon::UndirectorBase::ArcMapBase::ArcMapBase(const lemon::UndirectorBase&, const V&) [with V = double; DGR = lemon::SmartDigraph]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/adaptors.h:2101:11: /usr/include/c++/13/bits/stl_vector.h:1034:25: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1034 | _M_fill_insert(end(), __new_size - size(), __x); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = double; _Alloc = std::allocator]', inlined from 'lemon::VectorMap<_Graph, _Item, _Value>::VectorMap(const GraphType&, const Value&) [with _Graph = lemon::DigraphExtender; _Item = lemon::SmartDigraphBase::Arc; _Value = double]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/vector_map.h:103:23, inlined from 'lemon::DefaultMap<_Graph, _Item, _Value>::DefaultMap(const GraphType&, const Value&) [with _Graph = lemon::DigraphExtender; _Item = lemon::SmartDigraphBase::Arc; _Value = double]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/default_map.h:166:28, inlined from 'lemon::MapExtender<_Map>::MapExtender(const GraphType&, const Value&) [with _Map = lemon::DefaultMap, lemon::SmartDigraphBase::Arc, double>]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/map_extender.h:66:28, inlined from 'lemon::DigraphExtender::ArcMap<_Value>::ArcMap(const lemon::DigraphExtender::Digraph&, const _Value&) [with _Value = double; Base = lemon::SmartDigraphBase]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:252:32, inlined from 'lemon::UndirectorBase::ArcMapBase::ArcMapBase(const lemon::UndirectorBase&, const V&) [with V = double; DGR = lemon::SmartDigraph]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/adaptors.h:2102:11: /usr/include/c++/13/bits/stl_vector.h:1034:25: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1034 | _M_fill_insert(end(), __new_size - size(), __x); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'std::__enable_if_t, _Pair>::value, typename std::_Rb_tree<_Key, std::pair, std::_Select1st >, _Compare, typename __gnu_cxx::__alloc_traits<_Allocator>::rebind >::other>::iterator> std::map<_Key, _Tp, _Compare, _Alloc>::insert(const_iterator, _Pair&&) [with _Pair = std::pair; _Key = double; _Tp = bool; _Compare = std::less; _Alloc = std::allocator >]', inlined from 'lemon::SparseMap::Value& lemon::SparseMap::operator[](const Key&) [with K = double; V = bool; Comp = std::less]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:409:27, inlined from 'int main()' at /build/reproducible-path/liblemon-1.3.1+dfsg/test/maps_test.cc:211:47: /usr/include/c++/13/bits/stl_map.h:927:45: note: parameter passing for argument of type 'std::map, std::allocator > >::const_iterator' {aka 'std::_Rb_tree, std::_Select1st >, std::less, std::allocator > >::const_iterator'} changed in GCC 7.1 927 | return _M_t._M_emplace_hint_unique(__position, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~ 928 | std::forward<_Pair>(__x)); | ~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'std::__enable_if_t, _Pair>::value, typename std::_Rb_tree<_Key, std::pair, std::_Select1st >, _Compare, typename __gnu_cxx::__alloc_traits<_Allocator>::rebind >::other>::iterator> std::map<_Key, _Tp, _Compare, _Alloc>::insert(const_iterator, _Pair&&) [with _Pair = std::pair; _Key = int; _Tp = double; _Compare = std::less; _Alloc = std::allocator >]', inlined from 'void lemon::SparseMap::set(const Key&, const Value&) [with K = int; V = double; Comp = std::less]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:427:20, inlined from 'void lemon::ForkMap::set(const Key&, const Value&) [with M1 = lemon::SparseMap; M2 = lemon::RangeMap]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:770:53, inlined from 'int main()' at /build/reproducible-path/liblemon-1.3.1+dfsg/test/maps_test.cc:280:13: /usr/include/c++/13/bits/stl_map.h:927:45: note: parameter passing for argument of type 'std::map, std::allocator > >::const_iterator' {aka 'std::_Rb_tree, std::_Select1st >, std::less, std::allocator > >::const_iterator'} changed in GCC 7.1 927 | return _M_t._M_emplace_hint_unique(__position, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~ 928 | std::forward<_Pair>(__x)); | ~~~~~~~~~~~~~~~~~~~~~~~~~ [ 68%] Linking CXX executable maps_test cd /build/reproducible-path/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 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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,-z,relro -Wl,-z,now -rdynamic CMakeFiles/maps_test.dir/maps_test.cc.o -o maps_test -L/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[5]: Leaving directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 68%] Built target maps_test make -f test/CMakeFiles/matching_test.dir/build.make test/CMakeFiles/matching_test.dir/depend make[5]: Entering directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /build/reproducible-path/liblemon-1.3.1+dfsg /build/reproducible-path/liblemon-1.3.1+dfsg/test /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test/CMakeFiles/matching_test.dir/DependInfo.cmake "--color=" make[5]: Leaving directory '/build/reproducible-path/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 '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 69%] Building CXX object test/CMakeFiles/matching_test.dir/matching_test.cc.o cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -I/build/reproducible-path/liblemon-1.3.1+dfsg -I/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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 -MD -MT test/CMakeFiles/matching_test.dir/matching_test.cc.o -MF CMakeFiles/matching_test.dir/matching_test.cc.o.d -o CMakeFiles/matching_test.dir/matching_test.cc.o -c /build/reproducible-path/liblemon-1.3.1+dfsg/test/matching_test.cc In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/matching.h:30, from /build/reproducible-path/liblemon-1.3.1+dfsg/test/matching_test.cc:25: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:1973:21: warning: 'template struct std::iterator' is deprecated [-Wdeprecated-declarations] 1973 | : public std::iterator { | ^~~~~~~~ In file included from /usr/include/c++/13/bits/stl_iterator_base_funcs.h:66, from /usr/include/c++/13/string:47, from /usr/include/c++/13/bits/locale_classes.h:40, from /usr/include/c++/13/bits/ios_base.h:41, from /usr/include/c++/13/ios:44, from /usr/include/c++/13/ostream:40, from /usr/include/c++/13/iostream:41, from /build/reproducible-path/liblemon-1.3.1+dfsg/test/matching_test.cc:19: /usr/include/c++/13/bits/stl_iterator_base_types.h:127:34: note: declared here 127 | struct _GLIBCXX17_DEPRECATED iterator | ^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:3135:21: warning: 'template struct std::iterator' is deprecated [-Wdeprecated-declarations] 3135 | : public std::iterator { | ^~~~~~~~ /usr/include/c++/13/bits/stl_iterator_base_types.h:127:34: note: declared here 127 | struct _GLIBCXX17_DEPRECATED iterator | ^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/test/matching_test.cc: In function 'void checkMaxMatchingCompile()': /build/reproducible-path/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 /build/reproducible-path/liblemon-1.3.1+dfsg/test/matching_test.cc:27: /build/reproducible-path/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&) { } | ^~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/test/matching_test.cc: In function 'void checkMaxWeightedMatchingCompile()': /build/reproducible-path/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]; | ^ /build/reproducible-path/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&) { } | ^~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/test/matching_test.cc: In function 'void checkMaxWeightedPerfectMatchingCompile()': /build/reproducible-path/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]; | ^ /build/reproducible-path/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&) { } | ^~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/matching.h: In instantiation of 'void lemon::MaxMatching::init() [with GR = lemon::concepts::Graph]': /build/reproducible-path/liblemon-1.3.1+dfsg/test/matching_test.cc:131:16: required from here /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~^~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/matching.h: In instantiation of 'void lemon::MaxMatching::greedyInit() [with GR = lemon::concepts::Graph]': /build/reproducible-path/liblemon-1.3.1+dfsg/test/matching_test.cc:132:22: required from here /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~^~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~^~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/test/matching_test.cc:133:24: required from here /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~^~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/matching.h: In instantiation of 'void lemon::MaxMatching::startSparse() [with GR = lemon::concepts::Graph]': /build/reproducible-path/liblemon-1.3.1+dfsg/test/matching_test.cc:134:23: required from here /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/matching.h: In instantiation of 'void lemon::MaxMatching::startDense() [with GR = lemon::concepts::Graph]': /build/reproducible-path/liblemon-1.3.1+dfsg/test/matching_test.cc:135:22: required from here /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/test/matching_test.cc:171:16: required from here /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/test/matching_test.cc:208:16: required from here /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ /build/reproducible-path/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 /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/matching.h:28: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/unionfind.h: In instantiation of 'int lemon::UnionFindEnum::insert(const Item&) [with IM = lemon::concepts::Graph::NodeMap; Item = lemon::concepts::Graph::Node]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/matching.h:508:47: required from 'void lemon::MaxMatching::startSparse() [with GR = lemon::concepts::Graph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/matching_test.cc:134:23: required from here /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~^~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/unionfind.h: In instantiation of 'int lemon::ExtendFindEnum::insert(const Item&) [with IM = lemon::concepts::Graph::NodeMap; Item = lemon::concepts::Graph::Node]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/matching.h:509:28: required from 'void lemon::MaxMatching::startSparse() [with GR = lemon::concepts::Graph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/matching_test.cc:134:23: required from here /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~^~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/matching.h: In instantiation of 'void lemon::MaxMatching::processSparse(const Node&) [with GR = lemon::concepts::Graph; Node = lemon::concepts::Graph::Node]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/matching.h:511:11: required from 'void lemon::MaxMatching::startSparse() [with GR = lemon::concepts::Graph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/matching_test.cc:134:23: required from here /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/matching.h: In instantiation of 'void lemon::MaxMatching::processDense(const Node&) [with GR = lemon::concepts::Graph; Node = lemon::concepts::Graph::Node]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/matching.h:530:11: required from 'void lemon::MaxMatching::startDense() [with GR = lemon::concepts::Graph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/matching_test.cc:135:22: required from here /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; Item = lemon::concepts::Graph::Node; Value = int]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/matching.h:1651:31: required from 'void lemon::MaxWeightedMatching::init() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/matching_test.cc:171:16: required from here /build/reproducible-path/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; | ~~~~~~~~~~~~~~~^~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~^~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; Node = lemon::concepts::Graph::Node]': /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/matching_test.cc:172:17: required from here /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; Arc = lemon::concepts::Graph::Arc]': /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/matching_test.cc:172:17: required from here /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; Arc = lemon::concepts::Graph::Arc]': /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/matching_test.cc:172:17: required from here /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; Edge = lemon::concepts::Graph::Edge]': /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/matching_test.cc:172:17: required from here /build/reproducible-path/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); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; Edge = lemon::concepts::Graph::Edge]': /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/matching_test.cc:172:17: required from here /build/reproducible-path/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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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]': /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/matching_test.cc:172:17: required from here /build/reproducible-path/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 = | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 1435 | _graph.oppositeArc((*_blossom_data)[tb].next); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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 = | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 1448 | _graph.oppositeArc((*_blossom_data)[tb].next); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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 = | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 1471 | _graph.oppositeArc((*_blossom_data)[tb].next); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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 = | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 1484 | _graph.oppositeArc((*_blossom_data)[tb].next); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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 = | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 1491 | _graph.oppositeArc((*_blossom_data)[ub].next); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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 = | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 1490 | (*_blossom_data)[tb].next = | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1491 | _graph.oppositeArc((*_blossom_data)[ub].next); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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]': /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/matching_test.cc:173:15: required from here /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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)); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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)); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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)); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; | ~~~~~~~~~~~^~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; Arc = lemon::concepts::Graph::Arc]': /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/matching_test.cc:209:17: required from here /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; Edge = lemon::concepts::Graph::Edge]': /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/matching_test.cc:209:17: required from here /build/reproducible-path/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); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; Edge = lemon::concepts::Graph::Edge]': /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/matching_test.cc:209:17: required from here /build/reproducible-path/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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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]': /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/matching_test.cc:209:17: required from here /build/reproducible-path/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 = | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 2863 | _graph.oppositeArc((*_blossom_data)[tb].next); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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 = | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 2876 | _graph.oppositeArc((*_blossom_data)[tb].next); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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 = | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 2899 | _graph.oppositeArc((*_blossom_data)[tb].next); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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 = | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 2912 | _graph.oppositeArc((*_blossom_data)[tb].next); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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 = | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 2919 | _graph.oppositeArc((*_blossom_data)[ub].next); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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 = | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 2918 | (*_blossom_data)[tb].next = | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2919 | _graph.oppositeArc((*_blossom_data)[ub].next); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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]': /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/matching_test.cc:210:15: required from here /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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)); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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)); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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)); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; | ~~~~~~~~~~~^~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/matching.h: In instantiation of 'void lemon::MaxMatching::shrinkOnEdge(const Edge&) [with GR = lemon::concepts::Graph; Edge = lemon::concepts::Graph::Edge]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/matching.h:225:15: required from 'void lemon::MaxMatching::processSparse(const Node&) [with GR = lemon::concepts::Graph; Node = lemon::concepts::Graph::Node]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/matching.h:511:11: required from 'void lemon::MaxMatching::startSparse() [with GR = lemon::concepts::Graph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/matching_test.cc:134:23: required from here /build/reproducible-path/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]); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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-> | ~~~~~^~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~^~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]); | ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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-> | ~~~~~~^~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~^~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~^~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]); | ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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-> | ~~~~^~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~^~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]); | ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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-> | ~~~~^~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~^~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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]); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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]); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~^~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]); | ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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]); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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)]; | ~~~~~^~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~^~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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]); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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]); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~^~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]); | ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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]); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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)]; | ~~~~~^~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/matching.h: In instantiation of 'void lemon::MaxMatching::extendOnArc(const Arc&) [with GR = lemon::concepts::Graph; Arc = lemon::concepts::Graph::Arc]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/matching.h:228:13: required from 'void lemon::MaxMatching::processSparse(const Node&) [with GR = lemon::concepts::Graph; Node = lemon::concepts::Graph::Node]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/matching.h:511:11: required from 'void lemon::MaxMatching::startSparse() [with GR = lemon::concepts::Graph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/matching_test.cc:134:23: required from here /build/reproducible-path/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); | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~^~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/matching.h: In instantiation of 'void lemon::MaxMatching::augmentOnArc(const Arc&) [with GR = lemon::concepts::Graph; Arc = lemon::concepts::Graph::Arc]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/matching.h:230:13: required from 'void lemon::MaxMatching::processSparse(const Node&) [with GR = lemon::concepts::Graph; Node = lemon::concepts::Graph::Node]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/matching.h:511:11: required from 'void lemon::MaxMatching::startSparse() [with GR = lemon::concepts::Graph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/matching_test.cc:134:23: required from here /build/reproducible-path/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); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~^~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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); | ~~~~^~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~~~^~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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); | ~~~~~^~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~^~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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]; | ~~~~^~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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]); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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]': /build/reproducible-path/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; Node = lemon::concepts::Graph::Node]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/matching_test.cc:172:17: required from here /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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 = | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 1184 | _graph.oppositeArc((*_blossom_data)[odd].pred); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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]': /build/reproducible-path/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; Arc = lemon::concepts::Graph::Arc]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/matching_test.cc:172:17: required from here /build/reproducible-path/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; | ~~~~~~~~~~~^~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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]': /build/reproducible-path/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; Edge = lemon::concepts::Graph::Edge]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/matching_test.cc:172:17: required from here /build/reproducible-path/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; | ~~~~~~~~~~~^~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/matching.h:1374:27: required from 'void lemon::MaxWeightedMatching::shrinkOnEdge(const Edge&, int) [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap; Edge = lemon::concepts::Graph::Edge]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/matching_test.cc:172:17: required from here /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; Node = lemon::concepts::Graph::Node; Arc = lemon::concepts::Graph::Arc]': /build/reproducible-path/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]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/matching_test.cc:172:17: required from here /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~ /build/reproducible-path/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 /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/matching.h:29: /build/reproducible-path/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; Item = lemon::concepts::Graph::Arc]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/matching.h:1803:47: required from 'void lemon::MaxWeightedMatching::fractionalInit() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/matching_test.cc:173:15: required from here /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~^~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; Item = lemon::concepts::Graph::Node; Value = int]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/matching.h:1815:33: required from 'void lemon::MaxWeightedMatching::fractionalInit() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/matching_test.cc:173:15: required from here /build/reproducible-path/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; | ~~~~~~~~~~~~~~~^~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/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; Arc = lemon::concepts::Graph::Arc]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/matching_test.cc:209:17: required from here /build/reproducible-path/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; | ~~~~~~~~~~~^~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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]': /build/reproducible-path/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; Edge = lemon::concepts::Graph::Edge]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/matching_test.cc:209:17: required from here /build/reproducible-path/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; | ~~~~~~~~~~~^~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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]': /build/reproducible-path/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; Edge = lemon::concepts::Graph::Edge]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/matching_test.cc:209:17: required from here /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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 = | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 2639 | _graph.oppositeArc((*_blossom_data)[odd].pred); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; Node = lemon::concepts::Graph::Node; Arc = lemon::concepts::Graph::Arc]': /build/reproducible-path/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]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/matching_test.cc:209:17: required from here /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/unionfind.h: In instantiation of 'void lemon::UnionFindEnum::insert(const Item&, int) [with IM = lemon::concepts::Graph::NodeMap; Item = lemon::concepts::Graph::Node]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/matching.h:309:31: required from 'void lemon::MaxMatching::shrinkOnEdge(const Edge&) [with GR = lemon::concepts::Graph; Edge = lemon::concepts::Graph::Edge]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/matching.h:225:15: required from 'void lemon::MaxMatching::processSparse(const Node&) [with GR = lemon::concepts::Graph; Node = lemon::concepts::Graph::Node]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/matching.h:511:11: required from 'void lemon::MaxMatching::startSparse() [with GR = lemon::concepts::Graph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/matching_test.cc:134:23: required from here /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~^~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/unionfind.h: In instantiation of 'void lemon::ExtendFindEnum::insert(const Item&, int) [with IM = lemon::concepts::Graph::NodeMap; Item = lemon::concepts::Graph::Node]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/matching.h:363:24: required from 'void lemon::MaxMatching::extendOnArc(const Arc&) [with GR = lemon::concepts::Graph; Arc = lemon::concepts::Graph::Arc]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/matching.h:228:13: required from 'void lemon::MaxMatching::processSparse(const Node&) [with GR = lemon::concepts::Graph; Node = lemon::concepts::Graph::Node]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/matching.h:511:11: required from 'void lemon::MaxMatching::startSparse() [with GR = lemon::concepts::Graph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/matching_test.cc:134:23: required from here /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~^~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/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]' /build/reproducible-path/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; Node = lemon::concepts::Graph::Node]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/matching_test.cc:172:17: required from here /build/reproducible-path/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; | ~~~~~~~~~~~^~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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]': /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/matching.h:1374:27: required from 'void lemon::MaxWeightedMatching::shrinkOnEdge(const Edge&, int) [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap; Edge = lemon::concepts::Graph::Edge]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/matching_test.cc:172:17: required from here /build/reproducible-path/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; | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/matching.h:1406:26: required from 'void lemon::MaxWeightedMatching::splitBlossom(int) [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/matching_test.cc:172:17: required from here /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/matching.h:1406:26: required from 'void lemon::MaxWeightedMatching::splitBlossom(int) [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/matching_test.cc:172:17: required from here /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/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]' /build/reproducible-path/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; Edge = lemon::concepts::Graph::Edge]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/matching_test.cc:209:17: required from here /build/reproducible-path/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; | ~~~~~~~~~~~^~~ /build/reproducible-path/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 /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/map_extender.h:27, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:24, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:30, from /build/reproducible-path/liblemon-1.3.1+dfsg/test/matching_test.cc:26: /build/reproducible-path/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&; Key = lemon::concepts::Graph::Node; Value = lemon::concepts::Graph::Arc]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/fractional_matching.h:1187:23: required from 'void lemon::MaxWeightedFractionalMatching::init() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/matching.h:1685:23: required from 'void lemon::MaxWeightedMatching::fractionalInit() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/matching_test.cc:173:15: required from here /build/reproducible-path/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; } | ~~~~~~~~~~~~~^~ /build/reproducible-path/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 /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/matching.h:31: /build/reproducible-path/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; Arc = lemon::concepts::Graph::Arc]': /build/reproducible-path/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]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/matching.h:1685:23: required from 'void lemon::MaxWeightedMatching::fractionalInit() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/matching_test.cc:173:15: required from here /build/reproducible-path/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]; | ~~~~~^~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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]); | ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; Edge = lemon::concepts::Graph::Edge]': /build/reproducible-path/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]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/matching.h:1685:23: required from 'void lemon::MaxWeightedMatching::fractionalInit() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/matching_test.cc:173:15: required from here /build/reproducible-path/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; | ~~~~^~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~^~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]); | ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]); | ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~^~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]); | ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]); | ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~^~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]); | ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]); | ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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]]); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; Arc = lemon::concepts::Graph::Arc]': /build/reproducible-path/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]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/matching.h:3102:28: required from 'void lemon::MaxWeightedPerfectMatching::fractionalInit() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/matching_test.cc:210:15: required from here /build/reproducible-path/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]; | ~~~~~^~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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]); | ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; Edge = lemon::concepts::Graph::Edge]': /build/reproducible-path/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]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/matching.h:3102:28: required from 'void lemon::MaxWeightedPerfectMatching::fractionalInit() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/matching_test.cc:210:15: required from here /build/reproducible-path/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; | ~~~~^~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~^~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]); | ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]); | ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~^~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]); | ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]); | ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~^~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]); | ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]); | ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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]]); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/fractional_matching.h: In instantiation of 'void lemon::MaxWeightedFractionalMatching::alternatePath(Node, int) [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap; Node = lemon::concepts::Graph::Node]': /build/reproducible-path/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; Node = lemon::concepts::Graph::Node]' /build/reproducible-path/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]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/matching.h:1685:23: required from 'void lemon::MaxWeightedMatching::fractionalInit() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/matching_test.cc:173:15: required from here /build/reproducible-path/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); | ~~~~^~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~~~~^~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/fractional_matching.h: In instantiation of 'void lemon::MaxWeightedFractionalMatching::evenToMatched(Node, int) [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap; Node = lemon::concepts::Graph::Node]': /build/reproducible-path/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; Edge = lemon::concepts::Graph::Edge]' /build/reproducible-path/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]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/matching.h:1685:23: required from 'void lemon::MaxWeightedMatching::fractionalInit() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/matching_test.cc:173:15: required from here /build/reproducible-path/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); | ~~~~^~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; | ~~~~~^~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/fractional_matching.h: In instantiation of 'void lemon::MaxWeightedFractionalMatching::oddToMatched(Node) [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap; Node = lemon::concepts::Graph::Node]': /build/reproducible-path/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; Edge = lemon::concepts::Graph::Edge]' /build/reproducible-path/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]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/matching.h:1685:23: required from 'void lemon::MaxWeightedMatching::fractionalInit() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/matching_test.cc:173:15: required from here /build/reproducible-path/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); | ~~~~^~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/fractional_matching.h: In instantiation of 'void lemon::MaxWeightedPerfectFractionalMatching::alternatePath(Node, int) [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap; Node = lemon::concepts::Graph::Node]': /build/reproducible-path/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; Arc = lemon::concepts::Graph::Arc]' /build/reproducible-path/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]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/matching.h:3102:28: required from 'void lemon::MaxWeightedPerfectMatching::fractionalInit() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/matching_test.cc:210:15: required from here /build/reproducible-path/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); | ~~~~^~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~~~~^~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/fractional_matching.h: In instantiation of 'void lemon::MaxWeightedPerfectFractionalMatching::evenToMatched(Node, int) [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap; Node = lemon::concepts::Graph::Node]': /build/reproducible-path/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; Edge = lemon::concepts::Graph::Edge]' /build/reproducible-path/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]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/matching.h:3102:28: required from 'void lemon::MaxWeightedPerfectMatching::fractionalInit() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/matching_test.cc:210:15: required from here /build/reproducible-path/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); | ~~~~^~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; | ~~~~~^~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/fractional_matching.h: In instantiation of 'void lemon::MaxWeightedPerfectFractionalMatching::oddToMatched(Node) [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap; Node = lemon::concepts::Graph::Node]': /build/reproducible-path/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; Edge = lemon::concepts::Graph::Edge]' /build/reproducible-path/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]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/matching.h:3102:28: required from 'void lemon::MaxWeightedPerfectMatching::fractionalInit() [with GR = lemon::concepts::Graph; WM = lemon::concepts::Graph::EdgeMap]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/matching_test.cc:210:15: required from here /build/reproducible-path/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); | ~~~~^~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ [ 69%] Linking CXX executable matching_test cd /build/reproducible-path/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 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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,-z,relro -Wl,-z,now -rdynamic CMakeFiles/matching_test.dir/matching_test.cc.o -o matching_test -L/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[5]: Leaving directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 69%] Built target matching_test make -f test/CMakeFiles/max_cardinality_search_test.dir/build.make test/CMakeFiles/max_cardinality_search_test.dir/depend make[5]: Entering directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /build/reproducible-path/liblemon-1.3.1+dfsg /build/reproducible-path/liblemon-1.3.1+dfsg/test /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test/CMakeFiles/max_cardinality_search_test.dir/DependInfo.cmake "--color=" make[5]: Leaving directory '/build/reproducible-path/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 '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 71%] Building CXX object test/CMakeFiles/max_cardinality_search_test.dir/max_cardinality_search_test.cc.o cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -I/build/reproducible-path/liblemon-1.3.1+dfsg -I/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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 -MD -MT test/CMakeFiles/max_cardinality_search_test.dir/max_cardinality_search_test.cc.o -MF CMakeFiles/max_cardinality_search_test.dir/max_cardinality_search_test.cc.o.d -o CMakeFiles/max_cardinality_search_test.dir/max_cardinality_search_test.cc.o -c /build/reproducible-path/liblemon-1.3.1+dfsg/test/max_cardinality_search_test.cc In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/max_cardinality_search.h:31, from /build/reproducible-path/liblemon-1.3.1+dfsg/test/max_cardinality_search_test.cc:23: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:1973:21: warning: 'template struct std::iterator' is deprecated [-Wdeprecated-declarations] 1973 | : public std::iterator { | ^~~~~~~~ In file included from /usr/include/c++/13/bits/stl_iterator_base_funcs.h:66, from /usr/include/c++/13/string:47, from /usr/include/c++/13/bits/locale_classes.h:40, from /usr/include/c++/13/bits/ios_base.h:41, from /usr/include/c++/13/ios:44, from /usr/include/c++/13/ostream:40, from /usr/include/c++/13/iostream:41, from /build/reproducible-path/liblemon-1.3.1+dfsg/test/max_cardinality_search_test.cc:19: /usr/include/c++/13/bits/stl_iterator_base_types.h:127:34: note: declared here 127 | struct _GLIBCXX17_DEPRECATED iterator | ^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:3135:21: warning: 'template struct std::iterator' is deprecated [-Wdeprecated-declarations] 3135 | : public std::iterator { | ^~~~~~~~ /usr/include/c++/13/bits/stl_iterator_base_types.h:127:34: note: declared here 127 | struct _GLIBCXX17_DEPRECATED iterator | ^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/test/max_cardinality_search_test.cc: In function 'void checkMaxCardSearchCompile()': /build/reproducible-path/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 /build/reproducible-path/liblemon-1.3.1+dfsg/test/max_cardinality_search_test.cc:24: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ In file included from /usr/include/arm-linux-gnueabihf/c++/13/bits/c++allocator.h:33, from /usr/include/c++/13/bits/allocator.h:46, from /usr/include/c++/13/string:43: In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]', inlined from 'static void std::allocator_traits >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]' at /usr/include/c++/13/bits/alloc_traits.h:538:17, inlined from 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/vector.tcc:117:30, inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/stl_vector.h:1296:21, inlined from 'lemon::SmartDigraphBase::Node lemon::SmartDigraphBase::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:22, inlined from 'lemon::DigraphExtender::Node lemon::DigraphExtender::addNode() [with Base = lemon::SmartDigraphBase]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:268:34: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/test/max_cardinality_search_test.cc:22: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h: In member function 'lemon::DigraphExtender::Node lemon::DigraphExtender::addNode() [with Base = lemon::SmartDigraphBase]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:29: note: '' declared here 77 | nodes.push_back(NodeT()); | ^ In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::ArcT; _Args = {lemon::SmartDigraphBase::ArcT}; _Tp = lemon::SmartDigraphBase::ArcT]', inlined from 'static void std::allocator_traits >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::ArcT; _Args = {lemon::SmartDigraphBase::ArcT}; _Tp = lemon::SmartDigraphBase::ArcT]' at /usr/include/c++/13/bits/alloc_traits.h:538:17, inlined from 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {lemon::SmartDigraphBase::ArcT}; _Tp = lemon::SmartDigraphBase::ArcT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/vector.tcc:117:30, inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = lemon::SmartDigraphBase::ArcT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/stl_vector.h:1296:21, inlined from 'lemon::SmartDigraphBase::Arc lemon::SmartDigraphBase::addArc(Node, Node)' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:85:21, inlined from 'lemon::DigraphExtender::Arc lemon::DigraphExtender::addArc(const Node&, const Node&) [with Base = lemon::SmartDigraphBase]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:274:31: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h: In member function 'lemon::DigraphExtender::Arc lemon::DigraphExtender::addArc(const Node&, const Node&) [with Base = lemon::SmartDigraphBase]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:85:27: note: '' declared here 85 | arcs.push_back(ArcT()); | ^ [ 72%] Linking CXX executable max_cardinality_search_test cd /build/reproducible-path/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 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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,-z,relro -Wl,-z,now -rdynamic CMakeFiles/max_cardinality_search_test.dir/max_cardinality_search_test.cc.o -o max_cardinality_search_test -L/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[5]: Leaving directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 72%] Built target max_cardinality_search_test make -f test/CMakeFiles/max_clique_test.dir/build.make test/CMakeFiles/max_clique_test.dir/depend make[5]: Entering directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /build/reproducible-path/liblemon-1.3.1+dfsg /build/reproducible-path/liblemon-1.3.1+dfsg/test /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test/CMakeFiles/max_clique_test.dir/DependInfo.cmake "--color=" make[5]: Leaving directory '/build/reproducible-path/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 '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 73%] Building CXX object test/CMakeFiles/max_clique_test.dir/max_clique_test.cc.o cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -I/build/reproducible-path/liblemon-1.3.1+dfsg -I/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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 -MD -MT test/CMakeFiles/max_clique_test.dir/max_clique_test.cc.o -MF CMakeFiles/max_clique_test.dir/max_clique_test.cc.o.d -o CMakeFiles/max_clique_test.dir/max_clique_test.cc.o -c /build/reproducible-path/liblemon-1.3.1+dfsg/test/max_clique_test.cc In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lgf_writer.h:37, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:36, from /build/reproducible-path/liblemon-1.3.1+dfsg/test/max_clique_test.cc:23: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:1973:21: warning: 'template struct std::iterator' is deprecated [-Wdeprecated-declarations] 1973 | : public std::iterator { | ^~~~~~~~ In file included from /usr/include/c++/13/bits/stl_iterator_base_funcs.h:66, from /usr/include/c++/13/string:47, from /usr/include/c++/13/bits/locale_classes.h:40, from /usr/include/c++/13/bits/ios_base.h:41, from /usr/include/c++/13/ios:44, from /usr/include/c++/13/istream:40, from /usr/include/c++/13/sstream:40, from /build/reproducible-path/liblemon-1.3.1+dfsg/test/max_clique_test.cc:19: /usr/include/c++/13/bits/stl_iterator_base_types.h:127:34: note: declared here 127 | struct _GLIBCXX17_DEPRECATED iterator | ^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:3135:21: warning: 'template struct std::iterator' is deprecated [-Wdeprecated-declarations] 3135 | : public std::iterator { | ^~~~~~~~ /usr/include/c++/13/bits/stl_iterator_base_types.h:127:34: note: declared here 127 | struct _GLIBCXX17_DEPRECATED iterator | ^~~~~~~~ In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/grosso_locatelli_pullan_mc.h:31, from /build/reproducible-path/liblemon-1.3.1+dfsg/test/max_clique_test.cc:24: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/random.h: In member function 'void lemon::_random_bits::RandomCore<_Word>::fillState()': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/random.h:252:24: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister] 252 | register Word *curr = state + length - 1; | ^~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/random.h:253:23: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister] 253 | register long num; | ^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/random.h: In member function 'std::pair lemon::Random::lognormalParamsFromMD(double, double)': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/random.h:825:5: note: parameter passing for argument of type 'std::pair' when C++17 is enabled changed to match C++14 in GCC 10.1 825 | { | ^ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/random.h: In instantiation of 'void lemon::_random_bits::RandomCore<_Word>::fillState() [with _Word = long unsigned int]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/random.h:236:31: required from 'lemon::_random_bits::RandomCore<_Word>::Word lemon::_random_bits::RandomCore<_Word>::operator()() [with _Word = long unsigned int; Word = long unsigned int]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/random.h:456:23: required from 'bool lemon::_random_bits::BoolProducer::convert(lemon::_random_bits::RandomCore&) [with Word = long unsigned int]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/random.h:760:35: required from here /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/random.h:252:24: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister] 252 | register Word *curr = state + length - 1; | ^~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/random.h:253:23: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister] 253 | register long num; | ^~~ [ 74%] Linking CXX executable max_clique_test cd /build/reproducible-path/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 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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,-z,relro -Wl,-z,now -rdynamic CMakeFiles/max_clique_test.dir/max_clique_test.cc.o -o max_clique_test -L/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[5]: Leaving directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 74%] Built target max_clique_test make -f test/CMakeFiles/max_flow_test.dir/build.make test/CMakeFiles/max_flow_test.dir/depend make[5]: Entering directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /build/reproducible-path/liblemon-1.3.1+dfsg /build/reproducible-path/liblemon-1.3.1+dfsg/test /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test/CMakeFiles/max_flow_test.dir/DependInfo.cmake "--color=" make[5]: Leaving directory '/build/reproducible-path/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 '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 75%] Building CXX object test/CMakeFiles/max_flow_test.dir/max_flow_test.cc.o cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -I/build/reproducible-path/liblemon-1.3.1+dfsg -I/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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 -MD -MT test/CMakeFiles/max_flow_test.dir/max_flow_test.cc.o -MF CMakeFiles/max_flow_test.dir/max_flow_test.cc.o.d -o CMakeFiles/max_flow_test.dir/max_flow_test.cc.o -c /build/reproducible-path/liblemon-1.3.1+dfsg/test/max_flow_test.cc In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lgf_writer.h:37, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:36, from /build/reproducible-path/liblemon-1.3.1+dfsg/test/max_flow_test.cc:27: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:1973:21: warning: 'template struct std::iterator' is deprecated [-Wdeprecated-declarations] 1973 | : public std::iterator { | ^~~~~~~~ In file included from /usr/include/c++/13/bits/stl_iterator_base_funcs.h:66, from /usr/include/c++/13/string:47, from /usr/include/c++/13/bits/locale_classes.h:40, from /usr/include/c++/13/bits/ios_base.h:41, from /usr/include/c++/13/ios:44, from /usr/include/c++/13/ostream:40, from /usr/include/c++/13/iostream:41, from /build/reproducible-path/liblemon-1.3.1+dfsg/test/max_flow_test.cc:19: /usr/include/c++/13/bits/stl_iterator_base_types.h:127:34: note: declared here 127 | struct _GLIBCXX17_DEPRECATED iterator | ^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:3135:21: warning: 'template struct std::iterator' is deprecated [-Wdeprecated-declarations] 3135 | : public std::iterator { | ^~~~~~~~ /usr/include/c++/13/bits/stl_iterator_base_types.h:127:34: note: declared here 127 | struct _GLIBCXX17_DEPRECATED iterator | ^~~~~~~~ In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/test/max_flow_test.cc:23: /build/reproducible-path/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 >]': /build/reproducible-path/liblemon-1.3.1+dfsg/test/max_flow_test.cc:155:31: required from here /build/reproducible-path/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 /build/reproducible-path/liblemon-1.3.1+dfsg/test/max_flow_test.cc:25: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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(); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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 >]': /build/reproducible-path/liblemon-1.3.1+dfsg/test/max_flow_test.cc:156:32: required from here /build/reproducible-path/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) { | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/test/max_flow_test.cc:24: /build/reproducible-path/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 >]': /build/reproducible-path/liblemon-1.3.1+dfsg/test/max_flow_test.cc:179:22: required from here /build/reproducible-path/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; | ~~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~^~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~^~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~^~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/preflow.h:23: /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/preflow.h:504:24: 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 >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/max_flow_test.cc:154:29: required from here /build/reproducible-path/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; | ~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/preflow.h:505:26: 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 >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/max_flow_test.cc:154:29: required from here /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~~~~~~~~^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/preflow.h:559:27: 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 >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/max_flow_test.cc:154:29: required from here /build/reproducible-path/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]; | ~~~~~~~~~~~~~~~~^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~~~~~~~~~~~~~~~^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~~~~~~~~~~~~^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/preflow.h:644:40: required from 'void lemon::Preflow::startFirstPhase() [with GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap; TR = lemon::Preflow, lemon::Preflow >::SetElevatorTraits > >::SetStandardElevatorTraits >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/max_flow_test.cc:155:31: required from here /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/preflow.h:646:45: required from 'void lemon::Preflow::startFirstPhase() [with GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap; TR = lemon::Preflow, lemon::Preflow >::SetElevatorTraits > >::SetStandardElevatorTraits >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/max_flow_test.cc:155:31: required from here /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/preflow.h:649:32: required from 'void lemon::Preflow::startFirstPhase() [with GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap; TR = lemon::Preflow, lemon::Preflow >::SetElevatorTraits > >::SetStandardElevatorTraits >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/max_flow_test.cc:155:31: required from here /build/reproducible-path/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]; | ~~^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/preflow.h:652:31: required from 'void lemon::Preflow::startFirstPhase() [with GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap; TR = lemon::Preflow, lemon::Preflow >::SetElevatorTraits > >::SetStandardElevatorTraits >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/max_flow_test.cc:155:31: required from here /build/reproducible-path/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]; | ~~~~~~~~~~~~~~~~^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~~~~~~~~~~~~~~~^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~~~~~~~~~~~~~~~~~^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~~~~~~~~^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/preflow.h:725:35: required from 'void lemon::Preflow::startFirstPhase() [with GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap; TR = lemon::Preflow, lemon::Preflow >::SetElevatorTraits > >::SetStandardElevatorTraits >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/max_flow_test.cc:155:31: required from here /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~~~~~~~~~^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~^~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/preflow.h:727:38: required from 'void lemon::Preflow::startFirstPhase() [with GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap; TR = lemon::Preflow, lemon::Preflow >::SetElevatorTraits > >::SetStandardElevatorTraits >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/max_flow_test.cc:155:31: required from here /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~~~~~~~~~^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/map_extender.h:27, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:24, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:30, from /build/reproducible-path/liblemon-1.3.1+dfsg/test/max_flow_test.cc:22: /build/reproducible-path/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&; Key = lemon::concepts::Digraph::Node; Value = lemon::concepts::Digraph::Arc]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/edmonds_karp.h:386:19: required from 'bool lemon::EdmondsKarp::augment() [with GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap; TR = lemon::EdmondsKarpDefaultTraits >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/max_flow_test.cc:179:22: required from here /build/reproducible-path/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; } | ~~~~~~~~~~~~~^~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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 >; Node = lemon::concepts::Digraph::Node]': /build/reproducible-path/liblemon-1.3.1+dfsg/test/max_flow_test.cc:107:18: required from 'void MaxFlowClassConcept::Constraints::constraints() [with MF = lemon::Preflow >; GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = MaxFlowClassConcept >; Type = Preflow >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/max_flow_test.cc:369:35: required from here /build/reproducible-path/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; | ~~~~~~~~^~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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 >; Node = lemon::concepts::Digraph::Node]': /build/reproducible-path/liblemon-1.3.1+dfsg/test/max_flow_test.cc:108:18: required from 'void MaxFlowClassConcept::Constraints::constraints() [with MF = lemon::Preflow >; GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = MaxFlowClassConcept >; Type = Preflow >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/max_flow_test.cc:369:35: required from here /build/reproducible-path/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; | ~~~~~~~~^~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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 >; Node = lemon::concepts::Digraph::Node]': /build/reproducible-path/liblemon-1.3.1+dfsg/test/max_flow_test.cc:107:18: required from 'void MaxFlowClassConcept::Constraints::constraints() [with MF = lemon::Preflow >; GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = MaxFlowClassConcept >; Type = Preflow >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/max_flow_test.cc:371:35: required from here /build/reproducible-path/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; | ~~~~~~~~^~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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 >; Node = lemon::concepts::Digraph::Node]': /build/reproducible-path/liblemon-1.3.1+dfsg/test/max_flow_test.cc:108:18: required from 'void MaxFlowClassConcept::Constraints::constraints() [with MF = lemon::Preflow >; GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = MaxFlowClassConcept >; Type = Preflow >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/max_flow_test.cc:371:35: required from here /build/reproducible-path/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; | ~~~~~~~~^~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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 >; Node = lemon::concepts::Digraph::Node]': /build/reproducible-path/liblemon-1.3.1+dfsg/test/max_flow_test.cc:107:18: required from 'void MaxFlowClassConcept::Constraints::constraints() [with MF = lemon::EdmondsKarp >; GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = MaxFlowClassConcept >; Type = EdmondsKarp >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/max_flow_test.cc:375:39: required from here /build/reproducible-path/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; | ~~~~~~~~^~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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 >; Node = lemon::concepts::Digraph::Node]': /build/reproducible-path/liblemon-1.3.1+dfsg/test/max_flow_test.cc:108:18: required from 'void MaxFlowClassConcept::Constraints::constraints() [with MF = lemon::EdmondsKarp >; GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = MaxFlowClassConcept >; Type = EdmondsKarp >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/max_flow_test.cc:375:39: required from here /build/reproducible-path/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; | ~~~~~~~~^~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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 >; Node = lemon::concepts::Digraph::Node]': /build/reproducible-path/liblemon-1.3.1+dfsg/test/max_flow_test.cc:107:18: required from 'void MaxFlowClassConcept::Constraints::constraints() [with MF = lemon::EdmondsKarp >; GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = MaxFlowClassConcept >; Type = EdmondsKarp >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/max_flow_test.cc:377:39: required from here /build/reproducible-path/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; | ~~~~~~~~^~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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 >; Node = lemon::concepts::Digraph::Node]': /build/reproducible-path/liblemon-1.3.1+dfsg/test/max_flow_test.cc:108:18: required from 'void MaxFlowClassConcept::Constraints::constraints() [with MF = lemon::EdmondsKarp >; GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = MaxFlowClassConcept >; Type = EdmondsKarp >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/max_flow_test.cc:377:39: required from here /build/reproducible-path/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; | ~~~~~~~~^~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/preflow.h:434:24: required from 'void lemon::Preflow::init() [with GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap; TR = lemon::Preflow >::SetFlowMapTraits >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/max_flow_test.cc:113:20: required from 'void MaxFlowClassConcept::Constraints::constraints() [with MF = lemon::Preflow >; GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = MaxFlowClassConcept >; Type = Preflow >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/max_flow_test.cc:369:35: required from here /build/reproducible-path/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; | ~~^~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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 >]': /build/reproducible-path/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 >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/max_flow_test.cc:115:19: required from 'void MaxFlowClassConcept::Constraints::constraints() [with MF = lemon::Preflow >; GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = MaxFlowClassConcept >; Type = Preflow >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/max_flow_test.cc:369:35: required from here /build/reproducible-path/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(); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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(); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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 >]': /build/reproducible-path/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 >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/max_flow_test.cc:115:19: required from 'void MaxFlowClassConcept::Constraints::constraints() [with MF = lemon::Preflow >; GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = MaxFlowClassConcept >; Type = Preflow >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/max_flow_test.cc:369:35: required from here /build/reproducible-path/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) { | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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 >]': /build/reproducible-path/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 >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/max_flow_test.cc:115:19: required from 'void MaxFlowClassConcept::Constraints::constraints() [with MF = lemon::Preflow >; GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = MaxFlowClassConcept >; Type = Preflow >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/max_flow_test.cc:371:35: required from here /build/reproducible-path/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(); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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(); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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 >]': /build/reproducible-path/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 >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/max_flow_test.cc:115:19: required from 'void MaxFlowClassConcept::Constraints::constraints() [with MF = lemon::Preflow >; GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = MaxFlowClassConcept >; Type = Preflow >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/max_flow_test.cc:371:35: required from here /build/reproducible-path/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) { | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/elevator.h: In instantiation of 'void lemon::Elevator::swap(Vit, Vit) [with GR = lemon::concepts::Digraph; Item = lemon::concepts::Digraph::Node; Vit = lemon::concepts::Digraph::Node*]': /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/preflow.h:435:26: required from 'void lemon::Preflow::init() [with GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap; TR = lemon::Preflow >::SetFlowMapTraits >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/max_flow_test.cc:113:20: required from 'void MaxFlowClassConcept::Constraints::constraints() [with MF = lemon::Preflow >; GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = MaxFlowClassConcept >; Type = Preflow >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/max_flow_test.cc:369:35: required from here /build/reproducible-path/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]; | ~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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 >]': /build/reproducible-path/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 >]' /build/reproducible-path/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 >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/max_flow_test.cc:115:19: required from 'void MaxFlowClassConcept::Constraints::constraints() [with MF = lemon::EdmondsKarp >; GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = MaxFlowClassConcept >; Type = EdmondsKarp >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/max_flow_test.cc:375:39: required from here /build/reproducible-path/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; | ~~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~^~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~^~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~^~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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 >]': /build/reproducible-path/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 >]' /build/reproducible-path/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 >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/max_flow_test.cc:115:19: required from 'void MaxFlowClassConcept::Constraints::constraints() [with MF = lemon::EdmondsKarp >; GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = MaxFlowClassConcept >; Type = EdmondsKarp >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/max_flow_test.cc:377:39: required from here /build/reproducible-path/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; | ~~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~^~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~^~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~^~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29: /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseDigraphComponent; Type = concepts::Digraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = concepts::Digraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = MaxFlowClassConcept >; Type = Preflow >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/max_flow_test.cc:369:35: required from here /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent<>; Type = concepts::Digraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = concepts::Digraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = MaxFlowClassConcept >; Type = Preflow >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/max_flow_test.cc:369:35: required from here /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IDableDigraphComponent<>; Type = concepts::Digraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = concepts::Digraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = MaxFlowClassConcept >; Type = Preflow >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/max_flow_test.cc:369:35: required from here /build/reproducible-path/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; | ~~~~^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~^~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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); | ~~~~^~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/elevator.h: In instantiation of 'void lemon::Elevator::copy(Vit, Vit) [with GR = lemon::concepts::Digraph; Item = lemon::concepts::Digraph::Node; Vit = lemon::concepts::Digraph::Node*]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/elevator.h:245:11: required from 'void lemon::Elevator::liftHighestActive(int) [with GR = lemon::concepts::Digraph; Item = lemon::concepts::Digraph::Node]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/preflow.h:644:40: required from 'void lemon::Preflow::startFirstPhase() [with GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap; TR = lemon::Preflow >::SetFlowMapTraits >]' /build/reproducible-path/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 >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/max_flow_test.cc:115:19: required from 'void MaxFlowClassConcept::Constraints::constraints() [with MF = lemon::Preflow >; GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = MaxFlowClassConcept >; Type = Preflow >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/max_flow_test.cc:369:35: required from here /build/reproducible-path/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; | ~~^~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/elevator.h: In instantiation of 'void lemon::Elevator::copy(Item, Vit) [with GR = lemon::concepts::Digraph; Item = lemon::concepts::Digraph::Node; Vit = lemon::concepts::Digraph::Node*]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/elevator.h:251:11: required from 'void lemon::Elevator::liftHighestActive(int) [with GR = lemon::concepts::Digraph; Item = lemon::concepts::Digraph::Node]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/preflow.h:644:40: required from 'void lemon::Preflow::startFirstPhase() [with GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap; TR = lemon::Preflow >::SetFlowMapTraits >]' /build/reproducible-path/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 >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/max_flow_test.cc:115:19: required from 'void MaxFlowClassConcept::Constraints::constraints() [with MF = lemon::Preflow >; GR = lemon::concepts::Digraph; CAP = lemon::concepts::ReadMap]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = MaxFlowClassConcept >; Type = Preflow >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/max_flow_test.cc:369:35: required from here /build/reproducible-path/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; | ~~^~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItem<'n'>; Type = concepts::Digraph::Node]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseDigraphComponent; Type = concepts::Digraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = concepts::Digraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = MaxFlowClassConcept >; Type = Preflow >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/max_flow_test.cc:369:35: required from here /build/reproducible-path/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; | ~~^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~^~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItem<'a'>; Type = concepts::Digraph::Arc]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseDigraphComponent; Type = concepts::Digraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = concepts::Digraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = MaxFlowClassConcept >; Type = Preflow >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/max_flow_test.cc:369:35: required from here /build/reproducible-path/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; | ~~^~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; | ~~~^~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; | ~~~^~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItemIt; Type = concepts::Digraph::ArcIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent<>; Type = concepts::Digraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = concepts::Digraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = MaxFlowClassConcept >; Type = Preflow >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/max_flow_test.cc:369:35: required from here /build/reproducible-path/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; | ~~~~^~~~~~~ /build/reproducible-path/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) { } | ^~~~~ /build/reproducible-path/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; | ~~~~~~^~~~~ /build/reproducible-path/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) { } | ^~~~~ /build/reproducible-path/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; | ~~~^~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItemIt; Type = concepts::Digraph::NodeIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent<>; Type = concepts::Digraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = concepts::Digraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = MaxFlowClassConcept >; Type = Preflow >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/max_flow_test.cc:369:35: required from here /build/reproducible-path/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; | ~~~~^~~~~~~ /build/reproducible-path/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) { } | ^~~~~~ /build/reproducible-path/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; | ~~~~~~^~~~~ /build/reproducible-path/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) { } | ^~~~~~ /build/reproducible-path/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; | ~~~^~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphIncIt; Type = concepts::Digraph::InArcIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent<>; Type = concepts::Digraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = concepts::Digraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = MaxFlowClassConcept >; Type = Preflow >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/max_flow_test.cc:369:35: required from here /build/reproducible-path/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; | ~~~~^~~~~~~ /build/reproducible-path/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) { } | ^~~~~~~ /build/reproducible-path/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; | ~~~~~~^~~~~ /build/reproducible-path/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) { } | ^~~~~~~ /build/reproducible-path/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; | ~~^~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphIncIt; Type = concepts::Digraph::OutArcIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent<>; Type = concepts::Digraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = concepts::Digraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = MaxFlowClassConcept >; Type = Preflow >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/max_flow_test.cc:369:35: required from here /build/reproducible-path/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; | ~~~~^~~~~~~ /build/reproducible-path/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) { } | ^~~~~~~~ /build/reproducible-path/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; | ~~~~~~^~~~~ /build/reproducible-path/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) { } | ^~~~~~~~ /build/reproducible-path/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; | ~~^~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItem<>; Type = concepts::Digraph::ArcIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItemIt; Type = concepts::Digraph::ArcIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent<>; Type = concepts::Digraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = concepts::Digraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = MaxFlowClassConcept >; Type = Preflow >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/max_flow_test.cc:369:35: required from here /build/reproducible-path/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; | ~~^~~~~~~~ /build/reproducible-path/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) { } | ^~~~~ /build/reproducible-path/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; | ~~~^~~~ /build/reproducible-path/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) { } | ^~~~~ /build/reproducible-path/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; | ~~~^~~~~~~~~ /build/reproducible-path/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) { } | ^~~~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItem<>; Type = concepts::Digraph::NodeIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItemIt; Type = concepts::Digraph::NodeIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent<>; Type = concepts::Digraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = concepts::Digraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = MaxFlowClassConcept >; Type = Preflow >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/max_flow_test.cc:369:35: required from here /build/reproducible-path/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; | ~~^~~~~~~~ /build/reproducible-path/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) { } | ^~~~~~ /build/reproducible-path/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; | ~~~^~~~ /build/reproducible-path/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) { } | ^~~~~~ /build/reproducible-path/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; | ~~~^~~~~~~~~ /build/reproducible-path/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) { } | ^~~~~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItem<'i'>; Type = concepts::Digraph::InArcIt]' /build/reproducible-path/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']' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphIncIt; Type = concepts::Digraph::InArcIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent<>; Type = concepts::Digraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = concepts::Digraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = MaxFlowClassConcept >; Type = Preflow >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/max_flow_test.cc:369:35: required from here /build/reproducible-path/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; | ~~^~~~~~~~ /build/reproducible-path/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) { } | ^~~~~~~ /build/reproducible-path/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; | ~~~^~~~ /build/reproducible-path/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) { } | ^~~~~~~ /build/reproducible-path/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; | ~~~^~~~~~~~~ /build/reproducible-path/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) { } | ^~~~~~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItem<'o'>; Type = concepts::Digraph::OutArcIt]' /build/reproducible-path/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']' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphIncIt; Type = concepts::Digraph::OutArcIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent<>; Type = concepts::Digraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = concepts::Digraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = MaxFlowClassConcept >; Type = Preflow >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/max_flow_test.cc:369:35: required from here /build/reproducible-path/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; | ~~^~~~~~~~ /build/reproducible-path/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) { } | ^~~~~~~~ /build/reproducible-path/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; | ~~~^~~~ /build/reproducible-path/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) { } | ^~~~~~~~ /build/reproducible-path/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; | ~~~^~~~~~~~~ /build/reproducible-path/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/arm-linux-gnueabihf/c++/13/bits/c++allocator.h:33, from /usr/include/c++/13/bits/allocator.h:46, from /usr/include/c++/13/string:43: In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]', inlined from 'static void std::allocator_traits >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]' at /usr/include/c++/13/bits/alloc_traits.h:538:17, inlined from 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/vector.tcc:117:30, inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/stl_vector.h:1296:21, inlined from 'lemon::SmartDigraphBase::Node lemon::SmartDigraphBase::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:22, inlined from 'lemon::DigraphExtender::Node lemon::DigraphExtender::addNode() [with Base = lemon::SmartDigraphBase]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:268:34: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h: In member function 'lemon::DigraphExtender::Node lemon::DigraphExtender::addNode() [with Base = lemon::SmartDigraphBase]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:29: note: '' declared here 77 | nodes.push_back(NodeT()); | ^ In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::ArcT; _Args = {lemon::SmartDigraphBase::ArcT}; _Tp = lemon::SmartDigraphBase::ArcT]', inlined from 'static void std::allocator_traits >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::ArcT; _Args = {lemon::SmartDigraphBase::ArcT}; _Tp = lemon::SmartDigraphBase::ArcT]' at /usr/include/c++/13/bits/alloc_traits.h:538:17, inlined from 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {lemon::SmartDigraphBase::ArcT}; _Tp = lemon::SmartDigraphBase::ArcT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/vector.tcc:117:30, inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = lemon::SmartDigraphBase::ArcT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/stl_vector.h:1296:21, inlined from 'lemon::SmartDigraphBase::Arc lemon::SmartDigraphBase::addArc(Node, Node)' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:85:21, inlined from 'lemon::DigraphExtender::Arc lemon::DigraphExtender::addArc(const Node&, const Node&) [with Base = lemon::SmartDigraphBase]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:274:31: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h: In member function 'lemon::DigraphExtender::Arc lemon::DigraphExtender::addArc(const Node&, const Node&) [with Base = lemon::SmartDigraphBase]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:85:27: note: '' declared here 85 | arcs.push_back(ArcT()); | ^ In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]', inlined from 'static void std::allocator_traits >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]' at /usr/include/c++/13/bits/alloc_traits.h:538:17, inlined from 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/vector.tcc:117:30, inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/stl_vector.h:1296:21, inlined from 'lemon::SmartDigraphBase::Node lemon::SmartDigraphBase::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:22, inlined from 'lemon::DigraphExtender::Node lemon::DigraphExtender::addNode() [with Base = lemon::SmartDigraphBase]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:268:34, inlined from 'lemon::DigraphExtender::Node lemon::SmartDigraph::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:223:44, inlined from 'void initFlowTest()' at /build/reproducible-path/liblemon-1.3.1+dfsg/test/max_flow_test.cc:228:19: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h: In function 'void initFlowTest()': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:29: note: '' declared here 77 | nodes.push_back(NodeT()); | ^ In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]', inlined from 'static void std::allocator_traits >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]' at /usr/include/c++/13/bits/alloc_traits.h:538:17, inlined from 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/vector.tcc:117:30, inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/stl_vector.h:1296:21, inlined from 'lemon::SmartDigraphBase::Node lemon::SmartDigraphBase::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:22, inlined from 'lemon::DigraphExtender::Node lemon::DigraphExtender::addNode() [with Base = lemon::SmartDigraphBase]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:268:34, inlined from 'lemon::DigraphExtender::Node lemon::SmartDigraph::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:223:44, inlined from 'void initFlowTest()' at /build/reproducible-path/liblemon-1.3.1+dfsg/test/max_flow_test.cc:228:39: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h: In function 'void initFlowTest()': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:29: note: '' declared here 77 | nodes.push_back(NodeT()); | ^ In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]', inlined from 'static void std::allocator_traits >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]' at /usr/include/c++/13/bits/alloc_traits.h:538:17, inlined from 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/vector.tcc:117:30, inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/stl_vector.h:1296:21, inlined from 'lemon::SmartDigraphBase::Node lemon::SmartDigraphBase::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:22, inlined from 'lemon::DigraphExtender::Node lemon::DigraphExtender::addNode() [with Base = lemon::SmartDigraphBase]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:268:34, inlined from 'lemon::DigraphExtender::Node lemon::SmartDigraph::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:223:44, inlined from 'void initFlowTest()' at /build/reproducible-path/liblemon-1.3.1+dfsg/test/max_flow_test.cc:229:20: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h: In function 'void initFlowTest()': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:29: note: '' declared here 77 | nodes.push_back(NodeT()); | ^ In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]', inlined from 'static void std::allocator_traits >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]' at /usr/include/c++/13/bits/alloc_traits.h:538:17, inlined from 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/vector.tcc:117:30, inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/stl_vector.h:1296:21, inlined from 'lemon::SmartDigraphBase::Node lemon::SmartDigraphBase::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:22, inlined from 'lemon::DigraphExtender::Node lemon::DigraphExtender::addNode() [with Base = lemon::SmartDigraphBase]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:268:34, inlined from 'lemon::DigraphExtender::Node lemon::SmartDigraph::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:223:44, inlined from 'void initFlowTest()' at /build/reproducible-path/liblemon-1.3.1+dfsg/test/max_flow_test.cc:229:41: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h: In function 'void initFlowTest()': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:29: note: '' declared here 77 | nodes.push_back(NodeT()); | ^ [ 75%] Linking CXX executable max_flow_test cd /build/reproducible-path/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 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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,-z,relro -Wl,-z,now -rdynamic CMakeFiles/max_flow_test.dir/max_flow_test.cc.o -o max_flow_test -L/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[5]: Leaving directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 75%] Built target max_flow_test make -f test/CMakeFiles/min_cost_arborescence_test.dir/build.make test/CMakeFiles/min_cost_arborescence_test.dir/depend make[5]: Entering directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /build/reproducible-path/liblemon-1.3.1+dfsg /build/reproducible-path/liblemon-1.3.1+dfsg/test /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test/CMakeFiles/min_cost_arborescence_test.dir/DependInfo.cmake "--color=" make[5]: Leaving directory '/build/reproducible-path/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 '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 77%] Building CXX object test/CMakeFiles/min_cost_arborescence_test.dir/min_cost_arborescence_test.cc.o cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -I/build/reproducible-path/liblemon-1.3.1+dfsg -I/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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 -MD -MT test/CMakeFiles/min_cost_arborescence_test.dir/min_cost_arborescence_test.cc.o -MF CMakeFiles/min_cost_arborescence_test.dir/min_cost_arborescence_test.cc.o.d -o CMakeFiles/min_cost_arborescence_test.dir/min_cost_arborescence_test.cc.o -c /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_cost_arborescence_test.cc In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lgf_writer.h:37, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:36, from /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_cost_arborescence_test.cc:26: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:1973:21: warning: 'template struct std::iterator' is deprecated [-Wdeprecated-declarations] 1973 | : public std::iterator { | ^~~~~~~~ In file included from /usr/include/c++/13/bits/stl_iterator_base_funcs.h:66, from /usr/include/c++/13/string:47, from /usr/include/c++/13/bits/locale_classes.h:40, from /usr/include/c++/13/bits/ios_base.h:41, from /usr/include/c++/13/ios:44, from /usr/include/c++/13/ostream:40, from /usr/include/c++/13/iostream:41, from /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_cost_arborescence_test.cc:19: /usr/include/c++/13/bits/stl_iterator_base_types.h:127:34: note: declared here 127 | struct _GLIBCXX17_DEPRECATED iterator | ^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:3135:21: warning: 'template struct std::iterator' is deprecated [-Wdeprecated-declarations] 3135 | : public std::iterator { | ^~~~~~~~ /usr/include/c++/13/bits/stl_iterator_base_types.h:127:34: note: declared here 127 | struct _GLIBCXX17_DEPRECATED iterator | ^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_cost_arborescence_test.cc: In function 'void checkMinCostArborescenceCompile()': /build/reproducible-path/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 /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_cost_arborescence_test.cc:27: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ^ /build/reproducible-path/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 /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_cost_arborescence_test.cc:25: /build/reproducible-path/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 >]': /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_cost_arborescence_test.cc:108:18: required from here /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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 >; Node = lemon::concepts::Digraph::Node]': /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_cost_arborescence_test.cc:111:33: required from here /build/reproducible-path/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); | ~~~~^~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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); | ~~~~^~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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); | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/min_cost_arborescence.h: In instantiation of 'lemon::MinCostArborescence::Arc lemon::MinCostArborescence::prepare(Node) [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::MinCostArborescence, lemon::MinCostArborescence >::SetArborescenceMapTraits > >::SetPredMapTraits >; Arc = lemon::concepts::Digraph::Arc; Node = lemon::concepts::Digraph::Node]': /build/reproducible-path/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 >; Node = lemon::concepts::Digraph::Node]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_cost_arborescence_test.cc:111:33: required from here /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/min_cost_arborescence.h: In instantiation of 'lemon::MinCostArborescence::Arc lemon::MinCostArborescence::contract(Node) [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::MinCostArborescence, lemon::MinCostArborescence >::SetArborescenceMapTraits > >::SetPredMapTraits >; Arc = lemon::concepts::Digraph::Arc; Node = lemon::concepts::Digraph::Node]': /build/reproducible-path/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 >; Node = lemon::concepts::Digraph::Node]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_cost_arborescence_test.cc:111:33: required from here /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ /build/reproducible-path/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/arm-linux-gnueabihf/c++/13/bits/c++allocator.h:33, from /usr/include/c++/13/bits/allocator.h:46, from /usr/include/c++/13/string:43: In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::MinCostArborescence::ArcMap >::CostArc; _Args = {lemon::MinCostArborescence::ArcMap >::CostArc}; _Tp = lemon::MinCostArborescence::ArcMap >::CostArc]', inlined from 'void lemon::ArrayMap<_Graph, _Item, _Value>::add(const std::vector<_Item>&) [with _Graph = lemon::DigraphExtender; _Item = lemon::SmartDigraphBase::Node; _Value = lemon::MinCostArborescence::ArcMap >::CostArc]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/array_map.h:272:28: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/default_map.h:23, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:25, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:30, from /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_cost_arborescence_test.cc:24: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/array_map.h: In member function 'void lemon::ArrayMap<_Graph, _Item, _Value>::add(const std::vector<_Item>&) [with _Graph = lemon::DigraphExtender; _Item = lemon::SmartDigraphBase::Node; _Value = lemon::MinCostArborescence::ArcMap >::CostArc]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/array_map.h:272:44: note: '' declared here 272 | allocator.construct(&(values[id]), Value()); | ^~~~~~~ In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::MinCostArborescence::ArcMap, lemon::MinCostArborescence::ArcMap >::SetArborescenceMapTraits::ArcMap > >::CostArc; _Args = {lemon::MinCostArborescence::ArcMap, lemon::MinCostArborescence::ArcMap >::SetArborescenceMapTraits::ArcMap > >::CostArc}; _Tp = lemon::MinCostArborescence::ArcMap, lemon::MinCostArborescence::ArcMap >::SetArborescenceMapTraits::ArcMap > >::CostArc]', inlined from 'void lemon::ArrayMap<_Graph, _Item, _Value>::add(const std::vector<_Item>&) [with _Graph = lemon::DigraphExtender; _Item = lemon::SmartDigraphBase::Node; _Value = lemon::MinCostArborescence::ArcMap, lemon::MinCostArborescence::ArcMap >::SetArborescenceMapTraits::ArcMap > >::CostArc]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/array_map.h:272:28: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/array_map.h: In member function 'void lemon::ArrayMap<_Graph, _Item, _Value>::add(const std::vector<_Item>&) [with _Graph = lemon::DigraphExtender; _Item = lemon::SmartDigraphBase::Node; _Value = lemon::MinCostArborescence::ArcMap, lemon::MinCostArborescence::ArcMap >::SetArborescenceMapTraits::ArcMap > >::CostArc]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/array_map.h:272:44: note: '' declared here 272 | allocator.construct(&(values[id]), Value()); | ^~~~~~~ In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::MinCostArborescence::ArcMap, lemon::MinCostArborescence::ArcMap >::SetArborescenceMapTraits::ArcMap > >::CostArc; _Args = {lemon::MinCostArborescence::ArcMap, lemon::MinCostArborescence::ArcMap >::SetArborescenceMapTraits::ArcMap > >::CostArc}; _Tp = lemon::MinCostArborescence::ArcMap, lemon::MinCostArborescence::ArcMap >::SetArborescenceMapTraits::ArcMap > >::CostArc]', inlined from 'void lemon::ArrayMap<_Graph, _Item, _Value>::add(const Key&) [with _Graph = lemon::DigraphExtender; _Item = lemon::SmartDigraphBase::Node; _Value = lemon::MinCostArborescence::ArcMap, lemon::MinCostArborescence::ArcMap >::SetArborescenceMapTraits::ArcMap > >::CostArc]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/array_map.h:229:26: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/array_map.h: In member function 'void lemon::ArrayMap<_Graph, _Item, _Value>::add(const Key&) [with _Graph = lemon::DigraphExtender; _Item = lemon::SmartDigraphBase::Node; _Value = lemon::MinCostArborescence::ArcMap, lemon::MinCostArborescence::ArcMap >::SetArborescenceMapTraits::ArcMap > >::CostArc]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/array_map.h:229:42: note: '' declared here 229 | allocator.construct(&(values[id]), Value()); | ^~~~~~~ In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::MinCostArborescence::ArcMap >::CostArc; _Args = {lemon::MinCostArborescence::ArcMap >::CostArc}; _Tp = lemon::MinCostArborescence::ArcMap >::CostArc]', inlined from 'void lemon::ArrayMap<_Graph, _Item, _Value>::add(const Key&) [with _Graph = lemon::DigraphExtender; _Item = lemon::SmartDigraphBase::Node; _Value = lemon::MinCostArborescence::ArcMap >::CostArc]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/array_map.h:229:26: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/array_map.h: In member function 'void lemon::ArrayMap<_Graph, _Item, _Value>::add(const Key&) [with _Graph = lemon::DigraphExtender; _Item = lemon::SmartDigraphBase::Node; _Value = lemon::MinCostArborescence::ArcMap >::CostArc]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/array_map.h:229:42: note: '' declared here 229 | allocator.construct(&(values[id]), Value()); | ^~~~~~~ In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::MinCostArborescence::ArcMap >::CostArc; _Args = {lemon::MinCostArborescence::ArcMap >::CostArc}; _Tp = lemon::MinCostArborescence::ArcMap >::CostArc]', inlined from 'void lemon::ArrayMap<_Graph, _Item, _Value>::build() [with _Graph = lemon::DigraphExtender; _Item = lemon::SmartDigraphBase::Node; _Value = lemon::MinCostArborescence::ArcMap >::CostArc]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/array_map.h:306:28: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/array_map.h: In member function 'void lemon::ArrayMap<_Graph, _Item, _Value>::build() [with _Graph = lemon::DigraphExtender; _Item = lemon::SmartDigraphBase::Node; _Value = lemon::MinCostArborescence::ArcMap >::CostArc]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/array_map.h:306:44: note: '' declared here 306 | allocator.construct(&(values[id]), Value()); | ^~~~~~~ In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::MinCostArborescence::ArcMap, lemon::MinCostArborescence::ArcMap >::SetArborescenceMapTraits::ArcMap > >::CostArc; _Args = {lemon::MinCostArborescence::ArcMap, lemon::MinCostArborescence::ArcMap >::SetArborescenceMapTraits::ArcMap > >::CostArc}; _Tp = lemon::MinCostArborescence::ArcMap, lemon::MinCostArborescence::ArcMap >::SetArborescenceMapTraits::ArcMap > >::CostArc]', inlined from 'void lemon::ArrayMap<_Graph, _Item, _Value>::build() [with _Graph = lemon::DigraphExtender; _Item = lemon::SmartDigraphBase::Node; _Value = lemon::MinCostArborescence::ArcMap, lemon::MinCostArborescence::ArcMap >::SetArborescenceMapTraits::ArcMap > >::CostArc]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/array_map.h:306:28: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/array_map.h: In member function 'void lemon::ArrayMap<_Graph, _Item, _Value>::build() [with _Graph = lemon::DigraphExtender; _Item = lemon::SmartDigraphBase::Node; _Value = lemon::MinCostArborescence::ArcMap, lemon::MinCostArborescence::ArcMap >::SetArborescenceMapTraits::ArcMap > >::CostArc]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/array_map.h:306:44: note: '' declared here 306 | allocator.construct(&(values[id]), Value()); | ^~~~~~~ In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::ArcT; _Args = {lemon::SmartDigraphBase::ArcT}; _Tp = lemon::SmartDigraphBase::ArcT]', inlined from 'static void std::allocator_traits >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::ArcT; _Args = {lemon::SmartDigraphBase::ArcT}; _Tp = lemon::SmartDigraphBase::ArcT]' at /usr/include/c++/13/bits/alloc_traits.h:538:17, inlined from 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {lemon::SmartDigraphBase::ArcT}; _Tp = lemon::SmartDigraphBase::ArcT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/vector.tcc:117:30, inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = lemon::SmartDigraphBase::ArcT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/stl_vector.h:1296:21, inlined from 'lemon::SmartDigraphBase::Arc lemon::SmartDigraphBase::addArc(Node, Node)' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:85:21, inlined from 'lemon::DigraphExtender::Arc lemon::DigraphExtender::addArc(const Node&, const Node&) [with Base = lemon::SmartDigraphBase]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:274:31: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h: In member function 'lemon::DigraphExtender::Arc lemon::DigraphExtender::addArc(const Node&, const Node&) [with Base = lemon::SmartDigraphBase]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:85:27: note: '' declared here 85 | arcs.push_back(ArcT()); | ^ In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]', inlined from 'static void std::allocator_traits >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]' at /usr/include/c++/13/bits/alloc_traits.h:538:17, inlined from 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/vector.tcc:117:30, inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/stl_vector.h:1296:21, inlined from 'lemon::SmartDigraphBase::Node lemon::SmartDigraphBase::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:22, inlined from 'lemon::DigraphExtender::Node lemon::DigraphExtender::addNode() [with Base = lemon::SmartDigraphBase]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:268:34, inlined from 'lemon::DigraphExtender::Node lemon::SmartDigraph::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:223:44, inlined from 'void lemon::DigraphReader::readNodes() [with DGR = lemon::SmartDigraph]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:954:31: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h: In member function 'void lemon::DigraphReader::readNodes() [with DGR = lemon::SmartDigraph]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:29: note: '' declared here 77 | nodes.push_back(NodeT()); | ^ In file included from /usr/include/c++/13/vector:72, from /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_cost_arborescence_test.cc:21: /usr/include/c++/13/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const lemon::MinCostArborescence::ArcMap >::DualVariable&}; _Tp = lemon::MinCostArborescence::ArcMap >::DualVariable; _Alloc = std::allocator::ArcMap >::DualVariable>]': /usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector::ArcMap >::DualVariable, std::allocator::ArcMap >::DualVariable> >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/13/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const lemon::MinCostArborescence::ArcMap >::CostArc&}; _Tp = lemon::MinCostArborescence::ArcMap >::CostArc; _Alloc = std::allocator::ArcMap >::CostArc>]': /usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector::ArcMap >::CostArc, std::allocator::ArcMap >::CostArc> >::iterator' changed in GCC 7.1 In file included from /usr/include/c++/13/vector:66: In member function 'void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = lemon::MinCostArborescence::ArcMap >::DualVariable; _Alloc = std::allocator::ArcMap >::DualVariable>]', inlined from 'lemon::MinCostArborescence::Arc lemon::MinCostArborescence::contract(Node) [with GR = lemon::SmartDigraph; CM = lemon::DigraphExtender::ArcMap; TR = lemon::MinCostArborescenceDefaultTraits::ArcMap >]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/min_cost_arborescence.h:342:32: /usr/include/c++/13/bits/stl_vector.h:1289:28: 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 1289 | _M_realloc_insert(end(), __x); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = lemon::MinCostArborescence::ArcMap >::CostArc; _Alloc = std::allocator::ArcMap >::CostArc>]', inlined from 'lemon::MinCostArborescence::Arc lemon::MinCostArborescence::contract(Node) [with GR = lemon::SmartDigraph; CM = lemon::DigraphExtender::ArcMap; TR = lemon::MinCostArborescenceDefaultTraits::ArcMap >]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/min_cost_arborescence.h:347:29: /usr/include/c++/13/bits/stl_vector.h:1289:28: 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 1289 | _M_realloc_insert(end(), __x); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = lemon::MinCostArborescence::ArcMap >::DualVariable; _Alloc = std::allocator::ArcMap >::DualVariable>]', inlined from 'lemon::MinCostArborescence::Arc lemon::MinCostArborescence::prepare(Node) [with GR = lemon::SmartDigraph; CM = lemon::DigraphExtender::ArcMap; TR = lemon::MinCostArborescenceDefaultTraits::ArcMap >]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/min_cost_arborescence.h:301:32: /usr/include/c++/13/bits/stl_vector.h:1289:28: 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 1289 | _M_realloc_insert(end(), __x); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = lemon::MinCostArborescence::ArcMap >::CostArc; _Alloc = std::allocator::ArcMap >::CostArc>]', inlined from 'lemon::MinCostArborescence::Arc lemon::MinCostArborescence::prepare(Node) [with GR = lemon::SmartDigraph; CM = lemon::DigraphExtender::ArcMap; TR = lemon::MinCostArborescenceDefaultTraits::ArcMap >]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/min_cost_arborescence.h:304:29: /usr/include/c++/13/bits/stl_vector.h:1289:28: 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 1289 | _M_realloc_insert(end(), __x); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~ /usr/include/c++/13/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(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++/13/bits/vector.tcc:445: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' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/13/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(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++/13/bits/vector.tcc:445: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' changed in GCC 7.1 In member function 'void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = lemon::MinCostArborescence::ArcMap, lemon::MinCostArborescence::ArcMap >::SetArborescenceMapTraits::ArcMap > >::DualVariable; _Alloc = std::allocator::ArcMap, lemon::MinCostArborescence::ArcMap >::SetArborescenceMapTraits::ArcMap > >::DualVariable>]', inlined from 'lemon::MinCostArborescence::Arc lemon::MinCostArborescence::contract(Node) [with GR = lemon::SmartDigraph; CM = lemon::DigraphExtender::ArcMap; TR = lemon::MinCostArborescence::ArcMap >::SetArborescenceMapTraits::ArcMap >]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/min_cost_arborescence.h:342:32: /usr/include/c++/13/bits/stl_vector.h:1289:28: 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 1289 | _M_realloc_insert(end(), __x); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = lemon::MinCostArborescence::ArcMap, lemon::MinCostArborescence::ArcMap >::SetArborescenceMapTraits::ArcMap > >::CostArc; _Alloc = std::allocator::ArcMap, lemon::MinCostArborescence::ArcMap >::SetArborescenceMapTraits::ArcMap > >::CostArc>]', inlined from 'lemon::MinCostArborescence::Arc lemon::MinCostArborescence::contract(Node) [with GR = lemon::SmartDigraph; CM = lemon::DigraphExtender::ArcMap; TR = lemon::MinCostArborescence::ArcMap >::SetArborescenceMapTraits::ArcMap >]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/min_cost_arborescence.h:347:29: /usr/include/c++/13/bits/stl_vector.h:1289:28: 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 1289 | _M_realloc_insert(end(), __x); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = lemon::MinCostArborescence::ArcMap, lemon::MinCostArborescence::ArcMap >::SetArborescenceMapTraits::ArcMap > >::DualVariable; _Alloc = std::allocator::ArcMap, lemon::MinCostArborescence::ArcMap >::SetArborescenceMapTraits::ArcMap > >::DualVariable>]', inlined from 'lemon::MinCostArborescence::Arc lemon::MinCostArborescence::prepare(Node) [with GR = lemon::SmartDigraph; CM = lemon::DigraphExtender::ArcMap; TR = lemon::MinCostArborescence::ArcMap >::SetArborescenceMapTraits::ArcMap >]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/min_cost_arborescence.h:301:32: /usr/include/c++/13/bits/stl_vector.h:1289:28: 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 1289 | _M_realloc_insert(end(), __x); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = lemon::MinCostArborescence::ArcMap, lemon::MinCostArborescence::ArcMap >::SetArborescenceMapTraits::ArcMap > >::CostArc; _Alloc = std::allocator::ArcMap, lemon::MinCostArborescence::ArcMap >::SetArborescenceMapTraits::ArcMap > >::CostArc>]', inlined from 'lemon::MinCostArborescence::Arc lemon::MinCostArborescence::prepare(Node) [with GR = lemon::SmartDigraph; CM = lemon::DigraphExtender::ArcMap; TR = lemon::MinCostArborescence::ArcMap >::SetArborescenceMapTraits::ArcMap >]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/min_cost_arborescence.h:304:29: /usr/include/c++/13/bits/stl_vector.h:1289:28: 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 1289 | _M_realloc_insert(end(), __x); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~ In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::MinCostArborescence::ArcMap >::CostArc; _Args = {lemon::MinCostArborescence::ArcMap >::CostArc}; _Tp = lemon::MinCostArborescence::ArcMap >::CostArc]', inlined from 'lemon::ArrayMap<_Graph, _Item, _Value>::ArrayMap(const GraphType&) [with _Graph = lemon::DigraphExtender; _Item = lemon::SmartDigraphBase::Node; _Value = lemon::MinCostArborescence::ArcMap >::CostArc]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/array_map.h:91:28, inlined from 'lemon::DefaultMap<_Graph, _Item, _Value>::DefaultMap(const GraphType&) [with _Graph = lemon::DigraphExtender; _Item = lemon::SmartDigraphBase::Node; _Value = lemon::MinCostArborescence::ArcMap >::CostArc]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/default_map.h:164:63, inlined from 'lemon::MapExtender<_Map>::MapExtender(const GraphType&) [with _Map = lemon::DefaultMap, lemon::SmartDigraphBase::Node, lemon::MinCostArborescence::ArcMap >::CostArc>]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/map_extender.h:63:21, inlined from 'lemon::DigraphExtender::NodeMap<_Value>::NodeMap(const lemon::DigraphExtender::Digraph&) [with _Value = lemon::MinCostArborescence::ArcMap >::CostArc; Base = lemon::SmartDigraphBase]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:226:25, inlined from 'void lemon::MinCostArborescence::createStructures() [with GR = lemon::SmartDigraph; CM = lemon::DigraphExtender::ArcMap; TR = lemon::MinCostArborescenceDefaultTraits::ArcMap >]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/min_cost_arborescence.h:236:22: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/array_map.h: In member function 'void lemon::MinCostArborescence::createStructures() [with GR = lemon::SmartDigraph; CM = lemon::DigraphExtender::ArcMap; TR = lemon::MinCostArborescenceDefaultTraits::ArcMap >]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/array_map.h:91:44: note: '' declared here 91 | allocator.construct(&(values[id]), Value()); | ^~~~~~~ In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::MinCostArborescence::ArcMap, lemon::MinCostArborescence::ArcMap >::SetArborescenceMapTraits::ArcMap > >::CostArc; _Args = {lemon::MinCostArborescence::ArcMap, lemon::MinCostArborescence::ArcMap >::SetArborescenceMapTraits::ArcMap > >::CostArc}; _Tp = lemon::MinCostArborescence::ArcMap, lemon::MinCostArborescence::ArcMap >::SetArborescenceMapTraits::ArcMap > >::CostArc]', inlined from 'lemon::ArrayMap<_Graph, _Item, _Value>::ArrayMap(const GraphType&) [with _Graph = lemon::DigraphExtender; _Item = lemon::SmartDigraphBase::Node; _Value = lemon::MinCostArborescence::ArcMap, lemon::MinCostArborescence::ArcMap >::SetArborescenceMapTraits::ArcMap > >::CostArc]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/array_map.h:91:28, inlined from 'lemon::DefaultMap<_Graph, _Item, _Value>::DefaultMap(const GraphType&) [with _Graph = lemon::DigraphExtender; _Item = lemon::SmartDigraphBase::Node; _Value = lemon::MinCostArborescence::ArcMap, lemon::MinCostArborescence::ArcMap >::SetArborescenceMapTraits::ArcMap > >::CostArc]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/default_map.h:164:63, inlined from 'lemon::MapExtender<_Map>::MapExtender(const GraphType&) [with _Map = lemon::DefaultMap, lemon::SmartDigraphBase::Node, lemon::MinCostArborescence::ArcMap, lemon::MinCostArborescence::ArcMap >::SetArborescenceMapTraits::ArcMap > >::CostArc>]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/map_extender.h:63:21, inlined from 'lemon::DigraphExtender::NodeMap<_Value>::NodeMap(const lemon::DigraphExtender::Digraph&) [with _Value = lemon::MinCostArborescence::ArcMap, lemon::MinCostArborescence::ArcMap >::SetArborescenceMapTraits::ArcMap > >::CostArc; Base = lemon::SmartDigraphBase]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:226:25, inlined from 'void lemon::MinCostArborescence::createStructures() [with GR = lemon::SmartDigraph; CM = lemon::DigraphExtender::ArcMap; TR = lemon::MinCostArborescence::ArcMap >::SetArborescenceMapTraits::ArcMap >]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/min_cost_arborescence.h:236:22: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/array_map.h: In member function 'void lemon::MinCostArborescence::createStructures() [with GR = lemon::SmartDigraph; CM = lemon::DigraphExtender::ArcMap; TR = lemon::MinCostArborescence::ArcMap >::SetArborescenceMapTraits::ArcMap >]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/array_map.h:91:44: note: '' declared here 91 | allocator.construct(&(values[id]), Value()); | ^~~~~~~ [ 78%] Linking CXX executable min_cost_arborescence_test cd /build/reproducible-path/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 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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,-z,relro -Wl,-z,now -rdynamic CMakeFiles/min_cost_arborescence_test.dir/min_cost_arborescence_test.cc.o -o min_cost_arborescence_test -L/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[5]: Leaving directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 78%] Built target min_cost_arborescence_test make -f test/CMakeFiles/min_cost_flow_test.dir/build.make test/CMakeFiles/min_cost_flow_test.dir/depend make[5]: Entering directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /build/reproducible-path/liblemon-1.3.1+dfsg /build/reproducible-path/liblemon-1.3.1+dfsg/test /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test/CMakeFiles/min_cost_flow_test.dir/DependInfo.cmake "--color=" make[5]: Leaving directory '/build/reproducible-path/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 '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 79%] Building CXX object test/CMakeFiles/min_cost_flow_test.dir/min_cost_flow_test.cc.o cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -I/build/reproducible-path/liblemon-1.3.1+dfsg -I/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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 -MD -MT test/CMakeFiles/min_cost_flow_test.dir/min_cost_flow_test.cc.o -MF CMakeFiles/min_cost_flow_test.dir/min_cost_flow_test.cc.o.d -o CMakeFiles/min_cost_flow_test.dir/min_cost_flow_test.cc.o -c /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lgf_writer.h:37, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:36, from /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:24: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:1973:21: warning: 'template struct std::iterator' is deprecated [-Wdeprecated-declarations] 1973 | : public std::iterator { | ^~~~~~~~ In file included from /usr/include/c++/13/bits/stl_iterator_base_funcs.h:66, from /usr/include/c++/13/string:47, from /usr/include/c++/13/bits/locale_classes.h:40, from /usr/include/c++/13/bits/ios_base.h:41, from /usr/include/c++/13/ios:44, from /usr/include/c++/13/ostream:40, from /usr/include/c++/13/iostream:41, from /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:19: /usr/include/c++/13/bits/stl_iterator_base_types.h:127:34: note: declared here 127 | struct _GLIBCXX17_DEPRECATED iterator | ^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:3135:21: warning: 'template struct std::iterator' is deprecated [-Wdeprecated-declarations] 3135 | : public std::iterator { | ^~~~~~~~ /usr/include/c++/13/bits/stl_iterator_base_types.h:127:34: note: declared here 127 | struct _GLIBCXX17_DEPRECATED iterator | ^~~~~~~~ In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/connectivity.h:28, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:32, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:37, from /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:29: /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseDigraphComponent; Type = concepts::Digraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = concepts::Digraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = McfClassConcept; Type = NetworkSimplex]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:463:39: required from here /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent<>; Type = concepts::Digraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = concepts::Digraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = McfClassConcept; Type = NetworkSimplex]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:463:39: required from here /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IDableDigraphComponent<>; Type = concepts::Digraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = concepts::Digraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = McfClassConcept; Type = NetworkSimplex]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:463:39: required from here /build/reproducible-path/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; | ~~~~^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~^~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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); | ~~~~^~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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 /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:26: /build/reproducible-path/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]': /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/network_simplex.h:1577:47: required from 'lemon::NetworkSimplex::ProblemType lemon::NetworkSimplex::start(PivotRule) [with GR = lemon::concepts::Digraph; V = int; C = int]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/network_simplex.h:834:19: required from 'lemon::NetworkSimplex::ProblemType lemon::NetworkSimplex::run(PivotRule) [with GR = lemon::concepts::Digraph; V = int; C = int]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:166:18: required from 'void McfClassConcept::Constraints::constraints() [with MCF = lemon::NetworkSimplex; GR = lemon::concepts::Digraph; Value = int; Cost = int]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = McfClassConcept; Type = NetworkSimplex]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:463:39: required from here /build/reproducible-path/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; | ~~^~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~^~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; | ~~~~~~~~^~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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]': /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/network_simplex.h:1577:47: required from 'lemon::NetworkSimplex::ProblemType lemon::NetworkSimplex::start(PivotRule) [with GR = lemon::concepts::Digraph; V = double; C = double]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/network_simplex.h:834:19: required from 'lemon::NetworkSimplex::ProblemType lemon::NetworkSimplex::run(PivotRule) [with GR = lemon::concepts::Digraph; V = double; C = double]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:166:18: required from 'void McfClassConcept::Constraints::constraints() [with MCF = lemon::NetworkSimplex; GR = lemon::concepts::Digraph; Value = double; Cost = double]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = McfClassConcept; Type = NetworkSimplex]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:465:47: required from here /build/reproducible-path/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; | ~~^~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~^~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; | ~~~~~~~~^~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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]': /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/network_simplex.h:1577:47: required from 'lemon::NetworkSimplex::ProblemType lemon::NetworkSimplex::start(PivotRule) [with GR = lemon::concepts::Digraph; V = int; C = double]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/network_simplex.h:834:19: required from 'lemon::NetworkSimplex::ProblemType lemon::NetworkSimplex::run(PivotRule) [with GR = lemon::concepts::Digraph; V = int; C = double]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:166:18: required from 'void McfClassConcept::Constraints::constraints() [with MCF = lemon::NetworkSimplex; GR = lemon::concepts::Digraph; Value = int; Cost = double]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = McfClassConcept; Type = NetworkSimplex]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:467:52: required from here /build/reproducible-path/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; | ~~^~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~^~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; | ~~~~~~~~^~~ /build/reproducible-path/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 /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/cost_scaling.h:34, from /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:28: /build/reproducible-path/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 >]': /build/reproducible-path/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 >]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/cost_scaling.h:861:34: required from 'lemon::CostScaling::ProblemType lemon::CostScaling::init() [with GR = lemon::concepts::Digraph; V = int; C = int; TR = lemon::CostScalingDefaultTraits]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/cost_scaling.h:512:24: required from 'lemon::CostScaling::ProblemType lemon::CostScaling::run(Method, int) [with GR = lemon::concepts::Digraph; V = int; C = int; TR = lemon::CostScalingDefaultTraits]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:166:18: required from 'void McfClassConcept::Constraints::constraints() [with MCF = lemon::CostScaling; GR = lemon::concepts::Digraph; Value = int; Cost = int]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = McfClassConcept; Type = CostScaling]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:488:36: required from here /build/reproducible-path/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) { | ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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 >]': /build/reproducible-path/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 >]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/cost_scaling.h:861:34: required from 'lemon::CostScaling::ProblemType lemon::CostScaling::init() [with GR = lemon::concepts::Digraph; V = double; C = double; TR = lemon::CostScalingDefaultTraits]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/cost_scaling.h:512:24: required from 'lemon::CostScaling::ProblemType lemon::CostScaling::run(Method, int) [with GR = lemon::concepts::Digraph; V = double; C = double; TR = lemon::CostScalingDefaultTraits]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:166:18: required from 'void McfClassConcept::Constraints::constraints() [with MCF = lemon::CostScaling; GR = lemon::concepts::Digraph; Value = double; Cost = double]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = McfClassConcept; Type = CostScaling]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:490:44: required from here /build/reproducible-path/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) { | ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/circulation.h:23: /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/circulation.h:555:24: 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 >]' /build/reproducible-path/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 >]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/cost_scaling.h:861:34: required from 'lemon::CostScaling::ProblemType lemon::CostScaling::init() [with GR = lemon::concepts::Digraph; V = int; C = int; TR = lemon::CostScalingDefaultTraits]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/cost_scaling.h:512:24: required from 'lemon::CostScaling::ProblemType lemon::CostScaling::run(Method, int) [with GR = lemon::concepts::Digraph; V = int; C = int; TR = lemon::CostScalingDefaultTraits]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:166:18: required from 'void McfClassConcept::Constraints::constraints() [with MCF = lemon::CostScaling; GR = lemon::concepts::Digraph; Value = int; Cost = int]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = McfClassConcept; Type = CostScaling]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:488:36: required from here /build/reproducible-path/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; | ~~^~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItem<'n'>; Type = concepts::Digraph::Node]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseDigraphComponent; Type = concepts::Digraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = concepts::Digraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = McfClassConcept; Type = NetworkSimplex]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:463:39: required from here /build/reproducible-path/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; | ~~^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~^~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItem<'a'>; Type = concepts::Digraph::Arc]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseDigraphComponent; Type = concepts::Digraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = concepts::Digraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = McfClassConcept; Type = NetworkSimplex]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:463:39: required from here /build/reproducible-path/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; | ~~^~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; | ~~~^~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; | ~~~^~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItemIt; Type = concepts::Digraph::ArcIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent<>; Type = concepts::Digraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = concepts::Digraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = McfClassConcept; Type = NetworkSimplex]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:463:39: required from here /build/reproducible-path/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; | ~~~~^~~~~~~ /build/reproducible-path/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) { } | ^~~~~ /build/reproducible-path/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; | ~~~~~~^~~~~ /build/reproducible-path/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) { } | ^~~~~ /build/reproducible-path/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; | ~~~^~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItemIt; Type = concepts::Digraph::NodeIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent<>; Type = concepts::Digraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = concepts::Digraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = McfClassConcept; Type = NetworkSimplex]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:463:39: required from here /build/reproducible-path/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; | ~~~~^~~~~~~ /build/reproducible-path/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) { } | ^~~~~~ /build/reproducible-path/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; | ~~~~~~^~~~~ /build/reproducible-path/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) { } | ^~~~~~ /build/reproducible-path/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; | ~~~^~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphIncIt; Type = concepts::Digraph::InArcIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent<>; Type = concepts::Digraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = concepts::Digraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = McfClassConcept; Type = NetworkSimplex]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:463:39: required from here /build/reproducible-path/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; | ~~~~^~~~~~~ /build/reproducible-path/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) { } | ^~~~~~~ /build/reproducible-path/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; | ~~~~~~^~~~~ /build/reproducible-path/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) { } | ^~~~~~~ /build/reproducible-path/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; | ~~^~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphIncIt; Type = concepts::Digraph::OutArcIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent<>; Type = concepts::Digraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = concepts::Digraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = McfClassConcept; Type = NetworkSimplex]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:463:39: required from here /build/reproducible-path/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; | ~~~~^~~~~~~ /build/reproducible-path/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) { } | ^~~~~~~~ /build/reproducible-path/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; | ~~~~~~^~~~~ /build/reproducible-path/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) { } | ^~~~~~~~ /build/reproducible-path/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; | ~~^~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/elevator.h: In instantiation of 'void lemon::Elevator::swap(Vit, Vit) [with GR = lemon::concepts::Digraph; Item = lemon::concepts::Digraph::Node; Vit = lemon::concepts::Digraph::Node*]': /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/circulation.h:557:28: 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 >]' /build/reproducible-path/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 >]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/cost_scaling.h:861:34: required from 'lemon::CostScaling::ProblemType lemon::CostScaling::init() [with GR = lemon::concepts::Digraph; V = int; C = int; TR = lemon::CostScalingDefaultTraits]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/cost_scaling.h:512:24: required from 'lemon::CostScaling::ProblemType lemon::CostScaling::run(Method, int) [with GR = lemon::concepts::Digraph; V = int; C = int; TR = lemon::CostScalingDefaultTraits]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:166:18: required from 'void McfClassConcept::Constraints::constraints() [with MCF = lemon::CostScaling; GR = lemon::concepts::Digraph; Value = int; Cost = int]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = McfClassConcept; Type = CostScaling]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:488:36: required from here /build/reproducible-path/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]; | ~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/elevator.h: In instantiation of 'void lemon::Elevator::copy(Vit, Vit) [with GR = lemon::concepts::Digraph; Item = lemon::concepts::Digraph::Node; Vit = lemon::concepts::Digraph::Node*]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/elevator.h:264:11: required from 'void lemon::Elevator::liftHighestActiveToTop() [with GR = lemon::concepts::Digraph; Item = lemon::concepts::Digraph::Node]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/circulation.h:633:41: 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 >]' /build/reproducible-path/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 >]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/cost_scaling.h:861:34: required from 'lemon::CostScaling::ProblemType lemon::CostScaling::init() [with GR = lemon::concepts::Digraph; V = int; C = int; TR = lemon::CostScalingDefaultTraits]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/cost_scaling.h:512:24: required from 'lemon::CostScaling::ProblemType lemon::CostScaling::run(Method, int) [with GR = lemon::concepts::Digraph; V = int; C = int; TR = lemon::CostScalingDefaultTraits]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:166:18: required from 'void McfClassConcept::Constraints::constraints() [with MCF = lemon::CostScaling; GR = lemon::concepts::Digraph; Value = int; Cost = int]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = McfClassConcept; Type = CostScaling]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:488:36: required from here /build/reproducible-path/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; | ~~^~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/elevator.h: In instantiation of 'void lemon::Elevator::copy(Item, Vit) [with GR = lemon::concepts::Digraph; Item = lemon::concepts::Digraph::Node; Vit = lemon::concepts::Digraph::Node*]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/elevator.h:270:11: required from 'void lemon::Elevator::liftHighestActiveToTop() [with GR = lemon::concepts::Digraph; Item = lemon::concepts::Digraph::Node]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/circulation.h:633:41: 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 >]' /build/reproducible-path/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 >]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/cost_scaling.h:861:34: required from 'lemon::CostScaling::ProblemType lemon::CostScaling::init() [with GR = lemon::concepts::Digraph; V = int; C = int; TR = lemon::CostScalingDefaultTraits]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/cost_scaling.h:512:24: required from 'lemon::CostScaling::ProblemType lemon::CostScaling::run(Method, int) [with GR = lemon::concepts::Digraph; V = int; C = int; TR = lemon::CostScalingDefaultTraits]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:166:18: required from 'void McfClassConcept::Constraints::constraints() [with MCF = lemon::CostScaling; GR = lemon::concepts::Digraph; Value = int; Cost = int]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = McfClassConcept; Type = CostScaling]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:488:36: required from here /build/reproducible-path/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; | ~~^~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItem<>; Type = concepts::Digraph::ArcIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItemIt; Type = concepts::Digraph::ArcIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent<>; Type = concepts::Digraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = concepts::Digraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = McfClassConcept; Type = NetworkSimplex]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:463:39: required from here /build/reproducible-path/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; | ~~^~~~~~~~ /build/reproducible-path/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) { } | ^~~~~ /build/reproducible-path/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; | ~~~^~~~ /build/reproducible-path/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) { } | ^~~~~ /build/reproducible-path/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; | ~~~^~~~~~~~~ /build/reproducible-path/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) { } | ^~~~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItem<>; Type = concepts::Digraph::NodeIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItemIt; Type = concepts::Digraph::NodeIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent<>; Type = concepts::Digraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = concepts::Digraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = McfClassConcept; Type = NetworkSimplex]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:463:39: required from here /build/reproducible-path/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; | ~~^~~~~~~~ /build/reproducible-path/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) { } | ^~~~~~ /build/reproducible-path/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; | ~~~^~~~ /build/reproducible-path/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) { } | ^~~~~~ /build/reproducible-path/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; | ~~~^~~~~~~~~ /build/reproducible-path/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) { } | ^~~~~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItem<'i'>; Type = concepts::Digraph::InArcIt]' /build/reproducible-path/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']' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphIncIt; Type = concepts::Digraph::InArcIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent<>; Type = concepts::Digraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = concepts::Digraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = McfClassConcept; Type = NetworkSimplex]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:463:39: required from here /build/reproducible-path/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; | ~~^~~~~~~~ /build/reproducible-path/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) { } | ^~~~~~~ /build/reproducible-path/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; | ~~~^~~~ /build/reproducible-path/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) { } | ^~~~~~~ /build/reproducible-path/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; | ~~~^~~~~~~~~ /build/reproducible-path/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) { } | ^~~~~~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItem<'o'>; Type = concepts::Digraph::OutArcIt]' /build/reproducible-path/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']' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphIncIt; Type = concepts::Digraph::OutArcIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent<>; Type = concepts::Digraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = concepts::Digraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = McfClassConcept; Type = NetworkSimplex]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:463:39: required from here /build/reproducible-path/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; | ~~^~~~~~~~ /build/reproducible-path/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) { } | ^~~~~~~~ /build/reproducible-path/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; | ~~~^~~~ /build/reproducible-path/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) { } | ^~~~~~~~ /build/reproducible-path/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; | ~~~^~~~~~~~~ /build/reproducible-path/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++/13/vector:72, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/core.h:22, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/list_graph.h:26, from /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_cost_flow_test.cc:23: /usr/include/c++/13/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {long long int}; _Tp = long long int; _Alloc = std::allocator]': /usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/13/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_fill_insert(iterator, 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++/13/bits/vector.tcc:529: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' changed in GCC 7.1 529 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/13/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_fill_insert(iterator, 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++/13/bits/vector.tcc:529: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' changed in GCC 7.1 In member function 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {long long int}; _Tp = long long int; _Alloc = std::allocator]', inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = long long int; _Alloc = std::allocator]' at /usr/include/c++/13/bits/stl_vector.h:1296:21, inlined from 'void lemon::CostScaling::start(Method) [with GR = lemon::ListDigraph; V = int; C = int; TR = lemon::CostScalingDefaultTraits]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/cost_scaling.h:965:31: /usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/13/vector:66: In member function 'void std::vector<_Tp, _Alloc>::resize(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>]', inlined from 'bool lemon::HartmannOrlinMmc::initComponent(int) [with GR = lemon::StaticDigraph; CM = lemon::CycleCanceling::StaticVectorMap; TR = lemon::HartmannOrlinMmc::StaticVectorMap, lemon::HartmannOrlinMmcDefaultTraits::StaticVectorMap, true> >::SetPathTraits >]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/hartmann_orlin_mmc.h:512:35, inlined from 'bool lemon::HartmannOrlinMmc::findCycleMean() [with GR = lemon::StaticDigraph; CM = lemon::CycleCanceling::StaticVectorMap; TR = lemon::HartmannOrlinMmc::StaticVectorMap, lemon::HartmannOrlinMmcDefaultTraits::StaticVectorMap, true> >::SetPathTraits >]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/hartmann_orlin_mmc.h:353:27: /usr/include/c++/13/bits/stl_vector.h:1034:25: 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 1034 | _M_fill_insert(end(), __new_size - size(), __x); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = lemon::HartmannOrlinMmc::StaticVectorMap, lemon::HartmannOrlinMmcDefaultTraits::StaticVectorMap, true> >::PathData; _Alloc = std::allocator::StaticVectorMap, lemon::HartmannOrlinMmcDefaultTraits::StaticVectorMap, true> >::PathData>]', inlined from 'bool lemon::HartmannOrlinMmc::initComponent(int) [with GR = lemon::StaticDigraph; CM = lemon::CycleCanceling::StaticVectorMap; TR = lemon::HartmannOrlinMmcDefaultTraits::StaticVectorMap, true>]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/hartmann_orlin_mmc.h:512:35, inlined from 'bool lemon::HartmannOrlinMmc::findCycleMean() [with GR = lemon::StaticDigraph; CM = lemon::CycleCanceling::StaticVectorMap; TR = lemon::HartmannOrlinMmcDefaultTraits::StaticVectorMap, true>]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/hartmann_orlin_mmc.h:353:27, inlined from 'void lemon::CycleCanceling::startCancelAndTighten() [with GR = lemon::ListDigraph; V = int; C = int]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/cycle_canceling.h:1196:33: /usr/include/c++/13/bits/stl_vector.h:1034:25: 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 1034 | _M_fill_insert(end(), __new_size - size(), __x); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ [ 80%] Linking CXX executable min_cost_flow_test cd /build/reproducible-path/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 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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,-z,relro -Wl,-z,now -rdynamic CMakeFiles/min_cost_flow_test.dir/min_cost_flow_test.cc.o -o min_cost_flow_test -L/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[5]: Leaving directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 80%] Built target min_cost_flow_test make -f test/CMakeFiles/min_mean_cycle_test.dir/build.make test/CMakeFiles/min_mean_cycle_test.dir/depend make[5]: Entering directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /build/reproducible-path/liblemon-1.3.1+dfsg /build/reproducible-path/liblemon-1.3.1+dfsg/test /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test/CMakeFiles/min_mean_cycle_test.dir/DependInfo.cmake "--color=" make[5]: Leaving directory '/build/reproducible-path/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 '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 81%] Building CXX object test/CMakeFiles/min_mean_cycle_test.dir/min_mean_cycle_test.cc.o cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -I/build/reproducible-path/liblemon-1.3.1+dfsg -I/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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 -MD -MT test/CMakeFiles/min_mean_cycle_test.dir/min_mean_cycle_test.cc.o -MF CMakeFiles/min_mean_cycle_test.dir/min_mean_cycle_test.cc.o.d -o CMakeFiles/min_mean_cycle_test.dir/min_mean_cycle_test.cc.o -c /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lgf_writer.h:37, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:36, from /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:23: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:1973:21: warning: 'template struct std::iterator' is deprecated [-Wdeprecated-declarations] 1973 | : public std::iterator { | ^~~~~~~~ In file included from /usr/include/c++/13/bits/stl_iterator_base_funcs.h:66, from /usr/include/c++/13/string:47, from /usr/include/c++/13/bits/locale_classes.h:40, from /usr/include/c++/13/bits/ios_base.h:41, from /usr/include/c++/13/ios:44, from /usr/include/c++/13/ostream:40, from /usr/include/c++/13/iostream:41, from /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:19: /usr/include/c++/13/bits/stl_iterator_base_types.h:127:34: note: declared here 127 | struct _GLIBCXX17_DEPRECATED iterator | ^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:3135:21: warning: 'template struct std::iterator' is deprecated [-Wdeprecated-declarations] 3135 | : public std::iterator { | ^~~~~~~~ /usr/include/c++/13/bits/stl_iterator_base_types.h:127:34: note: declared here 127 | struct _GLIBCXX17_DEPRECATED iterator | ^~~~~~~~ In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:28: /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:86:24: required from 'void MmcClassConcept::Constraints::constraints() [with MMC = lemon::KarpMmc >; GR = lemon::concepts::Digraph; Cost = int]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = MmcClassConcept; Type = KarpMmc >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:153:66: required from here /build/reproducible-path/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 /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:25: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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) { | ~~~^~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~^~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:86:24: required from 'void MmcClassConcept::Constraints::constraints() [with MMC = lemon::KarpMmc >; GR = lemon::concepts::Digraph; Cost = float]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = MmcClassConcept; Type = KarpMmc >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:155:68: required from here /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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) { | ~~~^~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~^~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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 /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:29: /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:85:28: required from 'void MmcClassConcept::Constraints::constraints() [with MMC = lemon::HartmannOrlinMmc >; GR = lemon::concepts::Digraph; Cost = int]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = MmcClassConcept; Type = HartmannOrlinMmc >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:159:75: required from here /build/reproducible-path/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; | ~~~~~~~~~~~^~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:86:24: required from 'void MmcClassConcept::Constraints::constraints() [with MMC = lemon::HartmannOrlinMmc >; GR = lemon::concepts::Digraph; Cost = int]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = MmcClassConcept; Type = HartmannOrlinMmc >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:159:75: required from here /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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) { | ~~~^~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~^~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:85:28: required from 'void MmcClassConcept::Constraints::constraints() [with MMC = lemon::HartmannOrlinMmc >; GR = lemon::concepts::Digraph; Cost = float]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = MmcClassConcept; Type = HartmannOrlinMmc >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:161:77: required from here /build/reproducible-path/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; | ~~~~~~~~~~~^~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:86:24: required from 'void MmcClassConcept::Constraints::constraints() [with MMC = lemon::HartmannOrlinMmc >; GR = lemon::concepts::Digraph; Cost = float]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = MmcClassConcept; Type = HartmannOrlinMmc >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:161:77: required from here /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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) { | ~~~^~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~^~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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 /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:30: /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:85:28: required from 'void MmcClassConcept::Constraints::constraints() [with MMC = lemon::HowardMmc >; GR = lemon::concepts::Digraph; Cost = int]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = MmcClassConcept; Type = HowardMmc >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:165:68: required from here /build/reproducible-path/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; | ~~~~~~~~~~~^~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:86:24: required from 'void MmcClassConcept::Constraints::constraints() [with MMC = lemon::HowardMmc >; GR = lemon::concepts::Digraph; Cost = int]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = MmcClassConcept; Type = HowardMmc >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:165:68: required from here /build/reproducible-path/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; ) { | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:85:28: required from 'void MmcClassConcept::Constraints::constraints() [with MMC = lemon::HowardMmc >; GR = lemon::concepts::Digraph; Cost = float]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = MmcClassConcept; Type = HowardMmc >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:167:70: required from here /build/reproducible-path/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; | ~~~~~~~~~~~^~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:86:24: required from 'void MmcClassConcept::Constraints::constraints() [with MMC = lemon::HowardMmc >; GR = lemon::concepts::Digraph; Cost = float]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = MmcClassConcept; Type = HowardMmc >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:167:70: required from here /build/reproducible-path/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; ) { | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:85:28: required from 'void MmcClassConcept::Constraints::constraints() [with MMC = lemon::KarpMmc >; GR = lemon::concepts::Digraph; Cost = int]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = MmcClassConcept; Type = KarpMmc >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:153:66: required from here /build/reproducible-path/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; | ~~~~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:85:28: required from 'void MmcClassConcept::Constraints::constraints() [with MMC = lemon::KarpMmc >; GR = lemon::concepts::Digraph; Cost = int]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = MmcClassConcept; Type = KarpMmc >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:153:66: required from here /build/reproducible-path/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; | ~~~~~~~~~~~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:24: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/path.h: In instantiation of 'void lemon::ListPath::addFront(const Arc&) [with GR = lemon::concepts::Digraph; Arc = lemon::concepts::Digraph::Arc]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/karp_mmc.h:371:28: required from 'bool lemon::KarpMmc::findCycle() [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::KarpMmc, lemon::KarpMmc >::SetPathTraits > >::SetLargeCostTraits]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:86:24: required from 'void MmcClassConcept::Constraints::constraints() [with MMC = lemon::KarpMmc >; GR = lemon::concepts::Digraph; Cost = int]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = MmcClassConcept; Type = KarpMmc >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:153:66: required from here /build/reproducible-path/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; | ~~~~~~~~~~^~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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]': /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:85:28: required from 'void MmcClassConcept::Constraints::constraints() [with MMC = lemon::KarpMmc >; GR = lemon::concepts::Digraph; Cost = float]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = MmcClassConcept; Type = KarpMmc >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:155:68: required from here /build/reproducible-path/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; | ~~~~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:85:28: required from 'void MmcClassConcept::Constraints::constraints() [with MMC = lemon::KarpMmc >; GR = lemon::concepts::Digraph; Cost = float]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = MmcClassConcept; Type = KarpMmc >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:155:68: required from here /build/reproducible-path/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; | ~~~~~~~~~~~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:85:28: required from 'void MmcClassConcept::Constraints::constraints() [with MMC = lemon::HowardMmc >; GR = lemon::concepts::Digraph; Cost = int]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = MmcClassConcept; Type = HowardMmc >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:165:68: required from here /build/reproducible-path/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]; | ~~^~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~^~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~^~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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]': /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:85:28: required from 'void MmcClassConcept::Constraints::constraints() [with MMC = lemon::HowardMmc >; GR = lemon::concepts::Digraph; Cost = int]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = MmcClassConcept; Type = HowardMmc >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:165:68: required from here /build/reproducible-path/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]; | ~~^~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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])) { | ~~^~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; ) { | ~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; ) { | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:85:28: required from 'void MmcClassConcept::Constraints::constraints() [with MMC = lemon::HowardMmc >; GR = lemon::concepts::Digraph; Cost = int]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = MmcClassConcept; Type = HowardMmc >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:165:68: required from here /build/reproducible-path/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; | ~~~~~~~~~~^~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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++]; | ~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~^~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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++]; | ~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~^~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~^~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~^~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~^~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~^~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/path.h: In instantiation of 'void lemon::ListPath::addBack(const Arc&) [with GR = lemon::concepts::Digraph; Arc = lemon::concepts::Digraph::Arc]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/howard_mmc.h:414:27: required from 'bool lemon::HowardMmc::findCycle() [with GR = lemon::concepts::Digraph; CM = lemon::concepts::ReadMap; TR = lemon::HowardMmc, lemon::HowardMmc >::SetPathTraits > >::SetLargeCostTraits]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:86:24: required from 'void MmcClassConcept::Constraints::constraints() [with MMC = lemon::HowardMmc >; GR = lemon::concepts::Digraph; Cost = int]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = MmcClassConcept; Type = HowardMmc >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:165:68: required from here /build/reproducible-path/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; | ~~~~~~~~~~^~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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]': /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:85:28: required from 'void MmcClassConcept::Constraints::constraints() [with MMC = lemon::HowardMmc >; GR = lemon::concepts::Digraph; Cost = float]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = MmcClassConcept; Type = HowardMmc >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:167:70: required from here /build/reproducible-path/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]; | ~~^~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~^~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~^~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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]': /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:85:28: required from 'void MmcClassConcept::Constraints::constraints() [with MMC = lemon::HowardMmc >; GR = lemon::concepts::Digraph; Cost = float]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = MmcClassConcept; Type = HowardMmc >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:167:70: required from here /build/reproducible-path/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]; | ~~^~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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])) { | ~~^~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; ) { | ~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; ) { | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:85:28: required from 'void MmcClassConcept::Constraints::constraints() [with MMC = lemon::HowardMmc >; GR = lemon::concepts::Digraph; Cost = float]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = MmcClassConcept; Type = HowardMmc >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:167:70: required from here /build/reproducible-path/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; | ~~~~~~~~~~^~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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++]; | ~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~^~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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++]; | ~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~^~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~^~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~^~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~^~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~^~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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]': /build/reproducible-path/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]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:85:28: required from 'void MmcClassConcept::Constraints::constraints() [with MMC = lemon::KarpMmc >; GR = lemon::concepts::Digraph; Cost = int]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = MmcClassConcept; Type = KarpMmc >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:153:66: required from here /build/reproducible-path/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]; | ~~^~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~^~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/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]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:85:28: required from 'void MmcClassConcept::Constraints::constraints() [with MMC = lemon::KarpMmc >; GR = lemon::concepts::Digraph; Cost = int]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = MmcClassConcept; Type = KarpMmc >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:153:66: required from here /build/reproducible-path/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]; | ~~^~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~^~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/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]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:85:28: required from 'void MmcClassConcept::Constraints::constraints() [with MMC = lemon::KarpMmc >; GR = lemon::concepts::Digraph; Cost = float]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = MmcClassConcept; Type = KarpMmc >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:155:68: required from here /build/reproducible-path/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]; | ~~^~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~^~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/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]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:85:28: required from 'void MmcClassConcept::Constraints::constraints() [with MMC = lemon::KarpMmc >; GR = lemon::concepts::Digraph; Cost = float]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = MmcClassConcept; Type = KarpMmc >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:155:68: required from here /build/reproducible-path/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]; | ~~^~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~^~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/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]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:85:28: required from 'void MmcClassConcept::Constraints::constraints() [with MMC = lemon::HartmannOrlinMmc >; GR = lemon::concepts::Digraph; Cost = int]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = MmcClassConcept; Type = HartmannOrlinMmc >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:159:75: required from here /build/reproducible-path/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]; | ~~^~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~^~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/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]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:85:28: required from 'void MmcClassConcept::Constraints::constraints() [with MMC = lemon::HartmannOrlinMmc >; GR = lemon::concepts::Digraph; Cost = int]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = MmcClassConcept; Type = HartmannOrlinMmc >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:159:75: required from here /build/reproducible-path/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]; | ~~^~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~^~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/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]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:85:28: required from 'void MmcClassConcept::Constraints::constraints() [with MMC = lemon::HartmannOrlinMmc >; GR = lemon::concepts::Digraph; Cost = int]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = MmcClassConcept; Type = HartmannOrlinMmc >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:159:75: required from here /build/reproducible-path/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]; | ~~^~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~^~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/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]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:85:28: required from 'void MmcClassConcept::Constraints::constraints() [with MMC = lemon::HartmannOrlinMmc >; GR = lemon::concepts::Digraph; Cost = float]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = MmcClassConcept; Type = HartmannOrlinMmc >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:161:77: required from here /build/reproducible-path/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]; | ~~^~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~^~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/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]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:85:28: required from 'void MmcClassConcept::Constraints::constraints() [with MMC = lemon::HartmannOrlinMmc >; GR = lemon::concepts::Digraph; Cost = float]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = MmcClassConcept; Type = HartmannOrlinMmc >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:161:77: required from here /build/reproducible-path/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]; | ~~^~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~^~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/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]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:85:28: required from 'void MmcClassConcept::Constraints::constraints() [with MMC = lemon::HartmannOrlinMmc >; GR = lemon::concepts::Digraph; Cost = float]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = MmcClassConcept; Type = HartmannOrlinMmc >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:161:77: required from here /build/reproducible-path/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]; | ~~^~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~^~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/connectivity.h:22, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/karp_mmc.h:32: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/dfs.h: In instantiation of 'void lemon::DfsVisit::addSource(Node) [with GR = lemon::concepts::Digraph; VS = lemon::_connectivity_bits::LeaveOrderVisitor > > >; TR = lemon::DfsVisitDefaultTraits; Node = lemon::concepts::Digraph::Node]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/connectivity.h:426:22: required from 'int lemon::stronglyConnectedComponents(const Digraph&, NodeMap&) [with Digraph = concepts::Digraph; NodeMap = concepts::Digraph::NodeMap]' /build/reproducible-path/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]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:85:28: required from 'void MmcClassConcept::Constraints::constraints() [with MMC = lemon::KarpMmc >; GR = lemon::concepts::Digraph; Cost = int]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = MmcClassConcept; Type = KarpMmc >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:153:66: required from here /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~^~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/dfs.h: In instantiation of 'void lemon::DfsVisit::addSource(Node) [with GR = lemon::ReverseDigraph; VS = lemon::_connectivity_bits::FillMapVisitor, lemon::concepts::Digraph::NodeMap >; TR = lemon::DfsVisitDefaultTraits >; Node = lemon::concepts::Digraph::Node]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/connectivity.h:446:23: required from 'int lemon::stronglyConnectedComponents(const Digraph&, NodeMap&) [with Digraph = concepts::Digraph; NodeMap = concepts::Digraph::NodeMap]' /build/reproducible-path/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]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:85:28: required from 'void MmcClassConcept::Constraints::constraints() [with MMC = lemon::KarpMmc >; GR = lemon::concepts::Digraph; Cost = int]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = MmcClassConcept; Type = KarpMmc >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:153:66: required from here /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~^~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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 > >; Node = lemon::concepts::Digraph::Node]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/dfs.h:1416:28: required from 'void lemon::DfsVisit::addSource(Node) [with GR = lemon::concepts::Digraph; VS = lemon::_connectivity_bits::LeaveOrderVisitor > > >; TR = lemon::DfsVisitDefaultTraits; Node = lemon::concepts::Digraph::Node]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/connectivity.h:426:22: required from 'int lemon::stronglyConnectedComponents(const Digraph&, NodeMap&) [with Digraph = concepts::Digraph; NodeMap = concepts::Digraph::NodeMap]' /build/reproducible-path/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]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:85:28: required from 'void MmcClassConcept::Constraints::constraints() [with MMC = lemon::KarpMmc >; GR = lemon::concepts::Digraph; Cost = int]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = MmcClassConcept; Type = KarpMmc >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:153:66: required from here /build/reproducible-path/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; | ~~~~~~~~~^~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; Arc = lemon::concepts::Digraph::Arc]': /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/connectivity.h:427:18: required from 'int lemon::stronglyConnectedComponents(const Digraph&, NodeMap&) [with Digraph = concepts::Digraph; NodeMap = concepts::Digraph::NodeMap]' /build/reproducible-path/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]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:85:28: required from 'void MmcClassConcept::Constraints::constraints() [with MMC = lemon::KarpMmc >; GR = lemon::concepts::Digraph; Cost = int]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = MmcClassConcept; Type = KarpMmc >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:153:66: required from here /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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 >; Arc = lemon::concepts::Digraph::Arc]': /build/reproducible-path/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 >]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/connectivity.h:447:19: required from 'int lemon::stronglyConnectedComponents(const Digraph&, NodeMap&) [with Digraph = concepts::Digraph; NodeMap = concepts::Digraph::NodeMap]' /build/reproducible-path/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]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:85:28: required from 'void MmcClassConcept::Constraints::constraints() [with MMC = lemon::KarpMmc >; GR = lemon::concepts::Digraph; Cost = int]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = MmcClassConcept; Type = KarpMmc >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:153:66: required from here /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:29: /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseDigraphComponent; Type = concepts::Digraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = concepts::Digraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/connectivity.h:408:45: required from 'int lemon::stronglyConnectedComponents(const Digraph&, NodeMap&) [with Digraph = concepts::Digraph; NodeMap = concepts::Digraph::NodeMap]' /build/reproducible-path/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]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:85:28: required from 'void MmcClassConcept::Constraints::constraints() [with MMC = lemon::KarpMmc >; GR = lemon::concepts::Digraph; Cost = int]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = MmcClassConcept; Type = KarpMmc >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:153:66: required from here /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent<>; Type = concepts::Digraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = concepts::Digraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/connectivity.h:408:45: required from 'int lemon::stronglyConnectedComponents(const Digraph&, NodeMap&) [with Digraph = concepts::Digraph; NodeMap = concepts::Digraph::NodeMap]' /build/reproducible-path/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]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:85:28: required from 'void MmcClassConcept::Constraints::constraints() [with MMC = lemon::KarpMmc >; GR = lemon::concepts::Digraph; Cost = int]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = MmcClassConcept; Type = KarpMmc >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:153:66: required from here /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IDableDigraphComponent<>; Type = concepts::Digraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = concepts::Digraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/connectivity.h:408:45: required from 'int lemon::stronglyConnectedComponents(const Digraph&, NodeMap&) [with Digraph = concepts::Digraph; NodeMap = concepts::Digraph::NodeMap]' /build/reproducible-path/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]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:85:28: required from 'void MmcClassConcept::Constraints::constraints() [with MMC = lemon::KarpMmc >; GR = lemon::concepts::Digraph; Cost = int]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = MmcClassConcept; Type = KarpMmc >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:153:66: required from here /build/reproducible-path/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; | ~~~~^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~^~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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); | ~~~~^~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItem<'n'>; Type = concepts::Digraph::Node]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseDigraphComponent; Type = concepts::Digraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = concepts::Digraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/connectivity.h:408:45: required from 'int lemon::stronglyConnectedComponents(const Digraph&, NodeMap&) [with Digraph = concepts::Digraph; NodeMap = concepts::Digraph::NodeMap]' /build/reproducible-path/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]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:85:28: required from 'void MmcClassConcept::Constraints::constraints() [with MMC = lemon::KarpMmc >; GR = lemon::concepts::Digraph; Cost = int]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = MmcClassConcept; Type = KarpMmc >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:153:66: required from here /build/reproducible-path/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; | ~~^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~^~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItem<'a'>; Type = concepts::Digraph::Arc]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::BaseDigraphComponent; Type = concepts::Digraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = concepts::Digraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/connectivity.h:408:45: required from 'int lemon::stronglyConnectedComponents(const Digraph&, NodeMap&) [with Digraph = concepts::Digraph; NodeMap = concepts::Digraph::NodeMap]' /build/reproducible-path/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]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:85:28: required from 'void MmcClassConcept::Constraints::constraints() [with MMC = lemon::KarpMmc >; GR = lemon::concepts::Digraph; Cost = int]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = MmcClassConcept; Type = KarpMmc >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:153:66: required from here /build/reproducible-path/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; | ~~^~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; | ~~~^~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; | ~~~^~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItemIt; Type = concepts::Digraph::ArcIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent<>; Type = concepts::Digraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = concepts::Digraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/connectivity.h:408:45: required from 'int lemon::stronglyConnectedComponents(const Digraph&, NodeMap&) [with Digraph = concepts::Digraph; NodeMap = concepts::Digraph::NodeMap]' /build/reproducible-path/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]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:85:28: required from 'void MmcClassConcept::Constraints::constraints() [with MMC = lemon::KarpMmc >; GR = lemon::concepts::Digraph; Cost = int]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = MmcClassConcept; Type = KarpMmc >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:153:66: required from here /build/reproducible-path/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; | ~~~~^~~~~~~ /build/reproducible-path/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) { } | ^~~~~ /build/reproducible-path/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; | ~~~~~~^~~~~ /build/reproducible-path/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) { } | ^~~~~ /build/reproducible-path/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; | ~~~^~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItemIt; Type = concepts::Digraph::NodeIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent<>; Type = concepts::Digraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = concepts::Digraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/connectivity.h:408:45: required from 'int lemon::stronglyConnectedComponents(const Digraph&, NodeMap&) [with Digraph = concepts::Digraph; NodeMap = concepts::Digraph::NodeMap]' /build/reproducible-path/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]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:85:28: required from 'void MmcClassConcept::Constraints::constraints() [with MMC = lemon::KarpMmc >; GR = lemon::concepts::Digraph; Cost = int]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = MmcClassConcept; Type = KarpMmc >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:153:66: required from here /build/reproducible-path/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; | ~~~~^~~~~~~ /build/reproducible-path/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) { } | ^~~~~~ /build/reproducible-path/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; | ~~~~~~^~~~~ /build/reproducible-path/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) { } | ^~~~~~ /build/reproducible-path/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; | ~~~^~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphIncIt; Type = concepts::Digraph::InArcIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent<>; Type = concepts::Digraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = concepts::Digraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/connectivity.h:408:45: required from 'int lemon::stronglyConnectedComponents(const Digraph&, NodeMap&) [with Digraph = concepts::Digraph; NodeMap = concepts::Digraph::NodeMap]' /build/reproducible-path/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]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:85:28: required from 'void MmcClassConcept::Constraints::constraints() [with MMC = lemon::KarpMmc >; GR = lemon::concepts::Digraph; Cost = int]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = MmcClassConcept; Type = KarpMmc >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:153:66: required from here /build/reproducible-path/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; | ~~~~^~~~~~~ /build/reproducible-path/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) { } | ^~~~~~~ /build/reproducible-path/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; | ~~~~~~^~~~~ /build/reproducible-path/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) { } | ^~~~~~~ /build/reproducible-path/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; | ~~^~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphIncIt; Type = concepts::Digraph::OutArcIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent<>; Type = concepts::Digraph]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Digraph; Type = concepts::Digraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/connectivity.h:408:45: required from 'int lemon::stronglyConnectedComponents(const Digraph&, NodeMap&) [with Digraph = concepts::Digraph; NodeMap = concepts::Digraph::NodeMap]' /build/reproducible-path/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]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:85:28: required from 'void MmcClassConcept::Constraints::constraints() [with MMC = lemon::KarpMmc >; GR = lemon::concepts::Digraph; Cost = int]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = MmcClassConcept; Type = KarpMmc >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:153:66: required from here /build/reproducible-path/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; | ~~~~^~~~~~~ /build/reproducible-path/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) { } | ^~~~~~~~ /build/reproducible-path/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; | ~~~~~~^~~~~ /build/reproducible-path/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) { } | ^~~~~~~~ /build/reproducible-path/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; | ~~^~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItem<>; Type = concepts::Digraph::ArcIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItemIt; Type = concepts::Digraph::ArcIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent<>; Type = concepts::Digraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/connectivity.h:408:45: required from 'int lemon::stronglyConnectedComponents(const Digraph&, NodeMap&) [with Digraph = concepts::Digraph; NodeMap = concepts::Digraph::NodeMap]' /build/reproducible-path/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]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:85:28: required from 'void MmcClassConcept::Constraints::constraints() [with MMC = lemon::KarpMmc >; GR = lemon::concepts::Digraph; Cost = int]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = MmcClassConcept; Type = KarpMmc >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:153:66: required from here /build/reproducible-path/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; | ~~^~~~~~~~ /build/reproducible-path/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) { } | ^~~~~ /build/reproducible-path/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; | ~~~^~~~ /build/reproducible-path/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) { } | ^~~~~ /build/reproducible-path/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; | ~~~^~~~~~~~~ /build/reproducible-path/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) { } | ^~~~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItem<>; Type = concepts::Digraph::NodeIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItemIt; Type = concepts::Digraph::NodeIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent<>; Type = concepts::Digraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/connectivity.h:408:45: required from 'int lemon::stronglyConnectedComponents(const Digraph&, NodeMap&) [with Digraph = concepts::Digraph; NodeMap = concepts::Digraph::NodeMap]' /build/reproducible-path/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]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:85:28: required from 'void MmcClassConcept::Constraints::constraints() [with MMC = lemon::KarpMmc >; GR = lemon::concepts::Digraph; Cost = int]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = MmcClassConcept; Type = KarpMmc >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:153:66: required from here /build/reproducible-path/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; | ~~^~~~~~~~ /build/reproducible-path/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) { } | ^~~~~~ /build/reproducible-path/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; | ~~~^~~~ /build/reproducible-path/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) { } | ^~~~~~ /build/reproducible-path/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; | ~~~^~~~~~~~~ /build/reproducible-path/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) { } | ^~~~~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItem<'i'>; Type = concepts::Digraph::InArcIt]' /build/reproducible-path/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']' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphIncIt; Type = concepts::Digraph::InArcIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent<>; Type = concepts::Digraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/connectivity.h:408:45: required from 'int lemon::stronglyConnectedComponents(const Digraph&, NodeMap&) [with Digraph = concepts::Digraph; NodeMap = concepts::Digraph::NodeMap]' /build/reproducible-path/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]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:85:28: required from 'void MmcClassConcept::Constraints::constraints() [with MMC = lemon::KarpMmc >; GR = lemon::concepts::Digraph; Cost = int]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = MmcClassConcept; Type = KarpMmc >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:153:66: required from here /build/reproducible-path/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; | ~~^~~~~~~~ /build/reproducible-path/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) { } | ^~~~~~~ /build/reproducible-path/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; | ~~~^~~~ /build/reproducible-path/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) { } | ^~~~~~~ /build/reproducible-path/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; | ~~~^~~~~~~~~ /build/reproducible-path/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) { } | ^~~~~~~ /build/reproducible-path/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']': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphItem<'o'>; Type = concepts::Digraph::OutArcIt]' /build/reproducible-path/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']' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::GraphIncIt; Type = concepts::Digraph::OutArcIt]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::IterableDigraphComponent<>; Type = concepts::Digraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:478:61: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/connectivity.h:408:45: required from 'int lemon::stronglyConnectedComponents(const Digraph&, NodeMap&) [with Digraph = concepts::Digraph; NodeMap = concepts::Digraph::NodeMap]' /build/reproducible-path/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]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:85:28: required from 'void MmcClassConcept::Constraints::constraints() [with MMC = lemon::KarpMmc >; GR = lemon::concepts::Digraph; Cost = int]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = MmcClassConcept; Type = KarpMmc >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:153:66: required from here /build/reproducible-path/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; | ~~^~~~~~~~ /build/reproducible-path/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) { } | ^~~~~~~~ /build/reproducible-path/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; | ~~~^~~~ /build/reproducible-path/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) { } | ^~~~~~~~ /build/reproducible-path/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; | ~~~^~~~~~~~~ /build/reproducible-path/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/arm-linux-gnueabihf/c++/13/bits/c++allocator.h:33, from /usr/include/c++/13/bits/allocator.h:46, from /usr/include/c++/13/string:43: In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::ArcT; _Args = {lemon::SmartDigraphBase::ArcT}; _Tp = lemon::SmartDigraphBase::ArcT]', inlined from 'static void std::allocator_traits >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::ArcT; _Args = {lemon::SmartDigraphBase::ArcT}; _Tp = lemon::SmartDigraphBase::ArcT]' at /usr/include/c++/13/bits/alloc_traits.h:538:17, inlined from 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {lemon::SmartDigraphBase::ArcT}; _Tp = lemon::SmartDigraphBase::ArcT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/vector.tcc:117:30, inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = lemon::SmartDigraphBase::ArcT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/stl_vector.h:1296:21, inlined from 'lemon::SmartDigraphBase::Arc lemon::SmartDigraphBase::addArc(Node, Node)' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:85:21, inlined from 'lemon::DigraphExtender::Arc lemon::DigraphExtender::addArc(const Node&, const Node&) [with Base = lemon::SmartDigraphBase]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:274:31: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/test/min_mean_cycle_test.cc:22: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h: In member function 'lemon::DigraphExtender::Arc lemon::DigraphExtender::addArc(const Node&, const Node&) [with Base = lemon::SmartDigraphBase]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:85:27: note: '' declared here 85 | arcs.push_back(ArcT()); | ^ In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]', inlined from 'static void std::allocator_traits >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = lemon::SmartDigraphBase::NodeT; _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT]' at /usr/include/c++/13/bits/alloc_traits.h:538:17, inlined from 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {lemon::SmartDigraphBase::NodeT}; _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/vector.tcc:117:30, inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = lemon::SmartDigraphBase::NodeT; _Alloc = std::allocator]' at /usr/include/c++/13/bits/stl_vector.h:1296:21, inlined from 'lemon::SmartDigraphBase::Node lemon::SmartDigraphBase::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:22, inlined from 'lemon::DigraphExtender::Node lemon::DigraphExtender::addNode() [with Base = lemon::SmartDigraphBase]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:268:34, inlined from 'lemon::DigraphExtender::Node lemon::SmartDigraph::addNode()' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:223:44, inlined from 'void lemon::DigraphReader::readNodes() [with DGR = lemon::SmartDigraph]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:954:31: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h: In member function 'void lemon::DigraphReader::readNodes() [with DGR = lemon::SmartDigraph]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:77:29: note: '' declared here 77 | nodes.push_back(NodeT()); | ^ In file included from /usr/include/c++/13/vector:72, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/smart_graph.h:26: /usr/include/c++/13/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_fill_insert(iterator, size_type, const value_type&) [with _Tp = lemon::KarpMmc::ArcMap >::PathData; _Alloc = std::allocator::ArcMap >::PathData>]': /usr/include/c++/13/bits/vector.tcc:529:5: note: parameter passing for argument of type 'std::vector::ArcMap >::PathData, std::allocator::ArcMap >::PathData> >::iterator' changed in GCC 7.1 529 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/13/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_fill_insert(iterator, size_type, const value_type&) [with _Tp = lemon::HartmannOrlinMmc::ArcMap >::PathData; _Alloc = std::allocator::ArcMap >::PathData>]': /usr/include/c++/13/bits/vector.tcc:529:5: note: parameter passing for argument of type 'std::vector::ArcMap >::PathData, std::allocator::ArcMap >::PathData> >::iterator' changed in GCC 7.1 In file included from /usr/include/c++/13/vector:66: In member function 'void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = lemon::KarpMmc::ArcMap >::PathData; _Alloc = std::allocator::ArcMap >::PathData>]', inlined from 'bool lemon::KarpMmc::initComponent(int) [with GR = lemon::SmartDigraph; CM = lemon::DigraphExtender::ArcMap; TR = lemon::KarpMmcDefaultTraits::ArcMap, true>]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/karp_mmc.h:494:35, inlined from 'bool lemon::KarpMmc::findCycleMean() [with GR = lemon::SmartDigraph; CM = lemon::DigraphExtender::ArcMap; TR = lemon::KarpMmcDefaultTraits::ArcMap, true>]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/karp_mmc.h:345:27: /usr/include/c++/13/bits/stl_vector.h:1034:25: 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 1034 | _M_fill_insert(end(), __new_size - size(), __x); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = lemon::HartmannOrlinMmc::ArcMap >::PathData; _Alloc = std::allocator::ArcMap >::PathData>]', inlined from 'bool lemon::HartmannOrlinMmc::initComponent(int) [with GR = lemon::SmartDigraph; CM = lemon::DigraphExtender::ArcMap; TR = lemon::HartmannOrlinMmcDefaultTraits::ArcMap, true>]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/hartmann_orlin_mmc.h:512:35, inlined from 'bool lemon::HartmannOrlinMmc::findCycleMean() [with GR = lemon::SmartDigraph; CM = lemon::DigraphExtender::ArcMap; TR = lemon::HartmannOrlinMmcDefaultTraits::ArcMap, true>]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/hartmann_orlin_mmc.h:353:27: /usr/include/c++/13/bits/stl_vector.h:1034:25: 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 1034 | _M_fill_insert(end(), __new_size - size(), __x); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ [ 83%] Linking CXX executable min_mean_cycle_test cd /build/reproducible-path/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 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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,-z,relro -Wl,-z,now -rdynamic CMakeFiles/min_mean_cycle_test.dir/min_mean_cycle_test.cc.o -o min_mean_cycle_test -L/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[5]: Leaving directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 83%] Built target min_mean_cycle_test make -f test/CMakeFiles/nagamochi_ibaraki_test.dir/build.make test/CMakeFiles/nagamochi_ibaraki_test.dir/depend make[5]: Entering directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /build/reproducible-path/liblemon-1.3.1+dfsg /build/reproducible-path/liblemon-1.3.1+dfsg/test /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test/CMakeFiles/nagamochi_ibaraki_test.dir/DependInfo.cmake "--color=" make[5]: Leaving directory '/build/reproducible-path/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 '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 84%] Building CXX object test/CMakeFiles/nagamochi_ibaraki_test.dir/nagamochi_ibaraki_test.cc.o cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -I/build/reproducible-path/liblemon-1.3.1+dfsg -I/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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 -MD -MT test/CMakeFiles/nagamochi_ibaraki_test.dir/nagamochi_ibaraki_test.cc.o -MF CMakeFiles/nagamochi_ibaraki_test.dir/nagamochi_ibaraki_test.cc.o.d -o CMakeFiles/nagamochi_ibaraki_test.dir/nagamochi_ibaraki_test.cc.o -c /build/reproducible-path/liblemon-1.3.1+dfsg/test/nagamochi_ibaraki_test.cc In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/adaptors.h:29, from /build/reproducible-path/liblemon-1.3.1+dfsg/test/nagamochi_ibaraki_test.cc:22: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:1973:21: warning: 'template struct std::iterator' is deprecated [-Wdeprecated-declarations] 1973 | : public std::iterator { | ^~~~~~~~ In file included from /usr/include/c++/13/bits/stl_iterator_base_funcs.h:66, from /usr/include/c++/13/string:47, from /usr/include/c++/13/bits/locale_classes.h:40, from /usr/include/c++/13/bits/ios_base.h:41, from /usr/include/c++/13/ios:44, from /usr/include/c++/13/istream:40, from /usr/include/c++/13/sstream:40, from /build/reproducible-path/liblemon-1.3.1+dfsg/test/nagamochi_ibaraki_test.cc:19: /usr/include/c++/13/bits/stl_iterator_base_types.h:127:34: note: declared here 127 | struct _GLIBCXX17_DEPRECATED iterator | ^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:3135:21: warning: 'template struct std::iterator' is deprecated [-Wdeprecated-declarations] 3135 | : public std::iterator { | ^~~~~~~~ /usr/include/c++/13/bits/stl_iterator_base_types.h:127:34: note: declared here 127 | struct _GLIBCXX17_DEPRECATED iterator | ^~~~~~~~ In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/test/nagamochi_ibaraki_test.cc:26: /build/reproducible-path/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 >]': /build/reproducible-path/liblemon-1.3.1+dfsg/test/nagamochi_ibaraki_test.cc:73:15: required from here /build/reproducible-path/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 /build/reproducible-path/liblemon-1.3.1+dfsg/test/nagamochi_ibaraki_test.cc:23: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~^~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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) { | ~~^~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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 >]': /build/reproducible-path/liblemon-1.3.1+dfsg/test/nagamochi_ibaraki_test.cc:75:31: required from here /build/reproducible-path/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) { | ~~^~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~^~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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]; | ~~^~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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) { | ~~^~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~~~~^~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/graph.h:109:9: note: because 'lemon::concepts::Graph::Node' has user-provided 'lemon::concepts::Graph::Node::Node(const lemon::concepts::Graph::Node&)' 109 | Node(const Node&) { } | ^~~~ [ 85%] Linking CXX executable nagamochi_ibaraki_test cd /build/reproducible-path/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 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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,-z,relro -Wl,-z,now -rdynamic CMakeFiles/nagamochi_ibaraki_test.dir/nagamochi_ibaraki_test.cc.o -o nagamochi_ibaraki_test -L/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[5]: Leaving directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 85%] Built target nagamochi_ibaraki_test make -f test/CMakeFiles/path_test.dir/build.make test/CMakeFiles/path_test.dir/depend make[5]: Entering directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /build/reproducible-path/liblemon-1.3.1+dfsg /build/reproducible-path/liblemon-1.3.1+dfsg/test /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test/CMakeFiles/path_test.dir/DependInfo.cmake "--color=" make[5]: Leaving directory '/build/reproducible-path/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 '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 86%] Building CXX object test/CMakeFiles/path_test.dir/path_test.cc.o cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -I/build/reproducible-path/liblemon-1.3.1+dfsg -I/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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 -MD -MT test/CMakeFiles/path_test.dir/path_test.cc.o -MF CMakeFiles/path_test.dir/path_test.cc.o.d -o CMakeFiles/path_test.dir/path_test.cc.o -c /build/reproducible-path/liblemon-1.3.1+dfsg/test/path_test.cc In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/test/path_test.cc:26: /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/path.h:998:17: required from 'static void lemon::_path_bits::PathCopySelectorForward::copy(const From&, To&) [with From = lemon::concepts::Path; To = lemon::SimplePath]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/path.h:1046:49: required from 'void lemon::pathCopy(const From&, To&) [with From = concepts::Path; To = SimplePath]' /build/reproducible-path/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]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Path; Type = SimplePath]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/path_test.cc:38:52: required from 'void checkConcepts() [with GR = lemon::concepts::Digraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/path_test.cc:45:35: required from here /build/reproducible-path/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 /build/reproducible-path/liblemon-1.3.1+dfsg/test/path_test.cc:23: /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/path.h:998:17: required from 'static void lemon::_path_bits::PathCopySelectorForward::copy(const From&, To&) [with From = lemon::concepts::Path; To = lemon::StaticPath]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/path.h:1046:49: required from 'void lemon::pathCopy(const From&, To&) [with From = concepts::Path; To = StaticPath]' /build/reproducible-path/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]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Path; Type = StaticPath]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/path_test.cc:39:52: required from 'void checkConcepts() [with GR = lemon::concepts::Digraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/path_test.cc:45:35: required from here /build/reproducible-path/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; | ~~~~~~~~~~~~^~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/path.h: In instantiation of 'void lemon::ListPath::addBack(const Arc&) [with GR = lemon::concepts::Digraph; Arc = lemon::concepts::Digraph::Arc]': /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/path.h:998:17: required from 'static void lemon::_path_bits::PathCopySelectorForward::copy(const From&, To&) [with From = lemon::concepts::Path; To = lemon::ListPath]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/path.h:1046:49: required from 'void lemon::pathCopy(const From&, To&) [with From = concepts::Path; To = ListPath]' /build/reproducible-path/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]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concept_check.h:70:33: required from 'void lemon::checkConcept() [with Concept = concepts::Path; Type = ListPath]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/path_test.cc:40:50: required from 'void checkConcepts() [with GR = lemon::concepts::Digraph]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/path_test.cc:45:35: required from here /build/reproducible-path/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; | ~~~~~~~~~~^~~~~ /build/reproducible-path/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&) { } | ^~~ [ 87%] Linking CXX executable path_test cd /build/reproducible-path/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 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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,-z,relro -Wl,-z,now -rdynamic CMakeFiles/path_test.dir/path_test.cc.o -o path_test -L/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[5]: Leaving directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 87%] Built target path_test make -f test/CMakeFiles/planarity_test.dir/build.make test/CMakeFiles/planarity_test.dir/depend make[5]: Entering directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /build/reproducible-path/liblemon-1.3.1+dfsg /build/reproducible-path/liblemon-1.3.1+dfsg/test /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test/CMakeFiles/planarity_test.dir/DependInfo.cmake "--color=" make[5]: Leaving directory '/build/reproducible-path/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 '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 87%] Building CXX object test/CMakeFiles/planarity_test.dir/planarity_test.cc.o cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -I/build/reproducible-path/liblemon-1.3.1+dfsg -I/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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 -MD -MT test/CMakeFiles/planarity_test.dir/planarity_test.cc.o -MF CMakeFiles/planarity_test.dir/planarity_test.cc.o.d -o CMakeFiles/planarity_test.dir/planarity_test.cc.o -c /build/reproducible-path/liblemon-1.3.1+dfsg/test/planarity_test.cc In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/dfs.h:30, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/planarity.h:29, from /build/reproducible-path/liblemon-1.3.1+dfsg/test/planarity_test.cc:21: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:1973:21: warning: 'template struct std::iterator' is deprecated [-Wdeprecated-declarations] 1973 | : public std::iterator { | ^~~~~~~~ In file included from /usr/include/c++/13/bits/stl_iterator_base_funcs.h:66, from /usr/include/c++/13/string:47, from /usr/include/c++/13/bits/locale_classes.h:40, from /usr/include/c++/13/bits/ios_base.h:41, from /usr/include/c++/13/ios:44, from /usr/include/c++/13/ostream:40, from /usr/include/c++/13/iostream:41, from /build/reproducible-path/liblemon-1.3.1+dfsg/test/planarity_test.cc:19: /usr/include/c++/13/bits/stl_iterator_base_types.h:127:34: note: declared here 127 | struct _GLIBCXX17_DEPRECATED iterator | ^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:3135:21: warning: 'template struct std::iterator' is deprecated [-Wdeprecated-declarations] 3135 | : public std::iterator { | ^~~~~~~~ /usr/include/c++/13/bits/stl_iterator_base_types.h:127:34: note: declared here 127 | struct _GLIBCXX17_DEPRECATED iterator | ^~~~~~~~ In file included from /usr/include/c++/13/vector:72, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/planarity.h:26: /usr/include/c++/13/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const lemon::Color&}; _Tp = lemon::Color; _Alloc = std::allocator]': /usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/13/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {lemon::Color}; _Tp = lemon::Color; _Alloc = std::allocator]': /usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector::iterator' changed in GCC 7.1 /usr/include/c++/13/bits/vector.tcc: In function 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {lemon::Color}; _Tp = lemon::Color; _Alloc = std::allocator]': /usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/arm-linux-gnueabihf/c++/13/bits/c++allocator.h:33, from /usr/include/c++/13/bits/allocator.h:46, from /usr/include/c++/13/string:43: In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::SmartEdgeSetBase::ArcT; _Args = {lemon::SmartEdgeSetBase::ArcT}; _Tp = lemon::SmartEdgeSetBase::ArcT]', inlined from 'static void std::allocator_traits >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = lemon::SmartEdgeSetBase::ArcT; _Args = {lemon::SmartEdgeSetBase::ArcT}; _Tp = lemon::SmartEdgeSetBase::ArcT]' at /usr/include/c++/13/bits/alloc_traits.h:538:17, inlined from 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {lemon::SmartEdgeSetBase::ArcT}; _Tp = lemon::SmartEdgeSetBase::ArcT; _Alloc = std::allocator::ArcT>]' at /usr/include/c++/13/bits/vector.tcc:117:30, inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = lemon::SmartEdgeSetBase::ArcT; _Alloc = std::allocator::ArcT>]' at /usr/include/c++/13/bits/stl_vector.h:1296:21, inlined from 'lemon::SmartEdgeSetBase::Edge lemon::SmartEdgeSetBase::addEdge(const Node&, const Node&) [with GR = lemon::SmartGraph]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/edge_set.h:1144:21, inlined from 'lemon::EdgeSetExtender::Edge lemon::EdgeSetExtender::addEdge(const Node&, const Node&) [with Base = lemon::SmartEdgeSetBase]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/edge_set_extender.h:588:34: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/planarity.h:36: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/edge_set.h: In member function 'lemon::EdgeSetExtender::Edge lemon::EdgeSetExtender::addEdge(const Node&, const Node&) [with Base = lemon::SmartEdgeSetBase]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/edge_set.h:1144:22: note: '' declared here 1144 | arcs.push_back(ArcT()); | ^~~~~~ In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::SmartEdgeSetBase::ArcT; _Args = {lemon::SmartEdgeSetBase::ArcT}; _Tp = lemon::SmartEdgeSetBase::ArcT]', inlined from 'static void std::allocator_traits >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = lemon::SmartEdgeSetBase::ArcT; _Args = {lemon::SmartEdgeSetBase::ArcT}; _Tp = lemon::SmartEdgeSetBase::ArcT]' at /usr/include/c++/13/bits/alloc_traits.h:538:17, inlined from 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {lemon::SmartEdgeSetBase::ArcT}; _Tp = lemon::SmartEdgeSetBase::ArcT; _Alloc = std::allocator::ArcT>]' at /usr/include/c++/13/bits/vector.tcc:117:30, inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = lemon::SmartEdgeSetBase::ArcT; _Alloc = std::allocator::ArcT>]' at /usr/include/c++/13/bits/stl_vector.h:1296:21, inlined from 'lemon::SmartEdgeSetBase::Edge lemon::SmartEdgeSetBase::addEdge(const Node&, const Node&) [with GR = lemon::SmartGraph]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/edge_set.h:1145:21, inlined from 'lemon::EdgeSetExtender::Edge lemon::EdgeSetExtender::addEdge(const Node&, const Node&) [with Base = lemon::SmartEdgeSetBase]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/edge_set_extender.h:588:34: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/edge_set.h: In member function 'lemon::EdgeSetExtender::Edge lemon::EdgeSetExtender::addEdge(const Node&, const Node&) [with Base = lemon::SmartEdgeSetBase]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/edge_set.h:1145:22: note: '' declared here 1145 | arcs.push_back(ArcT()); | ^~~~~~ In file included from /usr/include/c++/13/vector:66: In member function 'void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = lemon::Color; _Alloc = std::allocator]', inlined from 'void lemon::Palette::add(const lemon::Color&)' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/color.h:176:23, inlined from 'lemon::PlanarColoring::PlanarColoring(const Graph&) [with Graph = lemon::SmartGraph]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/planarity.h:2527:19: /usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1289 | _M_realloc_insert(end(), __x); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = lemon::Color; _Alloc = std::allocator]', inlined from 'void lemon::Palette::add(const lemon::Color&)' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/color.h:176:23, inlined from 'lemon::PlanarColoring::PlanarColoring(const Graph&) [with Graph = lemon::SmartGraph]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/planarity.h:2528:19: /usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1289 | _M_realloc_insert(end(), __x); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = lemon::Color; _Alloc = std::allocator]', inlined from 'void lemon::Palette::add(const lemon::Color&)' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/color.h:176:23, inlined from 'lemon::PlanarColoring::PlanarColoring(const Graph&) [with Graph = lemon::SmartGraph]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/planarity.h:2529:19: /usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1289 | _M_realloc_insert(end(), __x); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = lemon::Color; _Alloc = std::allocator]', inlined from 'void lemon::Palette::add(const lemon::Color&)' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/color.h:176:23, inlined from 'lemon::PlanarColoring::PlanarColoring(const Graph&) [with Graph = lemon::SmartGraph]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/planarity.h:2530:19: /usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1289 | _M_realloc_insert(end(), __x); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = lemon::Color; _Alloc = std::allocator]', inlined from 'void lemon::Palette::add(const lemon::Color&)' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/color.h:176:23, inlined from 'lemon::PlanarColoring::PlanarColoring(const Graph&) [with Graph = lemon::SmartGraph]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/planarity.h:2531:19: /usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1289 | _M_realloc_insert(end(), __x); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = lemon::Color; _Alloc = std::allocator]', inlined from 'void lemon::Palette::add(const lemon::Color&)' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/color.h:176:23, inlined from 'lemon::PlanarColoring::PlanarColoring(const Graph&) [with Graph = lemon::SmartGraph]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/planarity.h:2532:19: /usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1289 | _M_realloc_insert(end(), __x); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~ [ 89%] Linking CXX executable planarity_test cd /build/reproducible-path/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 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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,-z,relro -Wl,-z,now -rdynamic CMakeFiles/planarity_test.dir/planarity_test.cc.o -o planarity_test -L/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[5]: Leaving directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 89%] Built target planarity_test make -f test/CMakeFiles/radix_sort_test.dir/build.make test/CMakeFiles/radix_sort_test.dir/depend make[5]: Entering directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /build/reproducible-path/liblemon-1.3.1+dfsg /build/reproducible-path/liblemon-1.3.1+dfsg/test /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test/CMakeFiles/radix_sort_test.dir/DependInfo.cmake "--color=" make[5]: Leaving directory '/build/reproducible-path/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 '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 90%] Building CXX object test/CMakeFiles/radix_sort_test.dir/radix_sort_test.cc.o cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -I/build/reproducible-path/liblemon-1.3.1+dfsg -I/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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 -MD -MT test/CMakeFiles/radix_sort_test.dir/radix_sort_test.cc.o -MF CMakeFiles/radix_sort_test.dir/radix_sort_test.cc.o.d -o CMakeFiles/radix_sort_test.dir/radix_sort_test.cc.o -c /build/reproducible-path/liblemon-1.3.1+dfsg/test/radix_sort_test.cc In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/test/radix_sort_test.cc:21: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:1973:21: warning: 'template struct std::iterator' is deprecated [-Wdeprecated-declarations] 1973 | : public std::iterator { | ^~~~~~~~ In file included from /usr/include/c++/13/bits/stl_iterator_base_funcs.h:66, from /usr/include/c++/13/string:47, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/time_measure.h:34, from /build/reproducible-path/liblemon-1.3.1+dfsg/test/radix_sort_test.cc:19: /usr/include/c++/13/bits/stl_iterator_base_types.h:127:34: note: declared here 127 | struct _GLIBCXX17_DEPRECATED iterator | ^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:3135:21: warning: 'template struct std::iterator' is deprecated [-Wdeprecated-declarations] 3135 | : public std::iterator { | ^~~~~~~~ /usr/include/c++/13/bits/stl_iterator_base_types.h:127:34: note: declared here 127 | struct _GLIBCXX17_DEPRECATED iterator | ^~~~~~~~ [ 91%] Linking CXX executable radix_sort_test cd /build/reproducible-path/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 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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,-z,relro -Wl,-z,now -rdynamic CMakeFiles/radix_sort_test.dir/radix_sort_test.cc.o -o radix_sort_test -L/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[5]: Leaving directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 91%] Built target radix_sort_test make -f test/CMakeFiles/random_test.dir/build.make test/CMakeFiles/random_test.dir/depend make[5]: Entering directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /build/reproducible-path/liblemon-1.3.1+dfsg /build/reproducible-path/liblemon-1.3.1+dfsg/test /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test/CMakeFiles/random_test.dir/DependInfo.cmake "--color=" make[5]: Leaving directory '/build/reproducible-path/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 '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 92%] Building CXX object test/CMakeFiles/random_test.dir/random_test.cc.o cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -I/build/reproducible-path/liblemon-1.3.1+dfsg -I/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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 -MD -MT test/CMakeFiles/random_test.dir/random_test.cc.o -MF CMakeFiles/random_test.dir/random_test.cc.o.d -o CMakeFiles/random_test.dir/random_test.cc.o -c /build/reproducible-path/liblemon-1.3.1+dfsg/test/random_test.cc In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/test/random_test.cc:19: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/random.h: In member function 'void lemon::_random_bits::RandomCore<_Word>::fillState()': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/random.h:252:24: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister] 252 | register Word *curr = state + length - 1; | ^~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/random.h:253:23: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister] 253 | register long num; | ^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/random.h: In member function 'std::pair lemon::Random::lognormalParamsFromMD(double, double)': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/random.h:825:5: note: parameter passing for argument of type 'std::pair' when C++17 is enabled changed to match C++14 in GCC 10.1 825 | { | ^ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/random.h: In instantiation of 'void lemon::_random_bits::RandomCore<_Word>::fillState() [with _Word = long unsigned int]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/random.h:236:31: required from 'lemon::_random_bits::RandomCore<_Word>::Word lemon::_random_bits::RandomCore<_Word>::operator()() [with _Word = long unsigned int; Word = long unsigned int]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/random.h:456:23: required from 'bool lemon::_random_bits::BoolProducer::convert(lemon::_random_bits::RandomCore&) [with Word = long unsigned int]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/random.h:760:35: required from here /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/random.h:252:24: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister] 252 | register Word *curr = state + length - 1; | ^~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/random.h:253:23: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister] 253 | register long num; | ^~~ [ 93%] Linking CXX executable random_test cd /build/reproducible-path/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 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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,-z,relro -Wl,-z,now -rdynamic CMakeFiles/random_test.dir/random_test.cc.o -o random_test -L/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[5]: Leaving directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 93%] Built target random_test make -f test/CMakeFiles/suurballe_test.dir/build.make test/CMakeFiles/suurballe_test.dir/depend make[5]: Entering directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /build/reproducible-path/liblemon-1.3.1+dfsg /build/reproducible-path/liblemon-1.3.1+dfsg/test /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test/CMakeFiles/suurballe_test.dir/DependInfo.cmake "--color=" make[5]: Leaving directory '/build/reproducible-path/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 '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 95%] Building CXX object test/CMakeFiles/suurballe_test.dir/suurballe_test.cc.o cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -I/build/reproducible-path/liblemon-1.3.1+dfsg -I/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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 -MD -MT test/CMakeFiles/suurballe_test.dir/suurballe_test.cc.o -MF CMakeFiles/suurballe_test.dir/suurballe_test.cc.o.d -o CMakeFiles/suurballe_test.dir/suurballe_test.cc.o -c /build/reproducible-path/liblemon-1.3.1+dfsg/test/suurballe_test.cc In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lgf_writer.h:37, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/lgf_reader.h:36, from /build/reproducible-path/liblemon-1.3.1+dfsg/test/suurballe_test.cc:22: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:1973:21: warning: 'template struct std::iterator' is deprecated [-Wdeprecated-declarations] 1973 | : public std::iterator { | ^~~~~~~~ In file included from /usr/include/c++/13/bits/stl_iterator_base_funcs.h:66, from /usr/include/c++/13/string:47, from /usr/include/c++/13/bits/locale_classes.h:40, from /usr/include/c++/13/bits/ios_base.h:41, from /usr/include/c++/13/ios:44, from /usr/include/c++/13/ostream:40, from /usr/include/c++/13/iostream:41, from /build/reproducible-path/liblemon-1.3.1+dfsg/test/suurballe_test.cc:19: /usr/include/c++/13/bits/stl_iterator_base_types.h:127:34: note: declared here 127 | struct _GLIBCXX17_DEPRECATED iterator | ^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:3135:21: warning: 'template struct std::iterator' is deprecated [-Wdeprecated-declarations] 3135 | : public std::iterator { | ^~~~~~~~ /usr/include/c++/13/bits/stl_iterator_base_types.h:127:34: note: declared here 127 | struct _GLIBCXX17_DEPRECATED iterator | ^~~~~~~~ In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/test/suurballe_test.cc:24: /build/reproducible-path/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 >; Node = lemon::concepts::Digraph::Node]': /build/reproducible-path/liblemon-1.3.1+dfsg/test/suurballe_test.cc:110:18: required from here /build/reproducible-path/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 /build/reproducible-path/liblemon-1.3.1+dfsg/test/suurballe_test.cc:25: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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 >; Node = lemon::concepts::Digraph::Node]': /build/reproducible-path/liblemon-1.3.1+dfsg/test/suurballe_test.cc:114:26: required from here /build/reproducible-path/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; | ~~~^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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) { | ~~~^~~~~~~~~~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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) { | ~~~^~~~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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 >]': /build/reproducible-path/liblemon-1.3.1+dfsg/test/suurballe_test.cc:116:23: required from here /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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 >]': /build/reproducible-path/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 >]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/suurballe.h:628:26: 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 >; Node = lemon::concepts::Digraph::Node]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/suurballe_test.cc:114:26: required from here /build/reproducible-path/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; | ~~~~~~~~~~^~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~^~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; | ~~~~~~~~~^~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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 >]': /build/reproducible-path/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 >]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/suurballe.h:628:26: 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 >; Node = lemon::concepts::Digraph::Node]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/suurballe_test.cc:114:26: required from here /build/reproducible-path/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; | ~~~~~~~~~~^~~~~~~~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~^~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; | ~~~~~~~~~^~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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); | ~~^~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/concepts/digraph.h:77:9: note: because 'lemon::concepts::Digraph::Node' has user-provided 'lemon::concepts::Digraph::Node::Node(const lemon::concepts::Digraph::Node&)' 77 | Node(const Node&) { } | ^~~~ /build/reproducible-path/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; | ~~~~~~~~~^~~ /build/reproducible-path/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&) { } | ^~~ /build/reproducible-path/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; | ~~~~~~~~~^~~ /build/reproducible-path/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 /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/map_extender.h:27, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:24, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/list_graph.h:28, from /build/reproducible-path/liblemon-1.3.1+dfsg/test/suurballe_test.cc:21: /build/reproducible-path/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&; Key = lemon::concepts::Digraph::Node; Value = lemon::concepts::Digraph::Arc]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/dijkstra.h:612:19: 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 >]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/dijkstra.h:782:7: required from 'void lemon::Dijkstra::run(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 >; Node = lemon::concepts::Digraph::Node]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/suurballe.h:557:15: 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 >; Node = lemon::concepts::Digraph::Node]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/suurballe_test.cc:111:22: required from here /build/reproducible-path/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; } | ~~~~~~~~~~~~~^~ /build/reproducible-path/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 /build/reproducible-path/liblemon-1.3.1+dfsg/test/suurballe_test.cc:23: /build/reproducible-path/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]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/path.h:998:17: required from 'static void lemon::_path_bits::PathCopySelectorForward::copy(const From&, To&) [with From = lemon::SimplePath; To = lemon::SimplePath]' /build/reproducible-path/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]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/path.h:1046:49: required from 'void lemon::pathCopy(const From&, To&) [with From = SimplePath; To = SimplePath]' /build/reproducible-path/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++/13/bits/stl_construct.h:119:7: required from 'void std::_Construct(_Tp*, _Args&& ...) [with _Tp = lemon::SimplePath; _Args = {const lemon::SimplePath&}]' /usr/include/c++/13/bits/stl_uninitialized.h:120:21: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /usr/include/c++/13/bits/stl_uninitialized.h:373:37: required from '_ForwardIterator std::__uninitialized_copy_a(_InputIterator, _InputIterator, _ForwardIterator, allocator<_Tp>&) [with _InputIterator = const lemon::SimplePath*; _ForwardIterator = lemon::SimplePath*; _Tp = lemon::SimplePath]' /usr/include/c++/13/bits/stl_uninitialized.h:399:2: required from '_ForwardIterator std::__uninitialized_move_if_noexcept_a(_InputIterator, _InputIterator, _ForwardIterator, _Allocator&) [with _InputIterator = lemon::SimplePath*; _ForwardIterator = lemon::SimplePath*; _Allocator = allocator >]' /usr/include/c++/13/bits/vector.tcc:687:48: required from 'void std::vector<_Tp, _Alloc>::_M_default_append(size_type) [with _Tp = lemon::SimplePath; _Alloc = std::allocator >; size_type = unsigned int]' /usr/include/c++/13/bits/stl_vector.h:1013:4: required from 'void std::vector<_Tp, _Alloc>::resize(size_type) [with _Tp = lemon::SimplePath; _Alloc = std::allocator >; size_type = unsigned int]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/suurballe.h:659:20: 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 >]' /build/reproducible-path/liblemon-1.3.1+dfsg/test/suurballe_test.cc:116:23: required from here /build/reproducible-path/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;; | ~~~~~~~~~~~~^~~~ /build/reproducible-path/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&) { } | ^~~ [ 95%] Linking CXX executable suurballe_test cd /build/reproducible-path/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 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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,-z,relro -Wl,-z,now -rdynamic CMakeFiles/suurballe_test.dir/suurballe_test.cc.o -o suurballe_test -L/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[5]: Leaving directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 95%] Built target suurballe_test make -f test/CMakeFiles/time_measure_test.dir/build.make test/CMakeFiles/time_measure_test.dir/depend make[5]: Entering directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /build/reproducible-path/liblemon-1.3.1+dfsg /build/reproducible-path/liblemon-1.3.1+dfsg/test /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test/CMakeFiles/time_measure_test.dir/DependInfo.cmake "--color=" make[5]: Leaving directory '/build/reproducible-path/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 '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 96%] Building CXX object test/CMakeFiles/time_measure_test.dir/time_measure_test.cc.o cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -I/build/reproducible-path/liblemon-1.3.1+dfsg -I/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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 -MD -MT test/CMakeFiles/time_measure_test.dir/time_measure_test.cc.o -MF CMakeFiles/time_measure_test.dir/time_measure_test.cc.o.d -o CMakeFiles/time_measure_test.dir/time_measure_test.cc.o -c /build/reproducible-path/liblemon-1.3.1+dfsg/test/time_measure_test.cc [ 97%] Linking CXX executable time_measure_test cd /build/reproducible-path/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 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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,-z,relro -Wl,-z,now -rdynamic CMakeFiles/time_measure_test.dir/time_measure_test.cc.o -o time_measure_test -L/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[5]: Leaving directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 97%] Built target time_measure_test make -f test/CMakeFiles/tsp_test.dir/build.make test/CMakeFiles/tsp_test.dir/depend make[5]: Entering directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /build/reproducible-path/liblemon-1.3.1+dfsg /build/reproducible-path/liblemon-1.3.1+dfsg/test /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test/CMakeFiles/tsp_test.dir/DependInfo.cmake "--color=" make[5]: Leaving directory '/build/reproducible-path/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 '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [ 98%] Building CXX object test/CMakeFiles/tsp_test.dir/tsp_test.cc.o cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -I/build/reproducible-path/liblemon-1.3.1+dfsg -I/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf -g -O2 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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 -MD -MT test/CMakeFiles/tsp_test.dir/tsp_test.cc.o -MF CMakeFiles/tsp_test.dir/tsp_test.cc.o.d -o CMakeFiles/tsp_test.dir/tsp_test.cc.o -c /build/reproducible-path/liblemon-1.3.1+dfsg/test/tsp_test.cc In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/test/tsp_test.cc:23: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:1973:21: warning: 'template struct std::iterator' is deprecated [-Wdeprecated-declarations] 1973 | : public std::iterator { | ^~~~~~~~ In file included from /usr/include/c++/13/bits/stl_iterator_base_funcs.h:66, from /usr/include/c++/13/string:47, from /usr/include/c++/13/bits/locale_classes.h:40, from /usr/include/c++/13/bits/ios_base.h:41, from /usr/include/c++/13/ios:44, from /usr/include/c++/13/ostream:40, from /usr/include/c++/13/iostream:41, from /build/reproducible-path/liblemon-1.3.1+dfsg/test/tsp_test.cc:19: /usr/include/c++/13/bits/stl_iterator_base_types.h:127:34: note: declared here 127 | struct _GLIBCXX17_DEPRECATED iterator | ^~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/maps.h:3135:21: warning: 'template struct std::iterator' is deprecated [-Wdeprecated-declarations] 3135 | : public std::iterator { | ^~~~~~~~ /usr/include/c++/13/bits/stl_iterator_base_types.h:127:34: note: declared here 127 | struct _GLIBCXX17_DEPRECATED iterator | ^~~~~~~~ In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/test/tsp_test.cc:24: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/random.h: In member function 'void lemon::_random_bits::RandomCore<_Word>::fillState()': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/random.h:252:24: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister] 252 | register Word *curr = state + length - 1; | ^~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/random.h:253:23: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister] 253 | register long num; | ^~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/random.h: In member function 'std::pair lemon::Random::lognormalParamsFromMD(double, double)': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/random.h:825:5: note: parameter passing for argument of type 'std::pair' when C++17 is enabled changed to match C++14 in GCC 10.1 825 | { | ^ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/random.h: In instantiation of 'void lemon::_random_bits::RandomCore<_Word>::fillState() [with _Word = long unsigned int]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/random.h:236:31: required from 'lemon::_random_bits::RandomCore<_Word>::Word lemon::_random_bits::RandomCore<_Word>::operator()() [with _Word = long unsigned int; Word = long unsigned int]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/random.h:456:23: required from 'bool lemon::_random_bits::BoolProducer::convert(lemon::_random_bits::RandomCore&) [with Word = long unsigned int]' /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/random.h:760:35: required from here /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/random.h:252:24: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister] 252 | register Word *curr = state + length - 1; | ^~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/random.h:253:23: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister] 253 | register long num; | ^~~ In file included from /usr/include/c++/13/bits/stl_algo.h:61, from /usr/include/c++/13/algorithm:61, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/core.h:23, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/full_graph.h:22, from /build/reproducible-path/liblemon-1.3.1+dfsg/test/tsp_test.cc:21: /usr/include/c++/13/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, vector, allocator > > >; _Distance = int; _Tp = pair; _Compare = __gnu_cxx::__ops::_Iter_comp_iter, allocator > > > >]': /usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, | ^~~~~~~~~~~~~ /usr/include/c++/13/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, vector, allocator > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter, allocator > > > >]': /usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1792 | __unguarded_linear_insert(_RandomAccessIterator __last, | ^~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, vector, allocator > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter, allocator > > > >]': /usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1812 | __insertion_sort(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13/bits/stl_algo.h:1812: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/arm-linux-gnueabihf/c++/13/bits/c++allocator.h:33, from /usr/include/c++/13/bits/allocator.h:46, from /usr/include/c++/13/string:43: In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::dim2::Point; _Args = {lemon::dim2::Point}; _Tp = lemon::dim2::Point]', inlined from 'void lemon::ArrayMap<_Graph, _Item, _Value>::add(const std::vector<_Item>&) [with _Graph = lemon::GraphExtender; _Item = lemon::FullGraphBase::Node; _Value = lemon::dim2::Point]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/array_map.h:272:28: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/default_map.h:23, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:25, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/full_graph.h:23: /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/array_map.h: In member function 'void lemon::ArrayMap<_Graph, _Item, _Value>::add(const std::vector<_Item>&) [with _Graph = lemon::GraphExtender; _Item = lemon::FullGraphBase::Node; _Value = lemon::dim2::Point]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/array_map.h:272:44: note: '' declared here 272 | allocator.construct(&(values[id]), Value()); | ^~~~~~~ In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::dim2::Point; _Args = {lemon::dim2::Point}; _Tp = lemon::dim2::Point]', inlined from 'void lemon::ArrayMap<_Graph, _Item, _Value>::add(const Key&) [with _Graph = lemon::GraphExtender; _Item = lemon::FullGraphBase::Node; _Value = lemon::dim2::Point]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/array_map.h:229:26: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/array_map.h: In member function 'void lemon::ArrayMap<_Graph, _Item, _Value>::add(const Key&) [with _Graph = lemon::GraphExtender; _Item = lemon::FullGraphBase::Node; _Value = lemon::dim2::Point]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/array_map.h:229:42: note: '' declared here 229 | allocator.construct(&(values[id]), Value()); | ^~~~~~~ In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::dim2::Point; _Args = {lemon::dim2::Point}; _Tp = lemon::dim2::Point]', inlined from 'void lemon::ArrayMap<_Graph, _Item, _Value>::build() [with _Graph = lemon::GraphExtender; _Item = lemon::FullGraphBase::Node; _Value = lemon::dim2::Point]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/array_map.h:306:28: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/array_map.h: In member function 'void lemon::ArrayMap<_Graph, _Item, _Value>::build() [with _Graph = lemon::GraphExtender; _Item = lemon::FullGraphBase::Node; _Value = lemon::dim2::Point]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/array_map.h:306:44: note: '' declared here 306 | allocator.construct(&(values[id]), Value()); | ^~~~~~~ In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = lemon::dim2::Point; _Args = {lemon::dim2::Point}; _Tp = lemon::dim2::Point]', inlined from 'lemon::ArrayMap<_Graph, _Item, _Value>::ArrayMap(const GraphType&) [with _Graph = lemon::GraphExtender; _Item = lemon::FullGraphBase::Node; _Value = lemon::dim2::Point]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/array_map.h:91:28: /usr/include/c++/13/bits/new_allocator.h:191:11: warning: '' may be used uninitialized [-Wmaybe-uninitialized] 191 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/array_map.h: In constructor 'lemon::ArrayMap<_Graph, _Item, _Value>::ArrayMap(const GraphType&) [with _Graph = lemon::GraphExtender; _Item = lemon::FullGraphBase::Node; _Value = lemon::dim2::Point]': /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/array_map.h:91:44: note: '' declared here 91 | allocator.construct(&(values[id]), Value()); | ^~~~~~~ In file included from /usr/include/c++/13/vector:72, from /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/core.h:22: /usr/include/c++/13/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {std::pair}; _Tp = std::pair; _Alloc = std::allocator >]': /usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector, std::allocator > >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/13/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, vector, allocator > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter, allocator > > > >]': /usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1918 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 /usr/include/c++/13/bits/stl_algo.h:1932:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(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++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector::NodeMap, std::less >::ItemNode, std::allocator::NodeMap, std::less >::ItemNode> >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ In member function 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {lemon::HeapUnionFind::NodeMap, std::less >::ItemNode}; _Tp = lemon::HeapUnionFind::NodeMap, std::less >::ItemNode; _Alloc = std::allocator::NodeMap, std::less >::ItemNode>]', inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = lemon::HeapUnionFind::NodeMap, std::less >::ItemNode; _Alloc = std::allocator::NodeMap, std::less >::ItemNode>]' at /usr/include/c++/13/bits/stl_vector.h:1296:21, inlined from 'int lemon::HeapUnionFind::newNode() [with V = double; IM = lemon::GraphExtender::NodeMap; Comp = std::less]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/unionfind.h:1020:24, inlined from 'int lemon::HeapUnionFind::newNode() [with V = double; IM = lemon::GraphExtender::NodeMap; Comp = std::less]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/unionfind.h:1017:9, inlined from 'void lemon::HeapUnionFind::split(int, Iterator) [with Iterator = std::back_insert_iterator >; V = double; IM = lemon::GraphExtender::NodeMap; Comp = std::less]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/unionfind.h:1591:35: /usr/include/c++/13/bits/vector.tcc:123:28: 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 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {lemon::HeapUnionFind::NodeMap, std::less >::ItemNode}; _Tp = lemon::HeapUnionFind::NodeMap, std::less >::ItemNode; _Alloc = std::allocator::NodeMap, std::less >::ItemNode>]', inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = lemon::HeapUnionFind::NodeMap, std::less >::ItemNode; _Alloc = std::allocator::NodeMap, std::less >::ItemNode>]' at /usr/include/c++/13/bits/stl_vector.h:1296:21, inlined from 'int lemon::HeapUnionFind::newNode() [with V = double; IM = lemon::GraphExtender::NodeMap; Comp = std::less]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/unionfind.h:1020:24, inlined from 'int lemon::HeapUnionFind::newNode() [with V = double; IM = lemon::GraphExtender::NodeMap; Comp = std::less]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/unionfind.h:1017:9, inlined from 'int lemon::HeapUnionFind::join(Iterator, Iterator) [with Iterator = __gnu_cxx::__normal_iterator >; V = double; IM = lemon::GraphExtender::NodeMap; Comp = std::less]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/unionfind.h:1408:35: /usr/include/c++/13/bits/vector.tcc:123:28: 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 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {lemon::HeapUnionFind::NodeMap, std::less >::ItemNode}; _Tp = lemon::HeapUnionFind::NodeMap, std::less >::ItemNode; _Alloc = std::allocator::NodeMap, std::less >::ItemNode>]', inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = lemon::HeapUnionFind::NodeMap, std::less >::ItemNode; _Alloc = std::allocator::NodeMap, std::less >::ItemNode>]' at /usr/include/c++/13/bits/stl_vector.h:1296:21, inlined from 'int lemon::HeapUnionFind::newNode() [with V = double; IM = lemon::GraphExtender::NodeMap; Comp = std::less]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/unionfind.h:1020:24, inlined from 'int lemon::HeapUnionFind::newNode() [with V = double; IM = lemon::GraphExtender::NodeMap; Comp = std::less]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/unionfind.h:1017:9, inlined from 'int lemon::HeapUnionFind::join(Iterator, Iterator) [with Iterator = __gnu_cxx::__normal_iterator >; V = double; IM = lemon::GraphExtender::NodeMap; Comp = std::less]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/unionfind.h:1430:39: /usr/include/c++/13/bits/vector.tcc:123:28: 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 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {lemon::HeapUnionFind::NodeMap, std::less >::ItemNode}; _Tp = lemon::HeapUnionFind::NodeMap, std::less >::ItemNode; _Alloc = std::allocator::NodeMap, std::less >::ItemNode>]', inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = lemon::HeapUnionFind::NodeMap, std::less >::ItemNode; _Alloc = std::allocator::NodeMap, std::less >::ItemNode>]' at /usr/include/c++/13/bits/stl_vector.h:1296:21, inlined from 'int lemon::HeapUnionFind::newNode() [with V = double; IM = lemon::GraphExtender::NodeMap; Comp = std::less]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/unionfind.h:1020:24, inlined from 'int lemon::HeapUnionFind::newNode() [with V = double; IM = lemon::GraphExtender::NodeMap; Comp = std::less]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/unionfind.h:1017:9, inlined from 'int lemon::HeapUnionFind::join(Iterator, Iterator) [with Iterator = __gnu_cxx::__normal_iterator >; V = double; IM = lemon::GraphExtender::NodeMap; Comp = std::less]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/unionfind.h:1455:35: /usr/include/c++/13/bits/vector.tcc:123:28: 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 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {lemon::HeapUnionFind::NodeMap, std::less >::ItemNode}; _Tp = lemon::HeapUnionFind::NodeMap, std::less >::ItemNode; _Alloc = std::allocator::NodeMap, std::less >::ItemNode>]', inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = lemon::HeapUnionFind::NodeMap, std::less >::ItemNode; _Alloc = std::allocator::NodeMap, std::less >::ItemNode>]' at /usr/include/c++/13/bits/stl_vector.h:1296:21, inlined from 'int lemon::HeapUnionFind::newNode() [with V = double; IM = lemon::GraphExtender::NodeMap; Comp = std::less]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/unionfind.h:1020:24, inlined from 'int lemon::HeapUnionFind::newNode() [with V = double; IM = lemon::GraphExtender::NodeMap; Comp = std::less]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/unionfind.h:1017:9, inlined from 'int lemon::HeapUnionFind::join(Iterator, Iterator) [with Iterator = __gnu_cxx::__normal_iterator >; V = double; IM = lemon::GraphExtender::NodeMap; Comp = std::less]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/unionfind.h:1478:39: /usr/include/c++/13/bits/vector.tcc:123:28: 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 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {lemon::HeapUnionFind::NodeMap, std::less >::ItemNode}; _Tp = lemon::HeapUnionFind::NodeMap, std::less >::ItemNode; _Alloc = std::allocator::NodeMap, std::less >::ItemNode>]', inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = lemon::HeapUnionFind::NodeMap, std::less >::ItemNode; _Alloc = std::allocator::NodeMap, std::less >::ItemNode>]' at /usr/include/c++/13/bits/stl_vector.h:1296:21, inlined from 'int lemon::HeapUnionFind::newNode() [with V = double; IM = lemon::GraphExtender::NodeMap; Comp = std::less]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/unionfind.h:1020:24, inlined from 'int lemon::HeapUnionFind::newNode() [with V = double; IM = lemon::GraphExtender::NodeMap; Comp = std::less]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/unionfind.h:1017:9, inlined from 'int lemon::HeapUnionFind::join(Iterator, Iterator) [with Iterator = __gnu_cxx::__normal_iterator >; V = double; IM = lemon::GraphExtender::NodeMap; Comp = std::less]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/unionfind.h:1513:39: /usr/include/c++/13/bits/vector.tcc:123:28: 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 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {lemon::MaxWeightedPerfectMatching::EdgeMap >::BlossomVariable}; _Tp = lemon::MaxWeightedPerfectMatching::EdgeMap >::BlossomVariable; _Alloc = std::allocator::EdgeMap >::BlossomVariable>]': /usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type 'std::vector::EdgeMap >::BlossomVariable, std::allocator::EdgeMap >::BlossomVariable> >::iterator' changed in GCC 7.1 445 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ In member function 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {lemon::MaxWeightedPerfectMatching::EdgeMap >::BlossomVariable}; _Tp = lemon::MaxWeightedPerfectMatching::EdgeMap >::BlossomVariable; _Alloc = std::allocator::EdgeMap >::BlossomVariable>]', inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = lemon::MaxWeightedPerfectMatching::EdgeMap >::BlossomVariable; _Alloc = std::allocator::EdgeMap >::BlossomVariable>]' at /usr/include/c++/13/bits/stl_vector.h:1296:21, inlined from 'void lemon::MaxWeightedPerfectMatching::extractBlossom(int, const Node&, const Arc&) [with GR = lemon::SmartGraph; WM = lemon::GraphExtender::EdgeMap]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/matching.h:2965:37: /usr/include/c++/13/bits/vector.tcc:123:28: 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 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_fill_insert(iterator, size_type, const value_type&) [with _Tp = double; _Alloc = std::allocator]': /usr/include/c++/13/bits/vector.tcc:529:5: note: parameter passing for argument of type 'std::vector >::iterator' changed in GCC 7.1 529 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/13/vector:66: In member function 'void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = double; _Alloc = std::allocator]', inlined from 'lemon::VectorMap<_Graph, _Item, _Value>::VectorMap(const GraphType&, const Value&) [with _Graph = lemon::GraphExtender; _Item = lemon::FullGraphBase::Node; _Value = double]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/vector_map.h:103:23, inlined from 'lemon::DefaultMap<_Graph, _Item, _Value>::DefaultMap(const GraphType&, const Value&) [with _Graph = lemon::GraphExtender; _Item = lemon::FullGraphBase::Node; _Value = double]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/default_map.h:166:28, inlined from 'lemon::MapExtender<_Map>::MapExtender(const GraphType&, const Value&) [with _Map = lemon::DefaultMap, lemon::FullGraphBase::Node, double>]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/map_extender.h:66:28, inlined from 'lemon::GraphExtender::NodeMap<_Value>::NodeMap(const lemon::GraphExtender::Graph&, const _Value&) [with _Value = double; Base = lemon::FullGraphBase]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:610:30, inlined from 'lemon::InsertionTsp::CheapestSelection::CheapestSelection(const lemon::FullGraph&, const lemon::InsertionTsp::CostMap&, std::vector >&, std::vector >&) [with CM = lemon::GraphExtender::EdgeMap]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/insertion_tsp.h:357:15, inlined from 'void lemon::InsertionTsp::start() [with SelectionFunctor = lemon::InsertionTsp::EdgeMap >::CheapestSelection; InsertionFunctor = lemon::InsertionTsp::EdgeMap >::CheapestInsertion; CM = lemon::GraphExtender::EdgeMap]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/insertion_tsp.h:267:26: /usr/include/c++/13/bits/stl_vector.h:1034:25: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator > >' changed in GCC 7.1 1034 | _M_fill_insert(end(), __new_size - size(), __x); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = double; _Alloc = std::allocator]', inlined from 'lemon::VectorMap<_Graph, _Item, _Value>::VectorMap(const GraphType&, const Value&) [with _Graph = lemon::GraphExtender; _Item = lemon::FullGraphBase::Node; _Value = double]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/vector_map.h:103:23, inlined from 'lemon::DefaultMap<_Graph, _Item, _Value>::DefaultMap(const GraphType&, const Value&) [with _Graph = lemon::GraphExtender; _Item = lemon::FullGraphBase::Node; _Value = double]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/default_map.h:166:28, inlined from 'lemon::MapExtender<_Map>::MapExtender(const GraphType&, const Value&) [with _Map = lemon::DefaultMap, lemon::FullGraphBase::Node, double>]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/map_extender.h:66:28, inlined from 'lemon::GraphExtender::NodeMap<_Value>::NodeMap(const lemon::GraphExtender::Graph&, const _Value&) [with _Value = double; Base = lemon::FullGraphBase]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:610:30, inlined from 'lemon::InsertionTsp::ComparingSelection::ComparingSelection(const lemon::FullGraph&, const lemon::InsertionTsp::CostMap&, std::vector >&, std::vector >&) [with Comparator = std::less; CM = lemon::GraphExtender::EdgeMap]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/insertion_tsp.h:288:15, inlined from 'void lemon::InsertionTsp::start() [with SelectionFunctor = lemon::InsertionTsp::EdgeMap >::ComparingSelection >; InsertionFunctor = lemon::InsertionTsp::EdgeMap >::DefaultInsertion; CM = lemon::GraphExtender::EdgeMap]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/insertion_tsp.h:267:26: /usr/include/c++/13/bits/stl_vector.h:1034:25: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator > >' changed in GCC 7.1 1034 | _M_fill_insert(end(), __new_size - size(), __x); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = double; _Alloc = std::allocator]', inlined from 'lemon::VectorMap<_Graph, _Item, _Value>::VectorMap(const GraphType&, const Value&) [with _Graph = lemon::GraphExtender; _Item = lemon::FullGraphBase::Node; _Value = double]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/vector_map.h:103:23, inlined from 'lemon::DefaultMap<_Graph, _Item, _Value>::DefaultMap(const GraphType&, const Value&) [with _Graph = lemon::GraphExtender; _Item = lemon::FullGraphBase::Node; _Value = double]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/default_map.h:166:28, inlined from 'lemon::MapExtender<_Map>::MapExtender(const GraphType&, const Value&) [with _Map = lemon::DefaultMap, lemon::FullGraphBase::Node, double>]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/map_extender.h:66:28, inlined from 'lemon::GraphExtender::NodeMap<_Value>::NodeMap(const lemon::GraphExtender::Graph&, const _Value&) [with _Value = double; Base = lemon::FullGraphBase]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/bits/graph_extender.h:610:30, inlined from 'lemon::InsertionTsp::ComparingSelection::ComparingSelection(const lemon::FullGraph&, const lemon::InsertionTsp::CostMap&, std::vector >&, std::vector >&) [with Comparator = std::greater; CM = lemon::GraphExtender::EdgeMap]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/insertion_tsp.h:288:15, inlined from 'void lemon::InsertionTsp::start() [with SelectionFunctor = lemon::InsertionTsp::EdgeMap >::ComparingSelection >; InsertionFunctor = lemon::InsertionTsp::EdgeMap >::DefaultInsertion; CM = lemon::GraphExtender::EdgeMap]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/insertion_tsp.h:267:26: /usr/include/c++/13/bits/stl_vector.h:1034:25: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator > >' changed in GCC 7.1 1034 | _M_fill_insert(end(), __new_size - size(), __x); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {lemon::HeapUnionFind::NodeMap, std::less >::ItemNode}; _Tp = lemon::HeapUnionFind::NodeMap, std::less >::ItemNode; _Alloc = std::allocator::NodeMap, std::less >::ItemNode>]', inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = lemon::HeapUnionFind::NodeMap, std::less >::ItemNode; _Alloc = std::allocator::NodeMap, std::less >::ItemNode>]' at /usr/include/c++/13/bits/stl_vector.h:1296:21, inlined from 'int lemon::HeapUnionFind::newNode() [with V = double; IM = lemon::GraphExtender::NodeMap; Comp = std::less]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/unionfind.h:1020:24, inlined from 'int lemon::HeapUnionFind::newNode() [with V = double; IM = lemon::GraphExtender::NodeMap; Comp = std::less]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/unionfind.h:1017:9, inlined from 'int lemon::HeapUnionFind::insert(const Item&, const Value&) [with V = double; IM = lemon::GraphExtender::NodeMap; Comp = std::less]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/unionfind.h:1307:23, inlined from 'void lemon::MaxWeightedPerfectMatching::fractionalInit() [with GR = lemon::SmartGraph; WM = lemon::GraphExtender::EdgeMap]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/matching.h:3134:31: /usr/include/c++/13/bits/vector.tcc:123:28: 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 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {std::pair}; _Tp = std::pair; _Alloc = std::allocator >]', inlined from 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = std::pair; _Alloc = std::allocator >]' at /usr/include/c++/13/bits/stl_vector.h:1296:21, inlined from 'static lemon::_kruskal_bits::KruskalInputSelector, void>::type>::Value lemon::_kruskal_bits::KruskalInputSelector, void>::type>::kruskal(const Graph&, const In&, Out&) [with Graph = lemon::FullGraph; In = lemon::GraphExtender::EdgeMap; Out = const std::back_insert_iterator > >]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/kruskal.h:200:24, inlined from 'typename lemon::_kruskal_bits::KruskalValueSelector::Value lemon::kruskal(const Graph&, const In&, const Out&) [with Graph = FullGraph; In = GraphExtender::EdgeMap; Out = std::back_insert_iterator > >]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/kruskal.h:319:14, inlined from 'lemon::ChristofidesTsp::Cost lemon::ChristofidesTsp::run() [with CM = lemon::GraphExtender::EdgeMap]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/christofides_tsp.h:114:16: /usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, vector, allocator > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter, allocator > > > >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator*, vector, allocator > > >; _Compare = lemon::_kruskal_bits::PairComp, allocator > > >]' at /usr/include/c++/13/bits/stl_algo.h:4894:18, inlined from 'static lemon::_kruskal_bits::KruskalInputSelector, void>::type>::Value lemon::_kruskal_bits::KruskalInputSelector, void>::type>::kruskal(const Graph&, const In&, Out&) [with Graph = lemon::FullGraph; In = lemon::GraphExtender::EdgeMap; Out = const std::back_insert_iterator > >]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/kruskal.h:203:18, inlined from 'typename lemon::_kruskal_bits::KruskalValueSelector::Value lemon::kruskal(const Graph&, const In&, const Out&) [with Graph = FullGraph; In = GraphExtender::EdgeMap; Out = std::back_insert_iterator > >]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/kruskal.h:319:14, inlined from 'lemon::ChristofidesTsp::Cost lemon::ChristofidesTsp::run() [with CM = lemon::GraphExtender::EdgeMap]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/christofides_tsp.h:114:16: /usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1947 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1948 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1949 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, vector, allocator > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter, allocator > > > >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, vector, allocator > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter, allocator > > > >]' at /usr/include/c++/13/bits/stl_algo.h:1950:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator*, vector, allocator > > >; _Compare = lemon::_kruskal_bits::PairComp, allocator > > >]' at /usr/include/c++/13/bits/stl_algo.h:4894:18, inlined from 'static lemon::_kruskal_bits::KruskalInputSelector, void>::type>::Value lemon::_kruskal_bits::KruskalInputSelector, void>::type>::kruskal(const Graph&, const In&, Out&) [with Graph = lemon::FullGraph; In = lemon::GraphExtender::EdgeMap; Out = const std::back_insert_iterator > >]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/kruskal.h:203:18, inlined from 'typename lemon::_kruskal_bits::KruskalValueSelector::Value lemon::kruskal(const Graph&, const In&, const Out&) [with Graph = FullGraph; In = GraphExtender::EdgeMap; Out = std::back_insert_iterator > >]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/kruskal.h:319:14, inlined from 'lemon::ChristofidesTsp::Cost lemon::ChristofidesTsp::run() [with CM = lemon::GraphExtender::EdgeMap]' at /build/reproducible-path/liblemon-1.3.1+dfsg/lemon/christofides_tsp.h:114:16: /usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1859 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13/bits/stl_algo.h:1864:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1864 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ [100%] Linking CXX executable tsp_test cd /build/reproducible-path/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 -ffile-prefix-map=/build/reproducible-path/liblemon-1.3.1+dfsg=. -fstack-protector-strong -fstack-clash-protection -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,-z,relro -Wl,-z,now -rdynamic CMakeFiles/tsp_test.dir/tsp_test.cc.o -o tsp_test -L/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon -Wl,-rpath,/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/lemon ../lemon/liblemon.so.1.3.1 -lglpk make[5]: Leaving directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [100%] Built target tsp_test make -f CMakeFiles/check.dir/build.make CMakeFiles/check.dir/depend make[5]: Entering directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /build/reproducible-path/liblemon-1.3.1+dfsg /build/reproducible-path/liblemon-1.3.1+dfsg /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/CMakeFiles/check.dir/DependInfo.cmake "--color=" make[5]: Leaving directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' make -f CMakeFiles/check.dir/build.make CMakeFiles/check.dir/build make[5]: Entering directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' make[5]: Nothing to be done for 'CMakeFiles/check.dir/build'. make[5]: Leaving directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' [100%] Built target check make[4]: Leaving directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' /usr/bin/cmake -E cmake_progress_start /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf/CMakeFiles 0 make[3]: Leaving directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' make[2]: Leaving directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' cd obj-* && ctest -E lgf_reader_writer_test Test project /build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf Start 1: lp_test 1/43 Test #1: lp_test .......................... Passed 0.04 sec Start 2: mip_test 2/43 Test #2: mip_test ......................... Passed 0.03 sec Start 3: adaptors_test 3/43 Test #3: adaptors_test .................... Passed 0.02 sec Start 4: arc_look_up_test 4/43 Test #4: arc_look_up_test ................. Passed 0.03 sec Start 5: bellman_ford_test 5/43 Test #5: bellman_ford_test ................ Passed 0.03 sec Start 6: bfs_test 6/43 Test #6: bfs_test ......................... Passed 0.03 sec Start 7: bpgraph_test 7/43 Test #7: bpgraph_test ..................... Passed 0.04 sec Start 8: circulation_test 8/43 Test #8: circulation_test ................. Passed 0.03 sec Start 9: connectivity_test 9/43 Test #9: connectivity_test ................ Passed 0.02 sec Start 10: counter_test 10/43 Test #10: counter_test ..................... Passed 0.02 sec Start 11: dfs_test 11/43 Test #11: dfs_test ......................... Passed 0.03 sec Start 12: digraph_test 12/43 Test #12: digraph_test ..................... Passed 0.03 sec Start 13: dijkstra_test 13/43 Test #13: dijkstra_test .................... Passed 0.03 sec Start 14: dim_test 14/43 Test #14: dim_test ......................... Passed 0.02 sec Start 15: edge_set_test 15/43 Test #15: edge_set_test .................... Passed 0.02 sec Start 16: error_test 16/43 Test #16: error_test ....................... Passed 0.02 sec Start 17: euler_test 17/43 Test #17: euler_test ....................... Passed 0.02 sec Start 18: fractional_matching_test 18/43 Test #18: fractional_matching_test ......... Passed 0.02 sec Start 19: gomory_hu_test 19/43 Test #19: gomory_hu_test ................... Passed 0.02 sec Start 20: graph_copy_test 20/43 Test #20: graph_copy_test .................. Passed 0.02 sec Start 21: graph_test 21/43 Test #21: graph_test ....................... Passed 0.02 sec Start 22: graph_utils_test 22/43 Test #22: graph_utils_test ................. Passed 0.04 sec Start 23: hao_orlin_test 23/43 Test #23: hao_orlin_test ................... Passed 0.03 sec Start 24: heap_test 24/43 Test #24: heap_test ........................ Passed 0.02 sec Start 25: kruskal_test 25/43 Test #25: kruskal_test ..................... Passed 0.02 sec Start 26: lgf_test 26/43 Test #26: lgf_test ......................... Passed 0.02 sec Start 27: maps_test 27/43 Test #27: maps_test ........................ Passed 0.02 sec Start 28: matching_test 28/43 Test #28: matching_test .................... Passed 0.04 sec Start 29: max_cardinality_search_test 29/43 Test #29: max_cardinality_search_test ...... Passed 0.03 sec Start 30: max_clique_test 30/43 Test #30: max_clique_test .................. Passed 0.05 sec Start 31: max_flow_test 31/43 Test #31: max_flow_test .................... Passed 0.03 sec Start 32: min_cost_arborescence_test 32/43 Test #32: min_cost_arborescence_test ....... Passed 0.02 sec Start 33: min_cost_flow_test 33/43 Test #33: min_cost_flow_test ............... Passed 0.04 sec Start 34: min_mean_cycle_test 34/43 Test #34: min_mean_cycle_test .............. Passed 0.02 sec Start 35: nagamochi_ibaraki_test 35/43 Test #35: nagamochi_ibaraki_test ........... Passed 0.03 sec Start 36: path_test 36/43 Test #36: path_test ........................ Passed 0.03 sec Start 37: planarity_test 37/43 Test #37: planarity_test ................... Passed 0.04 sec Start 38: radix_sort_test 38/43 Test #38: radix_sort_test .................. Passed 0.35 sec Start 39: random_test 39/43 Test #39: random_test ...................... Passed 0.03 sec Start 40: suurballe_test 40/43 Test #40: suurballe_test ................... Passed 0.02 sec Start 41: time_measure_test 41/43 Test #41: time_measure_test ................ Passed 0.40 sec Start 42: tsp_test 42/43 Test #42: tsp_test ......................... Passed 0.04 sec Start 43: unionfind_test 43/43 Test #43: unionfind_test ................... Passed 0.02 sec 100% tests passed, 0 tests failed out of 43 Total Test time (real) = 2.09 sec make[1]: Leaving directory '/build/reproducible-path/liblemon-1.3.1+dfsg' create-stamp debian/debhelper-build-stamp dh_prep dh_auto_install cd obj-arm-linux-gnueabihf && make -j3 install DESTDIR=/build/reproducible-path/liblemon-1.3.1\+dfsg/debian/tmp AM_UPDATE_INFO_DIR=no "INSTALL=install --strip-program=true" make[1]: Entering directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' /usr/bin/cmake -S/build/reproducible-path/liblemon-1.3.1+dfsg -B/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf --check-build-system CMakeFiles/Makefile.cmake 0 make -f CMakeFiles/Makefile2 preinstall make[2]: Entering directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' make[2]: Nothing to be done for 'preinstall'. make[2]: Leaving directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' Install the project... /usr/bin/cmake -P cmake_install.cmake -- Install configuration: "None" -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/lemon/cmake/LEMONConfig.cmake -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/lib/liblemon.so.1.3.1 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/lib/liblemon.so -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/. -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./lgf_writer.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./kruskal.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./clp.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./hypercube_graph.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./concepts -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./concepts/graph.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./concepts/digraph.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./concepts/path.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./concepts/graph_components.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./concepts/heap.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./concepts/maps.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./concepts/bpgraph.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./planarity.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./nearest_neighbor_tsp.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./edge_set.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./assert.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./smart_graph.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./min_cost_arborescence.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./quad_heap.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./counter.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./unionfind.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./lp.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./tolerance.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./insertion_tsp.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./fractional_matching.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./pairing_heap.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./elevator.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./time_measure.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./soplex.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./dijkstra.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./math.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./christofides_tsp.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./dimacs.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./arg_parser.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./capacity_scaling.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./graph_to_eps.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./path.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./lp_skeleton.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./radix_sort.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./error.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./dim2.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./bin_heap.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./static_graph.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./cost_scaling.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./nagamochi_ibaraki.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./random.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./lp_base.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./dheap.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./connectivity.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./nauty_reader.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./cycle_canceling.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./glpk.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./color.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./greedy_tsp.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./bucket_heap.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./core.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./grosso_locatelli_pullan_mc.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./hao_orlin.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./howard_mmc.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./concept_check.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./lgf_reader.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./dfs.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./edmonds_karp.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./bfs.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./binomial_heap.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./bits -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./bits/enable_if.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./bits/default_map.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./bits/bezier.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./bits/path_dump.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./bits/windows.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./bits/alteration_notifier.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./bits/lock.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./bits/solver_bits.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./bits/array_map.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./bits/graph_extender.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./bits/graph_adaptor_extender.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./bits/edge_set_extender.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./bits/variant.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./bits/map_extender.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./bits/vector_map.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./bits/traits.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./cbc.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./circulation.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./bellman_ford.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./matching.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./gomory_hu.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./maps.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./list_graph.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./hartmann_orlin_mmc.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./grid_graph.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./radix_heap.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./fib_heap.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./adaptors.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./preflow.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./cplex.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./opt2_tsp.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./euler.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./network_simplex.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./karp_mmc.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./max_cardinality_search.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./suurballe.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/./full_graph.h -- Up-to-date: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/bits -- Up-to-date: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/bits/enable_if.h -- Up-to-date: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/bits/default_map.h -- Up-to-date: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/bits/bezier.h -- Up-to-date: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/bits/path_dump.h -- Up-to-date: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/bits/windows.h -- Up-to-date: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/bits/alteration_notifier.h -- Up-to-date: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/bits/lock.h -- Up-to-date: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/bits/solver_bits.h -- Up-to-date: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/bits/array_map.h -- Up-to-date: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/bits/graph_extender.h -- Up-to-date: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/bits/graph_adaptor_extender.h -- Up-to-date: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/bits/edge_set_extender.h -- Up-to-date: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/bits/variant.h -- Up-to-date: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/bits/map_extender.h -- Up-to-date: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/bits/vector_map.h -- Up-to-date: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/bits/traits.h -- Up-to-date: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/concepts -- Up-to-date: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/concepts/graph.h -- Up-to-date: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/concepts/digraph.h -- Up-to-date: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/concepts/path.h -- Up-to-date: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/concepts/graph_components.h -- Up-to-date: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/concepts/heap.h -- Up-to-date: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/concepts/maps.h -- Up-to-date: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/concepts/bpgraph.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/include/lemon/config.h -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/lib/pkgconfig/lemon.pc -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/bin/lgf-gen -- Set non-toolchain portion of runtime path of "/build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/bin/lgf-gen" to "" -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/bin/dimacs-to-lgf -- Set non-toolchain portion of runtime path of "/build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/bin/dimacs-to-lgf" to "" -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/bin/dimacs-solver -- Set non-toolchain portion of runtime path of "/build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/bin/dimacs-solver" to "" -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/bin/lemon-0.x-to-1.x.sh -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01650.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03725.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/tab_ad.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05129.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03634.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00517.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04320.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00542.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03133.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04273.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02301.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02605.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05188.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03492.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04073.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03833.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03440.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03465.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05226.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/functions_func_u.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05541.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04397.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/functions_func_l.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/tab_s.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05420.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03778.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03914.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02170.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03422.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03448.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02208.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02178.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01638.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03326.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03448.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02560.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01757.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02180.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03274.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02405.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05488.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/dir_5c049cf256bb88a1cce4b23b25177c88.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05276.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01533.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05224.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03378.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/nodeshape_1.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00419.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05133.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01969.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03540.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04072.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05292.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03322.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02297.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03426.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05360.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a11517.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00539.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04064.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03402.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/functions_func_i.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01764.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00191.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04332.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/functions_type_u.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03416.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02240.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01450.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03517.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05149.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03498.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05192.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02185.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02449.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03421.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00014.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03621.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03340.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01760.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/enumvalues_d.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/groups_7.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/functions_16.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/files_4.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/classes_7.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/variables_9.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/classes_3.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/functions_7.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/classes_14.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/all_b.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/functions_17.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/functions_19.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/enums_4.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/groups_0.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/typedefs_4.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/typedefs_11.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/mag_d.svg -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/all_1c.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/groups_10.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/enumvalues_1.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/variables_5.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/enums_2.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/typedefs_3.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/pages_d.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/pages_5.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/typedefs_5.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/enumvalues_f.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/pages_6.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/variables_b.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/all_4.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/all_e.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/groups_c.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/groups_6.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/classes_16.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/all_2.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/typedefs_e.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/files_11.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/all_c.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/classes_13.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/enumvalues_3.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/enumvalues_5.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/functions_11.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/mag_sel.svg -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/all_13.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/classes_6.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/classes_5.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/functions_8.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/pages_8.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/variables_6.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/classes_1.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/classes_9.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/enumvalues_e.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/typedefs_7.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/typedefs_b.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/groups_1.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/classes_a.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/all_10.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/classes_12.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/all_f.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/enumvalues_c.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/functions_e.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/variables_2.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/files_c.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/variables_3.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/files_13.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/all_a.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/pages_e.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/pages_2.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/variables_f.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/all_1e.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/enumvalues_a.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/search.css -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/functions_1b.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/files_12.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/classes_11.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/namespaces_0.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/groups_e.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/functions_9.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/files_e.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/typedefs_9.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/functions_5.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/typedefs_2.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/files_f.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/functions_2.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/enums_1.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/functions_3.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/groups_9.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/typedefs_13.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/all_1b.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/files_a.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/typedefs_1.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/variables_0.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/groups_f.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/typedefs_0.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/enums_7.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/pages_9.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/pages_7.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/variables_c.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/all_8.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/pages_1.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/variables_8.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/mag_seld.svg -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/all_17.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/functions_1.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/typedefs_d.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/functions_10.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/enums_8.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/all_11.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/enums_5.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/searchdata.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/functions_f.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/functions_12.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/variables_4.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/files_7.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/functions_0.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/files_14.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/all_9.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/classes_0.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/pages_3.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/functions_18.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/classes_17.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/files_0.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/variables_a.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/all_6.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/all_18.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/functions_b.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/variables_e.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/typedefs_a.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/pages_4.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/classes_f.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/enums_6.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/enumvalues_4.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/functions_14.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/all_19.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/functions_c.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/classes_4.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/all_5.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/typedefs_6.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/files_3.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/enums_0.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/all_1a.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/groups_5.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/enumvalues_8.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/typedefs_14.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/functions_4.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/functions_d.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/functions_13.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/files_2.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/groups_d.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/all_1.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/all_3.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/mag.svg -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/all_7.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/classes_2.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/files_d.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/enumvalues_6.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/classes_c.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/typedefs_f.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/pages_0.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/classes_b.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/all_0.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/functions_a.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/typedefs_10.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/search.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/classes_15.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/variables_d.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/groups_4.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/enumvalues_9.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/groups_b.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/enumvalues_b.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/files_10.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/pages_b.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/all_15.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/files_9.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/classes_e.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/enumvalues_10.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/groups_2.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/defines_0.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/all_1d.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/files_1.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/typedefs_8.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/typedefs_c.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/all_d.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/all_14.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/classes_d.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/all_16.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/typedefs_12.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/pages_c.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/variables_1.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/files_8.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/enumvalues_2.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/enumvalues_7.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/groups_a.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/groups_3.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/functions_6.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/classes_8.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/files_5.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/groups_8.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/functions_1a.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/enums_3.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/files_6.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/close.svg -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/files_b.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/pages_a.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/variables_7.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/classes_10.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/all_12.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/functions_15.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/search/enumvalues_0.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04041.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02590.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03476.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/bc_sd.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03340.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03348.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05156.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03597.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04080.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02377.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03532.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03492.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05154.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00365.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/files.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03673.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03868.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02621.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a11512.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02714.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05473.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02718.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03756.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02629.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03796.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03348.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02349.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/tab_h.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05144.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03338.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05453.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04417.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03662.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01672.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03352.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05294.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03126.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03454.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05456.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05190.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03553.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02148.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01908.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04284.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02245.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00562.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01913.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02738.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04090.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03432.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05384.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02368.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02858.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03456.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/functions_type_h.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00200.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/functions_type_p.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03433.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03416.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04350.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05361.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02176.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01808.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03546.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05169.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02670.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04318.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04345.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05156.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04081.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05164.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02988.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00263.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03552.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00203.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00515.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03802.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03552.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02316.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04080.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01612.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03853.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03844.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05228.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05304.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03772.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05106.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02786.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01865.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01917.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05360.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02549.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/functions_func_m.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03542.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01486.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03861.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05590.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03805.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05277.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03780.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02354.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05269.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03954.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00296.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02898.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04092.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05510.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03504.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03618.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02969.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05157.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00518.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05366.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03501.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02274.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05513.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05336.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/functions_s.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05496.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02124.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04080.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01864.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02281.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01489.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03201.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05564.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02066.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03570.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05112.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01692.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03518.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00503.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01613.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02576.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03361.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05293.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02846.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03444.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03410.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01530.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00323.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03205.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01641.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04398.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/functions_eval.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03657.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02248.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04250.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03460.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02813.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05246.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04341.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05450.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05516.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02720.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05376.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05264.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05248.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05274.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04253.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04401.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/dir_4eeb864c4eec08c7d6b9d3b0352cfdde.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05516.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/functions_type_i.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01717.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02980.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02166.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05505.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02172.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03824.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03450.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03585.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05310.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01614.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01894.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04312.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05208.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03453.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/globals.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02332.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02316.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02356.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/namespaces.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01724.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00413.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02634.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03536.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00281.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02413.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00224.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05128.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/graph_legend.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05416.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02180.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04373.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05146.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05098.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01692.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02561.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05104.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02174.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05601.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01553.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/functions_j.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00482.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03356.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/functions_func_h.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05517.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03602.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04410.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05398.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02881.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04053.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02620.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00359.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00537.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02572.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01550.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02172.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02165.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02330.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03786.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03645.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02208.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05481.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03356.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05308.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03962.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04064.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01642.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03552.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02422.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00356.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02406.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05256.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03484.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01769.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/functions_type_g.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/dynsections.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02586.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02224.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00512.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03480.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04072.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04381.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02893.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05144.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02292.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01868.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03352.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03408.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05168.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00236.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03349.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05440.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03420.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02978.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04393.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05400.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/functions_type_e.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05460.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03472.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03385.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01490.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01853.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/tab_bd.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03841.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01690.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03949.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04270.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02509.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05181.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03496.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03549.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01598.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03797.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02137.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02309.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03125.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03824.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00544.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/functions_o.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03625.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03889.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03544.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00530.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02356.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02618.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05250.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05358.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02232.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03492.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04346.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05121.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03780.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05152.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01645.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03425.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01846.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05266.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03650.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03838.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05546.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02209.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05360.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/functions_func_~.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03452.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03544.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05284.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05126.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03508.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00248.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02058.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/functions_type_l.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02244.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05193.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05136.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/functions_v.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03477.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01730.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/dir_b6c2a257bfab6380ca9b3cb94b12cb25.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02248.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/functions_m.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05312.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03705.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03373.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/dir_13e138d54eb8818da29c3992edef070a.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05328.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02937.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05376.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03589.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04070.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05102.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03541.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02853.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03400.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01422.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03922.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02324.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02900.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02573.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01612.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03401.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02365.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03525.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00170.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02825.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05257.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01664.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05265.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04284.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02238.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04394.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03756.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02572.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02173.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05116.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02217.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05113.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03474.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05353.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03441.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00428.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05528.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05120.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03860.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03209.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02717.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03885.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05125.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02372.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05137.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05120.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01602.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05185.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/functions.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/functions_func_s.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02317.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01762.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00197.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a11523.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01758.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05261.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04374.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03430.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03428.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03198.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04338.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05222.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05297.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02298.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03882.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/functions_func_o.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05264.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03658.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04357.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02333.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/nodeshape_0.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02374.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05565.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02961.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03130.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02401.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03858.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/nav_g.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03512.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02908.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01501.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03868.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01756.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02930.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/minusd.svg -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03822.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00266.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02278.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05472.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01798.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04328.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01813.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05458.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04054.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02701.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00526.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03344.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02182.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00233.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/minus.svg -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04049.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05296.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04092.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04057.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05208.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04414.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03601.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03505.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03605.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04085.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/functions_z.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02722.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05160.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01801.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00179.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05213.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03510.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05296.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/menu.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05208.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04321.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01741.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03480.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03524.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02720.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05312.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05290.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03513.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03457.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02630.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05384.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04320.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00008.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02576.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05345.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00519.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/folderopend.svg -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02246.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04284.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02593.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05166.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05369.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05540.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02890.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02222.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01877.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03654.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05514.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02721.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03540.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05164.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03444.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05306.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00531.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05244.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05140.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02101.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04302.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03565.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01886.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02906.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05461.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/dir_76709df9bfa39e37f63eb646d4b01cd8.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04353.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03277.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02176.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03445.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02129.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03706.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05556.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05165.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02348.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01817.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02417.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03438.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03484.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00380.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/nodeshape_4.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00278.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00221.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03641.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04242.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05122.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03409.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02926.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01908.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00302.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01662.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05382.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03520.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01809.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00525.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/doxygen.css -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05326.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00257.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/functions_q.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01694.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05312.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03794.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02308.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01657.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01566.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03362.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05456.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00275.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/plus.svg -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05268.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03502.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05212.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03609.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03472.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05184.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00371.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04065.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01896.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01664.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01850.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03428.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02325.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03957.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03729.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02214.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02578.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03573.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03958.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05162.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05184.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04325.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05192.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05384.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/dir_b6a880ca7a9b1fd5587fcf7bef62ae2e.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03537.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02558.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05420.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02478.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02240.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01732.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03653.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02162.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01605.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05124.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02817.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02184.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03532.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05418.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01565.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05201.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02340.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03470.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05225.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02322.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02184.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05170.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/functions_type_n.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00543.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05574.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01888.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00536.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05158.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03357.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01870.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05308.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03824.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04062.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03665.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05230.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03938.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03469.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a11515.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03206.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04064.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03141.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02324.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/globals_defs.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03398.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02481.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02230.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01873.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01764.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03961.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01748.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02538.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02224.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02224.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02126.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01609.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02394.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05377.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03946.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05254.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02572.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/folderclosed.svg -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/functions_type_s.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04173.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01830.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00182.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03930.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05305.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00242.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/functions_type_b.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02698.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03512.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03764.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03709.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00368.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05142.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03500.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03825.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05160.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03500.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00488.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03452.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03412.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/functions_c.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02172.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02364.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00290.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05124.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/doc.svg -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02102.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03606.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02980.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00392.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04296.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00552.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05260.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05168.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02364.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03129.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03536.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01740.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/closed.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03772.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02589.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/functions_func_j.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00398.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02364.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00554.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03762.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/functions_func_x.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01810.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05488.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02580.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02958.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01864.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02421.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03424.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05334.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02842.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03516.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/functions_i.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03452.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01732.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01896.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05238.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01864.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05152.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02880.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02628.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01754.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01680.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02305.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05264.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01909.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02580.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05496.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05424.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03689.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05420.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02872.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03466.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03934.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00538.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05497.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04305.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00479.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a11513.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01569.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03480.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04149.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03325.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02626.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02134.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/functions_type_d.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03564.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01688.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03798.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05452.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05337.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04282.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04034.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00535.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02373.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05421.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/folderopen.svg -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03356.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03528.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02628.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05260.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05140.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04050.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03369.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02324.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03428.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02929.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04205.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02194.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03344.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05533.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02885.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04377.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/functions_type_o.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03496.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05437.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02302.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01505.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03568.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03464.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05454.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02402.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04249.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03937.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03237.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04333.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05256.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05524.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05406.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05178.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02909.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05140.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05200.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03868.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02184.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03594.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02900.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02610.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/bc_s.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00230.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05132.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03545.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05401.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05408.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03564.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03374.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01904.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/functions_func_t.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00299.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00374.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/functions_func_d.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02158.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04390.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02598.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01562.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05205.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03536.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/nodeshape_3.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05228.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03772.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02620.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00548.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03520.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02726.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02176.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04072.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03506.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01688.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03524.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01733.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01425.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05196.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/graph_to_eps.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05441.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03682.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03424.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05268.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02612.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05116.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05480.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05328.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05256.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05392.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03521.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05385.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04304.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05374.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03773.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03526.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/dir_dedea193b59082b9146f1dbfd0a8b56a.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02576.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/functions_f.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02340.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00389.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01914.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02810.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02233.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/functions_y.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01748.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03508.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02370.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02114.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03352.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02882.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05148.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02716.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05252.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01868.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04177.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03860.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03485.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03353.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02850.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02742.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05104.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03462.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01794.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03404.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03468.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05218.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02366.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/functions_type_t.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05496.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/functions_func_v.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/nav_h.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00215.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02560.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05548.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01749.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01692.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05525.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03464.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01612.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01808.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02122.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05593.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00212.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/strongly_connected_components.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/namespacemembers.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03444.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/matching.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05104.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05408.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03464.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02872.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01664.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02900.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/functions_a.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02244.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03533.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/functions_func_q.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02980.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03796.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/functions_k.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05392.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03844.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03534.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00523.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03404.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03446.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02125.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a11510.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02061.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05470.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00353.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00524.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05392.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03417.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02569.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01534.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00185.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02232.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00407.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03661.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03832.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05150.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03497.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/lemon.tag -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05116.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03440.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/sync_off.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01814.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02873.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04170.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00254.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00532.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02316.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02546.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05570.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03354.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05260.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02934.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00494.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02988.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04304.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04245.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03756.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02244.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04304.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03832.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00555.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01896.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03478.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05393.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01897.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05598.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03406.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04278.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/functions_type_k.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02633.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05562.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/splitbar.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03458.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/functions_r.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02306.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01610.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01869.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03137.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05282.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02826.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02650.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05480.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03569.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04328.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/namespacemembers_type.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00491.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05192.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/functions_func_a.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02506.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05206.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00188.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02628.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00425.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02177.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05202.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01498.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05512.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03568.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02861.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05258.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00329.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/nav_hd.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03486.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03780.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00551.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02901.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03649.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02580.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04329.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03488.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02730.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04349.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05548.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05440.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/plusd.svg -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05502.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05108.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03210.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05252.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/open.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04009.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04252.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05108.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03842.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05109.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03852.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00245.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03548.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01697.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00320.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00194.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05424.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04310.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03852.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a11520.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05200.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05302.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05489.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02872.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05472.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03234.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00422.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01681.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05112.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05172.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01502.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02729.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00005.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01673.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02086.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00550.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05285.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01906.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04296.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05320.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03516.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03508.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01601.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01793.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/doxygen.svg -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05577.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02637.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02818.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03504.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05478.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05424.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05549.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02241.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04209.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/functions_t.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05209.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04206.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00410.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04326.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02357.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03344.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00529.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03412.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01889.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04082.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05409.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03350.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03429.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01765.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/functions_type.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03781.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/dir_e68e8157741866f444e17edd764ebbae.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05284.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03476.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00227.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04006.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03844.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/pages.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05438.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01888.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05416.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03832.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05460.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/functions_w.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/connected_components.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04092.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05248.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/functions_type_c.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04252.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02208.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05168.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05233.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00404.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03850.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00549.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03448.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03801.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03566.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04354.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05540.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02708.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00497.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/planar.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02308.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05152.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00284.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03484.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01916.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01748.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03764.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03626.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03278.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05186.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05172.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/functions_func.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05145.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02054.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05188.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00383.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02198.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/functions_func_n.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04297.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04093.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05194.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/node_biconnected_components.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03460.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05452.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05198.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05117.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05368.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05320.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03577.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05512.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03488.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00164.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02878.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01868.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05416.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05224.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03530.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03370.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04294.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03377.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02933.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05414.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05242.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/menudata.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/tsp.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/functions_type_m.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05189.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05105.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05368.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05524.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03405.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03482.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02612.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04378.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00514.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03494.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05350.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02116.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/sync_on.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01680.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03202.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02409.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02577.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01670.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05504.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/functions_enum.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02225.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01693.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02057.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/docd.svg -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02105.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02332.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03582.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05556.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/functions_func_y.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05228.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03590.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03578.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/nav_f.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02332.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05134.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02585.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04086.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02908.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05494.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03490.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03540.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04174.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05124.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02186.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02725.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00209.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/functions_~.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00521.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02340.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03122.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01617.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05436.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/functions_func_f.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05408.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05522.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00516.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01874.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03500.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03789.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04246.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05304.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02089.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01797.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05422.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05156.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01808.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02124.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01714.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05400.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05296.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05308.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02282.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02161.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/jquery.js -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03488.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03765.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01904.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02706.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02369.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02414.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05594.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00513.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04046.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01453.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02550.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02446.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04296.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/functions_n.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01606.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02148.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05524.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02292.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03418.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02197.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/functions_b.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01653.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01760.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02745.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03642.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03637.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/functions_h.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03532.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02822.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05321.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00173.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03726.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03925.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02849.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02216.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02560.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04312.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03538.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03134.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02189.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02789.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/functions_func_e.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05234.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03442.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03686.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04334.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05172.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05434.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01760.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/functions_func_b.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03238.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02602.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00546.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00176.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01849.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05304.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05456.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/functions_e.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02880.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03341.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03629.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03456.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05164.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02149.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01689.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03461.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01966.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00401.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01682.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03420.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03886.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01537.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00547.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02116.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02348.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03449.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05564.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02562.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03404.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05390.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02372.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04089.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00335.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05480.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01902.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02180.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/tab_b.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01686.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00533.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02308.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05141.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/annotated.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05237.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/nodeshape_2.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01905.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02169.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03456.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05336.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02845.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/tab_hd.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05229.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03610.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/splitbard.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/tab_a.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05528.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00272.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/_formulas_dark.tex -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05262.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03788.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02541.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03366.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05244.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03358.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01756.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02981.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03702.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02397.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04358.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01878.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02709.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05400.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04370.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01888.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00540.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04328.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03866.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05204.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00314.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05173.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00206.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05144.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03764.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05457.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05110.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02356.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05136.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03516.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02216.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02116.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05452.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03834.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03382.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/functions_d.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05528.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05425.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02098.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03528.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03528.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02181.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05318.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/edge_biconnected_components.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05128.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00534.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05516.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/functions_func_g.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01672.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04322.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03860.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03520.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02124.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03408.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01838.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03622.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03213.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02249.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/functions_x.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/tabs.css -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03460.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/adaptors2.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05526.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05241.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a11514.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00344.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02653.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02601.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a11511.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03138.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02277.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02232.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/hierarchy.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03472.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02720.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03509.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05436.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03529.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/bipartite_partitions.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00506.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02201.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/functions_func_p.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03522.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04037.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03646.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02338.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02570.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/functions_type_w.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01833.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05210.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00541.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01904.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05248.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03681.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05212.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05529.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01910.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03342.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05136.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03942.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/_formulas.tex -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00341.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03581.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00293.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03468.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01678.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05118.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03933.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04312.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02216.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02285.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05376.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03504.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04146.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05130.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05182.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/functions_func_c.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00269.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01764.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02708.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00239.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03365.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04078.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05440.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00522.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05253.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02716.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02348.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03678.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02612.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02314.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03670.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02148.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03512.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00520.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01724.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/grid_graph.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02966.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05504.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/classes.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05557.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04313.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05148.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00545.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01740.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05472.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03524.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04202.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05309.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03917.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03945.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02733.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05540.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02418.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05268.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/namespacemembers_vars.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02581.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05204.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02146.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03420.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/functions_func_k.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05284.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02398.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02880.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02741.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01725.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03941.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02566.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/functions_type_f.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05188.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03416.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/functions_l.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04332.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00311.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03564.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05548.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05436.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04320.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01738.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05554.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02582.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01908.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01713.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/functions_func_r.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03613.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05132.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02908.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/functions_func_w.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03869.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03408.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03481.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03489.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03476.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02292.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03550.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01756.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03473.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01916.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01493.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01680.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02372.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02673.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03598.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00260.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00218.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02814.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05112.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/namespacemembers_func.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05530.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02240.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02829.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00332.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02821.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05320.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00251.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/functions_type_r.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03381.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03432.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01766.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00416.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/dir_004474b48550446901cdcca6f8b902b3.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02341.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03329.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05417.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00485.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05224.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00395.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05108.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04038.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05204.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00347.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02989.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05153.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01761.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03568.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01841.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03345.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/nav_fd.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01740.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05538.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05196.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01654.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02620.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03514.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05138.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05486.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02206.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05276.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01881.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05120.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03346.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02988.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00377.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05512.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01806.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05313.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05292.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05196.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00528.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02368.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02553.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02069.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02425.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01732.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05221.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01688.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03281.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05329.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04330.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00287.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01866.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05101.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/tab_sd.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05252.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02117.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01665.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03722.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00386.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03440.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02253.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00350.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03830.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05328.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05597.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02294.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04252.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02248.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02574.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00326.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/functions_g.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/index.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02290.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05564.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01724.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03574.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03400.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05212.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/functions_func_z.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05292.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02613.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/functions_type_v.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05244.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03548.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03468.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05556.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04342.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05197.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04285.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01916.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03340.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01685.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03586.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02368.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/functions_u.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02242.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03788.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01862.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05245.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03593.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05160.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02870.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03400.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03432.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02410.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02362.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03845.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05504.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03754.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05200.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03965.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/functions_p.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/functions_vars.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00317.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04361.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02293.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/graph_legend.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00338.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05148.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/graph_legend.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03685.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03548.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/folderclosedd.svg -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05342.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01746.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05114.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03562.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05128.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05368.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01710.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03788.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04337.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05488.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02346.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02986.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05249.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05276.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03348.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03837.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04281.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05184.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03796.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03496.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03413.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03757.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01722.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03852.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05161.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00527.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03638.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03544.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03414.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03493.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03424.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02708.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02250.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03412.md5 -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03770.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02565.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04332.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a02716.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05336.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05132.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05460.png -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01790.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00500.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00308.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a05573.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a00305.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a01672.map -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a04413.html -- Installing: /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/share/doc/lemon/html/a03241.html make[1]: Leaving directory '/build/reproducible-path/liblemon-1.3.1+dfsg/obj-arm-linux-gnueabihf' debian/rules override_dh_install make[1]: Entering directory '/build/reproducible-path/liblemon-1.3.1+dfsg' dh_install cp -a obj-*/lemon/liblemon_static.a debian/tmp/usr/lib/liblemon.a # rename cmake config file mv debian/tmp/usr/share/lemon/cmake/LEMONConfig.cmake debian/tmp/usr/share/lemon/cmake/lemonConfig.cmake # Modify CMake config file to add multiarch sed -i 's:usr/lib:usr/lib/arm-linux-gnueabihf:' debian/tmp/usr/share/lemon/cmake/* d-shlibmove --commit \ --multiarch \ --devunversioned \ --exclude-la \ --movedev debian/tmp/usr/include/* usr/include \ --movedev "debian/tmp/usr/lib/pkgconfig/*.pc" usr/lib/arm-linux-gnueabihf/pkgconfig \ --movedev "debian/tmp/usr/share/lemon/cmake/*" usr/lib/arm-linux-gnueabihf/cmake/lemon \ debian/tmp/usr/lib/*.so Library package automatic movement utility --> libglpk-dev package exists. set -e install -d -m 755 debian/liblemon-dev/usr/lib/arm-linux-gnueabihf install -d -m 755 debian/liblemon1.3.1/usr/lib/arm-linux-gnueabihf mv debian/tmp/usr/lib/liblemon.a debian/liblemon-dev/usr/lib/arm-linux-gnueabihf mv debian/tmp/usr/lib/liblemon.so debian/liblemon-dev/usr/lib/arm-linux-gnueabihf mv /build/reproducible-path/liblemon-1.3.1+dfsg/debian/tmp/usr/lib/liblemon.so.1.3.1 debian/liblemon1.3.1/usr/lib/arm-linux-gnueabihf PKGDEV=liblemon-dev PKGSHL=liblemon1.3.1 install -d -m 755 debian/liblemon-dev/usr/include mv debian/tmp/usr/include/lemon debian/liblemon-dev/usr/include install -d -m 755 debian/liblemon-dev/usr/lib/arm-linux-gnueabihf/pkgconfig mv debian/tmp/usr/lib/pkgconfig/*.pc debian/liblemon-dev/usr/lib/arm-linux-gnueabihf/pkgconfig install -d -m 755 debian/liblemon-dev/usr/lib/arm-linux-gnueabihf/cmake/lemon mv debian/tmp/usr/share/lemon/cmake/* debian/liblemon-dev/usr/lib/arm-linux-gnueabihf/cmake/lemon find debian -name lemon-0.x-to-1.x.sh -delete find debian -name "lib*.la" -delete make[1]: Leaving directory '/build/reproducible-path/liblemon-1.3.1+dfsg' dh_installdocs debian/rules override_dh_installchangelogs make[1]: Entering directory '/build/reproducible-path/liblemon-1.3.1+dfsg' dh_installchangelogs NEWS make[1]: Leaving directory '/build/reproducible-path/liblemon-1.3.1+dfsg' dh_perl dh_link dh_strip_nondeterminism dh_compress dh_fixperms dh_missing dh_dwz -a dh_strip -a dh_makeshlibs -a dh_shlibdeps -a dpkg-shlibdeps: warning: symbol __aeabi_atexit@CXXABI_ARM_1.3.3 used by debian/liblemon1.3.1/usr/lib/arm-linux-gnueabihf/liblemon.so.1.3.1 found in none of the libraries dpkg-shlibdeps: warning: debian/liblemon-utils/usr/bin/lgf-gen contains an unresolvable reference to symbol __aeabi_atexit@CXXABI_ARM_1.3.3: it's probably a plugin dh_installdeb dh_gencontrol dpkg-gencontrol: warning: Depends field of package liblemon-dev: substitution variable ${shlibs:Depends} used, but is not defined dpkg-gencontrol: warning: package liblemon-dev: substitution variable ${devlibs:Depends} unused, but is defined dh_md5sums dh_builddeb dpkg-deb: building package 'liblemon-dev' in '../liblemon-dev_1.3.1+dfsg-6_armhf.deb'. dpkg-deb: building package 'liblemon1.3.1' in '../liblemon1.3.1_1.3.1+dfsg-6_armhf.deb'. dpkg-deb: building package 'liblemon-utils-dbgsym' in '../liblemon-utils-dbgsym_1.3.1+dfsg-6_armhf.deb'. dpkg-deb: building package 'liblemon1.3.1-dbgsym' in '../liblemon1.3.1-dbgsym_1.3.1+dfsg-6_armhf.deb'. dpkg-deb: building package 'liblemon-doc' in '../liblemon-doc_1.3.1+dfsg-6_all.deb'. dpkg-deb: building package 'liblemon-utils' in '../liblemon-utils_1.3.1+dfsg-6_armhf.deb'. dpkg-genbuildinfo --build=binary -O../liblemon_1.3.1+dfsg-6_armhf.buildinfo dpkg-genchanges --build=binary -O../liblemon_1.3.1+dfsg-6_armhf.changes dpkg-genchanges: info: binary-only upload (no source code included) dpkg-source --after-build . dpkg-buildpackage: info: binary-only upload (no source included) dpkg-genchanges: info: not including original source code in upload I: copying local configuration I: unmounting dev/ptmx filesystem I: unmounting dev/pts filesystem I: unmounting dev/shm filesystem I: unmounting proc filesystem I: unmounting sys filesystem I: cleaning the build env I: removing directory /srv/workspace/pbuilder/25566 and its subdirectories I: Current time: Fri Apr 12 17:58:38 -12 2024 I: pbuilder-time-stamp: 1712987918 Sat Apr 13 05:59:09 UTC 2024 I: 1st build successful. Starting 2nd build on remote node virt64a-armhf-rb.debian.net. Sat Apr 13 05:59:09 UTC 2024 I: Preparing to do remote build '2' on virt64a-armhf-rb.debian.net. Sat Apr 13 06:26:08 UTC 2024 I: Deleting $TMPDIR on virt64a-armhf-rb.debian.net. Sat Apr 13 06:26:10 UTC 2024 I: liblemon_1.3.1+dfsg-6_armhf.changes: Format: 1.8 Date: Mon, 25 Jul 2022 20:36:57 +0200 Source: liblemon Binary: liblemon-dev liblemon-doc liblemon-utils liblemon-utils-dbgsym liblemon1.3.1 liblemon1.3.1-dbgsym Architecture: armhf all Version: 1.3.1+dfsg-6 Distribution: unstable Urgency: medium Maintainer: Debian Med Packaging Team Changed-By: Andreas Tille Description: liblemon-dev - Library for Efficient Modeling and Optimization in Networks (deve liblemon-doc - Library for Efficient Modeling and Optimization in Networks (doc) liblemon-utils - Library for Efficient Modeling and Optimization in Networks (util liblemon1.3.1 - Library for Efficient Modeling and Optimization in Networks Closes: 1015955 Changes: liblemon (1.3.1+dfsg-6) unstable; urgency=medium . * Fix pkg-config --libs response Closes: #1015955 * Standards-Version: 4.6.1 (routine-update) Checksums-Sha1: 02d517c329bdd328d2d7e52c9ccf929689ef9fb4 322252 liblemon-dev_1.3.1+dfsg-6_armhf.deb 8c028f8398a54ae4748cbec05ae82e1b9d879d30 3476976 liblemon-doc_1.3.1+dfsg-6_all.deb f95b4cc1156f0b2e1bd36ece07a6d3c382e25a6d 2680236 liblemon-utils-dbgsym_1.3.1+dfsg-6_armhf.deb d574bbde732c23255bf97509c92138649bf36581 163884 liblemon-utils_1.3.1+dfsg-6_armhf.deb f6f6768ec1e795cb83849f07671f8d4e64312832 519204 liblemon1.3.1-dbgsym_1.3.1+dfsg-6_armhf.deb 17fd8b567497997095cabe91f527536a33dd3b5e 47976 liblemon1.3.1_1.3.1+dfsg-6_armhf.deb d8f7e13cf40724aed777243163bd330a02856019 11555 liblemon_1.3.1+dfsg-6_armhf.buildinfo Checksums-Sha256: 3ff4717cd5b32d139a201aa4e0908ffc888fe9b1b98fe00a43fa669b8781e744 322252 liblemon-dev_1.3.1+dfsg-6_armhf.deb 528bad4c1d01de9944b1b517d8197fc69f26ce36e17f9a8eb70c5e9240bee82c 3476976 liblemon-doc_1.3.1+dfsg-6_all.deb 13a58960ededf1822d919c98e9bfe203dbd492ba5ff6aad3828776d16be003e7 2680236 liblemon-utils-dbgsym_1.3.1+dfsg-6_armhf.deb 0466cc43dd78c326a27d11962b46236a5e26871b9e87c65571abaf965fd3b66f 163884 liblemon-utils_1.3.1+dfsg-6_armhf.deb 73686d156d2a96bf00e25d176389ca61af93a6b6fc977743a27c471643c0080b 519204 liblemon1.3.1-dbgsym_1.3.1+dfsg-6_armhf.deb ab7f41f42f8a78fc5f1ea4993f9cb2dfb6530132e757c55748143faead04fe1e 47976 liblemon1.3.1_1.3.1+dfsg-6_armhf.deb 087e48b7bd7a267e6e02cb61253fa5eb70b8bb35f8301c853c465f75d6cdfd50 11555 liblemon_1.3.1+dfsg-6_armhf.buildinfo Files: f6a813914388c0f9544b4e1f1d0d1409 322252 libdevel optional liblemon-dev_1.3.1+dfsg-6_armhf.deb fce775d1f731ed47920c87604d20aac0 3476976 doc optional liblemon-doc_1.3.1+dfsg-6_all.deb e1c8e9e30f07b1d73854ef9fd6e80e23 2680236 debug optional liblemon-utils-dbgsym_1.3.1+dfsg-6_armhf.deb ab053ab59d47550584f5d12f8b4830e6 163884 science optional liblemon-utils_1.3.1+dfsg-6_armhf.deb a4bf1acc4d8049238b7c44658a8f3a07 519204 debug optional liblemon1.3.1-dbgsym_1.3.1+dfsg-6_armhf.deb 32d97a3a70264a571bcc3d1784b33d06 47976 libs optional liblemon1.3.1_1.3.1+dfsg-6_armhf.deb 61d2b05ba3a415e27d3c36fc3517b43b 11555 science optional liblemon_1.3.1+dfsg-6_armhf.buildinfo Sat Apr 13 06:26:12 UTC 2024 I: diffoscope 264 will be used to compare the two builds: Running as unit: rb-diffoscope-armhf_10-2071.service # Profiling output for: /usr/bin/diffoscope --timeout 7200 --html /srv/reproducible-results/rbuild-debian/r-b-build.L0MwzBhL/liblemon_1.3.1+dfsg-6.diffoscope.html --text /srv/reproducible-results/rbuild-debian/r-b-build.L0MwzBhL/liblemon_1.3.1+dfsg-6.diffoscope.txt --json /srv/reproducible-results/rbuild-debian/r-b-build.L0MwzBhL/liblemon_1.3.1+dfsg-6.diffoscope.json --profile=- /srv/reproducible-results/rbuild-debian/r-b-build.L0MwzBhL/b1/liblemon_1.3.1+dfsg-6_armhf.changes /srv/reproducible-results/rbuild-debian/r-b-build.L0MwzBhL/b2/liblemon_1.3.1+dfsg-6_armhf.changes ## close_archive (total time: 0.000s) 0.000s 6 calls diffoscope.comparators.xz.XzContainer 0.000s 2 calls diffoscope.comparators.deb.DebContainer 0.000s 4 calls diffoscope.comparators.tar.TarContainer 0.000s 2 calls diffoscope.comparators.gzip.GzipContainer 0.000s 2 calls diffoscope.comparators.deb.DebTarContainer ## command (total time: 5.522s) 3.672s 326 calls diff 0.833s 6 calls xz 0.630s 1529 calls html2text 0.316s 462 calls js-beautify 0.031s 2 calls gzip 0.015s 4 calls cmp 0.015s 4 calls cmp (external) 0.012s 103 calls cmp (internal) ## compare_files (cumulative) (total time: 181.083s) 37.567s 1 call abc.DotChangesFile 37.486s 1 call abc.DebFile 37.431s 2 calls abc.XzFile 36.489s 1 call abc.DebDataTarFile 22.810s 42 calls abc.JavaScriptFile 6.219s 139 calls abc.HtmlFile 2.891s 1 call abc.GzipFile 0.099s 1 call abc.TarFile 0.067s 1 call abc.Md5sumsFile 0.025s 1 call abc.XMLFile ## container_extract (total time: 1.923s) 1.035s 3986 calls diffoscope.comparators.deb.DebTarContainer 0.833s 6 calls diffoscope.comparators.xz.XzContainer 0.031s 2 calls diffoscope.comparators.gzip.GzipContainer 0.019s 8 calls diffoscope.comparators.deb.DebContainer 0.005s 6 calls diffoscope.comparators.tar.TarContainer ## diff (total time: 6.426s) 6.426s 1022 calls linediff ## has_same_content_as (total time: 0.050s) 0.021s 140 calls abc.HtmlFile 0.018s 6 calls abc.DebFile 0.010s 42 calls abc.JavaScriptFile 0.000s 1 call abc.XMLFile 0.000s 2 calls abc.Md5sumsFile 0.000s 2 calls abc.TextFile 0.000s 1 call abc.DebDataTarFile 0.000s 1 call abc.TarFile 0.000s 1 call abc.DotChangesFile 0.000s 2 calls abc.XzFile 0.000s 1 call abc.GzipFile ## main (total time: 64.963s) 64.957s 2 calls outputs 0.006s 1 call cleanup ## open_archive (total time: 0.000s) 0.000s 6 calls diffoscope.comparators.xz.XzContainer 0.000s 4 calls diffoscope.comparators.tar.TarContainer 0.000s 2 calls diffoscope.comparators.deb.DebContainer 0.000s 2 calls diffoscope.comparators.deb.DebTarContainer 0.000s 2 calls diffoscope.comparators.gzip.GzipContainer ## output (total time: 26.965s) 26.906s 1 call html 0.035s 1 call text 0.025s 1 call json ## recognizes (total time: 4.124s) 2.873s 298 calls diffoscope.comparators.utils.archive.ArchiveMember 1.108s 8452 calls diffoscope.comparators.utils.libarchive.LibarchiveMember 0.096s 12 calls diffoscope.comparators.binary.FilesystemFile 0.047s 324 calls diffoscope.comparators.debian.DebControlMember ## specialize (total time: 4.173s) 4.173s 199 calls specialize Finished with result: success Main processes terminated with: code=exited/status=1 Service runtime: 1min 5.344s CPU time consumed: 1min 6.462s Sat Apr 13 06:27:18 UTC 2024 W: Diffoscope claims the build is reproducible, but there is a diffoscope file. Please investigate. Sat Apr 13 06:27:18 UTC 2024 E: liblemon failed to build reproducibly in trixie on armhf. Sat Apr 13 06:27:20 UTC 2024 I: Submitting .buildinfo files to external archives: Sat Apr 13 06:27:20 UTC 2024 I: Submitting 16K b1/liblemon_1.3.1+dfsg-6_armhf.buildinfo.asc Sat Apr 13 06:27:21 UTC 2024 I: Submitting 16K b2/liblemon_1.3.1+dfsg-6_armhf.buildinfo.asc Sat Apr 13 06:27:22 UTC 2024 I: Done submitting .buildinfo files to http://buildinfo.debian.net/api/submit. Sat Apr 13 06:27:22 UTC 2024 I: Done submitting .buildinfo files. Sat Apr 13 06:27:22 UTC 2024 I: Removing signed liblemon_1.3.1+dfsg-6_armhf.buildinfo.asc files: removed './b1/liblemon_1.3.1+dfsg-6_armhf.buildinfo.asc' removed './b2/liblemon_1.3.1+dfsg-6_armhf.buildinfo.asc'